./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label53.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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_label53.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 7127a319cf1cd9799cd1fae45aa7d7ff5ae81a2fc57d6618c5b4c58ba3671893 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 14:08:01,087 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 14:08:01,149 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 14:08:01,155 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 14:08:01,156 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 14:08:01,176 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 14:08:01,177 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 14:08:01,177 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 14:08:01,177 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 14:08:01,177 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 14:08:01,177 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 14:08:01,177 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 14:08:01,177 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 14:08:01,178 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 14:08:01,178 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 14:08:01,178 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 14:08:01,178 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 14:08:01,178 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 14:08:01,178 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 14:08:01,178 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 14:08:01,178 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 14:08:01,178 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 14:08:01,178 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 14:08:01,178 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 14:08:01,178 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 14:08:01,178 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 14:08:01,178 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 14:08:01,178 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 14:08:01,179 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 14:08:01,179 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 14:08:01,180 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 14:08:01,180 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 14:08:01,180 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:08:01,180 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 14:08:01,180 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 14:08:01,180 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 14:08:01,180 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 14:08:01,180 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 14:08:01,180 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 14:08:01,180 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 14:08:01,180 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 14:08:01,180 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 14:08:01,180 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 14:08:01,180 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 -> 7127a319cf1cd9799cd1fae45aa7d7ff5ae81a2fc57d6618c5b4c58ba3671893 [2025-03-16 14:08:01,389 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 14:08:01,396 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 14:08:01,398 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 14:08:01,398 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 14:08:01,399 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 14:08:01,399 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label53.c [2025-03-16 14:08:02,522 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3f1a3d13/c355b968c2c44684974c881c8477d4be/FLAGd61765e5e [2025-03-16 14:08:02,794 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 14:08:02,797 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label53.c [2025-03-16 14:08:02,810 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3f1a3d13/c355b968c2c44684974c881c8477d4be/FLAGd61765e5e [2025-03-16 14:08:03,086 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3f1a3d13/c355b968c2c44684974c881c8477d4be [2025-03-16 14:08:03,088 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 14:08:03,089 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 14:08:03,090 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 14:08:03,090 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 14:08:03,093 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 14:08:03,093 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:08:03" (1/1) ... [2025-03-16 14:08:03,094 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40d167f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:03, skipping insertion in model container [2025-03-16 14:08:03,094 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:08:03" (1/1) ... [2025-03-16 14:08:03,112 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 14:08:03,322 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_label53.c[19724,19737] [2025-03-16 14:08:03,347 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:08:03,354 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 14:08:03,408 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_label53.c[19724,19737] [2025-03-16 14:08:03,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:08:03,428 INFO L204 MainTranslator]: Completed translation [2025-03-16 14:08:03,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:03 WrapperNode [2025-03-16 14:08:03,428 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 14:08:03,429 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 14:08:03,429 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 14:08:03,429 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 14:08:03,434 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:03" (1/1) ... [2025-03-16 14:08:03,444 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:03" (1/1) ... [2025-03-16 14:08:03,481 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 655 [2025-03-16 14:08:03,481 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 14:08:03,482 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 14:08:03,482 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 14:08:03,482 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 14:08:03,488 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:03" (1/1) ... [2025-03-16 14:08:03,488 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:03" (1/1) ... [2025-03-16 14:08:03,499 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:03" (1/1) ... [2025-03-16 14:08:03,514 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-16 14:08:03,519 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:03" (1/1) ... [2025-03-16 14:08:03,519 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:03" (1/1) ... [2025-03-16 14:08:03,532 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:03" (1/1) ... [2025-03-16 14:08:03,535 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:03" (1/1) ... [2025-03-16 14:08:03,538 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:03" (1/1) ... [2025-03-16 14:08:03,539 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:03" (1/1) ... [2025-03-16 14:08:03,543 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 14:08:03,544 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 14:08:03,544 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 14:08:03,544 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 14:08:03,545 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:03" (1/1) ... [2025-03-16 14:08:03,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:08:03,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:08:03,575 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-16 14:08:03,579 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-16 14:08:03,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 14:08:03,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 14:08:03,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 14:08:03,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 14:08:03,652 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 14:08:03,654 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 14:08:04,373 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2025-03-16 14:08:04,373 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 14:08:04,385 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 14:08:04,385 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 14:08:04,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:08:04 BoogieIcfgContainer [2025-03-16 14:08:04,386 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 14:08:04,387 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 14:08:04,387 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 14:08:04,390 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 14:08:04,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:08:03" (1/3) ... [2025-03-16 14:08:04,390 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69728818 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:08:04, skipping insertion in model container [2025-03-16 14:08:04,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:03" (2/3) ... [2025-03-16 14:08:04,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69728818 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:08:04, skipping insertion in model container [2025-03-16 14:08:04,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:08:04" (3/3) ... [2025-03-16 14:08:04,392 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem01_label53.c [2025-03-16 14:08:04,402 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 14:08:04,403 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem01_label53.c that has 1 procedures, 137 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 14:08:04,444 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 14:08:04,454 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;@7856ae62, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 14:08:04,454 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 14:08:04,456 INFO L276 IsEmpty]: Start isEmpty. Operand has 137 states, 135 states have (on average 1.962962962962963) internal successors, (265), 136 states have internal predecessors, (265), 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-16 14:08:04,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-16 14:08:04,462 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:08:04,463 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:08:04,463 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:08:04,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:08:04,467 INFO L85 PathProgramCache]: Analyzing trace with hash -2092414753, now seen corresponding path program 1 times [2025-03-16 14:08:04,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:08:04,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252121990] [2025-03-16 14:08:04,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:04,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:08:04,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-16 14:08:04,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-16 14:08:04,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:04,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:04,723 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-16 14:08:04,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:08:04,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252121990] [2025-03-16 14:08:04,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252121990] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:08:04,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:08:04,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:08:04,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505799600] [2025-03-16 14:08:04,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:08:04,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 14:08:04,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:08:04,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 14:08:04,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:08:04,747 INFO L87 Difference]: Start difference. First operand has 137 states, 135 states have (on average 1.962962962962963) internal successors, (265), 136 states have internal predecessors, (265), 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 2 states, 2 states have (on average 56.5) internal successors, (113), 2 states have internal predecessors, (113), 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-16 14:08:04,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:08:04,765 INFO L93 Difference]: Finished difference Result 273 states and 529 transitions. [2025-03-16 14:08:04,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 14:08:04,766 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 56.5) internal successors, (113), 2 states have internal predecessors, (113), 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 113 [2025-03-16 14:08:04,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:08:04,772 INFO L225 Difference]: With dead ends: 273 [2025-03-16 14:08:04,773 INFO L226 Difference]: Without dead ends: 134 [2025-03-16 14:08:04,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:08:04,779 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:08:04,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:08:04,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-16 14:08:04,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2025-03-16 14:08:04,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 1.5037593984962405) internal successors, (200), 133 states have internal predecessors, (200), 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-16 14:08:04,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 200 transitions. [2025-03-16 14:08:04,810 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 200 transitions. Word has length 113 [2025-03-16 14:08:04,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:08:04,810 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 200 transitions. [2025-03-16 14:08:04,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 56.5) internal successors, (113), 2 states have internal predecessors, (113), 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-16 14:08:04,811 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 200 transitions. [2025-03-16 14:08:04,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-16 14:08:04,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:08:04,814 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:08:04,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 14:08:04,814 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:08:04,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:08:04,815 INFO L85 PathProgramCache]: Analyzing trace with hash -717450369, now seen corresponding path program 1 times [2025-03-16 14:08:04,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:08:04,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524237752] [2025-03-16 14:08:04,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:04,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:08:04,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-16 14:08:04,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-16 14:08:04,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:04,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:05,102 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-16 14:08:05,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:08:05,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524237752] [2025-03-16 14:08:05,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524237752] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:08:05,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:08:05,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:08:05,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485108625] [2025-03-16 14:08:05,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:08:05,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:08:05,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:08:05,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:08:05,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:08:05,107 INFO L87 Difference]: Start difference. First operand 134 states and 200 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 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-16 14:08:05,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:08:05,512 INFO L93 Difference]: Finished difference Result 398 states and 597 transitions. [2025-03-16 14:08:05,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:08:05,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 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 113 [2025-03-16 14:08:05,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:08:05,514 INFO L225 Difference]: With dead ends: 398 [2025-03-16 14:08:05,514 INFO L226 Difference]: Without dead ends: 265 [2025-03-16 14:08:05,514 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-16 14:08:05,515 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 31 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:08:05,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 24 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:08:05,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-03-16 14:08:05,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2025-03-16 14:08:05,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 264 states have (on average 1.4583333333333333) internal successors, (385), 264 states have internal predecessors, (385), 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-16 14:08:05,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 385 transitions. [2025-03-16 14:08:05,539 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 385 transitions. Word has length 113 [2025-03-16 14:08:05,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:08:05,539 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 385 transitions. [2025-03-16 14:08:05,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 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-16 14:08:05,541 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 385 transitions. [2025-03-16 14:08:05,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-16 14:08:05,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:08:05,542 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:08:05,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 14:08:05,543 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:08:05,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:08:05,543 INFO L85 PathProgramCache]: Analyzing trace with hash -2022501031, now seen corresponding path program 1 times [2025-03-16 14:08:05,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:08:05,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750780021] [2025-03-16 14:08:05,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:05,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:08:05,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-16 14:08:05,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-16 14:08:05,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:05,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:05,645 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:08:05,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:08:05,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750780021] [2025-03-16 14:08:05,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750780021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:08:05,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:08:05,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:08:05,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331463645] [2025-03-16 14:08:05,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:08:05,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:08:05,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:08:05,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:08:05,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:08:05,648 INFO L87 Difference]: Start difference. First operand 265 states and 385 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 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-16 14:08:06,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:08:06,007 INFO L93 Difference]: Finished difference Result 791 states and 1152 transitions. [2025-03-16 14:08:06,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:08:06,008 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 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 119 [2025-03-16 14:08:06,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:08:06,010 INFO L225 Difference]: With dead ends: 791 [2025-03-16 14:08:06,010 INFO L226 Difference]: Without dead ends: 527 [2025-03-16 14:08:06,011 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-16 14:08:06,011 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 140 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:08:06,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 37 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:08:06,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2025-03-16 14:08:06,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2025-03-16 14:08:06,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 526 states have (on average 1.3783269961977187) internal successors, (725), 526 states have internal predecessors, (725), 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-16 14:08:06,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 725 transitions. [2025-03-16 14:08:06,030 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 725 transitions. Word has length 119 [2025-03-16 14:08:06,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:08:06,030 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 725 transitions. [2025-03-16 14:08:06,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 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-16 14:08:06,030 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 725 transitions. [2025-03-16 14:08:06,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-16 14:08:06,040 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:08:06,040 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 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-16 14:08:06,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 14:08:06,040 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:08:06,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:08:06,041 INFO L85 PathProgramCache]: Analyzing trace with hash 2066979875, now seen corresponding path program 1 times [2025-03-16 14:08:06,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:08:06,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559594376] [2025-03-16 14:08:06,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:06,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:08:06,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-16 14:08:06,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-16 14:08:06,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:06,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:06,184 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:08:06,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:08:06,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559594376] [2025-03-16 14:08:06,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559594376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:08:06,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:08:06,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:08:06,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555305306] [2025-03-16 14:08:06,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:08:06,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:08:06,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:08:06,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:08:06,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:08:06,187 INFO L87 Difference]: Start difference. First operand 527 states and 725 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 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-16 14:08:06,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:08:06,534 INFO L93 Difference]: Finished difference Result 1577 states and 2172 transitions. [2025-03-16 14:08:06,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:08:06,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 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 134 [2025-03-16 14:08:06,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:08:06,537 INFO L225 Difference]: With dead ends: 1577 [2025-03-16 14:08:06,538 INFO L226 Difference]: Without dead ends: 1051 [2025-03-16 14:08:06,539 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-16 14:08:06,539 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 132 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:08:06,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 36 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:08:06,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2025-03-16 14:08:06,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 1051. [2025-03-16 14:08:06,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1051 states, 1050 states have (on average 1.3095238095238095) internal successors, (1375), 1050 states have internal predecessors, (1375), 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-16 14:08:06,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1375 transitions. [2025-03-16 14:08:06,571 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1375 transitions. Word has length 134 [2025-03-16 14:08:06,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:08:06,571 INFO L471 AbstractCegarLoop]: Abstraction has 1051 states and 1375 transitions. [2025-03-16 14:08:06,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 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-16 14:08:06,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1375 transitions. [2025-03-16 14:08:06,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-16 14:08:06,572 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:08:06,573 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:08:06,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 14:08:06,573 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:08:06,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:08:06,573 INFO L85 PathProgramCache]: Analyzing trace with hash -843802003, now seen corresponding path program 1 times [2025-03-16 14:08:06,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:08:06,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932987638] [2025-03-16 14:08:06,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:06,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:08:06,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-16 14:08:06,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-16 14:08:06,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:06,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:06,664 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 14:08:06,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:08:06,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932987638] [2025-03-16 14:08:06,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932987638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:08:06,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:08:06,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:08:06,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991795900] [2025-03-16 14:08:06,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:08:06,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:08:06,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:08:06,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:08:06,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:08:06,667 INFO L87 Difference]: Start difference. First operand 1051 states and 1375 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 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-16 14:08:07,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:08:07,002 INFO L93 Difference]: Finished difference Result 2494 states and 3287 transitions. [2025-03-16 14:08:07,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:08:07,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 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 147 [2025-03-16 14:08:07,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:08:07,007 INFO L225 Difference]: With dead ends: 2494 [2025-03-16 14:08:07,007 INFO L226 Difference]: Without dead ends: 1444 [2025-03-16 14:08:07,009 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-16 14:08:07,009 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 147 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:08:07,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 29 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:08:07,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2025-03-16 14:08:07,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 1051. [2025-03-16 14:08:07,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1051 states, 1050 states have (on average 1.3047619047619048) internal successors, (1370), 1050 states have internal predecessors, (1370), 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-16 14:08:07,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1370 transitions. [2025-03-16 14:08:07,034 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1370 transitions. Word has length 147 [2025-03-16 14:08:07,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:08:07,034 INFO L471 AbstractCegarLoop]: Abstraction has 1051 states and 1370 transitions. [2025-03-16 14:08:07,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 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-16 14:08:07,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1370 transitions. [2025-03-16 14:08:07,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-16 14:08:07,036 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:08:07,036 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:08:07,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 14:08:07,036 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:08:07,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:08:07,037 INFO L85 PathProgramCache]: Analyzing trace with hash 274494263, now seen corresponding path program 1 times [2025-03-16 14:08:07,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:08:07,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857283856] [2025-03-16 14:08:07,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:07,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:08:07,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-16 14:08:07,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-16 14:08:07,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:07,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:07,192 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-16 14:08:07,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:08:07,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857283856] [2025-03-16 14:08:07,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857283856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:08:07,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:08:07,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:08:07,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273627739] [2025-03-16 14:08:07,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:08:07,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:08:07,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:08:07,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:08:07,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:08:07,193 INFO L87 Difference]: Start difference. First operand 1051 states and 1370 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 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-16 14:08:07,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:08:07,499 INFO L93 Difference]: Finished difference Result 2101 states and 2739 transitions. [2025-03-16 14:08:07,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:08:07,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 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 151 [2025-03-16 14:08:07,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:08:07,503 INFO L225 Difference]: With dead ends: 2101 [2025-03-16 14:08:07,503 INFO L226 Difference]: Without dead ends: 1051 [2025-03-16 14:08:07,504 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-16 14:08:07,505 INFO L435 NwaCegarLoop]: 56 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, 61 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-16 14:08:07,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 61 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:08:07,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2025-03-16 14:08:07,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 1051. [2025-03-16 14:08:07,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1051 states, 1050 states have (on average 1.2933333333333332) internal successors, (1358), 1050 states have internal predecessors, (1358), 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-16 14:08:07,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1358 transitions. [2025-03-16 14:08:07,527 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1358 transitions. Word has length 151 [2025-03-16 14:08:07,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:08:07,528 INFO L471 AbstractCegarLoop]: Abstraction has 1051 states and 1358 transitions. [2025-03-16 14:08:07,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 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-16 14:08:07,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1358 transitions. [2025-03-16 14:08:07,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-16 14:08:07,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:08:07,530 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:08:07,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 14:08:07,530 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:08:07,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:08:07,530 INFO L85 PathProgramCache]: Analyzing trace with hash -591937226, now seen corresponding path program 1 times [2025-03-16 14:08:07,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:08:07,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213703979] [2025-03-16 14:08:07,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:07,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:08:07,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-16 14:08:07,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-16 14:08:07,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:07,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:07,683 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-16 14:08:07,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:08:07,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213703979] [2025-03-16 14:08:07,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213703979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:08:07,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:08:07,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:08:07,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478793369] [2025-03-16 14:08:07,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:08:07,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:08:07,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:08:07,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:08:07,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:08:07,685 INFO L87 Difference]: Start difference. First operand 1051 states and 1358 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 3 states have internal predecessors, (129), 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-16 14:08:08,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:08:08,153 INFO L93 Difference]: Finished difference Result 3018 states and 3842 transitions. [2025-03-16 14:08:08,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:08:08,153 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 3 states have internal predecessors, (129), 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 155 [2025-03-16 14:08:08,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:08:08,158 INFO L225 Difference]: With dead ends: 3018 [2025-03-16 14:08:08,158 INFO L226 Difference]: Without dead ends: 1968 [2025-03-16 14:08:08,160 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-16 14:08:08,160 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 395 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:08:08,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 38 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:08:08,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1968 states. [2025-03-16 14:08:08,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1968 to 1182. [2025-03-16 14:08:08,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1182 states, 1181 states have (on average 1.2658763759525826) internal successors, (1495), 1181 states have internal predecessors, (1495), 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-16 14:08:08,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1495 transitions. [2025-03-16 14:08:08,182 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1495 transitions. Word has length 155 [2025-03-16 14:08:08,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:08:08,182 INFO L471 AbstractCegarLoop]: Abstraction has 1182 states and 1495 transitions. [2025-03-16 14:08:08,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 3 states have internal predecessors, (129), 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-16 14:08:08,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1495 transitions. [2025-03-16 14:08:08,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-16 14:08:08,184 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:08:08,184 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:08:08,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 14:08:08,184 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:08:08,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:08:08,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1782695206, now seen corresponding path program 1 times [2025-03-16 14:08:08,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:08:08,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877567392] [2025-03-16 14:08:08,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:08,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:08:08,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-16 14:08:08,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-16 14:08:08,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:08,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:08,290 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-16 14:08:08,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:08:08,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877567392] [2025-03-16 14:08:08,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877567392] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:08:08,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:08:08,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:08:08,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988128617] [2025-03-16 14:08:08,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:08:08,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:08:08,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:08:08,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:08:08,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:08:08,291 INFO L87 Difference]: Start difference. First operand 1182 states and 1495 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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-16 14:08:08,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:08:08,608 INFO L93 Difference]: Finished difference Result 2887 states and 3621 transitions. [2025-03-16 14:08:08,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:08:08,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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 164 [2025-03-16 14:08:08,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:08:08,613 INFO L225 Difference]: With dead ends: 2887 [2025-03-16 14:08:08,613 INFO L226 Difference]: Without dead ends: 1706 [2025-03-16 14:08:08,614 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-16 14:08:08,615 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 141 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:08:08,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 16 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:08:08,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2025-03-16 14:08:08,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1444. [2025-03-16 14:08:08,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1444 states, 1443 states have (on average 1.2383922383922383) internal successors, (1787), 1443 states have internal predecessors, (1787), 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-16 14:08:08,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 1787 transitions. [2025-03-16 14:08:08,641 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 1787 transitions. Word has length 164 [2025-03-16 14:08:08,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:08:08,642 INFO L471 AbstractCegarLoop]: Abstraction has 1444 states and 1787 transitions. [2025-03-16 14:08:08,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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-16 14:08:08,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 1787 transitions. [2025-03-16 14:08:08,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-16 14:08:08,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:08:08,645 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 14:08:08,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 14:08:08,647 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:08:08,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:08:08,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1342657849, now seen corresponding path program 1 times [2025-03-16 14:08:08,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:08:08,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639789520] [2025-03-16 14:08:08,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:08,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:08:08,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-16 14:08:08,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-16 14:08:08,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:08,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:08,814 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-16 14:08:08,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:08:08,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639789520] [2025-03-16 14:08:08,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639789520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:08:08,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:08:08,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:08:08,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805257063] [2025-03-16 14:08:08,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:08:08,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:08:08,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:08:08,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:08:08,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:08:08,817 INFO L87 Difference]: Start difference. First operand 1444 states and 1787 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 states have internal predecessors, (144), 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-16 14:08:09,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:08:09,112 INFO L93 Difference]: Finished difference Result 3149 states and 3883 transitions. [2025-03-16 14:08:09,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:08:09,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 states have internal predecessors, (144), 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 180 [2025-03-16 14:08:09,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:08:09,117 INFO L225 Difference]: With dead ends: 3149 [2025-03-16 14:08:09,117 INFO L226 Difference]: Without dead ends: 1706 [2025-03-16 14:08:09,118 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-16 14:08:09,119 INFO L435 NwaCegarLoop]: 56 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, 61 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-16 14:08:09,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 61 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:08:09,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2025-03-16 14:08:09,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1706. [2025-03-16 14:08:09,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1706 states, 1705 states have (on average 1.2193548387096773) internal successors, (2079), 1705 states have internal predecessors, (2079), 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-16 14:08:09,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 2079 transitions. [2025-03-16 14:08:09,145 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 2079 transitions. Word has length 180 [2025-03-16 14:08:09,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:08:09,145 INFO L471 AbstractCegarLoop]: Abstraction has 1706 states and 2079 transitions. [2025-03-16 14:08:09,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 states have internal predecessors, (144), 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-16 14:08:09,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 2079 transitions. [2025-03-16 14:08:09,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-16 14:08:09,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:08:09,149 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 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, 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] [2025-03-16 14:08:09,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 14:08:09,149 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:08:09,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:08:09,152 INFO L85 PathProgramCache]: Analyzing trace with hash -7275638, now seen corresponding path program 1 times [2025-03-16 14:08:09,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:08:09,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562406246] [2025-03-16 14:08:09,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:09,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:08:09,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-16 14:08:09,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-16 14:08:09,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:09,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:09,328 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-16 14:08:09,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:08:09,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562406246] [2025-03-16 14:08:09,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562406246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:08:09,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:08:09,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:08:09,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489079789] [2025-03-16 14:08:09,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:08:09,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:08:09,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:08:09,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:08:09,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:08:09,330 INFO L87 Difference]: Start difference. First operand 1706 states and 2079 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 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-16 14:08:09,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:08:09,820 INFO L93 Difference]: Finished difference Result 4328 states and 5231 transitions. [2025-03-16 14:08:09,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:08:09,820 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 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 196 [2025-03-16 14:08:09,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:08:09,828 INFO L225 Difference]: With dead ends: 4328 [2025-03-16 14:08:09,828 INFO L226 Difference]: Without dead ends: 2492 [2025-03-16 14:08:09,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-16 14:08:09,830 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 242 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:08:09,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 36 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:08:09,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2492 states. [2025-03-16 14:08:09,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2492 to 2099. [2025-03-16 14:08:09,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2099 states, 2098 states have (on average 1.190181124880839) internal successors, (2497), 2098 states have internal predecessors, (2497), 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-16 14:08:09,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2099 states to 2099 states and 2497 transitions. [2025-03-16 14:08:09,864 INFO L78 Accepts]: Start accepts. Automaton has 2099 states and 2497 transitions. Word has length 196 [2025-03-16 14:08:09,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:08:09,865 INFO L471 AbstractCegarLoop]: Abstraction has 2099 states and 2497 transitions. [2025-03-16 14:08:09,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 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-16 14:08:09,865 INFO L276 IsEmpty]: Start isEmpty. Operand 2099 states and 2497 transitions. [2025-03-16 14:08:09,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-03-16 14:08:09,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:08:09,868 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 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, 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] [2025-03-16 14:08:09,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 14:08:09,869 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:08:09,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:08:09,870 INFO L85 PathProgramCache]: Analyzing trace with hash 18971854, now seen corresponding path program 1 times [2025-03-16 14:08:09,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:08:09,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65560477] [2025-03-16 14:08:09,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:09,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:08:09,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-16 14:08:09,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-16 14:08:09,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:09,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:10,035 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-16 14:08:10,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:08:10,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65560477] [2025-03-16 14:08:10,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65560477] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:08:10,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:08:10,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:08:10,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600309512] [2025-03-16 14:08:10,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:08:10,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:08:10,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:08:10,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:08:10,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:08:10,037 INFO L87 Difference]: Start difference. First operand 2099 states and 2497 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 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-16 14:08:10,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:08:10,342 INFO L93 Difference]: Finished difference Result 4590 states and 5433 transitions. [2025-03-16 14:08:10,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:08:10,342 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 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 213 [2025-03-16 14:08:10,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:08:10,348 INFO L225 Difference]: With dead ends: 4590 [2025-03-16 14:08:10,348 INFO L226 Difference]: Without dead ends: 2492 [2025-03-16 14:08:10,350 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-16 14:08:10,351 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 94 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:08:10,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 38 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:08:10,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2492 states. [2025-03-16 14:08:10,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2492 to 2230. [2025-03-16 14:08:10,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2230 states, 2229 states have (on average 1.189771197846568) internal successors, (2652), 2229 states have internal predecessors, (2652), 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-16 14:08:10,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2230 states to 2230 states and 2652 transitions. [2025-03-16 14:08:10,380 INFO L78 Accepts]: Start accepts. Automaton has 2230 states and 2652 transitions. Word has length 213 [2025-03-16 14:08:10,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:08:10,380 INFO L471 AbstractCegarLoop]: Abstraction has 2230 states and 2652 transitions. [2025-03-16 14:08:10,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 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-16 14:08:10,380 INFO L276 IsEmpty]: Start isEmpty. Operand 2230 states and 2652 transitions. [2025-03-16 14:08:10,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-03-16 14:08:10,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:08:10,383 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 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] [2025-03-16 14:08:10,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 14:08:10,384 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:08:10,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:08:10,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1614794986, now seen corresponding path program 1 times [2025-03-16 14:08:10,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:08:10,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147373824] [2025-03-16 14:08:10,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:10,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:08:10,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-16 14:08:10,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-16 14:08:10,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:10,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:10,702 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 63 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:08:10,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:08:10,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147373824] [2025-03-16 14:08:10,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147373824] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:08:10,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190357577] [2025-03-16 14:08:10,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:10,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:08:10,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:08:10,706 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:08:10,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 14:08:10,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-16 14:08:10,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-16 14:08:10,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:10,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:10,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:08:10,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:08:10,985 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-16 14:08:10,986 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:08:10,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190357577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:08:10,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:08:10,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-16 14:08:10,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335064698] [2025-03-16 14:08:10,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:08:10,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:08:10,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:08:10,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:08:10,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:08:10,987 INFO L87 Difference]: Start difference. First operand 2230 states and 2652 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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-16 14:08:11,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:08:11,326 INFO L93 Difference]: Finished difference Result 4459 states and 5303 transitions. [2025-03-16 14:08:11,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:08:11,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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 217 [2025-03-16 14:08:11,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:08:11,332 INFO L225 Difference]: With dead ends: 4459 [2025-03-16 14:08:11,332 INFO L226 Difference]: Without dead ends: 2230 [2025-03-16 14:08:11,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:08:11,334 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 23 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:08:11,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 178 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:08:11,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2230 states. [2025-03-16 14:08:11,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2230 to 1706. [2025-03-16 14:08:11,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1706 states, 1705 states have (on average 1.1495601173020529) internal successors, (1960), 1705 states have internal predecessors, (1960), 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-16 14:08:11,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 1960 transitions. [2025-03-16 14:08:11,358 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 1960 transitions. Word has length 217 [2025-03-16 14:08:11,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:08:11,358 INFO L471 AbstractCegarLoop]: Abstraction has 1706 states and 1960 transitions. [2025-03-16 14:08:11,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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-16 14:08:11,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 1960 transitions. [2025-03-16 14:08:11,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2025-03-16 14:08:11,361 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:08:11,361 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 14:08:11,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 14:08:11,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-16 14:08:11,562 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:08:11,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:08:11,563 INFO L85 PathProgramCache]: Analyzing trace with hash 796529722, now seen corresponding path program 1 times [2025-03-16 14:08:11,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:08:11,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278400868] [2025-03-16 14:08:11,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:11,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:08:11,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-03-16 14:08:11,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-03-16 14:08:11,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:11,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:11,744 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2025-03-16 14:08:11,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:08:11,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278400868] [2025-03-16 14:08:11,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278400868] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:08:11,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:08:11,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:08:11,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972642203] [2025-03-16 14:08:11,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:08:11,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:08:11,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:08:11,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:08:11,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:08:11,747 INFO L87 Difference]: Start difference. First operand 1706 states and 1960 transitions. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 3 states have internal predecessors, (150), 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-16 14:08:12,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:08:12,191 INFO L93 Difference]: Finished difference Result 3804 states and 4346 transitions. [2025-03-16 14:08:12,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:08:12,191 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 3 states have internal predecessors, (150), 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 258 [2025-03-16 14:08:12,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:08:12,195 INFO L225 Difference]: With dead ends: 3804 [2025-03-16 14:08:12,196 INFO L226 Difference]: Without dead ends: 2099 [2025-03-16 14:08:12,197 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-16 14:08:12,198 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 254 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:08:12,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 50 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:08:12,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2099 states. [2025-03-16 14:08:12,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2099 to 1837. [2025-03-16 14:08:12,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1837 states, 1836 states have (on average 1.1416122004357299) internal successors, (2096), 1836 states have internal predecessors, (2096), 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-16 14:08:12,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1837 states and 2096 transitions. [2025-03-16 14:08:12,223 INFO L78 Accepts]: Start accepts. Automaton has 1837 states and 2096 transitions. Word has length 258 [2025-03-16 14:08:12,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:08:12,223 INFO L471 AbstractCegarLoop]: Abstraction has 1837 states and 2096 transitions. [2025-03-16 14:08:12,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 3 states have internal predecessors, (150), 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-16 14:08:12,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 2096 transitions. [2025-03-16 14:08:12,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2025-03-16 14:08:12,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:08:12,227 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:08:12,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 14:08:12,228 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:08:12,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:08:12,228 INFO L85 PathProgramCache]: Analyzing trace with hash 2049257486, now seen corresponding path program 1 times [2025-03-16 14:08:12,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:08:12,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951426896] [2025-03-16 14:08:12,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:12,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:08:12,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 284 statements into 1 equivalence classes. [2025-03-16 14:08:12,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 284 of 284 statements. [2025-03-16 14:08:12,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:12,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:12,410 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 188 proven. 112 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-16 14:08:12,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:08:12,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951426896] [2025-03-16 14:08:12,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951426896] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:08:12,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8751441] [2025-03-16 14:08:12,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:12,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:08:12,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:08:12,414 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:08:12,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 14:08:12,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 284 statements into 1 equivalence classes. [2025-03-16 14:08:12,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 284 of 284 statements. [2025-03-16 14:08:12,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:12,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:12,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:08:12,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:08:12,694 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2025-03-16 14:08:12,694 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:08:12,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8751441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:08:12,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:08:12,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 14:08:12,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060177049] [2025-03-16 14:08:12,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:08:12,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:08:12,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:08:12,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:08:12,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:08:12,696 INFO L87 Difference]: Start difference. First operand 1837 states and 2096 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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-16 14:08:12,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:08:12,982 INFO L93 Difference]: Finished difference Result 3671 states and 4190 transitions. [2025-03-16 14:08:12,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:08:12,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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 284 [2025-03-16 14:08:12,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:08:12,984 INFO L225 Difference]: With dead ends: 3671 [2025-03-16 14:08:12,984 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 14:08:12,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:08:12,986 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 25 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:08:12,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 187 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:08:12,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 14:08:12,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 14:08:12,987 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-16 14:08:12,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 14:08:12,987 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 284 [2025-03-16 14:08:12,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:08:12,987 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 14:08:12,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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-16 14:08:12,987 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 14:08:12,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 14:08:12,989 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 14:08:13,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 14:08:13,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-16 14:08:13,192 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:08:13,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 14:08:13,420 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 14:08:13,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 02:08:13 BoogieIcfgContainer [2025-03-16 14:08:13,437 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 14:08:13,437 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 14:08:13,437 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 14:08:13,437 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 14:08:13,437 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:08:04" (3/4) ... [2025-03-16 14:08:13,439 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 14:08:13,450 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-16 14:08:13,451 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 14:08:13,451 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 14:08:13,452 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 14:08:13,540 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 14:08:13,541 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 14:08:13,541 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 14:08:13,541 INFO L158 Benchmark]: Toolchain (without parser) took 10452.33ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 132.8MB in the beginning and 167.1MB in the end (delta: -34.2MB). Peak memory consumption was 92.9MB. Max. memory is 16.1GB. [2025-03-16 14:08:13,541 INFO L158 Benchmark]: CDTParser took 0.73ms. Allocated memory is still 201.3MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:08:13,541 INFO L158 Benchmark]: CACSL2BoogieTranslator took 339.02ms. Allocated memory is still 167.8MB. Free memory was 132.8MB in the beginning and 106.0MB in the end (delta: 26.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 14:08:13,541 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.14ms. Allocated memory is still 167.8MB. Free memory was 106.0MB in the beginning and 100.9MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 14:08:13,542 INFO L158 Benchmark]: Boogie Preprocessor took 61.43ms. Allocated memory is still 167.8MB. Free memory was 100.5MB in the beginning and 96.8MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:08:13,542 INFO L158 Benchmark]: IcfgBuilder took 841.99ms. Allocated memory is still 167.8MB. Free memory was 96.8MB in the beginning and 105.8MB in the end (delta: -9.0MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-03-16 14:08:13,542 INFO L158 Benchmark]: TraceAbstraction took 9049.70ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 104.9MB in the beginning and 180.2MB in the end (delta: -75.2MB). Peak memory consumption was 50.9MB. Max. memory is 16.1GB. [2025-03-16 14:08:13,542 INFO L158 Benchmark]: Witness Printer took 103.59ms. Allocated memory is still 293.6MB. Free memory was 180.2MB in the beginning and 167.1MB in the end (delta: 13.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 14:08:13,543 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.73ms. Allocated memory is still 201.3MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 339.02ms. Allocated memory is still 167.8MB. Free memory was 132.8MB in the beginning and 106.0MB in the end (delta: 26.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.14ms. Allocated memory is still 167.8MB. Free memory was 106.0MB in the beginning and 100.9MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.43ms. Allocated memory is still 167.8MB. Free memory was 100.5MB in the beginning and 96.8MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 841.99ms. Allocated memory is still 167.8MB. Free memory was 96.8MB in the beginning and 105.8MB in the end (delta: -9.0MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * TraceAbstraction took 9049.70ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 104.9MB in the beginning and 180.2MB in the end (delta: -75.2MB). Peak memory consumption was 50.9MB. Max. memory is 16.1GB. * Witness Printer took 103.59ms. Allocated memory is still 293.6MB. Free memory was 180.2MB in the beginning and 167.1MB in the end (delta: 13.1MB). Peak memory consumption was 16.8MB. 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: 528]: 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, 137 locations, 265 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.8s, OverallIterations: 14, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1864 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1864 mSDsluCounter, 994 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 71 mSDsCounter, 739 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4975 IncrementalHoareTripleChecker+Invalid, 5714 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 739 mSolverCounterUnsat, 923 mSDtfsCounter, 4975 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 539 GetRequests, 517 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2230occurred in iteration=11, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 2882 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 2945 NumberOfCodeBlocks, 2945 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 2929 ConstructedInterpolants, 0 QuantifiedInterpolants, 8970 SizeOfPredicates, 0 NumberOfNonLiveVariables, 866 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 16 InterpolantComputations, 14 PerfectInterpolantSequences, 1862/2066 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) && (a17 == 1)) && (a20 == 1)) || (((a21 <= 0) && (a17 <= 0)) && (a20 == 1))) || (((a21 <= 0) && (a17 == 1)) && (a20 == 1))) || ((((a7 != 1) && (a21 == 1)) && (a17 == 1)) && (15 <= a8))) || (((a21 <= 0) && (a17 == 1)) && (a16 <= 5))) || (((a7 != 1) && (a17 <= 0)) && (a21 == 1))) || ((((5 <= a16) && (a7 != 1)) && (a21 == 1)) && (a17 == 1))) || (((a17 <= 0) && (a21 == 1)) && (a16 <= 5))) || (((a17 <= 0) && (a21 == 1)) && (a20 == 1))) RESULT: Ultimate proved your program to be correct! [2025-03-16 14:08:13,566 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