./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label34.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem01_label34.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 734ea858638864cf111875fb6688bf68ceb15644fd98461d3cd9d71a49a35f2c --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:57:43,760 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:57:43,806 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 00:57:43,810 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:57:43,810 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:57:43,829 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:57:43,830 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:57:43,830 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:57:43,830 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:57:43,830 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:57:43,831 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:57:43,831 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:57:43,831 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:57:43,831 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:57:43,832 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:57:43,832 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:57:43,832 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:57:43,832 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:57:43,832 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:57:43,832 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:57:43,832 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:57:43,832 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:57:43,832 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:57:43,832 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:57:43,832 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:57:43,832 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:57:43,832 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:57:43,832 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:57:43,832 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:57:43,832 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:57:43,833 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:57:43,833 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:57:43,833 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:57:43,833 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:57:43,833 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:57:43,833 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:57:43,833 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:57:43,833 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:57:43,833 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:57:43,833 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:57:43,833 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:57:43,833 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:57:43,833 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:57:43,833 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/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 -> 734ea858638864cf111875fb6688bf68ceb15644fd98461d3cd9d71a49a35f2c [2025-03-08 00:57:44,087 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:57:44,096 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:57:44,097 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:57:44,098 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:57:44,098 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:57:44,100 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label34.c [2025-03-08 00:57:45,329 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02240d63b/45d8dfecaacf49b3b5c2f6eb99a971be/FLAG9232371f1 [2025-03-08 00:57:45,628 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:57:45,628 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label34.c [2025-03-08 00:57:45,636 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02240d63b/45d8dfecaacf49b3b5c2f6eb99a971be/FLAG9232371f1 [2025-03-08 00:57:45,907 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02240d63b/45d8dfecaacf49b3b5c2f6eb99a971be [2025-03-08 00:57:45,908 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:57:45,909 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:57:45,910 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:57:45,910 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:57:45,913 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:57:45,914 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:57:45" (1/1) ... [2025-03-08 00:57:45,914 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@726ea9af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:45, skipping insertion in model container [2025-03-08 00:57:45,914 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:57:45" (1/1) ... [2025-03-08 00:57:45,946 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:57:46,194 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label34.c[18605,18618] [2025-03-08 00:57:46,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:57:46,236 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:57:46,302 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label34.c[18605,18618] [2025-03-08 00:57:46,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:57:46,331 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:57:46,332 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:46 WrapperNode [2025-03-08 00:57:46,332 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:57:46,333 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:57:46,333 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:57:46,334 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:57:46,338 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:46" (1/1) ... [2025-03-08 00:57:46,348 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:46" (1/1) ... [2025-03-08 00:57:46,384 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 655 [2025-03-08 00:57:46,388 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:57:46,389 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:57:46,389 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:57:46,389 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:57:46,396 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:46" (1/1) ... [2025-03-08 00:57:46,397 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:46" (1/1) ... [2025-03-08 00:57:46,404 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:46" (1/1) ... [2025-03-08 00:57:46,430 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-03-08 00:57:46,431 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:46" (1/1) ... [2025-03-08 00:57:46,431 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:46" (1/1) ... [2025-03-08 00:57:46,446 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:46" (1/1) ... [2025-03-08 00:57:46,449 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:46" (1/1) ... [2025-03-08 00:57:46,452 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:46" (1/1) ... [2025-03-08 00:57:46,455 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:46" (1/1) ... [2025-03-08 00:57:46,465 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:57:46,465 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:57:46,465 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:57:46,465 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:57:46,466 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:46" (1/1) ... [2025-03-08 00:57:46,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:57:46,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:57:46,493 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 00:57:46,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 00:57:46,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:57:46,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:57:46,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:57:46,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:57:46,570 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:57:46,572 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:57:47,280 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2025-03-08 00:57:47,280 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:57:47,292 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:57:47,292 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:57:47,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:57:47 BoogieIcfgContainer [2025-03-08 00:57:47,292 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:57:47,295 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:57:47,296 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:57:47,299 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:57:47,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:57:45" (1/3) ... [2025-03-08 00:57:47,300 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2839ac5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:57:47, skipping insertion in model container [2025-03-08 00:57:47,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:46" (2/3) ... [2025-03-08 00:57:47,300 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2839ac5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:57:47, skipping insertion in model container [2025-03-08 00:57:47,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:57:47" (3/3) ... [2025-03-08 00:57:47,301 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem01_label34.c [2025-03-08 00:57:47,313 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:57:47,315 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem01_label34.c that has 1 procedures, 198 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 00:57:47,364 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:57:47,375 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;@4ae58050, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:57:47,376 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:57:47,380 INFO L276 IsEmpty]: Start isEmpty. Operand has 198 states, 196 states have (on average 1.663265306122449) internal successors, (326), 197 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:47,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-08 00:57:47,389 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:57:47,389 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 00:57:47,390 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:57:47,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:57:47,394 INFO L85 PathProgramCache]: Analyzing trace with hash 705031628, now seen corresponding path program 1 times [2025-03-08 00:57:47,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:57:47,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842794765] [2025-03-08 00:57:47,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:57:47,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:57:47,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-08 00:57:47,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-08 00:57:47,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:57:47,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:57:47,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:57:47,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:57:47,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842794765] [2025-03-08 00:57:47,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842794765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:57:47,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:57:47,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 00:57:47,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557245640] [2025-03-08 00:57:47,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:57:47,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:57:47,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:57:47,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:57:47,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:57:47,847 INFO L87 Difference]: Start difference. First operand has 198 states, 196 states have (on average 1.663265306122449) internal successors, (326), 197 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:48,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:57:48,457 INFO L93 Difference]: Finished difference Result 528 states and 912 transitions. [2025-03-08 00:57:48,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:57:48,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2025-03-08 00:57:48,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:57:48,465 INFO L225 Difference]: With dead ends: 528 [2025-03-08 00:57:48,465 INFO L226 Difference]: Without dead ends: 266 [2025-03-08 00:57:48,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-03-08 00:57:48,469 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 77 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 00:57:48,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 73 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 00:57:48,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-03-08 00:57:48,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2025-03-08 00:57:48,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 1.411320754716981) internal successors, (374), 265 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:48,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 374 transitions. [2025-03-08 00:57:48,502 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 374 transitions. Word has length 105 [2025-03-08 00:57:48,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:57:48,503 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 374 transitions. [2025-03-08 00:57:48,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:48,504 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 374 transitions. [2025-03-08 00:57:48,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 00:57:48,506 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:57:48,507 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 00:57:48,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 00:57:48,507 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:57:48,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:57:48,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1900950423, now seen corresponding path program 1 times [2025-03-08 00:57:48,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:57:48,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868579127] [2025-03-08 00:57:48,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:57:48,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:57:48,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 00:57:48,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 00:57:48,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:57:48,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:57:48,730 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:57:48,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:57:48,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868579127] [2025-03-08 00:57:48,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868579127] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:57:48,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:57:48,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:57:48,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579165704] [2025-03-08 00:57:48,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:57:48,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:57:48,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:57:48,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:57:48,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:57:48,732 INFO L87 Difference]: Start difference. First operand 266 states and 374 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:49,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:57:49,112 INFO L93 Difference]: Finished difference Result 792 states and 1117 transitions. [2025-03-08 00:57:49,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:57:49,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2025-03-08 00:57:49,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:57:49,115 INFO L225 Difference]: With dead ends: 792 [2025-03-08 00:57:49,115 INFO L226 Difference]: Without dead ends: 528 [2025-03-08 00:57:49,116 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-03-08 00:57:49,116 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 46 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 00:57:49,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 19 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 00:57:49,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-03-08 00:57:49,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 397. [2025-03-08 00:57:49,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 396 states have (on average 1.4267676767676767) internal successors, (565), 396 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:49,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 565 transitions. [2025-03-08 00:57:49,132 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 565 transitions. Word has length 109 [2025-03-08 00:57:49,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:57:49,132 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 565 transitions. [2025-03-08 00:57:49,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:49,132 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 565 transitions. [2025-03-08 00:57:49,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 00:57:49,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:57:49,133 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 00:57:49,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 00:57:49,134 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:57:49,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:57:49,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1830671320, now seen corresponding path program 1 times [2025-03-08 00:57:49,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:57:49,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686939089] [2025-03-08 00:57:49,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:57:49,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:57:49,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 00:57:49,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 00:57:49,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:57:49,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:57:49,209 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:57:49,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:57:49,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686939089] [2025-03-08 00:57:49,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686939089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:57:49,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:57:49,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 00:57:49,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889552775] [2025-03-08 00:57:49,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:57:49,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:57:49,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:57:49,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:57:49,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:57:49,210 INFO L87 Difference]: Start difference. First operand 397 states and 565 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:49,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:57:49,532 INFO L93 Difference]: Finished difference Result 1054 states and 1492 transitions. [2025-03-08 00:57:49,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:57:49,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-08 00:57:49,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:57:49,535 INFO L225 Difference]: With dead ends: 1054 [2025-03-08 00:57:49,536 INFO L226 Difference]: Without dead ends: 659 [2025-03-08 00:57:49,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-03-08 00:57:49,539 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 172 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:57:49,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 29 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:57:49,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2025-03-08 00:57:49,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659. [2025-03-08 00:57:49,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 658 states have (on average 1.3297872340425532) internal successors, (875), 658 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:49,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 875 transitions. [2025-03-08 00:57:49,566 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 875 transitions. Word has length 110 [2025-03-08 00:57:49,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:57:49,566 INFO L471 AbstractCegarLoop]: Abstraction has 659 states and 875 transitions. [2025-03-08 00:57:49,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:49,566 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 875 transitions. [2025-03-08 00:57:49,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 00:57:49,569 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:57:49,569 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 00:57:49,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 00:57:49,569 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:57:49,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:57:49,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1931782781, now seen corresponding path program 1 times [2025-03-08 00:57:49,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:57:49,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961833135] [2025-03-08 00:57:49,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:57:49,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:57:49,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 00:57:49,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 00:57:49,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:57:49,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:57:49,735 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 00:57:49,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:57:49,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961833135] [2025-03-08 00:57:49,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961833135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:57:49,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:57:49,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 00:57:49,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388532290] [2025-03-08 00:57:49,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:57:49,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:57:49,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:57:49,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:57:49,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:57:49,739 INFO L87 Difference]: Start difference. First operand 659 states and 875 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:50,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:57:50,050 INFO L93 Difference]: Finished difference Result 1316 states and 1748 transitions. [2025-03-08 00:57:50,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:57:50,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2025-03-08 00:57:50,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:57:50,055 INFO L225 Difference]: With dead ends: 1316 [2025-03-08 00:57:50,055 INFO L226 Difference]: Without dead ends: 659 [2025-03-08 00:57:50,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-03-08 00:57:50,057 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 132 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:57:50,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 62 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:57:50,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2025-03-08 00:57:50,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659. [2025-03-08 00:57:50,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 658 states have (on average 1.3206686930091185) internal successors, (869), 658 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:50,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 869 transitions. [2025-03-08 00:57:50,070 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 869 transitions. Word has length 121 [2025-03-08 00:57:50,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:57:50,070 INFO L471 AbstractCegarLoop]: Abstraction has 659 states and 869 transitions. [2025-03-08 00:57:50,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:50,071 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 869 transitions. [2025-03-08 00:57:50,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 00:57:50,072 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:57:50,072 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 00:57:50,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 00:57:50,072 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:57:50,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:57:50,073 INFO L85 PathProgramCache]: Analyzing trace with hash -394154214, now seen corresponding path program 1 times [2025-03-08 00:57:50,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:57:50,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081898393] [2025-03-08 00:57:50,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:57:50,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:57:50,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 00:57:50,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 00:57:50,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:57:50,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:57:50,205 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 00:57:50,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:57:50,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081898393] [2025-03-08 00:57:50,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081898393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:57:50,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:57:50,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:57:50,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390340816] [2025-03-08 00:57:50,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:57:50,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:57:50,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:57:50,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:57:50,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:57:50,207 INFO L87 Difference]: Start difference. First operand 659 states and 869 transitions. Second operand has 4 states, 4 states have (on average 30.25) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:50,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:57:50,690 INFO L93 Difference]: Finished difference Result 1971 states and 2560 transitions. [2025-03-08 00:57:50,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:57:50,690 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 125 [2025-03-08 00:57:50,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:57:50,694 INFO L225 Difference]: With dead ends: 1971 [2025-03-08 00:57:50,694 INFO L226 Difference]: Without dead ends: 1314 [2025-03-08 00:57:50,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:57:50,695 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 263 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 00:57:50,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 48 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 00:57:50,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2025-03-08 00:57:50,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1183. [2025-03-08 00:57:50,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1182 states have (on average 1.239424703891709) internal successors, (1465), 1182 states have internal predecessors, (1465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:50,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1465 transitions. [2025-03-08 00:57:50,713 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1465 transitions. Word has length 125 [2025-03-08 00:57:50,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:57:50,714 INFO L471 AbstractCegarLoop]: Abstraction has 1183 states and 1465 transitions. [2025-03-08 00:57:50,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:50,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1465 transitions. [2025-03-08 00:57:50,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 00:57:50,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:57:50,716 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 00:57:50,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 00:57:50,717 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:57:50,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:57:50,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1315068309, now seen corresponding path program 1 times [2025-03-08 00:57:50,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:57:50,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430083150] [2025-03-08 00:57:50,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:57:50,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:57:50,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 00:57:50,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 00:57:50,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:57:50,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:57:50,922 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 00:57:50,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:57:50,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430083150] [2025-03-08 00:57:50,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430083150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:57:50,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:57:50,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 00:57:50,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606375896] [2025-03-08 00:57:50,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:57:50,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:57:50,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:57:50,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:57:50,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:57:50,927 INFO L87 Difference]: Start difference. First operand 1183 states and 1465 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:51,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:57:51,242 INFO L93 Difference]: Finished difference Result 2364 states and 2928 transitions. [2025-03-08 00:57:51,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:57:51,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2025-03-08 00:57:51,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:57:51,246 INFO L225 Difference]: With dead ends: 2364 [2025-03-08 00:57:51,246 INFO L226 Difference]: Without dead ends: 1183 [2025-03-08 00:57:51,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-03-08 00:57:51,247 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 108 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:57:51,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 62 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:57:51,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2025-03-08 00:57:51,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1183. [2025-03-08 00:57:51,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1182 states have (on average 1.22419627749577) internal successors, (1447), 1182 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:51,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1447 transitions. [2025-03-08 00:57:51,265 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1447 transitions. Word has length 150 [2025-03-08 00:57:51,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:57:51,265 INFO L471 AbstractCegarLoop]: Abstraction has 1183 states and 1447 transitions. [2025-03-08 00:57:51,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:51,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1447 transitions. [2025-03-08 00:57:51,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-08 00:57:51,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:57:51,268 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 00:57:51,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 00:57:51,268 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:57:51,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:57:51,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1857623576, now seen corresponding path program 1 times [2025-03-08 00:57:51,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:57:51,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429278650] [2025-03-08 00:57:51,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:57:51,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:57:51,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-08 00:57:51,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-08 00:57:51,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:57:51,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:57:51,457 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 00:57:51,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:57:51,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429278650] [2025-03-08 00:57:51,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429278650] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:57:51,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:57:51,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:57:51,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845530451] [2025-03-08 00:57:51,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:57:51,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:57:51,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:57:51,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:57:51,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:57:51,459 INFO L87 Difference]: Start difference. First operand 1183 states and 1447 transitions. Second operand has 4 states, 4 states have (on average 35.0) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:51,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:57:51,934 INFO L93 Difference]: Finished difference Result 2757 states and 3333 transitions. [2025-03-08 00:57:51,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:57:51,935 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2025-03-08 00:57:51,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:57:51,940 INFO L225 Difference]: With dead ends: 2757 [2025-03-08 00:57:51,940 INFO L226 Difference]: Without dead ends: 1576 [2025-03-08 00:57:51,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:57:51,942 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 245 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 00:57:51,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 60 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 00:57:51,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2025-03-08 00:57:51,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1445. [2025-03-08 00:57:51,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1445 states, 1444 states have (on average 1.2001385041551247) internal successors, (1733), 1444 states have internal predecessors, (1733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:51,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1733 transitions. [2025-03-08 00:57:51,963 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1733 transitions. Word has length 154 [2025-03-08 00:57:51,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:57:51,963 INFO L471 AbstractCegarLoop]: Abstraction has 1445 states and 1733 transitions. [2025-03-08 00:57:51,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:51,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1733 transitions. [2025-03-08 00:57:51,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-08 00:57:51,965 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:57:51,965 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 00:57:51,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 00:57:51,966 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:57:51,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:57:51,966 INFO L85 PathProgramCache]: Analyzing trace with hash -788088864, now seen corresponding path program 1 times [2025-03-08 00:57:51,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:57:51,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33614044] [2025-03-08 00:57:51,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:57:51,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:57:51,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-08 00:57:51,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-08 00:57:51,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:57:51,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:57:52,107 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 00:57:52,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:57:52,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33614044] [2025-03-08 00:57:52,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33614044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:57:52,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:57:52,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:57:52,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521356032] [2025-03-08 00:57:52,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:57:52,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:57:52,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:57:52,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:57:52,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:57:52,110 INFO L87 Difference]: Start difference. First operand 1445 states and 1733 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:52,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:57:52,473 INFO L93 Difference]: Finished difference Result 3281 states and 3923 transitions. [2025-03-08 00:57:52,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:57:52,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 171 [2025-03-08 00:57:52,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:57:52,480 INFO L225 Difference]: With dead ends: 3281 [2025-03-08 00:57:52,480 INFO L226 Difference]: Without dead ends: 1838 [2025-03-08 00:57:52,482 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-03-08 00:57:52,483 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 93 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:57:52,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 55 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:57:52,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2025-03-08 00:57:52,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1576. [2025-03-08 00:57:52,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1575 states have (on average 1.2063492063492063) internal successors, (1900), 1575 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:52,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1900 transitions. [2025-03-08 00:57:52,515 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1900 transitions. Word has length 171 [2025-03-08 00:57:52,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:57:52,516 INFO L471 AbstractCegarLoop]: Abstraction has 1576 states and 1900 transitions. [2025-03-08 00:57:52,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:52,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1900 transitions. [2025-03-08 00:57:52,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-08 00:57:52,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:57:52,522 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 00:57:52,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 00:57:52,522 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:57:52,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:57:52,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1079916647, now seen corresponding path program 1 times [2025-03-08 00:57:52,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:57:52,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767389029] [2025-03-08 00:57:52,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:57:52,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:57:52,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-08 00:57:52,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-08 00:57:52,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:57:52,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:57:52,673 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 00:57:52,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:57:52,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767389029] [2025-03-08 00:57:52,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767389029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:57:52,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:57:52,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:57:52,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583405119] [2025-03-08 00:57:52,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:57:52,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:57:52,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:57:52,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:57:52,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:57:52,675 INFO L87 Difference]: Start difference. First operand 1576 states and 1900 transitions. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:53,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:57:53,015 INFO L93 Difference]: Finished difference Result 3543 states and 4257 transitions. [2025-03-08 00:57:53,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:57:53,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 198 [2025-03-08 00:57:53,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:57:53,021 INFO L225 Difference]: With dead ends: 3543 [2025-03-08 00:57:53,021 INFO L226 Difference]: Without dead ends: 1969 [2025-03-08 00:57:53,023 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-03-08 00:57:53,023 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 88 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:57:53,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 191 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:57:53,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2025-03-08 00:57:53,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1838. [2025-03-08 00:57:53,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1837 states have (on average 1.1834512792596625) internal successors, (2174), 1837 states have internal predecessors, (2174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:53,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2174 transitions. [2025-03-08 00:57:53,058 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2174 transitions. Word has length 198 [2025-03-08 00:57:53,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:57:53,058 INFO L471 AbstractCegarLoop]: Abstraction has 1838 states and 2174 transitions. [2025-03-08 00:57:53,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:53,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2174 transitions. [2025-03-08 00:57:53,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-03-08 00:57:53,062 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:57:53,062 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 00:57:53,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 00:57:53,062 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:57:53,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:57:53,063 INFO L85 PathProgramCache]: Analyzing trace with hash 192402768, now seen corresponding path program 1 times [2025-03-08 00:57:53,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:57:53,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327857118] [2025-03-08 00:57:53,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:57:53,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:57:53,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-03-08 00:57:53,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-03-08 00:57:53,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:57:53,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:57:53,155 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:57:53,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:57:53,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327857118] [2025-03-08 00:57:53,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327857118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:57:53,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:57:53,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:57:53,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369797316] [2025-03-08 00:57:53,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:57:53,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:57:53,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:57:53,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:57:53,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:57:53,157 INFO L87 Difference]: Start difference. First operand 1838 states and 2174 transitions. Second operand has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:53,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:57:53,499 INFO L93 Difference]: Finished difference Result 3674 states and 4346 transitions. [2025-03-08 00:57:53,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:57:53,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 211 [2025-03-08 00:57:53,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:57:53,505 INFO L225 Difference]: With dead ends: 3674 [2025-03-08 00:57:53,505 INFO L226 Difference]: Without dead ends: 1838 [2025-03-08 00:57:53,506 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-03-08 00:57:53,507 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 98 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:57:53,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 178 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:57:53,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2025-03-08 00:57:53,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1838. [2025-03-08 00:57:53,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1837 states have (on average 1.1475231355470876) internal successors, (2108), 1837 states have internal predecessors, (2108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:53,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2108 transitions. [2025-03-08 00:57:53,532 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2108 transitions. Word has length 211 [2025-03-08 00:57:53,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:57:53,532 INFO L471 AbstractCegarLoop]: Abstraction has 1838 states and 2108 transitions. [2025-03-08 00:57:53,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:53,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2108 transitions. [2025-03-08 00:57:53,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-03-08 00:57:53,535 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:57:53,535 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 00:57:53,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 00:57:53,535 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:57:53,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:57:53,536 INFO L85 PathProgramCache]: Analyzing trace with hash -336264208, now seen corresponding path program 1 times [2025-03-08 00:57:53,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:57:53,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811859714] [2025-03-08 00:57:53,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:57:53,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:57:53,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-08 00:57:53,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-08 00:57:53,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:57:53,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:57:53,644 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-03-08 00:57:53,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:57:53,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811859714] [2025-03-08 00:57:53,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811859714] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:57:53,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:57:53,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:57:53,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604191085] [2025-03-08 00:57:53,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:57:53,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:57:53,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:57:53,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:57:53,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:57:53,646 INFO L87 Difference]: Start difference. First operand 1838 states and 2108 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:53,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:57:53,934 INFO L93 Difference]: Finished difference Result 2100 states and 2394 transitions. [2025-03-08 00:57:53,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:57:53,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 220 [2025-03-08 00:57:53,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:57:53,935 INFO L225 Difference]: With dead ends: 2100 [2025-03-08 00:57:53,935 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 00:57:53,936 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-03-08 00:57:53,937 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 49 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:57:53,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 28 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:57:53,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 00:57:53,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 00:57:53,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:53,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 00:57:53,938 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 220 [2025-03-08 00:57:53,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:57:53,938 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 00:57:53,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:53,938 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 00:57:53,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 00:57:53,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 00:57:53,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 00:57:53,943 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:57:53,944 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 00:57:54,009 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 00:57:54,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 12:57:54 BoogieIcfgContainer [2025-03-08 00:57:54,029 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 00:57:54,029 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 00:57:54,030 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 00:57:54,030 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 00:57:54,030 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:57:47" (3/4) ... [2025-03-08 00:57:54,032 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 00:57:54,048 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-08 00:57:54,051 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-08 00:57:54,052 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 00:57:54,052 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 00:57:54,157 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 00:57:54,158 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 00:57:54,158 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 00:57:54,159 INFO L158 Benchmark]: Toolchain (without parser) took 8248.97ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 128.3MB in the beginning and 206.5MB in the end (delta: -78.2MB). Peak memory consumption was 150.1MB. Max. memory is 16.1GB. [2025-03-08 00:57:54,159 INFO L158 Benchmark]: CDTParser took 0.53ms. Allocated memory is still 192.9MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 00:57:54,159 INFO L158 Benchmark]: CACSL2BoogieTranslator took 422.60ms. Allocated memory is still 167.8MB. Free memory was 128.3MB in the beginning and 101.5MB in the end (delta: 26.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 00:57:54,160 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.24ms. Allocated memory is still 167.8MB. Free memory was 101.5MB in the beginning and 96.1MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 00:57:54,160 INFO L158 Benchmark]: Boogie Preprocessor took 75.79ms. Allocated memory is still 167.8MB. Free memory was 96.1MB in the beginning and 92.0MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 00:57:54,160 INFO L158 Benchmark]: IcfgBuilder took 828.38ms. Allocated memory is still 167.8MB. Free memory was 92.0MB in the beginning and 93.7MB in the end (delta: -1.6MB). Peak memory consumption was 59.1MB. Max. memory is 16.1GB. [2025-03-08 00:57:54,161 INFO L158 Benchmark]: TraceAbstraction took 6733.61ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 92.8MB in the beginning and 74.7MB in the end (delta: 18.2MB). Peak memory consumption was 107.8MB. Max. memory is 16.1GB. [2025-03-08 00:57:54,161 INFO L158 Benchmark]: Witness Printer took 128.31ms. Allocated memory is still 251.7MB. Free memory was 74.7MB in the beginning and 206.5MB in the end (delta: -131.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 00:57:54,162 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.53ms. Allocated memory is still 192.9MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 422.60ms. Allocated memory is still 167.8MB. Free memory was 128.3MB in the beginning and 101.5MB in the end (delta: 26.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.24ms. Allocated memory is still 167.8MB. Free memory was 101.5MB in the beginning and 96.1MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.79ms. Allocated memory is still 167.8MB. Free memory was 96.1MB in the beginning and 92.0MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 828.38ms. Allocated memory is still 167.8MB. Free memory was 92.0MB in the beginning and 93.7MB in the end (delta: -1.6MB). Peak memory consumption was 59.1MB. Max. memory is 16.1GB. * TraceAbstraction took 6733.61ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 92.8MB in the beginning and 74.7MB in the end (delta: 18.2MB). Peak memory consumption was 107.8MB. Max. memory is 16.1GB. * Witness Printer took 128.31ms. Allocated memory is still 251.7MB. Free memory was 74.7MB in the beginning and 206.5MB in the end (delta: -131.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 501]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 326 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.6s, OverallIterations: 11, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1371 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1371 mSDsluCounter, 805 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 66 mSDsCounter, 679 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4095 IncrementalHoareTripleChecker+Invalid, 4774 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 679 mSolverCounterUnsat, 739 mSDtfsCounter, 4095 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1838occurred in iteration=9, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 786 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1674 NumberOfCodeBlocks, 1674 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1663 ConstructedInterpolants, 0 QuantifiedInterpolants, 3703 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 792/792 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 593]: Location Invariant Derived location invariant: (((((a21 == 1) && (a16 <= 5)) || ((a7 != 1) && (a21 == 1))) || (a20 == 1)) || ((a17 == 1) && (a16 <= 5))) RESULT: Ultimate proved your program to be correct! [2025-03-08 00:57:54,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE