./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-86.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 37de0228bdc926eeed8c36d9a0d9df874217b43056bdb710b9397461ea004e55 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 11:46:49,281 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 11:46:49,352 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 11:46:49,358 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 11:46:49,361 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 11:46:49,383 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 11:46:49,385 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 11:46:49,385 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 11:46:49,385 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 11:46:49,386 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 11:46:49,386 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 11:46:49,387 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 11:46:49,387 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 11:46:49,387 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 11:46:49,387 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 11:46:49,388 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 11:46:49,388 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 11:46:49,388 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 11:46:49,388 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 11:46:49,388 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 11:46:49,388 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 11:46:49,388 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 11:46:49,388 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 11:46:49,388 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 11:46:49,388 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 11:46:49,388 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 11:46:49,389 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 11:46:49,389 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 11:46:49,389 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 11:46:49,389 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:46:49,389 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:46:49,389 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:46:49,389 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:46:49,390 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 11:46:49,390 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:46:49,390 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:46:49,390 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:46:49,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:46:49,390 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 11:46:49,390 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 11:46:49,390 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 11:46:49,390 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 11:46:49,390 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 11:46:49,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 11:46:49,390 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 11:46:49,391 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 11:46:49,391 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 11:46:49,391 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 11:46:49,391 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 37de0228bdc926eeed8c36d9a0d9df874217b43056bdb710b9397461ea004e55 [2025-01-09 11:46:49,669 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 11:46:49,678 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 11:46:49,681 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 11:46:49,682 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 11:46:49,682 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 11:46:49,683 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-86.i [2025-01-09 11:46:50,804 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9bd0c93a3/d398d4d65d9d4bcb983159702cd9758a/FLAG350cb3096 [2025-01-09 11:46:51,077 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 11:46:51,078 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-86.i [2025-01-09 11:46:51,088 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9bd0c93a3/d398d4d65d9d4bcb983159702cd9758a/FLAG350cb3096 [2025-01-09 11:46:51,380 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9bd0c93a3/d398d4d65d9d4bcb983159702cd9758a [2025-01-09 11:46:51,382 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 11:46:51,383 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 11:46:51,384 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 11:46:51,384 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 11:46:51,387 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 11:46:51,388 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:46:51" (1/1) ... [2025-01-09 11:46:51,388 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@733247b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:46:51, skipping insertion in model container [2025-01-09 11:46:51,389 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:46:51" (1/1) ... [2025-01-09 11:46:51,404 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 11:46:51,511 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-86.i[919,932] [2025-01-09 11:46:51,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:46:51,592 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 11:46:51,601 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-86.i[919,932] [2025-01-09 11:46:51,624 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:46:51,642 INFO L204 MainTranslator]: Completed translation [2025-01-09 11:46:51,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:46:51 WrapperNode [2025-01-09 11:46:51,644 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 11:46:51,644 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 11:46:51,644 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 11:46:51,644 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 11:46:51,650 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:46:51" (1/1) ... [2025-01-09 11:46:51,658 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:46:51" (1/1) ... [2025-01-09 11:46:51,687 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 233 [2025-01-09 11:46:51,688 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 11:46:51,688 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 11:46:51,688 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 11:46:51,688 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 11:46:51,694 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:46:51" (1/1) ... [2025-01-09 11:46:51,695 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:46:51" (1/1) ... [2025-01-09 11:46:51,697 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:46:51" (1/1) ... [2025-01-09 11:46:51,713 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 11:46:51,713 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:46:51" (1/1) ... [2025-01-09 11:46:51,713 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:46:51" (1/1) ... [2025-01-09 11:46:51,727 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:46:51" (1/1) ... [2025-01-09 11:46:51,728 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:46:51" (1/1) ... [2025-01-09 11:46:51,735 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:46:51" (1/1) ... [2025-01-09 11:46:51,737 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:46:51" (1/1) ... [2025-01-09 11:46:51,739 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:46:51" (1/1) ... [2025-01-09 11:46:51,742 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 11:46:51,743 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 11:46:51,743 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 11:46:51,744 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 11:46:51,745 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:46:51" (1/1) ... [2025-01-09 11:46:51,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:46:51,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:46:51,778 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 11:46:51,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 11:46:51,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 11:46:51,796 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 11:46:51,796 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 11:46:51,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 11:46:51,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 11:46:51,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 11:46:51,859 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 11:46:51,861 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 11:46:52,247 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-01-09 11:46:52,247 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 11:46:52,257 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 11:46:52,257 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 11:46:52,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:46:52 BoogieIcfgContainer [2025-01-09 11:46:52,258 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 11:46:52,260 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 11:46:52,260 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 11:46:52,263 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 11:46:52,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 11:46:51" (1/3) ... [2025-01-09 11:46:52,264 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@127c8763 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:46:52, skipping insertion in model container [2025-01-09 11:46:52,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:46:51" (2/3) ... [2025-01-09 11:46:52,264 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@127c8763 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:46:52, skipping insertion in model container [2025-01-09 11:46:52,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:46:52" (3/3) ... [2025-01-09 11:46:52,265 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-86.i [2025-01-09 11:46:52,277 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 11:46:52,279 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-86.i that has 2 procedures, 97 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 11:46:52,317 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 11:46:52,325 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@38aad982, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 11:46:52,325 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 11:46:52,328 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 67 states have (on average 1.4776119402985075) internal successors, (99), 68 states have internal predecessors, (99), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 11:46:52,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 11:46:52,336 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:46:52,337 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:46:52,337 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:46:52,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:46:52,341 INFO L85 PathProgramCache]: Analyzing trace with hash 2067938277, now seen corresponding path program 1 times [2025-01-09 11:46:52,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:46:52,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729740586] [2025-01-09 11:46:52,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:46:52,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:46:52,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 11:46:52,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 11:46:52,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:46:52,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:46:52,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-01-09 11:46:52,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:46:52,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729740586] [2025-01-09 11:46:52,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729740586] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:46:52,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441060781] [2025-01-09 11:46:52,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:46:52,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:46:52,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:46:52,632 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 11:46:52,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 11:46:52,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 11:46:52,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 11:46:52,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:46:52,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:46:52,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 11:46:52,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:46:52,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-01-09 11:46:52,814 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:46:52,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441060781] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:46:52,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 11:46:52,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 11:46:52,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300085315] [2025-01-09 11:46:52,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:46:52,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 11:46:52,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:46:52,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 11:46:52,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 11:46:52,837 INFO L87 Difference]: Start difference. First operand has 97 states, 67 states have (on average 1.4776119402985075) internal successors, (99), 68 states have internal predecessors, (99), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 11:46:52,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:46:52,854 INFO L93 Difference]: Finished difference Result 188 states and 328 transitions. [2025-01-09 11:46:52,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 11:46:52,857 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 175 [2025-01-09 11:46:52,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:46:52,862 INFO L225 Difference]: With dead ends: 188 [2025-01-09 11:46:52,862 INFO L226 Difference]: Without dead ends: 94 [2025-01-09 11:46:52,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 11:46:52,866 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:46:52,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:46:52,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-01-09 11:46:52,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-01-09 11:46:52,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 65 states have (on average 1.4307692307692308) internal successors, (93), 65 states have internal predecessors, (93), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 11:46:52,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 147 transitions. [2025-01-09 11:46:52,898 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 147 transitions. Word has length 175 [2025-01-09 11:46:52,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:46:52,898 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 147 transitions. [2025-01-09 11:46:52,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 11:46:52,898 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 147 transitions. [2025-01-09 11:46:52,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 11:46:52,901 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:46:52,902 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:46:52,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 11:46:53,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 11:46:53,104 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:46:53,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:46:53,105 INFO L85 PathProgramCache]: Analyzing trace with hash 265703719, now seen corresponding path program 1 times [2025-01-09 11:46:53,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:46:53,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405544139] [2025-01-09 11:46:53,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:46:53,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:46:53,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 11:46:53,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 11:46:53,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:46:53,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:46:53,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 11:46:53,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:46:53,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405544139] [2025-01-09 11:46:53,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405544139] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:46:53,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:46:53,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:46:53,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559651643] [2025-01-09 11:46:53,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:46:53,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:46:53,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:46:53,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:46:53,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:46:53,404 INFO L87 Difference]: Start difference. First operand 94 states and 147 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 11:46:53,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:46:53,434 INFO L93 Difference]: Finished difference Result 186 states and 293 transitions. [2025-01-09 11:46:53,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:46:53,435 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175 [2025-01-09 11:46:53,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:46:53,437 INFO L225 Difference]: With dead ends: 186 [2025-01-09 11:46:53,437 INFO L226 Difference]: Without dead ends: 95 [2025-01-09 11:46:53,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:46:53,438 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:46:53,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 286 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:46:53,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-01-09 11:46:53,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-01-09 11:46:53,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 66 states have internal predecessors, (94), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 11:46:53,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 148 transitions. [2025-01-09 11:46:53,453 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 148 transitions. Word has length 175 [2025-01-09 11:46:53,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:46:53,455 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 148 transitions. [2025-01-09 11:46:53,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 11:46:53,455 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 148 transitions. [2025-01-09 11:46:53,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 11:46:53,458 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:46:53,459 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:46:53,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 11:46:53,459 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:46:53,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:46:53,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1728440987, now seen corresponding path program 1 times [2025-01-09 11:46:53,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:46:53,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030496633] [2025-01-09 11:46:53,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:46:53,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:46:53,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 11:46:53,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 11:46:53,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:46:53,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:46:53,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 11:46:53,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:46:53,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030496633] [2025-01-09 11:46:53,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030496633] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:46:53,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:46:53,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 11:46:53,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749795894] [2025-01-09 11:46:53,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:46:53,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 11:46:53,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:46:53,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 11:46:53,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 11:46:53,772 INFO L87 Difference]: Start difference. First operand 95 states and 148 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 11:46:54,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:46:54,008 INFO L93 Difference]: Finished difference Result 280 states and 439 transitions. [2025-01-09 11:46:54,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 11:46:54,009 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175 [2025-01-09 11:46:54,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:46:54,013 INFO L225 Difference]: With dead ends: 280 [2025-01-09 11:46:54,014 INFO L226 Difference]: Without dead ends: 188 [2025-01-09 11:46:54,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 11:46:54,016 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 149 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 11:46:54,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 503 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 11:46:54,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-01-09 11:46:54,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 168. [2025-01-09 11:46:54,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 111 states have (on average 1.4054054054054055) internal successors, (156), 111 states have internal predecessors, (156), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 11:46:54,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 264 transitions. [2025-01-09 11:46:54,048 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 264 transitions. Word has length 175 [2025-01-09 11:46:54,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:46:54,048 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 264 transitions. [2025-01-09 11:46:54,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 11:46:54,049 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 264 transitions. [2025-01-09 11:46:54,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 11:46:54,052 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:46:54,052 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:46:54,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 11:46:54,053 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:46:54,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:46:54,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1555409059, now seen corresponding path program 1 times [2025-01-09 11:46:54,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:46:54,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2502327] [2025-01-09 11:46:54,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:46:54,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:46:54,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 11:46:54,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 11:46:54,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:46:54,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:47:00,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 11:47:00,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:47:00,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2502327] [2025-01-09 11:47:00,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2502327] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:47:00,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:47:00,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 11:47:00,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674424680] [2025-01-09 11:47:00,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:47:00,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 11:47:00,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:47:00,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 11:47:00,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-01-09 11:47:00,369 INFO L87 Difference]: Start difference. First operand 168 states and 264 transitions. Second operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 11:47:02,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:47:02,799 INFO L93 Difference]: Finished difference Result 357 states and 549 transitions. [2025-01-09 11:47:02,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 11:47:02,801 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175 [2025-01-09 11:47:02,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:47:02,803 INFO L225 Difference]: With dead ends: 357 [2025-01-09 11:47:02,803 INFO L226 Difference]: Without dead ends: 265 [2025-01-09 11:47:02,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=233, Invalid=697, Unknown=0, NotChecked=0, Total=930 [2025-01-09 11:47:02,804 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 431 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 11:47:02,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 1161 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 11:47:02,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-01-09 11:47:02,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 210. [2025-01-09 11:47:02,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 153 states have (on average 1.4313725490196079) internal successors, (219), 153 states have internal predecessors, (219), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 11:47:02,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 327 transitions. [2025-01-09 11:47:02,832 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 327 transitions. Word has length 175 [2025-01-09 11:47:02,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:47:02,833 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 327 transitions. [2025-01-09 11:47:02,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 11:47:02,834 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 327 transitions. [2025-01-09 11:47:02,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 11:47:02,836 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:47:02,836 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:47:02,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 11:47:02,836 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:47:02,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:47:02,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1774263777, now seen corresponding path program 1 times [2025-01-09 11:47:02,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:47:02,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500369143] [2025-01-09 11:47:02,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:47:02,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:47:02,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 11:47:02,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 11:47:02,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:47:02,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:47:03,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 11:47:03,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:47:03,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500369143] [2025-01-09 11:47:03,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500369143] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:47:03,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:47:03,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 11:47:03,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792296610] [2025-01-09 11:47:03,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:47:03,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 11:47:03,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:47:03,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 11:47:03,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:47:03,019 INFO L87 Difference]: Start difference. First operand 210 states and 327 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 11:47:03,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:47:03,085 INFO L93 Difference]: Finished difference Result 486 states and 759 transitions. [2025-01-09 11:47:03,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 11:47:03,086 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175 [2025-01-09 11:47:03,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:47:03,088 INFO L225 Difference]: With dead ends: 486 [2025-01-09 11:47:03,088 INFO L226 Difference]: Without dead ends: 394 [2025-01-09 11:47:03,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 11:47:03,089 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 275 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:47:03,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 556 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:47:03,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2025-01-09 11:47:03,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 355. [2025-01-09 11:47:03,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 270 states have (on average 1.4666666666666666) internal successors, (396), 270 states have internal predecessors, (396), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 11:47:03,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 558 transitions. [2025-01-09 11:47:03,111 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 558 transitions. Word has length 175 [2025-01-09 11:47:03,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:47:03,111 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 558 transitions. [2025-01-09 11:47:03,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 11:47:03,112 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 558 transitions. [2025-01-09 11:47:03,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 11:47:03,113 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:47:03,113 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:47:03,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 11:47:03,113 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:47:03,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:47:03,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1026542494, now seen corresponding path program 1 times [2025-01-09 11:47:03,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:47:03,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92533951] [2025-01-09 11:47:03,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:47:03,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:47:03,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 11:47:03,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 11:47:03,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:47:03,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:47:10,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 11:47:10,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:47:10,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92533951] [2025-01-09 11:47:10,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92533951] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:47:10,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:47:10,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-09 11:47:10,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456307015] [2025-01-09 11:47:10,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:47:10,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 11:47:10,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:47:10,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 11:47:10,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2025-01-09 11:47:10,681 INFO L87 Difference]: Start difference. First operand 355 states and 558 transitions. Second operand has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 11:47:15,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:47:15,409 INFO L93 Difference]: Finished difference Result 438 states and 666 transitions. [2025-01-09 11:47:15,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 11:47:15,411 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 176 [2025-01-09 11:47:15,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:47:15,413 INFO L225 Difference]: With dead ends: 438 [2025-01-09 11:47:15,414 INFO L226 Difference]: Without dead ends: 436 [2025-01-09 11:47:15,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=262, Invalid=794, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 11:47:15,415 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 553 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 1028 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 11:47:15,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 1028 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 11:47:15,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2025-01-09 11:47:15,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 356. [2025-01-09 11:47:15,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 271 states have (on average 1.4649446494464944) internal successors, (397), 271 states have internal predecessors, (397), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 11:47:15,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 559 transitions. [2025-01-09 11:47:15,440 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 559 transitions. Word has length 176 [2025-01-09 11:47:15,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:47:15,441 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 559 transitions. [2025-01-09 11:47:15,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 11:47:15,441 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 559 transitions. [2025-01-09 11:47:15,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 11:47:15,443 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:47:15,443 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:47:15,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 11:47:15,443 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:47:15,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:47:15,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1705574854, now seen corresponding path program 1 times [2025-01-09 11:47:15,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:47:15,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315995755] [2025-01-09 11:47:15,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:47:15,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:47:15,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 11:47:15,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 11:47:15,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:47:15,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:47:19,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 11:47:19,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:47:19,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315995755] [2025-01-09 11:47:19,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315995755] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:47:19,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:47:19,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 11:47:19,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993854048] [2025-01-09 11:47:19,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:47:19,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 11:47:19,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:47:19,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 11:47:19,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2025-01-09 11:47:19,233 INFO L87 Difference]: Start difference. First operand 356 states and 559 transitions. Second operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 11:47:22,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:47:22,251 INFO L93 Difference]: Finished difference Result 660 states and 1015 transitions. [2025-01-09 11:47:22,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 11:47:22,252 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 176 [2025-01-09 11:47:22,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:47:22,255 INFO L225 Difference]: With dead ends: 660 [2025-01-09 11:47:22,256 INFO L226 Difference]: Without dead ends: 423 [2025-01-09 11:47:22,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=276, Invalid=846, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 11:47:22,258 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 466 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 11:47:22,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 918 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 11:47:22,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2025-01-09 11:47:22,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 361. [2025-01-09 11:47:22,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 276 states have (on average 1.463768115942029) internal successors, (404), 276 states have internal predecessors, (404), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 11:47:22,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 566 transitions. [2025-01-09 11:47:22,286 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 566 transitions. Word has length 176 [2025-01-09 11:47:22,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:47:22,286 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 566 transitions. [2025-01-09 11:47:22,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 11:47:22,286 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 566 transitions. [2025-01-09 11:47:22,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 11:47:22,288 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:47:22,288 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:47:22,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 11:47:22,288 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:47:22,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:47:22,292 INFO L85 PathProgramCache]: Analyzing trace with hash 814385080, now seen corresponding path program 1 times [2025-01-09 11:47:22,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:47:22,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816322298] [2025-01-09 11:47:22,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:47:22,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:47:22,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 11:47:22,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 11:47:22,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:47:22,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:47:22,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 11:47:22,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:47:22,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816322298] [2025-01-09 11:47:22,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816322298] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:47:22,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:47:22,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:47:22,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064524375] [2025-01-09 11:47:22,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:47:22,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:47:22,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:47:22,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:47:22,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:47:22,437 INFO L87 Difference]: Start difference. First operand 361 states and 566 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 11:47:22,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:47:22,481 INFO L93 Difference]: Finished difference Result 608 states and 955 transitions. [2025-01-09 11:47:22,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:47:22,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 176 [2025-01-09 11:47:22,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:47:22,487 INFO L225 Difference]: With dead ends: 608 [2025-01-09 11:47:22,487 INFO L226 Difference]: Without dead ends: 368 [2025-01-09 11:47:22,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:47:22,488 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 6 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:47:22,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 272 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:47:22,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-01-09 11:47:22,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 359. [2025-01-09 11:47:22,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 274 states have (on average 1.4525547445255473) internal successors, (398), 274 states have internal predecessors, (398), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 11:47:22,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 560 transitions. [2025-01-09 11:47:22,508 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 560 transitions. Word has length 176 [2025-01-09 11:47:22,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:47:22,509 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 560 transitions. [2025-01-09 11:47:22,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 11:47:22,510 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 560 transitions. [2025-01-09 11:47:22,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 11:47:22,511 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:47:22,511 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:47:22,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 11:47:22,512 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:47:22,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:47:22,513 INFO L85 PathProgramCache]: Analyzing trace with hash 339831385, now seen corresponding path program 1 times [2025-01-09 11:47:22,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:47:22,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805700070] [2025-01-09 11:47:22,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:47:22,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:47:22,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 11:47:22,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 11:47:22,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:47:22,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:47:28,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 11:47:28,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:47:28,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805700070] [2025-01-09 11:47:28,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805700070] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:47:28,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:47:28,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 11:47:28,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659678759] [2025-01-09 11:47:28,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:47:28,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 11:47:28,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:47:28,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 11:47:28,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-01-09 11:47:28,019 INFO L87 Difference]: Start difference. First operand 359 states and 560 transitions. Second operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 11:47:30,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:47:30,797 INFO L93 Difference]: Finished difference Result 430 states and 641 transitions. [2025-01-09 11:47:30,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 11:47:30,798 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 176 [2025-01-09 11:47:30,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:47:30,800 INFO L225 Difference]: With dead ends: 430 [2025-01-09 11:47:30,800 INFO L226 Difference]: Without dead ends: 428 [2025-01-09 11:47:30,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=233, Invalid=637, Unknown=0, NotChecked=0, Total=870 [2025-01-09 11:47:30,801 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 393 mSDsluCounter, 1166 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 1347 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 11:47:30,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 1347 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 11:47:30,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-01-09 11:47:30,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 371. [2025-01-09 11:47:30,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 286 states have (on average 1.444055944055944) internal successors, (413), 286 states have internal predecessors, (413), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 11:47:30,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 575 transitions. [2025-01-09 11:47:30,820 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 575 transitions. Word has length 176 [2025-01-09 11:47:30,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:47:30,821 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 575 transitions. [2025-01-09 11:47:30,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 11:47:30,821 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 575 transitions. [2025-01-09 11:47:30,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 11:47:30,822 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:47:30,823 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:47:30,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 11:47:30,823 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:47:30,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:47:30,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1019889755, now seen corresponding path program 1 times [2025-01-09 11:47:30,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:47:30,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329464806] [2025-01-09 11:47:30,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:47:30,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:47:30,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 11:47:30,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 11:47:30,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:47:30,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:47:37,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 11:47:37,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:47:37,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329464806] [2025-01-09 11:47:37,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329464806] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:47:37,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:47:37,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-09 11:47:37,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772553231] [2025-01-09 11:47:37,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:47:37,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 11:47:37,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:47:37,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 11:47:37,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2025-01-09 11:47:37,333 INFO L87 Difference]: Start difference. First operand 371 states and 575 transitions. Second operand has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 11:47:40,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:47:40,339 INFO L93 Difference]: Finished difference Result 424 states and 635 transitions. [2025-01-09 11:47:40,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 11:47:40,341 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 176 [2025-01-09 11:47:40,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:47:40,343 INFO L225 Difference]: With dead ends: 424 [2025-01-09 11:47:40,343 INFO L226 Difference]: Without dead ends: 422 [2025-01-09 11:47:40,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=251, Invalid=679, Unknown=0, NotChecked=0, Total=930 [2025-01-09 11:47:40,344 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 399 mSDsluCounter, 1160 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 1339 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 11:47:40,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 1339 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 11:47:40,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2025-01-09 11:47:40,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 371. [2025-01-09 11:47:40,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 286 states have (on average 1.444055944055944) internal successors, (413), 286 states have internal predecessors, (413), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 11:47:40,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 575 transitions. [2025-01-09 11:47:40,360 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 575 transitions. Word has length 176 [2025-01-09 11:47:40,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:47:40,360 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 575 transitions. [2025-01-09 11:47:40,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 11:47:40,360 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 575 transitions. [2025-01-09 11:47:40,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 11:47:40,362 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:47:40,362 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:47:40,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 11:47:40,362 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:47:40,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:47:40,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1279711001, now seen corresponding path program 1 times [2025-01-09 11:47:40,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:47:40,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636617056] [2025-01-09 11:47:40,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:47:40,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:47:40,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 11:47:40,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 11:47:40,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:47:40,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:47:44,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 11:47:44,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:47:44,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636617056] [2025-01-09 11:47:44,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636617056] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:47:44,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:47:44,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-09 11:47:44,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291084356] [2025-01-09 11:47:44,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:47:44,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 11:47:44,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:47:44,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 11:47:44,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2025-01-09 11:47:44,175 INFO L87 Difference]: Start difference. First operand 371 states and 575 transitions. Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 11:47:48,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:47:48,206 INFO L93 Difference]: Finished difference Result 418 states and 626 transitions. [2025-01-09 11:47:48,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-09 11:47:48,206 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 177 [2025-01-09 11:47:48,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:47:48,208 INFO L225 Difference]: With dead ends: 418 [2025-01-09 11:47:48,208 INFO L226 Difference]: Without dead ends: 416 [2025-01-09 11:47:48,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=336, Invalid=996, Unknown=0, NotChecked=0, Total=1332 [2025-01-09 11:47:48,209 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 413 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 11:47:48,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 978 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 11:47:48,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2025-01-09 11:47:48,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 368. [2025-01-09 11:47:48,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 283 states have (on average 1.4452296819787986) internal successors, (409), 283 states have internal predecessors, (409), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 11:47:48,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 571 transitions. [2025-01-09 11:47:48,223 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 571 transitions. Word has length 177 [2025-01-09 11:47:48,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:47:48,223 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 571 transitions. [2025-01-09 11:47:48,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 11:47:48,223 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 571 transitions. [2025-01-09 11:47:48,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 11:47:48,224 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:47:48,224 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:47:48,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 11:47:48,224 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:47:48,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:47:48,225 INFO L85 PathProgramCache]: Analyzing trace with hash -697597129, now seen corresponding path program 1 times [2025-01-09 11:47:48,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:47:48,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034356327] [2025-01-09 11:47:48,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:47:48,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:47:48,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 11:47:48,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 11:47:48,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:47:48,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:47:54,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 11:47:54,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:47:54,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034356327] [2025-01-09 11:47:54,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034356327] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:47:54,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:47:54,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-09 11:47:54,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996964361] [2025-01-09 11:47:54,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:47:54,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 11:47:54,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:47:54,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 11:47:54,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2025-01-09 11:47:54,754 INFO L87 Difference]: Start difference. First operand 368 states and 571 transitions. Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 11:47:58,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:47:58,374 INFO L93 Difference]: Finished difference Result 446 states and 661 transitions. [2025-01-09 11:47:58,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 11:47:58,375 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 177 [2025-01-09 11:47:58,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:47:58,378 INFO L225 Difference]: With dead ends: 446 [2025-01-09 11:47:58,378 INFO L226 Difference]: Without dead ends: 444 [2025-01-09 11:47:58,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=318, Invalid=804, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 11:47:58,379 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 264 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:47:58,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 994 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 11:47:58,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2025-01-09 11:47:58,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 372. [2025-01-09 11:47:58,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 287 states have (on average 1.4425087108013936) internal successors, (414), 287 states have internal predecessors, (414), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 11:47:58,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 576 transitions. [2025-01-09 11:47:58,392 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 576 transitions. Word has length 177 [2025-01-09 11:47:58,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:47:58,392 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 576 transitions. [2025-01-09 11:47:58,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 11:47:58,393 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 576 transitions. [2025-01-09 11:47:58,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 11:47:58,393 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:47:58,393 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:47:58,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 11:47:58,394 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:47:58,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:47:58,394 INFO L85 PathProgramCache]: Analyzing trace with hash -17538759, now seen corresponding path program 1 times [2025-01-09 11:47:58,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:47:58,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199202827] [2025-01-09 11:47:58,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:47:58,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:47:58,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 11:47:58,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 11:47:58,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:47:58,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:48:06,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 11:48:06,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:48:06,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199202827] [2025-01-09 11:48:06,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199202827] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:48:06,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:48:06,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-01-09 11:48:06,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739941469] [2025-01-09 11:48:06,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:48:06,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 11:48:06,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:48:06,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 11:48:06,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2025-01-09 11:48:06,692 INFO L87 Difference]: Start difference. First operand 372 states and 576 transitions. Second operand has 18 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 11:48:14,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:48:14,236 INFO L93 Difference]: Finished difference Result 426 states and 637 transitions. [2025-01-09 11:48:14,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 11:48:14,237 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 177 [2025-01-09 11:48:14,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:48:14,239 INFO L225 Difference]: With dead ends: 426 [2025-01-09 11:48:14,239 INFO L226 Difference]: Without dead ends: 424 [2025-01-09 11:48:14,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=352, Invalid=838, Unknown=0, NotChecked=0, Total=1190 [2025-01-09 11:48:14,241 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 288 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 11:48:14,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 813 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 11:48:14,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2025-01-09 11:48:14,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 367. [2025-01-09 11:48:14,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 282 states have (on average 1.446808510638298) internal successors, (408), 282 states have internal predecessors, (408), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 11:48:14,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 570 transitions. [2025-01-09 11:48:14,257 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 570 transitions. Word has length 177 [2025-01-09 11:48:14,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:48:14,258 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 570 transitions. [2025-01-09 11:48:14,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 11:48:14,258 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 570 transitions. [2025-01-09 11:48:14,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 11:48:14,259 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:48:14,259 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:48:14,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 11:48:14,259 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:48:14,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:48:14,260 INFO L85 PathProgramCache]: Analyzing trace with hash 2000187306, now seen corresponding path program 1 times [2025-01-09 11:48:14,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:48:14,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032366702] [2025-01-09 11:48:14,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:48:14,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:48:14,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 11:48:14,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 11:48:14,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:48:14,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat