./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-39.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-39.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 f5eff424b13e274e9264f217cb93b9f92431d9f38ae53b99fcf8d948b0cbf8ce --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:35:10,887 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:35:10,970 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 07:35:10,977 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:35:10,978 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:35:11,001 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:35:11,001 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:35:11,002 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:35:11,002 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:35:11,003 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:35:11,003 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:35:11,004 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:35:11,004 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:35:11,005 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:35:11,005 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:35:11,005 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:35:11,006 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:35:11,006 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:35:11,007 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 07:35:11,007 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:35:11,007 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:35:11,011 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:35:11,011 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:35:11,012 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:35:11,012 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:35:11,012 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:35:11,013 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:35:11,016 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:35:11,016 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:35:11,017 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:35:11,017 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:35:11,017 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:35:11,017 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:35:11,018 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:35:11,018 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:35:11,018 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:35:11,019 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 07:35:11,019 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 07:35:11,020 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:35:11,021 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:35:11,021 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:35:11,021 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:35:11,022 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 -> f5eff424b13e274e9264f217cb93b9f92431d9f38ae53b99fcf8d948b0cbf8ce [2024-11-10 07:35:11,270 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:35:11,299 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:35:11,302 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:35:11,303 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:35:11,304 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:35:11,305 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-39.i [2024-11-10 07:35:12,759 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:35:12,955 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:35:12,955 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-39.i [2024-11-10 07:35:12,964 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f297807c/12de5e1819e34625a5d5801f6e18295d/FLAGb930a3fe2 [2024-11-10 07:35:13,314 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f297807c/12de5e1819e34625a5d5801f6e18295d [2024-11-10 07:35:13,317 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:35:13,318 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:35:13,319 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:35:13,319 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:35:13,325 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:35:13,326 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:35:13" (1/1) ... [2024-11-10 07:35:13,326 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@439939b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:13, skipping insertion in model container [2024-11-10 07:35:13,327 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:35:13" (1/1) ... [2024-11-10 07:35:13,350 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:35:13,514 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-39.i[915,928] [2024-11-10 07:35:13,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:35:13,566 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:35:13,577 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-39.i[915,928] [2024-11-10 07:35:13,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:35:13,617 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:35:13,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:13 WrapperNode [2024-11-10 07:35:13,618 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:35:13,619 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:35:13,619 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:35:13,619 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:35:13,628 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:13" (1/1) ... [2024-11-10 07:35:13,641 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:13" (1/1) ... [2024-11-10 07:35:13,684 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 101 [2024-11-10 07:35:13,685 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:35:13,687 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:35:13,687 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:35:13,687 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:35:13,698 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:13" (1/1) ... [2024-11-10 07:35:13,698 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:13" (1/1) ... [2024-11-10 07:35:13,704 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:13" (1/1) ... [2024-11-10 07:35:13,722 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-11-10 07:35:13,723 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:13" (1/1) ... [2024-11-10 07:35:13,724 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:13" (1/1) ... [2024-11-10 07:35:13,736 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:13" (1/1) ... [2024-11-10 07:35:13,737 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:13" (1/1) ... [2024-11-10 07:35:13,739 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:13" (1/1) ... [2024-11-10 07:35:13,740 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:13" (1/1) ... [2024-11-10 07:35:13,743 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:35:13,744 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:35:13,744 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:35:13,744 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:35:13,745 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:13" (1/1) ... [2024-11-10 07:35:13,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:35:13,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:35:13,784 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-11-10 07:35:13,788 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-11-10 07:35:13,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:35:13,838 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:35:13,839 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:35:13,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 07:35:13,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:35:13,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:35:13,992 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:35:13,994 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:35:14,269 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-10 07:35:14,269 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:35:14,283 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:35:14,285 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:35:14,286 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:35:14 BoogieIcfgContainer [2024-11-10 07:35:14,286 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:35:14,289 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:35:14,289 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:35:14,292 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:35:14,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:35:13" (1/3) ... [2024-11-10 07:35:14,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c5fec19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:35:14, skipping insertion in model container [2024-11-10 07:35:14,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:13" (2/3) ... [2024-11-10 07:35:14,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c5fec19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:35:14, skipping insertion in model container [2024-11-10 07:35:14,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:35:14" (3/3) ... [2024-11-10 07:35:14,296 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-39.i [2024-11-10 07:35:14,313 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:35:14,313 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:35:14,377 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:35:14,386 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;@5eb584d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:35:14,387 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:35:14,392 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 07:35:14,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-10 07:35:14,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:35:14,406 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 07:35:14,407 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:35:14,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:35:14,414 INFO L85 PathProgramCache]: Analyzing trace with hash 924036631, now seen corresponding path program 1 times [2024-11-10 07:35:14,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:35:14,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141717297] [2024-11-10 07:35:14,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:35:14,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:35:14,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:14,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:35:14,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:14,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:35:14,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:14,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:35:14,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:14,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 07:35:14,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:14,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 07:35:14,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:14,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 07:35:14,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:14,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 07:35:14,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:14,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 07:35:14,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:14,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 07:35:14,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:14,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 07:35:14,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:14,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 07:35:14,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:14,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 07:35:14,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:14,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 07:35:14,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:14,761 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-10 07:35:14,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:35:14,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141717297] [2024-11-10 07:35:14,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141717297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:35:14,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:35:14,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:35:14,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819447163] [2024-11-10 07:35:14,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:35:14,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:35:14,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:35:14,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:35:14,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:35:14,796 INFO L87 Difference]: Start difference. First operand has 50 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-10 07:35:14,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:35:14,818 INFO L93 Difference]: Finished difference Result 92 states and 146 transitions. [2024-11-10 07:35:14,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:35:14,820 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 89 [2024-11-10 07:35:14,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:35:14,830 INFO L225 Difference]: With dead ends: 92 [2024-11-10 07:35:14,830 INFO L226 Difference]: Without dead ends: 45 [2024-11-10 07:35:14,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 41 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-11-10 07:35:14,839 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 07:35:14,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:35:14,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-10 07:35:14,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-10 07:35:14,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 07:35:14,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2024-11-10 07:35:14,879 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 62 transitions. Word has length 89 [2024-11-10 07:35:14,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:35:14,880 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 62 transitions. [2024-11-10 07:35:14,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-10 07:35:14,880 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2024-11-10 07:35:14,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-10 07:35:14,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:35:14,883 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 07:35:14,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 07:35:14,884 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:35:14,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:35:14,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1986655508, now seen corresponding path program 1 times [2024-11-10 07:35:14,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:35:14,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293494204] [2024-11-10 07:35:14,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:35:14,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:35:14,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:16,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:35:16,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:16,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:35:16,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:16,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:35:16,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:16,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 07:35:16,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:16,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 07:35:16,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:16,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 07:35:16,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:16,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 07:35:16,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:16,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 07:35:16,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:16,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 07:35:16,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:16,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 07:35:16,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:16,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 07:35:16,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:16,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 07:35:16,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:16,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 07:35:16,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:16,701 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-10 07:35:16,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:35:16,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293494204] [2024-11-10 07:35:16,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293494204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:35:16,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:35:16,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 07:35:16,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860398064] [2024-11-10 07:35:16,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:35:16,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 07:35:16,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:35:16,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 07:35:16,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 07:35:16,707 INFO L87 Difference]: Start difference. First operand 45 states and 62 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-10 07:35:17,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:35:17,205 INFO L93 Difference]: Finished difference Result 160 states and 225 transitions. [2024-11-10 07:35:17,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 07:35:17,206 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 89 [2024-11-10 07:35:17,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:35:17,209 INFO L225 Difference]: With dead ends: 160 [2024-11-10 07:35:17,209 INFO L226 Difference]: Without dead ends: 118 [2024-11-10 07:35:17,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-10 07:35:17,211 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 75 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 07:35:17,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 269 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 07:35:17,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-10 07:35:17,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 84. [2024-11-10 07:35:17,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 55 states have (on average 1.2) internal successors, (66), 55 states have internal predecessors, (66), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 07:35:17,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 118 transitions. [2024-11-10 07:35:17,254 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 118 transitions. Word has length 89 [2024-11-10 07:35:17,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:35:17,255 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 118 transitions. [2024-11-10 07:35:17,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-10 07:35:17,256 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 118 transitions. [2024-11-10 07:35:17,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-10 07:35:17,258 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:35:17,258 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 07:35:17,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 07:35:17,259 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:35:17,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:35:17,259 INFO L85 PathProgramCache]: Analyzing trace with hash -2113651919, now seen corresponding path program 1 times [2024-11-10 07:35:17,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:35:17,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084105694] [2024-11-10 07:35:17,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:35:17,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:35:17,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:17,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:35:17,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:17,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:35:17,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:17,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:35:17,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:17,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 07:35:17,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:17,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 07:35:17,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:17,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 07:35:17,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:17,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 07:35:17,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:17,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 07:35:17,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:17,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 07:35:17,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:17,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 07:35:17,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:17,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 07:35:17,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:17,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 07:35:17,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:17,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 07:35:17,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:17,474 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-10 07:35:17,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:35:17,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084105694] [2024-11-10 07:35:17,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084105694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:35:17,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:35:17,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 07:35:17,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426755114] [2024-11-10 07:35:17,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:35:17,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 07:35:17,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:35:17,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 07:35:17,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 07:35:17,477 INFO L87 Difference]: Start difference. First operand 84 states and 118 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 07:35:17,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:35:17,585 INFO L93 Difference]: Finished difference Result 215 states and 298 transitions. [2024-11-10 07:35:17,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 07:35:17,586 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 90 [2024-11-10 07:35:17,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:35:17,588 INFO L225 Difference]: With dead ends: 215 [2024-11-10 07:35:17,588 INFO L226 Difference]: Without dead ends: 134 [2024-11-10 07:35:17,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 07:35:17,590 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 49 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 07:35:17,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 176 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 07:35:17,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-10 07:35:17,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 122. [2024-11-10 07:35:17,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 79 states have (on average 1.1772151898734178) internal successors, (93), 79 states have internal predecessors, (93), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-10 07:35:17,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 171 transitions. [2024-11-10 07:35:17,632 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 171 transitions. Word has length 90 [2024-11-10 07:35:17,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:35:17,634 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 171 transitions. [2024-11-10 07:35:17,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 07:35:17,634 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 171 transitions. [2024-11-10 07:35:17,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-10 07:35:17,637 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:35:17,637 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 07:35:17,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 07:35:17,637 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:35:17,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:35:17,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1097288684, now seen corresponding path program 1 times [2024-11-10 07:35:17,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:35:17,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698724187] [2024-11-10 07:35:17,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:35:17,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:35:17,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:41,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:35:41,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:41,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:35:41,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:41,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:35:41,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:41,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 07:35:41,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:41,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 07:35:41,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:41,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 07:35:41,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:41,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 07:35:41,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:41,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 07:35:41,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:41,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 07:35:41,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:41,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 07:35:41,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:41,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 07:35:41,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:41,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 07:35:41,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:41,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 07:35:41,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:41,532 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-10 07:35:41,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:35:41,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698724187] [2024-11-10 07:35:41,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698724187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:35:41,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:35:41,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 07:35:41,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499394780] [2024-11-10 07:35:41,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:35:41,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 07:35:41,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:35:41,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 07:35:41,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-10 07:35:41,538 INFO L87 Difference]: Start difference. First operand 122 states and 171 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 07:35:42,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:35:42,054 INFO L93 Difference]: Finished difference Result 149 states and 204 transitions. [2024-11-10 07:35:42,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 07:35:42,055 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 90 [2024-11-10 07:35:42,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:35:42,057 INFO L225 Difference]: With dead ends: 149 [2024-11-10 07:35:42,057 INFO L226 Difference]: Without dead ends: 146 [2024-11-10 07:35:42,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-11-10 07:35:42,059 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 24 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 07:35:42,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 302 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 07:35:42,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-10 07:35:42,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 138. [2024-11-10 07:35:42,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 95 states have (on average 1.1894736842105262) internal successors, (113), 95 states have internal predecessors, (113), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-10 07:35:42,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 191 transitions. [2024-11-10 07:35:42,089 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 191 transitions. Word has length 90 [2024-11-10 07:35:42,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:35:42,090 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 191 transitions. [2024-11-10 07:35:42,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 07:35:42,091 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 191 transitions. [2024-11-10 07:35:42,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-10 07:35:42,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:35:42,093 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:35:42,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 07:35:42,094 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:35:42,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:35:42,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1105361830, now seen corresponding path program 1 times [2024-11-10 07:35:42,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:35:42,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076646246] [2024-11-10 07:35:42,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:35:42,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:35:42,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:43,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:35:43,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:43,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:35:43,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:43,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:35:43,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:43,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 07:35:43,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:43,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 07:35:43,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:43,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 07:35:43,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:43,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 07:35:43,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:43,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 07:35:43,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:43,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 07:35:43,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:43,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 07:35:43,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:43,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 07:35:43,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:43,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 07:35:43,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:43,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 07:35:43,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:43,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-10 07:35:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:43,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 07:35:43,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:43,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 07:35:43,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:43,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-10 07:35:43,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:43,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-10 07:35:43,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:43,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 07:35:43,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:43,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-10 07:35:43,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:43,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 07:35:43,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:43,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-10 07:35:43,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:43,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 07:35:43,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:43,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-10 07:35:43,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:43,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 07:35:43,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:43,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-10 07:35:43,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:43,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1325 trivial. 0 not checked. [2024-11-10 07:35:43,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:35:43,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076646246] [2024-11-10 07:35:43,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076646246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:35:43,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:35:43,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 07:35:43,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709057336] [2024-11-10 07:35:43,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:35:43,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 07:35:43,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:35:43,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 07:35:43,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-10 07:35:43,504 INFO L87 Difference]: Start difference. First operand 138 states and 191 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 07:35:43,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:35:43,765 INFO L93 Difference]: Finished difference Result 167 states and 223 transitions. [2024-11-10 07:35:43,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 07:35:43,765 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 176 [2024-11-10 07:35:43,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:35:43,767 INFO L225 Difference]: With dead ends: 167 [2024-11-10 07:35:43,768 INFO L226 Difference]: Without dead ends: 164 [2024-11-10 07:35:43,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-10 07:35:43,769 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 37 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 07:35:43,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 406 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 07:35:43,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-10 07:35:43,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 143. [2024-11-10 07:35:43,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 100 states have (on average 1.21) internal successors, (121), 100 states have internal predecessors, (121), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-10 07:35:43,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 199 transitions. [2024-11-10 07:35:43,800 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 199 transitions. Word has length 176 [2024-11-10 07:35:43,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:35:43,801 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 199 transitions. [2024-11-10 07:35:43,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 07:35:43,802 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 199 transitions. [2024-11-10 07:35:43,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-10 07:35:43,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:35:43,808 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:35:43,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 07:35:43,808 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:35:43,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:35:43,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1076732679, now seen corresponding path program 1 times [2024-11-10 07:35:43,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:35:43,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711179798] [2024-11-10 07:35:43,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:35:43,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:35:43,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:45,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:35:45,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:45,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:35:45,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:45,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:35:45,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:45,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 07:35:45,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:45,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 07:35:45,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:45,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 07:35:45,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:45,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 07:35:45,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:45,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 07:35:45,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:45,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 07:35:45,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:45,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 07:35:45,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:45,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 07:35:45,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:45,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 07:35:45,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:45,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 07:35:45,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:45,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-10 07:35:45,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:45,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 07:35:45,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:45,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 07:35:45,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:45,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-10 07:35:45,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:45,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-10 07:35:45,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:45,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 07:35:45,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:45,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-10 07:35:45,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:45,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 07:35:45,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:45,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-10 07:35:45,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:45,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 07:35:45,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:45,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-10 07:35:45,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:45,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 07:35:45,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:45,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-10 07:35:45,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:45,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1324 trivial. 0 not checked. [2024-11-10 07:35:45,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:35:45,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711179798] [2024-11-10 07:35:45,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711179798] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:35:45,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:35:45,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 07:35:45,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752534884] [2024-11-10 07:35:45,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:35:45,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 07:35:45,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:35:45,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 07:35:45,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-10 07:35:45,228 INFO L87 Difference]: Start difference. First operand 143 states and 199 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 07:35:45,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:35:45,523 INFO L93 Difference]: Finished difference Result 155 states and 211 transitions. [2024-11-10 07:35:45,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 07:35:45,523 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 176 [2024-11-10 07:35:45,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:35:45,525 INFO L225 Difference]: With dead ends: 155 [2024-11-10 07:35:45,525 INFO L226 Difference]: Without dead ends: 152 [2024-11-10 07:35:45,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-11-10 07:35:45,527 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 28 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 07:35:45,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 321 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 07:35:45,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-10 07:35:45,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 138. [2024-11-10 07:35:45,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 95 states have (on average 1.1894736842105262) internal successors, (113), 95 states have internal predecessors, (113), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-10 07:35:45,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 191 transitions. [2024-11-10 07:35:45,553 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 191 transitions. Word has length 176 [2024-11-10 07:35:45,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:35:45,554 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 191 transitions. [2024-11-10 07:35:45,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 07:35:45,554 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 191 transitions. [2024-11-10 07:35:45,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-10 07:35:45,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:35:45,556 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:35:45,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 07:35:45,557 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:35:45,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:35:45,557 INFO L85 PathProgramCache]: Analyzing trace with hash 37470287, now seen corresponding path program 1 times [2024-11-10 07:35:45,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:35:45,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723953675] [2024-11-10 07:35:45,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:35:45,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:35:45,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:46,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:35:46,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:46,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:35:46,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:46,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:35:46,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:46,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 07:35:46,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:46,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 07:35:46,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:46,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 07:35:46,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:46,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 07:35:46,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:46,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 07:35:46,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:46,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 07:35:46,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:46,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 07:35:46,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:46,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 07:35:46,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:46,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 07:35:46,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:46,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 07:35:46,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:46,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-10 07:35:46,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:46,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 07:35:46,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:46,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 07:35:46,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:46,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-10 07:35:46,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:46,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-10 07:35:46,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:46,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 07:35:46,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:46,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-10 07:35:46,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:46,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 07:35:46,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:46,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-10 07:35:46,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:46,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 07:35:46,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:46,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-10 07:35:46,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:46,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 07:35:46,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:46,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-10 07:35:46,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:46,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1324 trivial. 0 not checked. [2024-11-10 07:35:46,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:35:46,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723953675] [2024-11-10 07:35:46,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723953675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:35:46,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:35:46,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 07:35:46,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152855177] [2024-11-10 07:35:46,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:35:46,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 07:35:46,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:35:46,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 07:35:46,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-10 07:35:46,617 INFO L87 Difference]: Start difference. First operand 138 states and 191 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 07:35:46,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:35:46,852 INFO L93 Difference]: Finished difference Result 161 states and 215 transitions. [2024-11-10 07:35:46,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 07:35:46,855 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 177 [2024-11-10 07:35:46,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:35:46,856 INFO L225 Difference]: With dead ends: 161 [2024-11-10 07:35:46,856 INFO L226 Difference]: Without dead ends: 158 [2024-11-10 07:35:46,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-10 07:35:46,857 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 22 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 07:35:46,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 259 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 07:35:46,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-10 07:35:46,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 138. [2024-11-10 07:35:46,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 95 states have (on average 1.1894736842105262) internal successors, (113), 95 states have internal predecessors, (113), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-10 07:35:46,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 191 transitions. [2024-11-10 07:35:46,893 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 191 transitions. Word has length 177 [2024-11-10 07:35:46,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:35:46,893 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 191 transitions. [2024-11-10 07:35:46,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 07:35:46,894 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 191 transitions. [2024-11-10 07:35:46,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-10 07:35:46,895 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:35:46,896 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:35:46,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 07:35:46,896 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:35:46,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:35:46,896 INFO L85 PathProgramCache]: Analyzing trace with hash 66099438, now seen corresponding path program 1 times [2024-11-10 07:35:46,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:35:46,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60431744] [2024-11-10 07:35:46,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:35:46,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:35:46,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:47,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:35:47,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:47,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:35:47,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:47,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:35:47,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:47,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 07:35:47,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:47,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 07:35:47,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:47,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 07:35:47,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:47,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 07:35:47,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:47,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 07:35:47,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:47,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 07:35:47,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:47,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 07:35:47,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:47,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 07:35:47,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:47,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 07:35:47,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:47,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 07:35:47,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:47,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-10 07:35:47,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:47,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 07:35:47,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:47,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 07:35:47,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:47,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-10 07:35:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:47,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-10 07:35:47,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:47,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 07:35:47,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:47,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-10 07:35:47,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:47,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 07:35:47,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:47,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-10 07:35:47,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:47,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 07:35:47,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:47,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-10 07:35:47,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:47,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 07:35:47,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:47,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-10 07:35:47,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:47,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1324 trivial. 0 not checked. [2024-11-10 07:35:47,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:35:47,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60431744] [2024-11-10 07:35:47,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60431744] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:35:47,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:35:47,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 07:35:47,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847943065] [2024-11-10 07:35:47,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:35:47,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 07:35:47,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:35:47,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 07:35:47,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-10 07:35:47,865 INFO L87 Difference]: Start difference. First operand 138 states and 191 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 07:35:48,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:35:48,092 INFO L93 Difference]: Finished difference Result 156 states and 212 transitions. [2024-11-10 07:35:48,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 07:35:48,092 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 177 [2024-11-10 07:35:48,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:35:48,093 INFO L225 Difference]: With dead ends: 156 [2024-11-10 07:35:48,093 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 07:35:48,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-11-10 07:35:48,095 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 27 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 07:35:48,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 338 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 07:35:48,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 07:35:48,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 07:35:48,095 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-11-10 07:35:48,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 07:35:48,096 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 177 [2024-11-10 07:35:48,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:35:48,096 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 07:35:48,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 07:35:48,096 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 07:35:48,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 07:35:48,099 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 07:35:48,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 07:35:48,103 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:35:48,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-10 07:35:48,866 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 07:35:48,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:35:48 BoogieIcfgContainer [2024-11-10 07:35:48,895 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 07:35:48,895 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 07:35:48,895 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 07:35:48,896 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 07:35:48,896 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:35:14" (3/4) ... [2024-11-10 07:35:48,898 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 07:35:48,903 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-10 07:35:48,909 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2024-11-10 07:35:48,910 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-10 07:35:48,910 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 07:35:48,911 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 07:35:49,015 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 07:35:49,017 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 07:35:49,017 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 07:35:49,017 INFO L158 Benchmark]: Toolchain (without parser) took 35699.47ms. Allocated memory was 192.9MB in the beginning and 1.2GB in the end (delta: 992.0MB). Free memory was 123.0MB in the beginning and 1.0GB in the end (delta: -878.3MB). Peak memory consumption was 114.1MB. Max. memory is 16.1GB. [2024-11-10 07:35:49,018 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 192.9MB. Free memory is still 149.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:35:49,018 INFO L158 Benchmark]: CACSL2BoogieTranslator took 299.09ms. Allocated memory is still 192.9MB. Free memory was 123.0MB in the beginning and 108.6MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 07:35:49,018 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.89ms. Allocated memory is still 192.9MB. Free memory was 108.6MB in the beginning and 105.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 07:35:49,019 INFO L158 Benchmark]: Boogie Preprocessor took 55.92ms. Allocated memory is still 192.9MB. Free memory was 105.8MB in the beginning and 102.1MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 07:35:49,019 INFO L158 Benchmark]: IcfgBuilder took 542.52ms. Allocated memory is still 192.9MB. Free memory was 102.1MB in the beginning and 150.4MB in the end (delta: -48.4MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. [2024-11-10 07:35:49,019 INFO L158 Benchmark]: TraceAbstraction took 34606.30ms. Allocated memory was 192.9MB in the beginning and 1.2GB in the end (delta: 992.0MB). Free memory was 149.4MB in the beginning and 1.0GB in the end (delta: -858.2MB). Peak memory consumption was 574.1MB. Max. memory is 16.1GB. [2024-11-10 07:35:49,019 INFO L158 Benchmark]: Witness Printer took 121.49ms. Allocated memory is still 1.2GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 07:35:49,021 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 192.9MB. Free memory is still 149.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 299.09ms. Allocated memory is still 192.9MB. Free memory was 123.0MB in the beginning and 108.6MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.89ms. Allocated memory is still 192.9MB. Free memory was 108.6MB in the beginning and 105.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.92ms. Allocated memory is still 192.9MB. Free memory was 105.8MB in the beginning and 102.1MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 542.52ms. Allocated memory is still 192.9MB. Free memory was 102.1MB in the beginning and 150.4MB in the end (delta: -48.4MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. * TraceAbstraction took 34606.30ms. Allocated memory was 192.9MB in the beginning and 1.2GB in the end (delta: 992.0MB). Free memory was 149.4MB in the beginning and 1.0GB in the end (delta: -858.2MB). Peak memory consumption was 574.1MB. Max. memory is 16.1GB. * Witness Printer took 121.49ms. Allocated memory is still 1.2GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 6.3MB). 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, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 33.7s, OverallIterations: 8, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 262 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 262 mSDsluCounter, 2133 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1611 mSDsCounter, 87 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 683 IncrementalHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 87 mSolverCounterUnsat, 522 mSDtfsCounter, 683 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 408 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=143occurred in iteration=5, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 109 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 30.6s InterpolantComputationTime, 1064 NumberOfCodeBlocks, 1064 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1056 ConstructedInterpolants, 0 QuantifiedInterpolants, 4992 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 6578/6578 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: 94]: Location Invariant Derived location invariant: null - 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_3 == \old(var_1_3))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (var_1_12 == \old(var_1_12))) && (var_1_13 == \old(var_1_13))) && (var_1_14 == \old(var_1_14))) && (var_1_16 == \old(var_1_16))) && (last_1_var_1_6 == \old(last_1_var_1_6))) && (last_1_var_1_10 == \old(last_1_var_1_10))) RESULT: Ultimate proved your program to be correct! [2024-11-10 07:35:49,079 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