./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-36.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-36.i -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 eac3468c0f4088651ddf076a06043d0b9c6e6e24604d04dedd9321326c1496b7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 10:18:48,450 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 10:18:48,540 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 10:18:48,547 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 10:18:48,549 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 10:18:48,582 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 10:18:48,584 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 10:18:48,585 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 10:18:48,586 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 10:18:48,587 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 10:18:48,588 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 10:18:48,588 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 10:18:48,589 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 10:18:48,589 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 10:18:48,591 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 10:18:48,592 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 10:18:48,592 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 10:18:48,592 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 10:18:48,593 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 10:18:48,593 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 10:18:48,593 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 10:18:48,596 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 10:18:48,597 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 10:18:48,597 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 10:18:48,597 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 10:18:48,598 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 10:18:48,598 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 10:18:48,598 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 10:18:48,599 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 10:18:48,599 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 10:18:48,599 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 10:18:48,599 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 10:18:48,600 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:18:48,600 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 10:18:48,600 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 10:18:48,600 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 10:18:48,601 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 10:18:48,601 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 10:18:48,601 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 10:18:48,601 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 10:18:48,601 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 10:18:48,603 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 10:18:48,603 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> eac3468c0f4088651ddf076a06043d0b9c6e6e24604d04dedd9321326c1496b7 [2024-10-24 10:18:48,856 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 10:18:48,880 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 10:18:48,883 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 10:18:48,884 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 10:18:48,885 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 10:18:48,886 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-36.i [2024-10-24 10:18:50,373 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 10:18:50,564 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 10:18:50,564 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-36.i [2024-10-24 10:18:50,576 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/137f6c1e8/45ab20fcd34842f1ae635c5a0146687f/FLAG639ee9704 [2024-10-24 10:18:50,593 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/137f6c1e8/45ab20fcd34842f1ae635c5a0146687f [2024-10-24 10:18:50,596 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 10:18:50,597 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 10:18:50,599 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 10:18:50,599 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 10:18:50,606 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 10:18:50,607 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:18:50" (1/1) ... [2024-10-24 10:18:50,610 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b004a84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:50, skipping insertion in model container [2024-10-24 10:18:50,610 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:18:50" (1/1) ... [2024-10-24 10:18:50,636 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 10:18:50,812 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-36.i[915,928] [2024-10-24 10:18:50,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:18:50,851 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 10:18:50,863 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-36.i[915,928] [2024-10-24 10:18:50,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:18:50,893 INFO L204 MainTranslator]: Completed translation [2024-10-24 10:18:50,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:50 WrapperNode [2024-10-24 10:18:50,894 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 10:18:50,895 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 10:18:50,895 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 10:18:50,895 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 10:18:50,904 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:50" (1/1) ... [2024-10-24 10:18:50,911 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:50" (1/1) ... [2024-10-24 10:18:50,935 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 87 [2024-10-24 10:18:50,936 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 10:18:50,937 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 10:18:50,937 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 10:18:50,937 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 10:18:50,947 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:50" (1/1) ... [2024-10-24 10:18:50,948 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:50" (1/1) ... [2024-10-24 10:18:50,949 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:50" (1/1) ... [2024-10-24 10:18:50,966 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]. [2024-10-24 10:18:50,967 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:50" (1/1) ... [2024-10-24 10:18:50,967 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:50" (1/1) ... [2024-10-24 10:18:50,974 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:50" (1/1) ... [2024-10-24 10:18:50,981 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:50" (1/1) ... [2024-10-24 10:18:50,982 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:50" (1/1) ... [2024-10-24 10:18:50,983 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:50" (1/1) ... [2024-10-24 10:18:50,985 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 10:18:50,986 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 10:18:50,986 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 10:18:50,986 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 10:18:50,987 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:50" (1/1) ... [2024-10-24 10:18:50,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:18:51,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:18:51,025 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) [2024-10-24 10:18:51,032 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 [2024-10-24 10:18:51,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 10:18:51,080 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 10:18:51,081 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 10:18:51,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 10:18:51,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 10:18:51,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 10:18:51,157 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 10:18:51,162 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 10:18:51,396 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-24 10:18:51,396 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 10:18:51,450 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 10:18:51,451 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 10:18:51,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:18:51 BoogieIcfgContainer [2024-10-24 10:18:51,451 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 10:18:51,454 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 10:18:51,454 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 10:18:51,458 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 10:18:51,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:18:50" (1/3) ... [2024-10-24 10:18:51,459 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@183c3748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:18:51, skipping insertion in model container [2024-10-24 10:18:51,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:50" (2/3) ... [2024-10-24 10:18:51,460 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@183c3748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:18:51, skipping insertion in model container [2024-10-24 10:18:51,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:18:51" (3/3) ... [2024-10-24 10:18:51,462 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-36.i [2024-10-24 10:18:51,483 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 10:18:51,483 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 10:18:51,556 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 10:18:51,575 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;@ecf5212, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 10:18:51,575 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 10:18:51,580 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 22 states have internal predecessors, (30), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 10:18:51,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-24 10:18:51,594 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:18:51,595 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:18:51,595 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:18:51,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:18:51,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1990853393, now seen corresponding path program 1 times [2024-10-24 10:18:51,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:18:51,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657002476] [2024-10-24 10:18:51,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:18:51,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:18:51,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:51,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:18:51,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:51,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:18:51,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:51,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:18:51,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:51,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:18:51,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:51,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:18:51,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:51,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:18:51,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:51,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:18:51,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:51,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:18:51,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:51,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:18:51,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:51,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:18:51,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:51,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 10:18:51,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:51,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 10:18:51,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:51,926 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 10:18:51,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:18:51,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657002476] [2024-10-24 10:18:51,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657002476] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:18:51,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:18:51,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 10:18:51,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514607065] [2024-10-24 10:18:51,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:18:51,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 10:18:51,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:18:51,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 10:18:51,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:18:51,962 INFO L87 Difference]: Start difference. First operand has 36 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 22 states have internal predecessors, (30), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 10:18:52,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:18:52,006 INFO L93 Difference]: Finished difference Result 69 states and 118 transitions. [2024-10-24 10:18:52,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 10:18:52,010 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 74 [2024-10-24 10:18:52,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:18:52,019 INFO L225 Difference]: With dead ends: 69 [2024-10-24 10:18:52,019 INFO L226 Difference]: Without dead ends: 34 [2024-10-24 10:18:52,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:18:52,026 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 10:18:52,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 10:18:52,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-24 10:18:52,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-10-24 10:18:52,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 10:18:52,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2024-10-24 10:18:52,071 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 74 [2024-10-24 10:18:52,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:18:52,072 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2024-10-24 10:18:52,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 10:18:52,073 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2024-10-24 10:18:52,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-24 10:18:52,076 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:18:52,076 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:18:52,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 10:18:52,077 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:18:52,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:18:52,078 INFO L85 PathProgramCache]: Analyzing trace with hash 456053999, now seen corresponding path program 1 times [2024-10-24 10:18:52,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:18:52,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676694759] [2024-10-24 10:18:52,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:18:52,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:18:52,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:52,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:18:52,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:52,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:18:52,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:52,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:18:52,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:52,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:18:52,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:52,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:18:52,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:52,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:18:52,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:52,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:18:52,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:52,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:18:52,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:52,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:18:52,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:52,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:18:52,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:52,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 10:18:52,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:52,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 10:18:52,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:52,983 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 10:18:52,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:18:52,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676694759] [2024-10-24 10:18:52,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676694759] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:18:52,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:18:52,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 10:18:52,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897509067] [2024-10-24 10:18:52,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:18:52,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 10:18:52,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:18:52,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 10:18:52,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 10:18:52,988 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 10:18:53,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:18:53,145 INFO L93 Difference]: Finished difference Result 44 states and 62 transitions. [2024-10-24 10:18:53,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 10:18:53,147 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 74 [2024-10-24 10:18:53,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:18:53,148 INFO L225 Difference]: With dead ends: 44 [2024-10-24 10:18:53,148 INFO L226 Difference]: Without dead ends: 42 [2024-10-24 10:18:53,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 10:18:53,150 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 8 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 10:18:53,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 127 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 10:18:53,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-24 10:18:53,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2024-10-24 10:18:53,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 10:18:53,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2024-10-24 10:18:53,167 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 58 transitions. Word has length 74 [2024-10-24 10:18:53,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:18:53,169 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 58 transitions. [2024-10-24 10:18:53,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 10:18:53,172 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2024-10-24 10:18:53,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-24 10:18:53,174 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:18:53,174 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:18:53,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 10:18:53,174 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:18:53,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:18:53,175 INFO L85 PathProgramCache]: Analyzing trace with hash 513312301, now seen corresponding path program 1 times [2024-10-24 10:18:53,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:18:53,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109485143] [2024-10-24 10:18:53,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:18:53,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:18:53,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:53,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:18:53,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:53,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:18:53,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:53,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:18:53,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:53,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:18:53,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:53,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:18:53,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:53,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:18:53,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:53,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:18:53,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:53,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:18:53,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:53,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:18:53,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:53,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:18:53,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:53,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 10:18:53,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:53,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 10:18:53,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:53,725 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 10:18:53,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:18:53,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109485143] [2024-10-24 10:18:53,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109485143] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:18:53,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:18:53,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 10:18:53,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145158694] [2024-10-24 10:18:53,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:18:53,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 10:18:53,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:18:53,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 10:18:53,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-24 10:18:53,728 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 10:18:53,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:18:53,869 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2024-10-24 10:18:53,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 10:18:53,870 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 74 [2024-10-24 10:18:53,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:18:53,871 INFO L225 Difference]: With dead ends: 56 [2024-10-24 10:18:53,871 INFO L226 Difference]: Without dead ends: 54 [2024-10-24 10:18:53,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 10:18:53,872 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 15 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 10:18:53,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 117 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 10:18:53,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-24 10:18:53,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 40. [2024-10-24 10:18:53,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 10:18:53,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2024-10-24 10:18:53,879 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 58 transitions. Word has length 74 [2024-10-24 10:18:53,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:18:53,880 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 58 transitions. [2024-10-24 10:18:53,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 10:18:53,880 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2024-10-24 10:18:53,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-24 10:18:53,881 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:18:53,882 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:18:53,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 10:18:53,882 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:18:53,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:18:53,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1281914212, now seen corresponding path program 1 times [2024-10-24 10:18:53,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:18:53,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165813752] [2024-10-24 10:18:53,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:18:53,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:18:53,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:54,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:18:54,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:54,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:18:54,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:54,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:18:54,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:54,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:18:54,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:54,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:18:54,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:54,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:18:54,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:54,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:18:54,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:54,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:18:54,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:54,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:18:54,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:54,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:18:54,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:54,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 10:18:54,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:54,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 10:18:54,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:54,203 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 10:18:54,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:18:54,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165813752] [2024-10-24 10:18:54,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165813752] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:18:54,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:18:54,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 10:18:54,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783647777] [2024-10-24 10:18:54,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:18:54,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 10:18:54,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:18:54,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 10:18:54,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-24 10:18:54,206 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 10:18:54,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:18:54,313 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2024-10-24 10:18:54,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 10:18:54,314 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 75 [2024-10-24 10:18:54,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:18:54,315 INFO L225 Difference]: With dead ends: 56 [2024-10-24 10:18:54,315 INFO L226 Difference]: Without dead ends: 54 [2024-10-24 10:18:54,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 10:18:54,316 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 11 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 10:18:54,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 119 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 10:18:54,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-24 10:18:54,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 40. [2024-10-24 10:18:54,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 10:18:54,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2024-10-24 10:18:54,323 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 58 transitions. Word has length 75 [2024-10-24 10:18:54,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:18:54,324 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 58 transitions. [2024-10-24 10:18:54,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 10:18:54,324 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2024-10-24 10:18:54,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-24 10:18:54,325 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:18:54,325 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:18:54,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 10:18:54,326 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:18:54,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:18:54,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1093969096, now seen corresponding path program 1 times [2024-10-24 10:18:54,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:18:54,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345204598] [2024-10-24 10:18:54,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:18:54,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:18:54,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:54,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:18:54,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:54,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:18:54,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:54,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:18:54,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:54,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:18:54,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:54,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:18:54,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:54,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:18:54,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:54,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:18:54,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:54,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:18:54,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:54,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:18:54,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:54,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:18:54,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:54,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 10:18:54,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:54,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 10:18:54,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:54,762 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 10:18:54,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:18:54,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345204598] [2024-10-24 10:18:54,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345204598] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:18:54,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:18:54,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 10:18:54,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291662026] [2024-10-24 10:18:54,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:18:54,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 10:18:54,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:18:54,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 10:18:54,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-24 10:18:54,766 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 10:18:54,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:18:54,956 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2024-10-24 10:18:54,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 10:18:54,956 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 76 [2024-10-24 10:18:54,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:18:54,957 INFO L225 Difference]: With dead ends: 56 [2024-10-24 10:18:54,958 INFO L226 Difference]: Without dead ends: 54 [2024-10-24 10:18:54,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-10-24 10:18:54,959 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 20 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 10:18:54,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 194 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 10:18:54,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-24 10:18:54,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 40. [2024-10-24 10:18:54,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 10:18:54,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2024-10-24 10:18:54,970 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 58 transitions. Word has length 76 [2024-10-24 10:18:54,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:18:54,970 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 58 transitions. [2024-10-24 10:18:54,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 10:18:54,971 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2024-10-24 10:18:54,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-24 10:18:54,972 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:18:54,972 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:18:54,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 10:18:54,973 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:18:54,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:18:54,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1093909514, now seen corresponding path program 1 times [2024-10-24 10:18:54,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:18:54,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107678656] [2024-10-24 10:18:54,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:18:54,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:18:54,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:55,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:18:55,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:55,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:18:55,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:55,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:18:55,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:55,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:18:55,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:55,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:18:55,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:55,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:18:55,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:55,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:18:55,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:55,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:18:55,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:55,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:18:55,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:55,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:18:55,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:55,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 10:18:55,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:55,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 10:18:55,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:55,085 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 10:18:55,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:18:55,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107678656] [2024-10-24 10:18:55,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107678656] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:18:55,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:18:55,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 10:18:55,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022033724] [2024-10-24 10:18:55,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:18:55,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 10:18:55,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:18:55,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 10:18:55,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 10:18:55,093 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 10:18:55,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:18:55,114 INFO L93 Difference]: Finished difference Result 110 states and 161 transitions. [2024-10-24 10:18:55,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 10:18:55,115 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 76 [2024-10-24 10:18:55,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:18:55,116 INFO L225 Difference]: With dead ends: 110 [2024-10-24 10:18:55,116 INFO L226 Difference]: Without dead ends: 71 [2024-10-24 10:18:55,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 10:18:55,117 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 21 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 10:18:55,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 96 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 10:18:55,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-24 10:18:55,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-10-24 10:18:55,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 10:18:55,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 103 transitions. [2024-10-24 10:18:55,127 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 103 transitions. Word has length 76 [2024-10-24 10:18:55,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:18:55,128 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 103 transitions. [2024-10-24 10:18:55,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 10:18:55,128 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 103 transitions. [2024-10-24 10:18:55,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-24 10:18:55,135 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:18:55,135 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 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] [2024-10-24 10:18:55,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 10:18:55,135 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:18:55,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:18:55,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1351617480, now seen corresponding path program 1 times [2024-10-24 10:18:55,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:18:55,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025501236] [2024-10-24 10:18:55,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:18:55,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:18:55,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:55,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:18:55,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:55,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:18:55,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:55,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:18:55,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:55,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:18:55,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:55,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:18:55,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:55,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:18:55,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:55,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:18:55,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:55,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:18:55,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:55,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:18:55,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:55,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:18:55,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:55,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 10:18:55,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:55,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 10:18:55,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:55,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 10:18:55,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:55,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 10:18:55,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:55,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 10:18:55,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:55,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 10:18:55,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:55,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 10:18:55,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:55,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 10:18:55,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:55,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 10:18:55,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:55,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 10:18:55,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:55,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 10:18:55,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:55,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 10:18:55,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:55,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 10:18:55,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:55,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 10:18:55,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:55,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1123 trivial. 0 not checked. [2024-10-24 10:18:55,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:18:55,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025501236] [2024-10-24 10:18:55,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025501236] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:18:55,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:18:55,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 10:18:55,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474410501] [2024-10-24 10:18:55,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:18:55,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 10:18:55,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:18:55,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 10:18:55,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-24 10:18:55,626 INFO L87 Difference]: Start difference. First operand 71 states and 103 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 10:18:55,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:18:55,745 INFO L93 Difference]: Finished difference Result 79 states and 111 transitions. [2024-10-24 10:18:55,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 10:18:55,748 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 149 [2024-10-24 10:18:55,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:18:55,749 INFO L225 Difference]: With dead ends: 79 [2024-10-24 10:18:55,749 INFO L226 Difference]: Without dead ends: 0 [2024-10-24 10:18:55,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 10:18:55,750 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 20 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 10:18:55,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 113 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 10:18:55,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-24 10:18:55,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-24 10:18:55,754 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) [2024-10-24 10:18:55,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-24 10:18:55,754 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 149 [2024-10-24 10:18:55,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:18:55,754 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-24 10:18:55,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 10:18:55,756 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-24 10:18:55,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-24 10:18:55,759 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 10:18:55,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 10:18:55,762 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:18:55,765 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-24 10:18:55,874 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 10:18:55,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:18:55 BoogieIcfgContainer [2024-10-24 10:18:55,900 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 10:18:55,901 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 10:18:55,901 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 10:18:55,901 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 10:18:55,902 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:18:51" (3/4) ... [2024-10-24 10:18:55,904 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-24 10:18:55,908 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-24 10:18:55,913 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-10-24 10:18:55,913 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-24 10:18:55,913 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-24 10:18:55,913 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-24 10:18:56,005 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 10:18:56,005 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-24 10:18:56,005 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 10:18:56,006 INFO L158 Benchmark]: Toolchain (without parser) took 5408.66ms. Allocated memory was 157.3MB in the beginning and 220.2MB in the end (delta: 62.9MB). Free memory was 99.6MB in the beginning and 100.4MB in the end (delta: -755.3kB). Peak memory consumption was 63.6MB. Max. memory is 16.1GB. [2024-10-24 10:18:56,006 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 157.3MB. Free memory was 116.8MB in the beginning and 116.7MB in the end (delta: 141.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:18:56,007 INFO L158 Benchmark]: CACSL2BoogieTranslator took 295.73ms. Allocated memory is still 157.3MB. Free memory was 99.6MB in the beginning and 86.5MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-24 10:18:56,007 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.04ms. Allocated memory is still 157.3MB. Free memory was 86.5MB in the beginning and 84.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 10:18:56,007 INFO L158 Benchmark]: Boogie Preprocessor took 48.22ms. Allocated memory is still 157.3MB. Free memory was 84.6MB in the beginning and 82.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 10:18:56,008 INFO L158 Benchmark]: RCFGBuilder took 465.88ms. Allocated memory is still 157.3MB. Free memory was 82.5MB in the beginning and 67.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 10:18:56,008 INFO L158 Benchmark]: TraceAbstraction took 4446.74ms. Allocated memory was 157.3MB in the beginning and 220.2MB in the end (delta: 62.9MB). Free memory was 67.4MB in the beginning and 106.6MB in the end (delta: -39.2MB). Peak memory consumption was 25.8MB. Max. memory is 16.1GB. [2024-10-24 10:18:56,008 INFO L158 Benchmark]: Witness Printer took 104.52ms. Allocated memory is still 220.2MB. Free memory was 106.6MB in the beginning and 100.4MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 10:18:56,010 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.18ms. Allocated memory is still 157.3MB. Free memory was 116.8MB in the beginning and 116.7MB in the end (delta: 141.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 295.73ms. Allocated memory is still 157.3MB. Free memory was 99.6MB in the beginning and 86.5MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.04ms. Allocated memory is still 157.3MB. Free memory was 86.5MB in the beginning and 84.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.22ms. Allocated memory is still 157.3MB. Free memory was 84.6MB in the beginning and 82.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 465.88ms. Allocated memory is still 157.3MB. Free memory was 82.5MB in the beginning and 67.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 4446.74ms. Allocated memory was 157.3MB in the beginning and 220.2MB in the end (delta: 62.9MB). Free memory was 67.4MB in the beginning and 106.6MB in the end (delta: -39.2MB). Peak memory consumption was 25.8MB. Max. memory is 16.1GB. * Witness Printer took 104.52ms. Allocated memory is still 220.2MB. Free memory was 106.6MB in the beginning and 100.4MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. 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: 19]: 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 2 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.2s, OverallIterations: 7, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 95 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 95 mSDsluCounter, 812 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 525 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 451 IncrementalHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 287 mSDtfsCounter, 451 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 250 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=6, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 44 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 598 NumberOfCodeBlocks, 598 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 591 ConstructedInterpolants, 0 QuantifiedInterpolants, 1525 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 2712/2712 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: (((((long long) var_1_4 + var_1_3) + last_1_var_1_7) < var_1_2) || (((var_1_6 == 0) || (var_1_1 == 0)) && ((var_1_1 == 1) || (var_1_6 != 0)))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_2 == \old(var_1_2))) && (var_1_3 == \old(var_1_3))) && (var_1_4 == \old(var_1_4))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (last_1_var_1_7 == \old(last_1_var_1_7))) RESULT: Ultimate proved your program to be correct! [2024-10-24 10:18:56,034 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