./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label36.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_label36.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 1f02632fff6230a332a62c3e19b9c0e1537cb9f813d08c30374ad65993036a6c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 14:07:40,255 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 14:07:40,316 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 14:07:40,322 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 14:07:40,323 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 14:07:40,345 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 14:07:40,346 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 14:07:40,346 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 14:07:40,347 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 14:07:40,347 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 14:07:40,348 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 14:07:40,348 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 14:07:40,350 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 14:07:40,350 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 14:07:40,350 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 14:07:40,350 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 14:07:40,350 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 14:07:40,350 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 14:07:40,350 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 14:07:40,350 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 14:07:40,350 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 14:07:40,350 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 14:07:40,350 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 14:07:40,350 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 14:07:40,350 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 14:07:40,350 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 14:07:40,350 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 14:07:40,350 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 14:07:40,350 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 14:07:40,351 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 14:07:40,352 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 14:07:40,352 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 14:07:40,352 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:07:40,352 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 14:07:40,352 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 14:07:40,352 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 14:07:40,352 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 14:07:40,352 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 14:07:40,352 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 14:07:40,352 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 14:07:40,352 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 14:07:40,352 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 14:07:40,352 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 14:07:40,353 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 -> 1f02632fff6230a332a62c3e19b9c0e1537cb9f813d08c30374ad65993036a6c [2025-03-16 14:07:40,572 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 14:07:40,579 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 14:07:40,582 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 14:07:40,583 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 14:07:40,583 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 14:07:40,584 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label36.c [2025-03-16 14:07:41,695 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdebecabd/9eb56e6c0a194005a70e96929705ced0/FLAG81bac5ea8 [2025-03-16 14:07:41,994 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 14:07:41,998 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label36.c [2025-03-16 14:07:42,019 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdebecabd/9eb56e6c0a194005a70e96929705ced0/FLAG81bac5ea8 [2025-03-16 14:07:42,256 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdebecabd/9eb56e6c0a194005a70e96929705ced0 [2025-03-16 14:07:42,258 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 14:07:42,259 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 14:07:42,260 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 14:07:42,260 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 14:07:42,263 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 14:07:42,263 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:07:42" (1/1) ... [2025-03-16 14:07:42,264 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e69d2ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:42, skipping insertion in model container [2025-03-16 14:07:42,264 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:07:42" (1/1) ... [2025-03-16 14:07:42,285 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 14:07:42,461 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_label36.c[18233,18246] [2025-03-16 14:07:42,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:07:42,487 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 14:07:42,538 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_label36.c[18233,18246] [2025-03-16 14:07:42,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:07:42,562 INFO L204 MainTranslator]: Completed translation [2025-03-16 14:07:42,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:42 WrapperNode [2025-03-16 14:07:42,563 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 14:07:42,564 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 14:07:42,564 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 14:07:42,565 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 14:07:42,568 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:07:42" (1/1) ... [2025-03-16 14:07:42,580 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:07:42" (1/1) ... [2025-03-16 14:07:42,621 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 655 [2025-03-16 14:07:42,622 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 14:07:42,622 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 14:07:42,622 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 14:07:42,622 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 14:07:42,628 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:42" (1/1) ... [2025-03-16 14:07:42,628 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:42" (1/1) ... [2025-03-16 14:07:42,631 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:42" (1/1) ... [2025-03-16 14:07:42,648 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:07:42,655 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:42" (1/1) ... [2025-03-16 14:07:42,655 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:42" (1/1) ... [2025-03-16 14:07:42,668 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:42" (1/1) ... [2025-03-16 14:07:42,674 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:42" (1/1) ... [2025-03-16 14:07:42,676 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:42" (1/1) ... [2025-03-16 14:07:42,681 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:42" (1/1) ... [2025-03-16 14:07:42,685 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 14:07:42,687 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 14:07:42,687 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 14:07:42,687 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 14:07:42,689 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:42" (1/1) ... [2025-03-16 14:07:42,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:07:42,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:07:42,713 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:07:42,715 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:07:42,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 14:07:42,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 14:07:42,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 14:07:42,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 14:07:42,785 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 14:07:42,786 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 14:07:43,455 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2025-03-16 14:07:43,455 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 14:07:43,463 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 14:07:43,465 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 14:07:43,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:07:43 BoogieIcfgContainer [2025-03-16 14:07:43,466 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 14:07:43,468 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 14:07:43,468 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 14:07:43,472 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 14:07:43,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:07:42" (1/3) ... [2025-03-16 14:07:43,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40236eb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:07:43, skipping insertion in model container [2025-03-16 14:07:43,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:42" (2/3) ... [2025-03-16 14:07:43,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40236eb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:07:43, skipping insertion in model container [2025-03-16 14:07:43,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:07:43" (3/3) ... [2025-03-16 14:07:43,474 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem01_label36.c [2025-03-16 14:07:43,486 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 14:07:43,488 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem01_label36.c that has 1 procedures, 137 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 14:07:43,536 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 14:07:43,545 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;@f8b9e1f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 14:07:43,546 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 14:07:43,549 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:07:43,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 14:07:43,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:07:43,555 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] [2025-03-16 14:07:43,555 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:07:43,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:07:43,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1541574293, now seen corresponding path program 1 times [2025-03-16 14:07:43,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:07:43,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741252580] [2025-03-16 14:07:43,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:43,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:07:43,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 14:07:43,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 14:07:43,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:43,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:43,875 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:07:43,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:07:43,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741252580] [2025-03-16 14:07:43,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741252580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:07:43,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:07:43,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:07:43,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044442028] [2025-03-16 14:07:43,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:07:43,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 14:07:43,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:07:43,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 14:07:43,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:07:43,902 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 50.5) internal successors, (101), 2 states have internal predecessors, (101), 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:07:43,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:07:43,925 INFO L93 Difference]: Finished difference Result 273 states and 529 transitions. [2025-03-16 14:07:43,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 14:07:43,926 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 50.5) internal successors, (101), 2 states have internal predecessors, (101), 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 101 [2025-03-16 14:07:43,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:07:43,934 INFO L225 Difference]: With dead ends: 273 [2025-03-16 14:07:43,934 INFO L226 Difference]: Without dead ends: 134 [2025-03-16 14:07:43,937 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:07:43,939 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:07:43,941 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:07:43,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-16 14:07:43,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2025-03-16 14:07:43,963 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:07:43,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 200 transitions. [2025-03-16 14:07:43,967 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 200 transitions. Word has length 101 [2025-03-16 14:07:43,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:07:43,968 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 200 transitions. [2025-03-16 14:07:43,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 50.5) internal successors, (101), 2 states have internal predecessors, (101), 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:07:43,968 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 200 transitions. [2025-03-16 14:07:43,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 14:07:43,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:07:43,970 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] [2025-03-16 14:07:43,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 14:07:43,971 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:07:43,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:07:43,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1900694709, now seen corresponding path program 1 times [2025-03-16 14:07:43,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:07:43,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671919234] [2025-03-16 14:07:43,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:43,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:07:43,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 14:07:44,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 14:07:44,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:44,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:44,221 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:07:44,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:07:44,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671919234] [2025-03-16 14:07:44,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671919234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:07:44,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:07:44,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:07:44,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170260980] [2025-03-16 14:07:44,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:07:44,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:07:44,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:07:44,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:07:44,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:07:44,224 INFO L87 Difference]: Start difference. First operand 134 states and 200 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 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:07:44,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:07:44,630 INFO L93 Difference]: Finished difference Result 398 states and 597 transitions. [2025-03-16 14:07:44,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:07:44,630 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 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 101 [2025-03-16 14:07:44,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:07:44,632 INFO L225 Difference]: With dead ends: 398 [2025-03-16 14:07:44,632 INFO L226 Difference]: Without dead ends: 265 [2025-03-16 14:07:44,632 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:07:44,633 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 54 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:07:44,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 30 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:07:44,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-03-16 14:07:44,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2025-03-16 14:07:44,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 264 states have (on average 1.4356060606060606) internal successors, (379), 264 states have internal predecessors, (379), 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:07:44,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 379 transitions. [2025-03-16 14:07:44,644 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 379 transitions. Word has length 101 [2025-03-16 14:07:44,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:07:44,644 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 379 transitions. [2025-03-16 14:07:44,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 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:07:44,644 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 379 transitions. [2025-03-16 14:07:44,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-16 14:07:44,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:07:44,646 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] [2025-03-16 14:07:44,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 14:07:44,646 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:07:44,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:07:44,646 INFO L85 PathProgramCache]: Analyzing trace with hash -2012435419, now seen corresponding path program 1 times [2025-03-16 14:07:44,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:07:44,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894093595] [2025-03-16 14:07:44,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:44,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:07:44,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-16 14:07:44,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-16 14:07:44,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:44,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:44,724 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:07:44,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:07:44,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894093595] [2025-03-16 14:07:44,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894093595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:07:44,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:07:44,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:07:44,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057486924] [2025-03-16 14:07:44,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:07:44,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:07:44,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:07:44,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:07:44,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:07:44,726 INFO L87 Difference]: Start difference. First operand 265 states and 379 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 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:07:45,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:07:45,090 INFO L93 Difference]: Finished difference Result 791 states and 1134 transitions. [2025-03-16 14:07:45,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:07:45,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 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 107 [2025-03-16 14:07:45,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:07:45,092 INFO L225 Difference]: With dead ends: 791 [2025-03-16 14:07:45,093 INFO L226 Difference]: Without dead ends: 527 [2025-03-16 14:07:45,093 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:07:45,094 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 142 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 35 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:07:45,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 35 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:07:45,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2025-03-16 14:07:45,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2025-03-16 14:07:45,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 526 states have (on average 1.3460076045627376) internal successors, (708), 526 states have internal predecessors, (708), 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:07:45,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 708 transitions. [2025-03-16 14:07:45,122 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 708 transitions. Word has length 107 [2025-03-16 14:07:45,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:07:45,122 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 708 transitions. [2025-03-16 14:07:45,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 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:07:45,123 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 708 transitions. [2025-03-16 14:07:45,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-16 14:07:45,124 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:07:45,124 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:07:45,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 14:07:45,125 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:07:45,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:07:45,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1248040274, now seen corresponding path program 1 times [2025-03-16 14:07:45,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:07:45,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199635399] [2025-03-16 14:07:45,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:45,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:07:45,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-16 14:07:45,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-16 14:07:45,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:45,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:45,432 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:07:45,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:07:45,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199635399] [2025-03-16 14:07:45,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199635399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:07:45,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:07:45,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:07:45,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785474376] [2025-03-16 14:07:45,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:07:45,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:07:45,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:07:45,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:07:45,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:07:45,434 INFO L87 Difference]: Start difference. First operand 527 states and 708 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 3 states have internal predecessors, (108), 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:07:45,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:07:45,965 INFO L93 Difference]: Finished difference Result 1410 states and 1881 transitions. [2025-03-16 14:07:45,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:07:45,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 3 states have internal predecessors, (108), 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 108 [2025-03-16 14:07:45,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:07:45,969 INFO L225 Difference]: With dead ends: 1410 [2025-03-16 14:07:45,969 INFO L226 Difference]: Without dead ends: 789 [2025-03-16 14:07:45,970 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:07:45,970 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 130 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:07:45,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 78 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:07:45,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2025-03-16 14:07:45,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 789. [2025-03-16 14:07:45,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.1637055837563453) internal successors, (917), 788 states have internal predecessors, (917), 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:07:45,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 917 transitions. [2025-03-16 14:07:45,991 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 917 transitions. Word has length 108 [2025-03-16 14:07:45,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:07:45,991 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 917 transitions. [2025-03-16 14:07:45,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 3 states have internal predecessors, (108), 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:07:45,992 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 917 transitions. [2025-03-16 14:07:45,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-16 14:07:45,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:07:45,994 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:07:45,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 14:07:45,994 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:07:45,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:07:45,995 INFO L85 PathProgramCache]: Analyzing trace with hash 194214399, now seen corresponding path program 1 times [2025-03-16 14:07:45,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:07:45,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395734320] [2025-03-16 14:07:45,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:45,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:07:46,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-16 14:07:46,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-16 14:07:46,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:46,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:46,115 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 14:07:46,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:07:46,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395734320] [2025-03-16 14:07:46,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395734320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:07:46,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:07:46,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:07:46,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564766557] [2025-03-16 14:07:46,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:07:46,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:07:46,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:07:46,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:07:46,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:07:46,120 INFO L87 Difference]: Start difference. First operand 789 states and 917 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 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:07:46,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:07:46,391 INFO L93 Difference]: Finished difference Result 1577 states and 1858 transitions. [2025-03-16 14:07:46,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:07:46,391 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 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:07:46,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:07:46,394 INFO L225 Difference]: With dead ends: 1577 [2025-03-16 14:07:46,394 INFO L226 Difference]: Without dead ends: 920 [2025-03-16 14:07:46,395 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:07:46,397 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 129 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:07:46,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 44 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:07:46,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2025-03-16 14:07:46,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 920. [2025-03-16 14:07:46,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 919 states have (on average 1.1534276387377584) internal successors, (1060), 919 states have internal predecessors, (1060), 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:07:46,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1060 transitions. [2025-03-16 14:07:46,415 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1060 transitions. Word has length 113 [2025-03-16 14:07:46,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:07:46,415 INFO L471 AbstractCegarLoop]: Abstraction has 920 states and 1060 transitions. [2025-03-16 14:07:46,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 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:07:46,416 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1060 transitions. [2025-03-16 14:07:46,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 14:07:46,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:07:46,418 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:46,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 14:07:46,419 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:07:46,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:07:46,419 INFO L85 PathProgramCache]: Analyzing trace with hash -506036061, now seen corresponding path program 1 times [2025-03-16 14:07:46,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:07:46,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957357710] [2025-03-16 14:07:46,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:46,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:07:46,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 14:07:46,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 14:07:46,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:46,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:46,501 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 14:07:46,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:07:46,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957357710] [2025-03-16 14:07:46,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957357710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:07:46,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:07:46,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:07:46,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391396694] [2025-03-16 14:07:46,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:07:46,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:07:46,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:07:46,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:07:46,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:07:46,504 INFO L87 Difference]: Start difference. First operand 920 states and 1060 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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:07:46,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:07:46,798 INFO L93 Difference]: Finished difference Result 2363 states and 2731 transitions. [2025-03-16 14:07:46,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:07:46,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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 122 [2025-03-16 14:07:46,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:07:46,803 INFO L225 Difference]: With dead ends: 2363 [2025-03-16 14:07:46,804 INFO L226 Difference]: Without dead ends: 1575 [2025-03-16 14:07:46,805 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:07:46,806 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 134 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:07:46,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 18 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:07:46,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2025-03-16 14:07:46,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1182. [2025-03-16 14:07:46,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1182 states, 1181 states have (on average 1.1507197290431836) internal successors, (1359), 1181 states have internal predecessors, (1359), 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:07:46,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1359 transitions. [2025-03-16 14:07:46,827 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1359 transitions. Word has length 122 [2025-03-16 14:07:46,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:07:46,827 INFO L471 AbstractCegarLoop]: Abstraction has 1182 states and 1359 transitions. [2025-03-16 14:07:46,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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:07:46,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1359 transitions. [2025-03-16 14:07:46,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-16 14:07:46,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:07:46,830 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:07:46,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 14:07:46,830 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:07:46,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:07:46,831 INFO L85 PathProgramCache]: Analyzing trace with hash 317929108, now seen corresponding path program 1 times [2025-03-16 14:07:46,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:07:46,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051593129] [2025-03-16 14:07:46,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:46,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:07:46,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-16 14:07:46,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-16 14:07:46,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:46,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:46,953 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 14:07:46,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:07:46,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051593129] [2025-03-16 14:07:46,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051593129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:07:46,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:07:46,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:07:46,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388993032] [2025-03-16 14:07:46,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:07:46,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:07:46,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:07:46,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:07:46,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:07:46,956 INFO L87 Difference]: Start difference. First operand 1182 states and 1359 transitions. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 3 states have internal predecessors, (126), 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:07:47,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:07:47,393 INFO L93 Difference]: Finished difference Result 2494 states and 2924 transitions. [2025-03-16 14:07:47,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:07:47,393 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 3 states have internal predecessors, (126), 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 128 [2025-03-16 14:07:47,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:07:47,397 INFO L225 Difference]: With dead ends: 2494 [2025-03-16 14:07:47,397 INFO L226 Difference]: Without dead ends: 1444 [2025-03-16 14:07:47,398 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:07:47,399 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 261 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:07:47,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 33 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:07:47,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2025-03-16 14:07:47,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 1444. [2025-03-16 14:07:47,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1444 states, 1443 states have (on average 1.1448371448371448) internal successors, (1652), 1443 states have internal predecessors, (1652), 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:07:47,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 1652 transitions. [2025-03-16 14:07:47,424 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 1652 transitions. Word has length 128 [2025-03-16 14:07:47,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:07:47,425 INFO L471 AbstractCegarLoop]: Abstraction has 1444 states and 1652 transitions. [2025-03-16 14:07:47,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 3 states have internal predecessors, (126), 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:07:47,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 1652 transitions. [2025-03-16 14:07:47,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-16 14:07:47,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:07:47,427 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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] [2025-03-16 14:07:47,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 14:07:47,428 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:07:47,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:07:47,428 INFO L85 PathProgramCache]: Analyzing trace with hash -49719183, now seen corresponding path program 1 times [2025-03-16 14:07:47,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:07:47,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260671005] [2025-03-16 14:07:47,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:47,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:07:47,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-16 14:07:47,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-16 14:07:47,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:47,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:47,575 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 14:07:47,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:07:47,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260671005] [2025-03-16 14:07:47,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260671005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:07:47,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:07:47,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:07:47,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555263462] [2025-03-16 14:07:47,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:07:47,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:07:47,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:07:47,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:07:47,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:07:47,576 INFO L87 Difference]: Start difference. First operand 1444 states and 1652 transitions. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 3 states have internal predecessors, (135), 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:07:48,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:07:48,026 INFO L93 Difference]: Finished difference Result 3280 states and 3774 transitions. [2025-03-16 14:07:48,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:07:48,026 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 3 states have internal predecessors, (135), 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 142 [2025-03-16 14:07:48,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:07:48,032 INFO L225 Difference]: With dead ends: 3280 [2025-03-16 14:07:48,032 INFO L226 Difference]: Without dead ends: 1968 [2025-03-16 14:07:48,034 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:07:48,034 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 346 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:07:48,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 41 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:07:48,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1968 states. [2025-03-16 14:07:48,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1968 to 1837. [2025-03-16 14:07:48,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1837 states, 1836 states have (on average 1.136165577342048) internal successors, (2086), 1836 states have internal predecessors, (2086), 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:07:48,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1837 states and 2086 transitions. [2025-03-16 14:07:48,069 INFO L78 Accepts]: Start accepts. Automaton has 1837 states and 2086 transitions. Word has length 142 [2025-03-16 14:07:48,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:07:48,070 INFO L471 AbstractCegarLoop]: Abstraction has 1837 states and 2086 transitions. [2025-03-16 14:07:48,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 3 states have internal predecessors, (135), 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:07:48,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 2086 transitions. [2025-03-16 14:07:48,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-16 14:07:48,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:07:48,073 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 14:07:48,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 14:07:48,073 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:07:48,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:07:48,074 INFO L85 PathProgramCache]: Analyzing trace with hash 326120629, now seen corresponding path program 1 times [2025-03-16 14:07:48,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:07:48,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830313229] [2025-03-16 14:07:48,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:48,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:07:48,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-16 14:07:48,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-16 14:07:48,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:48,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:48,259 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:07:48,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:07:48,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830313229] [2025-03-16 14:07:48,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830313229] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:07:48,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719846986] [2025-03-16 14:07:48,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:48,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:07:48,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:07:48,263 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:07:48,264 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:07:48,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-16 14:07:48,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-16 14:07:48,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:48,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:48,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:07:48,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:07:48,464 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-16 14:07:48,464 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:07:48,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719846986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:07:48,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:07:48,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 14:07:48,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311603421] [2025-03-16 14:07:48,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:07:48,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:07:48,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:07:48,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:07:48,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:07:48,465 INFO L87 Difference]: Start difference. First operand 1837 states and 2086 transitions. Second operand has 3 states, 3 states have (on average 50.0) 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:07:48,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:07:48,766 INFO L93 Difference]: Finished difference Result 4328 states and 4932 transitions. [2025-03-16 14:07:48,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:07:48,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) 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 159 [2025-03-16 14:07:48,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:07:48,772 INFO L225 Difference]: With dead ends: 4328 [2025-03-16 14:07:48,773 INFO L226 Difference]: Without dead ends: 2492 [2025-03-16 14:07:48,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:07:48,775 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 32 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:07:48,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 183 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:07:48,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2492 states. [2025-03-16 14:07:48,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2492 to 2099. [2025-03-16 14:07:48,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2099 states, 2098 states have (on average 1.1091515729265968) internal successors, (2327), 2098 states have internal predecessors, (2327), 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:07:48,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2099 states to 2099 states and 2327 transitions. [2025-03-16 14:07:48,827 INFO L78 Accepts]: Start accepts. Automaton has 2099 states and 2327 transitions. Word has length 159 [2025-03-16 14:07:48,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:07:48,827 INFO L471 AbstractCegarLoop]: Abstraction has 2099 states and 2327 transitions. [2025-03-16 14:07:48,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) 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:07:48,828 INFO L276 IsEmpty]: Start isEmpty. Operand 2099 states and 2327 transitions. [2025-03-16 14:07:48,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-16 14:07:48,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:07:48,830 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, 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] [2025-03-16 14:07:48,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 14:07:49,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:07:49,032 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:07:49,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:07:49,032 INFO L85 PathProgramCache]: Analyzing trace with hash -111973325, now seen corresponding path program 1 times [2025-03-16 14:07:49,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:07:49,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010793508] [2025-03-16 14:07:49,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:49,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:07:49,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-16 14:07:49,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-16 14:07:49,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:49,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:49,133 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-16 14:07:49,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:07:49,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010793508] [2025-03-16 14:07:49,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010793508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:07:49,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:07:49,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:07:49,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554386839] [2025-03-16 14:07:49,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:07:49,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:07:49,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:07:49,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:07:49,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:07:49,134 INFO L87 Difference]: Start difference. First operand 2099 states and 2327 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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:07:49,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:07:49,427 INFO L93 Difference]: Finished difference Result 4590 states and 5118 transitions. [2025-03-16 14:07:49,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:07:49,427 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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 162 [2025-03-16 14:07:49,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:07:49,433 INFO L225 Difference]: With dead ends: 4590 [2025-03-16 14:07:49,433 INFO L226 Difference]: Without dead ends: 2623 [2025-03-16 14:07:49,435 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:07:49,435 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 93 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:07:49,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 39 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:07:49,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2623 states. [2025-03-16 14:07:49,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2623 to 2492. [2025-03-16 14:07:49,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2492 states, 2491 states have (on average 1.1128061019670814) internal successors, (2772), 2491 states have internal predecessors, (2772), 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:07:49,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2492 states to 2492 states and 2772 transitions. [2025-03-16 14:07:49,469 INFO L78 Accepts]: Start accepts. Automaton has 2492 states and 2772 transitions. Word has length 162 [2025-03-16 14:07:49,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:07:49,469 INFO L471 AbstractCegarLoop]: Abstraction has 2492 states and 2772 transitions. [2025-03-16 14:07:49,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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:07:49,470 INFO L276 IsEmpty]: Start isEmpty. Operand 2492 states and 2772 transitions. [2025-03-16 14:07:49,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-16 14:07:49,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:07:49,472 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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, 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] [2025-03-16 14:07:49,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 14:07:49,473 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:07:49,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:07:49,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1400276077, now seen corresponding path program 1 times [2025-03-16 14:07:49,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:07:49,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895907539] [2025-03-16 14:07:49,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:49,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:07:49,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-16 14:07:49,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-16 14:07:49,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:49,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:49,717 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-16 14:07:49,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:07:49,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895907539] [2025-03-16 14:07:49,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895907539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:07:49,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:07:49,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 14:07:49,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542262448] [2025-03-16 14:07:49,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:07:49,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 14:07:49,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:07:49,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 14:07:49,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:07:49,718 INFO L87 Difference]: Start difference. First operand 2492 states and 2772 transitions. Second operand has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 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:07:50,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:07:50,129 INFO L93 Difference]: Finished difference Result 4993 states and 5558 transitions. [2025-03-16 14:07:50,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:07:50,129 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 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 205 [2025-03-16 14:07:50,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:07:50,137 INFO L225 Difference]: With dead ends: 4993 [2025-03-16 14:07:50,137 INFO L226 Difference]: Without dead ends: 2633 [2025-03-16 14:07:50,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:07:50,139 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 133 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:07:50,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 181 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:07:50,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2633 states. [2025-03-16 14:07:50,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2633 to 2492. [2025-03-16 14:07:50,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2492 states, 2491 states have (on average 1.1035728623042955) internal successors, (2749), 2491 states have internal predecessors, (2749), 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:07:50,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2492 states to 2492 states and 2749 transitions. [2025-03-16 14:07:50,188 INFO L78 Accepts]: Start accepts. Automaton has 2492 states and 2749 transitions. Word has length 205 [2025-03-16 14:07:50,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:07:50,188 INFO L471 AbstractCegarLoop]: Abstraction has 2492 states and 2749 transitions. [2025-03-16 14:07:50,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 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:07:50,188 INFO L276 IsEmpty]: Start isEmpty. Operand 2492 states and 2749 transitions. [2025-03-16 14:07:50,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-16 14:07:50,191 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:07:50,192 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 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, 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:07:50,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 14:07:50,192 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:07:50,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:07:50,192 INFO L85 PathProgramCache]: Analyzing trace with hash -495597100, now seen corresponding path program 1 times [2025-03-16 14:07:50,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:07:50,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829406739] [2025-03-16 14:07:50,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:50,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:07:50,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-16 14:07:50,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-16 14:07:50,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:50,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:50,288 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-16 14:07:50,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:07:50,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829406739] [2025-03-16 14:07:50,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829406739] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:07:50,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:07:50,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:07:50,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033253640] [2025-03-16 14:07:50,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:07:50,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:07:50,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:07:50,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:07:50,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:07:50,290 INFO L87 Difference]: Start difference. First operand 2492 states and 2749 transitions. Second operand has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 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:07:50,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:07:50,562 INFO L93 Difference]: Finished difference Result 5114 states and 5648 transitions. [2025-03-16 14:07:50,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:07:50,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 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 218 [2025-03-16 14:07:50,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:07:50,569 INFO L225 Difference]: With dead ends: 5114 [2025-03-16 14:07:50,569 INFO L226 Difference]: Without dead ends: 2623 [2025-03-16 14:07:50,572 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:07:50,573 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 96 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:07:50,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 167 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 14:07:50,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2623 states. [2025-03-16 14:07:50,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2623 to 2361. [2025-03-16 14:07:50,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2361 states, 2360 states have (on average 1.0868644067796611) internal successors, (2565), 2360 states have internal predecessors, (2565), 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:07:50,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2361 states to 2361 states and 2565 transitions. [2025-03-16 14:07:50,607 INFO L78 Accepts]: Start accepts. Automaton has 2361 states and 2565 transitions. Word has length 218 [2025-03-16 14:07:50,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:07:50,608 INFO L471 AbstractCegarLoop]: Abstraction has 2361 states and 2565 transitions. [2025-03-16 14:07:50,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 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:07:50,608 INFO L276 IsEmpty]: Start isEmpty. Operand 2361 states and 2565 transitions. [2025-03-16 14:07:50,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-16 14:07:50,611 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:07:50,612 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 14:07:50,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 14:07:50,612 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:07:50,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:07:50,612 INFO L85 PathProgramCache]: Analyzing trace with hash -62837180, now seen corresponding path program 1 times [2025-03-16 14:07:50,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:07:50,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574482276] [2025-03-16 14:07:50,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:50,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:07:50,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-16 14:07:50,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-16 14:07:50,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:50,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:50,797 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 124 proven. 67 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-16 14:07:50,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:07:50,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574482276] [2025-03-16 14:07:50,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574482276] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:07:50,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782150775] [2025-03-16 14:07:50,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:50,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:07:50,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:07:50,800 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:07:50,801 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:07:50,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-16 14:07:50,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-16 14:07:50,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:50,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:50,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:07:50,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:07:51,004 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2025-03-16 14:07:51,005 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:07:51,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782150775] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:07:51,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:07:51,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 14:07:51,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177826919] [2025-03-16 14:07:51,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:07:51,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:07:51,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:07:51,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:07:51,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:07:51,006 INFO L87 Difference]: Start difference. First operand 2361 states and 2565 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 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:07:51,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:07:51,276 INFO L93 Difference]: Finished difference Result 4721 states and 5129 transitions. [2025-03-16 14:07:51,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:07:51,277 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 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 227 [2025-03-16 14:07:51,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:07:51,282 INFO L225 Difference]: With dead ends: 4721 [2025-03-16 14:07:51,283 INFO L226 Difference]: Without dead ends: 2361 [2025-03-16 14:07:51,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 228 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:07:51,285 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 38 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:07:51,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 170 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 14:07:51,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2361 states. [2025-03-16 14:07:51,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2361 to 2099. [2025-03-16 14:07:51,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2099 states, 2098 states have (on average 1.071020019065777) internal successors, (2247), 2098 states have internal predecessors, (2247), 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:07:51,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2099 states to 2099 states and 2247 transitions. [2025-03-16 14:07:51,314 INFO L78 Accepts]: Start accepts. Automaton has 2099 states and 2247 transitions. Word has length 227 [2025-03-16 14:07:51,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:07:51,314 INFO L471 AbstractCegarLoop]: Abstraction has 2099 states and 2247 transitions. [2025-03-16 14:07:51,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 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:07:51,314 INFO L276 IsEmpty]: Start isEmpty. Operand 2099 states and 2247 transitions. [2025-03-16 14:07:51,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2025-03-16 14:07:51,317 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:07:51,318 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:07:51,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 14:07:51,518 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,SelfDestructingSolverStorable12 [2025-03-16 14:07:51,519 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:07:51,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:07:51,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1936239981, now seen corresponding path program 1 times [2025-03-16 14:07:51,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:07:51,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080635114] [2025-03-16 14:07:51,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:51,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:07:51,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-03-16 14:07:51,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-03-16 14:07:51,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:51,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:51,875 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 143 proven. 86 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-16 14:07:51,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:07:51,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080635114] [2025-03-16 14:07:51,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080635114] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:07:51,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212697764] [2025-03-16 14:07:51,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:51,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:07:51,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:07:51,879 INFO L229 MonitoredProcess]: Starting monitored process 4 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:07:51,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 14:07:51,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-03-16 14:07:51,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-03-16 14:07:51,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:51,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:51,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:07:51,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:07:52,096 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2025-03-16 14:07:52,096 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:07:52,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212697764] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:07:52,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:07:52,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 14:07:52,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208703541] [2025-03-16 14:07:52,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:07:52,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:07:52,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:07:52,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:07:52,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:07:52,098 INFO L87 Difference]: Start difference. First operand 2099 states and 2247 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 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:07:52,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:07:52,390 INFO L93 Difference]: Finished difference Result 4326 states and 4639 transitions. [2025-03-16 14:07:52,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:07:52,391 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 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 246 [2025-03-16 14:07:52,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:07:52,391 INFO L225 Difference]: With dead ends: 4326 [2025-03-16 14:07:52,392 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 14:07:52,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:07:52,395 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 36 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:07:52,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 159 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:07:52,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 14:07:52,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 14:07:52,396 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:07:52,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 14:07:52,396 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 246 [2025-03-16 14:07:52,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:07:52,396 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 14:07:52,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 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:07:52,397 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 14:07:52,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 14:07:52,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 14:07:52,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 14:07:52,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:07:52,602 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:07:52,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 14:07:52,864 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 14:07:52,879 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 02:07:52 BoogieIcfgContainer [2025-03-16 14:07:52,879 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 14:07:52,879 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 14:07:52,880 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 14:07:52,880 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 14:07:52,880 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:07:43" (3/4) ... [2025-03-16 14:07:52,882 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 14:07:52,897 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-16 14:07:52,898 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 14:07:52,898 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 14:07:52,899 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 14:07:52,996 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 14:07:52,996 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 14:07:52,996 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 14:07:52,997 INFO L158 Benchmark]: Toolchain (without parser) took 10737.87ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 112.3MB in the beginning and 179.9MB in the end (delta: -67.6MB). Peak memory consumption was 114.6MB. Max. memory is 16.1GB. [2025-03-16 14:07:52,997 INFO L158 Benchmark]: CDTParser took 0.99ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:07:52,997 INFO L158 Benchmark]: CACSL2BoogieTranslator took 304.25ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 84.8MB in the end (delta: 27.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 14:07:52,997 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.41ms. Allocated memory is still 142.6MB. Free memory was 84.8MB in the beginning and 79.5MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 14:07:52,997 INFO L158 Benchmark]: Boogie Preprocessor took 63.47ms. Allocated memory is still 142.6MB. Free memory was 79.5MB in the beginning and 75.4MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:07:52,998 INFO L158 Benchmark]: IcfgBuilder took 779.01ms. Allocated memory is still 142.6MB. Free memory was 75.4MB in the beginning and 68.0MB in the end (delta: 7.4MB). Peak memory consumption was 50.0MB. Max. memory is 16.1GB. [2025-03-16 14:07:52,998 INFO L158 Benchmark]: TraceAbstraction took 9410.84ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 67.3MB in the beginning and 191.8MB in the end (delta: -124.5MB). Peak memory consumption was 64.5MB. Max. memory is 16.1GB. [2025-03-16 14:07:52,998 INFO L158 Benchmark]: Witness Printer took 116.73ms. Allocated memory is still 327.2MB. Free memory was 191.8MB in the beginning and 179.9MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 14:07:53,001 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.99ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 304.25ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 84.8MB in the end (delta: 27.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.41ms. Allocated memory is still 142.6MB. Free memory was 84.8MB in the beginning and 79.5MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.47ms. Allocated memory is still 142.6MB. Free memory was 79.5MB in the beginning and 75.4MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 779.01ms. Allocated memory is still 142.6MB. Free memory was 75.4MB in the beginning and 68.0MB in the end (delta: 7.4MB). Peak memory consumption was 50.0MB. Max. memory is 16.1GB. * TraceAbstraction took 9410.84ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 67.3MB in the beginning and 191.8MB in the end (delta: -124.5MB). Peak memory consumption was 64.5MB. Max. memory is 16.1GB. * Witness Printer took 116.73ms. Allocated memory is still 327.2MB. Free memory was 191.8MB in the beginning and 179.9MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 492]: 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: 9.1s, OverallIterations: 14, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1624 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1624 mSDsluCounter, 1381 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 74 mSDsCounter, 663 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4925 IncrementalHoareTripleChecker+Invalid, 5588 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 663 mSolverCounterUnsat, 1307 mSDtfsCounter, 4925 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 674 GetRequests, 649 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2492occurred in iteration=10, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 1713 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 2771 NumberOfCodeBlocks, 2771 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 2754 ConstructedInterpolants, 0 QuantifiedInterpolants, 9819 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1155 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 17 InterpolantComputations, 14 PerfectInterpolantSequences, 1606/1767 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 <= 0) && (a16 <= 4)) && (a20 == 1)) || (((a21 <= 0) && (a17 == 1)) && (a16 <= 4))) || (((a21 <= 0) && (a17 == 1)) && (a20 == 1))) || ((((((a20 != 1) && (5 == a16)) && (a7 != 1)) && (a21 == 1)) && (a17 == 1)) && (15 <= a8))) || (((((a20 != 1) && (a16 == 6)) && (a21 == 1)) && (a17 == 1)) && (15 <= a8))) || ((((a16 == 6) && (a17 <= 0)) && (a21 == 1)) && (15 <= a8))) || (((a16 == 6) && (a21 <= 0)) && (a20 == 1))) || ((((((a12 == 8) && (5 == a16)) && (a7 != 1)) && (a21 == 1)) && (a17 == 1)) && (15 <= a8))) || (((((a12 == 8) && (a16 == 6)) && (a21 == 1)) && (a17 == 1)) && (a20 == 1))) || (((a17 <= 0) && (a21 == 1)) && (a16 <= 5))) || (((a17 <= 0) && (a21 == 1)) && (a20 == 1))) || (((((a12 == 8) && (a21 == 1)) && (a17 == 1)) && (a16 <= 4)) && (a20 == 1))) || ((((((a20 != 1) && (a7 != 1)) && (a21 == 1)) && (a17 == 1)) && (a16 <= 4)) && (15 <= a8))) RESULT: Ultimate proved your program to be correct! [2025-03-16 14:07:53,015 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