./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.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 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 04:36:08,402 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 04:36:08,455 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 04:36:08,460 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 04:36:08,460 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 04:36:08,482 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 04:36:08,482 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 04:36:08,483 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 04:36:08,483 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 04:36:08,483 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 04:36:08,484 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 04:36:08,484 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 04:36:08,484 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 04:36:08,484 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 04:36:08,485 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 04:36:08,485 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 04:36:08,485 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 04:36:08,485 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 04:36:08,485 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 04:36:08,485 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 04:36:08,485 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 04:36:08,485 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 04:36:08,486 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 04:36:08,486 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 04:36:08,486 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 04:36:08,486 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 04:36:08,486 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 04:36:08,486 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 04:36:08,486 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 04:36:08,486 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 04:36:08,486 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 04:36:08,486 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 04:36:08,487 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:36:08,487 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 04:36:08,487 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 04:36:08,487 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 04:36:08,487 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 04:36:08,487 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 04:36:08,487 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 04:36:08,487 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 04:36:08,487 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 04:36:08,487 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 04:36:08,488 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 04:36:08,488 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 [2025-03-08 04:36:08,694 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 04:36:08,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 04:36:08,701 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 04:36:08,701 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 04:36:08,702 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 04:36:08,702 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2025-03-08 04:36:09,786 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b617ea80/b48c2deba9f14edb8eefbc4ac4dba440/FLAG698447525 [2025-03-08 04:36:10,087 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 04:36:10,088 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2025-03-08 04:36:10,103 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b617ea80/b48c2deba9f14edb8eefbc4ac4dba440/FLAG698447525 [2025-03-08 04:36:10,361 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b617ea80/b48c2deba9f14edb8eefbc4ac4dba440 [2025-03-08 04:36:10,363 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 04:36:10,364 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 04:36:10,365 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 04:36:10,365 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 04:36:10,368 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 04:36:10,368 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:36:10" (1/1) ... [2025-03-08 04:36:10,369 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f41bb0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:36:10, skipping insertion in model container [2025-03-08 04:36:10,369 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:36:10" (1/1) ... [2025-03-08 04:36:10,392 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 04:36:10,621 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/list-simple/sll2n_update_all_reverse.i[24236,24249] [2025-03-08 04:36:10,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:36:10,630 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 04:36:10,659 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/list-simple/sll2n_update_all_reverse.i[24236,24249] [2025-03-08 04:36:10,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:36:10,683 INFO L204 MainTranslator]: Completed translation [2025-03-08 04:36:10,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:36:10 WrapperNode [2025-03-08 04:36:10,684 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 04:36:10,685 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 04:36:10,686 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 04:36:10,686 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 04:36:10,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:36:10" (1/1) ... [2025-03-08 04:36:10,704 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:36:10" (1/1) ... [2025-03-08 04:36:10,717 INFO L138 Inliner]: procedures = 126, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 104 [2025-03-08 04:36:10,719 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 04:36:10,720 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 04:36:10,720 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 04:36:10,720 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 04:36:10,724 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:36:10" (1/1) ... [2025-03-08 04:36:10,725 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:36:10" (1/1) ... [2025-03-08 04:36:10,731 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:36:10" (1/1) ... [2025-03-08 04:36:10,745 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2025-03-08 04:36:10,747 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:36:10" (1/1) ... [2025-03-08 04:36:10,747 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:36:10" (1/1) ... [2025-03-08 04:36:10,755 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:36:10" (1/1) ... [2025-03-08 04:36:10,755 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:36:10" (1/1) ... [2025-03-08 04:36:10,759 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:36:10" (1/1) ... [2025-03-08 04:36:10,760 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:36:10" (1/1) ... [2025-03-08 04:36:10,761 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 04:36:10,763 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 04:36:10,764 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 04:36:10,764 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 04:36:10,764 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:36:10" (1/1) ... [2025-03-08 04:36:10,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:36:10,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:36:10,786 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 04:36:10,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 04:36:10,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 04:36:10,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 04:36:10,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 04:36:10,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 04:36:10,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 04:36:10,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 04:36:10,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 04:36:10,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 04:36:10,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 04:36:10,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 04:36:10,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 04:36:10,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 04:36:10,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 04:36:10,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 04:36:10,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 04:36:10,903 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 04:36:10,905 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 04:36:11,051 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint myexit_returnLabel#1: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-03-08 04:36:11,052 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L604: havoc sll_get_data_at_#t~mem9#1; [2025-03-08 04:36:11,064 INFO L? ?]: Removed 44 outVars from TransFormulas that were not future-live. [2025-03-08 04:36:11,064 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 04:36:11,072 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 04:36:11,072 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 04:36:11,073 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:36:11 BoogieIcfgContainer [2025-03-08 04:36:11,073 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 04:36:11,075 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 04:36:11,075 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 04:36:11,078 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 04:36:11,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:36:10" (1/3) ... [2025-03-08 04:36:11,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78119806 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:36:11, skipping insertion in model container [2025-03-08 04:36:11,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:36:10" (2/3) ... [2025-03-08 04:36:11,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78119806 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:36:11, skipping insertion in model container [2025-03-08 04:36:11,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:36:11" (3/3) ... [2025-03-08 04:36:11,080 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse.i [2025-03-08 04:36:11,094 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 04:36:11,096 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2n_update_all_reverse.i that has 1 procedures, 22 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-03-08 04:36:11,136 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 04:36:11,145 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;@36672f5a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 04:36:11,145 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 04:36:11,149 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:36:11,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 04:36:11,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:36:11,153 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:36:11,153 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:36:11,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:36:11,157 INFO L85 PathProgramCache]: Analyzing trace with hash -7223182, now seen corresponding path program 1 times [2025-03-08 04:36:11,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:36:11,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806848220] [2025-03-08 04:36:11,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:36:11,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:36:11,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 04:36:11,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 04:36:11,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:36:11,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:36:11,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:36:11,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:36:11,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806848220] [2025-03-08 04:36:11,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806848220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:36:11,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:36:11,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 04:36:11,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237325369] [2025-03-08 04:36:11,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:36:11,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 04:36:11,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:36:11,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 04:36:11,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 04:36:11,368 INFO L87 Difference]: Start difference. First operand has 22 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:36:11,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:36:11,395 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2025-03-08 04:36:11,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 04:36:11,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-08 04:36:11,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:36:11,408 INFO L225 Difference]: With dead ends: 42 [2025-03-08 04:36:11,408 INFO L226 Difference]: Without dead ends: 20 [2025-03-08 04:36:11,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 04:36:11,413 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 5 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:36:11,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 49 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:36:11,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-08 04:36:11,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2025-03-08 04:36:11,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:36:11,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2025-03-08 04:36:11,440 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2025-03-08 04:36:11,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:36:11,441 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2025-03-08 04:36:11,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:36:11,441 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2025-03-08 04:36:11,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 04:36:11,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:36:11,442 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:36:11,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 04:36:11,442 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:36:11,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:36:11,442 INFO L85 PathProgramCache]: Analyzing trace with hash 2005358543, now seen corresponding path program 1 times [2025-03-08 04:36:11,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:36:11,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377327616] [2025-03-08 04:36:11,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:36:11,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:36:11,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 04:36:11,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 04:36:11,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:36:11,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:36:11,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:36:11,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:36:11,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377327616] [2025-03-08 04:36:11,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377327616] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:36:11,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298548585] [2025-03-08 04:36:11,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:36:11,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:36:11,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:36:11,619 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:36:11,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 04:36:11,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 04:36:11,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 04:36:11,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:36:11,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:36:11,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 04:36:11,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:36:11,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:36:11,739 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:36:11,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:36:11,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298548585] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:36:11,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:36:11,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-03-08 04:36:11,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82386650] [2025-03-08 04:36:11,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:36:11,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 04:36:11,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:36:11,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 04:36:11,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:36:11,765 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:36:11,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:36:11,780 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2025-03-08 04:36:11,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 04:36:11,780 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-08 04:36:11,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:36:11,780 INFO L225 Difference]: With dead ends: 31 [2025-03-08 04:36:11,781 INFO L226 Difference]: Without dead ends: 21 [2025-03-08 04:36:11,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:36:11,781 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 3 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:36:11,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 35 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:36:11,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-08 04:36:11,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-03-08 04:36:11,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:36:11,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2025-03-08 04:36:11,784 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2025-03-08 04:36:11,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:36:11,784 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2025-03-08 04:36:11,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:36:11,784 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2025-03-08 04:36:11,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 04:36:11,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:36:11,785 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:36:11,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 04:36:11,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:36:11,986 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:36:11,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:36:11,987 INFO L85 PathProgramCache]: Analyzing trace with hash -784600916, now seen corresponding path program 2 times [2025-03-08 04:36:11,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:36:11,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839877374] [2025-03-08 04:36:11,988 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:36:11,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:36:12,007 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-08 04:36:12,012 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 18 statements. [2025-03-08 04:36:12,012 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 04:36:12,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:36:12,044 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 04:36:12,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:36:12,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839877374] [2025-03-08 04:36:12,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839877374] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:36:12,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:36:12,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 04:36:12,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632223643] [2025-03-08 04:36:12,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:36:12,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 04:36:12,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:36:12,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 04:36:12,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 04:36:12,045 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:36:12,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:36:12,066 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2025-03-08 04:36:12,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 04:36:12,067 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-08 04:36:12,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:36:12,067 INFO L225 Difference]: With dead ends: 36 [2025-03-08 04:36:12,067 INFO L226 Difference]: Without dead ends: 30 [2025-03-08 04:36:12,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:36:12,068 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 33 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:36:12,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 28 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:36:12,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-08 04:36:12,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 22. [2025-03-08 04:36:12,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:36:12,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2025-03-08 04:36:12,072 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 18 [2025-03-08 04:36:12,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:36:12,072 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2025-03-08 04:36:12,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:36:12,072 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2025-03-08 04:36:12,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 04:36:12,072 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:36:12,072 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:36:12,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 04:36:12,072 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:36:12,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:36:12,073 INFO L85 PathProgramCache]: Analyzing trace with hash 894358099, now seen corresponding path program 1 times [2025-03-08 04:36:12,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:36:12,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86751587] [2025-03-08 04:36:12,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:36:12,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:36:12,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 04:36:12,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 04:36:12,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:36:12,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:36:12,238 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 04:36:12,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:36:12,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86751587] [2025-03-08 04:36:12,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86751587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:36:12,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:36:12,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 04:36:12,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236630109] [2025-03-08 04:36:12,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:36:12,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 04:36:12,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:36:12,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 04:36:12,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:36:12,241 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:36:12,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:36:12,288 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2025-03-08 04:36:12,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 04:36:12,289 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-08 04:36:12,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:36:12,290 INFO L225 Difference]: With dead ends: 40 [2025-03-08 04:36:12,290 INFO L226 Difference]: Without dead ends: 31 [2025-03-08 04:36:12,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 04:36:12,291 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 34 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:36:12,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 38 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:36:12,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-08 04:36:12,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2025-03-08 04:36:12,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:36:12,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2025-03-08 04:36:12,297 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 21 [2025-03-08 04:36:12,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:36:12,297 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2025-03-08 04:36:12,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:36:12,298 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2025-03-08 04:36:12,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 04:36:12,299 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:36:12,299 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:36:12,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 04:36:12,299 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:36:12,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:36:12,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1486241750, now seen corresponding path program 1 times [2025-03-08 04:36:12,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:36:12,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498591653] [2025-03-08 04:36:12,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:36:12,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:36:12,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 04:36:12,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 04:36:12,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:36:12,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:36:12,415 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 04:36:12,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:36:12,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498591653] [2025-03-08 04:36:12,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498591653] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:36:12,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484182231] [2025-03-08 04:36:12,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:36:12,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:36:12,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:36:12,418 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:36:12,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 04:36:12,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 04:36:12,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 04:36:12,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:36:12,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:36:12,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 04:36:12,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:36:12,581 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 04:36:12,581 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:36:12,620 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 04:36:12,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484182231] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:36:12,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:36:12,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-08 04:36:12,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237997742] [2025-03-08 04:36:12,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:36:12,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 04:36:12,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:36:12,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 04:36:12,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 04:36:12,624 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:36:12,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:36:12,670 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2025-03-08 04:36:12,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 04:36:12,670 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-08 04:36:12,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:36:12,671 INFO L225 Difference]: With dead ends: 39 [2025-03-08 04:36:12,671 INFO L226 Difference]: Without dead ends: 33 [2025-03-08 04:36:12,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-08 04:36:12,672 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 41 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:36:12,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 48 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:36:12,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-08 04:36:12,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2025-03-08 04:36:12,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:36:12,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2025-03-08 04:36:12,677 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 22 [2025-03-08 04:36:12,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:36:12,677 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2025-03-08 04:36:12,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:36:12,677 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2025-03-08 04:36:12,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 04:36:12,678 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:36:12,678 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:36:12,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 04:36:12,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:36:12,878 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:36:12,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:36:12,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1918102037, now seen corresponding path program 2 times [2025-03-08 04:36:12,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:36:12,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122322408] [2025-03-08 04:36:12,879 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:36:12,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:36:12,896 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-08 04:36:12,898 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 25 statements. [2025-03-08 04:36:12,898 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 04:36:12,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:36:12,948 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 04:36:12,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:36:12,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122322408] [2025-03-08 04:36:12,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122322408] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:36:12,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:36:12,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 04:36:12,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293758484] [2025-03-08 04:36:12,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:36:12,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 04:36:12,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:36:12,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 04:36:12,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:36:12,949 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:36:12,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:36:12,989 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2025-03-08 04:36:12,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 04:36:12,989 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-08 04:36:12,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:36:12,989 INFO L225 Difference]: With dead ends: 39 [2025-03-08 04:36:12,990 INFO L226 Difference]: Without dead ends: 33 [2025-03-08 04:36:12,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 04:36:12,990 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 26 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:36:12,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 38 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:36:12,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-08 04:36:12,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2025-03-08 04:36:12,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:36:12,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2025-03-08 04:36:12,994 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 25 [2025-03-08 04:36:12,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:36:12,995 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2025-03-08 04:36:12,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:36:12,995 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2025-03-08 04:36:12,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 04:36:12,995 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:36:12,995 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:36:12,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 04:36:12,995 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:36:12,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:36:12,996 INFO L85 PathProgramCache]: Analyzing trace with hash -667362969, now seen corresponding path program 1 times [2025-03-08 04:36:12,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:36:12,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939157499] [2025-03-08 04:36:12,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:36:12,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:36:13,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 04:36:13,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 04:36:13,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:36:13,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:36:14,329 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:36:14,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:36:14,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939157499] [2025-03-08 04:36:14,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939157499] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:36:14,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947298821] [2025-03-08 04:36:14,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:36:14,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:36:14,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:36:14,332 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:36:14,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 04:36:14,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 04:36:14,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 04:36:14,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:36:14,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:36:14,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 81 conjuncts are in the unsatisfiable core [2025-03-08 04:36:14,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:36:14,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 04:36:14,564 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 04:36:14,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-08 04:36:14,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-08 04:36:14,858 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-08 04:36:14,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 73 [2025-03-08 04:36:14,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2025-03-08 04:36:14,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 23 [2025-03-08 04:36:14,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:36:14,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 27 [2025-03-08 04:36:14,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2025-03-08 04:36:14,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:36:14,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2025-03-08 04:36:15,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2025-03-08 04:36:15,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-08 04:36:15,209 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 04:36:15,209 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:36:15,345 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_348 (Array Int Int)) (v_ArrVal_349 (Array Int Int)) (v_ArrVal_350 (Array Int Int))) (or (= (+ (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_350) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_348) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_349) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) 1) (* |c_ULTIMATE.start_main_~len~0#1| 2)) (not (= v_ArrVal_349 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))) (not (= v_ArrVal_348 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_348 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))))) is different from false [2025-03-08 04:36:15,507 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:36:15,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2025-03-08 04:36:15,517 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:36:15,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 86 [2025-03-08 04:36:15,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 20 [2025-03-08 04:36:15,628 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:36:15,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 43 [2025-03-08 04:36:15,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-08 04:36:15,937 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-03-08 04:36:15,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947298821] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:36:15,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:36:15,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 21] total 56 [2025-03-08 04:36:15,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625755484] [2025-03-08 04:36:15,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:36:15,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-03-08 04:36:15,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:36:15,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-03-08 04:36:15,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=2760, Unknown=26, NotChecked=106, Total=3080 [2025-03-08 04:36:15,940 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 56 states, 56 states have (on average 1.25) internal successors, (70), 56 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:36:16,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:36:16,990 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2025-03-08 04:36:16,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-08 04:36:16,990 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 1.25) internal successors, (70), 56 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-08 04:36:16,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:36:16,990 INFO L225 Difference]: With dead ends: 56 [2025-03-08 04:36:16,991 INFO L226 Difference]: Without dead ends: 54 [2025-03-08 04:36:16,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1127 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=427, Invalid=4953, Unknown=26, NotChecked=144, Total=5550 [2025-03-08 04:36:16,993 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 179 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 04:36:16,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 112 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 850 Invalid, 0 Unknown, 59 Unchecked, 0.4s Time] [2025-03-08 04:36:16,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-08 04:36:16,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2025-03-08 04:36:16,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:36:16,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2025-03-08 04:36:16,997 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 26 [2025-03-08 04:36:16,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:36:16,998 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2025-03-08 04:36:16,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 1.25) internal successors, (70), 56 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:36:16,998 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2025-03-08 04:36:16,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 04:36:16,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:36:16,998 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:36:17,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 04:36:17,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:36:17,201 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:36:17,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:36:17,201 INFO L85 PathProgramCache]: Analyzing trace with hash 787600469, now seen corresponding path program 2 times [2025-03-08 04:36:17,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:36:17,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738331182] [2025-03-08 04:36:17,201 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:36:17,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:36:17,212 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-08 04:36:17,219 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 04:36:17,219 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:36:17,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:36:17,285 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 04:36:17,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:36:17,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738331182] [2025-03-08 04:36:17,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738331182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:36:17,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:36:17,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 04:36:17,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660758243] [2025-03-08 04:36:17,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:36:17,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 04:36:17,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:36:17,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 04:36:17,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 04:36:17,286 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:36:17,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:36:17,318 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2025-03-08 04:36:17,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 04:36:17,318 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-08 04:36:17,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:36:17,319 INFO L225 Difference]: With dead ends: 50 [2025-03-08 04:36:17,319 INFO L226 Difference]: Without dead ends: 44 [2025-03-08 04:36:17,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-08 04:36:17,320 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 24 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:36:17,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 37 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:36:17,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-08 04:36:17,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2025-03-08 04:36:17,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:36:17,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2025-03-08 04:36:17,325 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 27 [2025-03-08 04:36:17,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:36:17,325 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2025-03-08 04:36:17,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:36:17,325 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2025-03-08 04:36:17,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 04:36:17,329 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:36:17,329 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:36:17,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 04:36:17,329 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:36:17,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:36:17,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1442575668, now seen corresponding path program 3 times [2025-03-08 04:36:17,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:36:17,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295385558] [2025-03-08 04:36:17,330 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 04:36:17,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:36:17,340 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 4 equivalence classes. [2025-03-08 04:36:17,355 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 04:36:17,355 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-08 04:36:17,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:36:17,394 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 04:36:17,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:36:17,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295385558] [2025-03-08 04:36:17,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295385558] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:36:17,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571106198] [2025-03-08 04:36:17,395 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 04:36:17,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:36:17,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:36:17,397 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:36:17,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 04:36:17,469 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 4 equivalence classes. [2025-03-08 04:36:17,512 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 04:36:17,512 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-08 04:36:17,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:36:17,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 04:36:17,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:36:17,521 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 04:36:17,521 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:36:17,536 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 04:36:17,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571106198] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 04:36:17,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 04:36:17,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 6 [2025-03-08 04:36:17,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461482343] [2025-03-08 04:36:17,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:36:17,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 04:36:17,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:36:17,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 04:36:17,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 04:36:17,537 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:36:17,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:36:17,563 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2025-03-08 04:36:17,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 04:36:17,563 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-08 04:36:17,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:36:17,564 INFO L225 Difference]: With dead ends: 52 [2025-03-08 04:36:17,564 INFO L226 Difference]: Without dead ends: 43 [2025-03-08 04:36:17,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 04:36:17,565 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 6 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:36:17,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 46 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:36:17,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-08 04:36:17,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2025-03-08 04:36:17,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:36:17,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2025-03-08 04:36:17,569 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 27 [2025-03-08 04:36:17,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:36:17,569 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2025-03-08 04:36:17,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:36:17,569 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2025-03-08 04:36:17,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 04:36:17,570 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:36:17,570 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:36:17,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 04:36:17,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:36:17,771 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:36:17,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:36:17,772 INFO L85 PathProgramCache]: Analyzing trace with hash -2117338640, now seen corresponding path program 4 times [2025-03-08 04:36:17,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:36:17,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144052320] [2025-03-08 04:36:17,772 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 04:36:17,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:36:17,782 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-08 04:36:17,788 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 25 of 27 statements. [2025-03-08 04:36:17,788 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 04:36:17,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:36:17,842 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 04:36:17,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:36:17,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144052320] [2025-03-08 04:36:17,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144052320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:36:17,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:36:17,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 04:36:17,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617448193] [2025-03-08 04:36:17,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:36:17,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 04:36:17,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:36:17,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 04:36:17,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 04:36:17,843 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:36:17,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:36:17,870 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2025-03-08 04:36:17,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 04:36:17,871 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-08 04:36:17,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:36:17,871 INFO L225 Difference]: With dead ends: 55 [2025-03-08 04:36:17,873 INFO L226 Difference]: Without dead ends: 40 [2025-03-08 04:36:17,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-08 04:36:17,873 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 24 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:36:17,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 31 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:36:17,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-08 04:36:17,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-08 04:36:17,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 39 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:36:17,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2025-03-08 04:36:17,878 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 27 [2025-03-08 04:36:17,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:36:17,879 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2025-03-08 04:36:17,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:36:17,879 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2025-03-08 04:36:17,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-08 04:36:17,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:36:17,879 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:36:17,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 04:36:17,880 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:36:17,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:36:17,880 INFO L85 PathProgramCache]: Analyzing trace with hash -131930262, now seen corresponding path program 1 times [2025-03-08 04:36:17,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:36:17,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247588848] [2025-03-08 04:36:17,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:36:17,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:36:17,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 04:36:17,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 04:36:17,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:36:17,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:36:18,191 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 04:36:18,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:36:18,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247588848] [2025-03-08 04:36:18,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247588848] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:36:18,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214691930] [2025-03-08 04:36:18,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:36:18,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:36:18,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:36:18,194 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:36:18,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 04:36:18,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 04:36:18,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 04:36:18,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:36:18,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:36:18,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-08 04:36:18,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:36:18,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-03-08 04:36:18,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2025-03-08 04:36:18,472 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 04:36:18,472 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:36:18,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2025-03-08 04:36:18,510 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 04:36:18,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214691930] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:36:18,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:36:18,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 22 [2025-03-08 04:36:18,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273919642] [2025-03-08 04:36:18,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:36:18,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 04:36:18,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:36:18,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 04:36:18,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2025-03-08 04:36:18,511 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 22 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 22 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:36:18,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:36:18,791 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2025-03-08 04:36:18,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 04:36:18,792 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 22 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-03-08 04:36:18,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:36:18,793 INFO L225 Difference]: With dead ends: 51 [2025-03-08 04:36:18,793 INFO L226 Difference]: Without dead ends: 36 [2025-03-08 04:36:18,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=947, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 04:36:18,794 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 74 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:36:18,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 90 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 04:36:18,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-08 04:36:18,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2025-03-08 04:36:18,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:36:18,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2025-03-08 04:36:18,798 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 30 [2025-03-08 04:36:18,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:36:18,799 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2025-03-08 04:36:18,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 22 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:36:18,799 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2025-03-08 04:36:18,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-08 04:36:18,799 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:36:18,799 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:36:18,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 04:36:18,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-08 04:36:19,000 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:36:19,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:36:19,000 INFO L85 PathProgramCache]: Analyzing trace with hash 206145202, now seen corresponding path program 2 times [2025-03-08 04:36:19,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:36:19,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137050685] [2025-03-08 04:36:19,000 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:36:19,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:36:19,014 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-08 04:36:19,027 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 04:36:19,027 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:36:19,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:36:19,096 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 04:36:19,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:36:19,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137050685] [2025-03-08 04:36:19,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137050685] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:36:19,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7146360] [2025-03-08 04:36:19,096 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:36:19,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:36:19,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:36:19,099 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:36:19,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 04:36:19,186 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-08 04:36:19,216 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 04:36:19,216 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:36:19,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:36:19,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 04:36:19,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:36:19,260 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 04:36:19,260 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:36:19,299 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 04:36:19,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7146360] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:36:19,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:36:19,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-03-08 04:36:19,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095293612] [2025-03-08 04:36:19,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:36:19,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 04:36:19,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:36:19,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 04:36:19,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 04:36:19,300 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:36:19,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:36:19,341 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2025-03-08 04:36:19,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 04:36:19,342 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-03-08 04:36:19,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:36:19,342 INFO L225 Difference]: With dead ends: 38 [2025-03-08 04:36:19,342 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 04:36:19,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-08 04:36:19,343 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 18 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:36:19,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 51 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:36:19,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 04:36:19,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 04:36:19,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:36:19,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 04:36:19,344 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2025-03-08 04:36:19,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:36:19,344 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 04:36:19,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:36:19,344 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 04:36:19,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 04:36:19,346 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 04:36:19,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 04:36:19,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:36:19,550 INFO L422 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 1, 1] [2025-03-08 04:36:19,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 04:36:19,752 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 04:36:19,759 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 04:36:19,760 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 04:36:19,760 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-03-08 04:36:19,760 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-03-08 04:36:19,760 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-03-08 04:36:19,760 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-03-08 04:36:19,760 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!base [2025-03-08 04:36:19,760 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 04:36:19,760 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 04:36:19,760 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IntegerLiteral[4]]]]] [2025-03-08 04:36:19,760 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 04:36:19,760 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 04:36:19,760 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-03-08 04:36:19,760 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2025-03-08 04:36:19,762 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-03-08 04:36:19,762 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~expected~0 [2025-03-08 04:36:19,762 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 04:36:19,763 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 04:36:19,763 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~head!base,]]] [2025-03-08 04:36:19,763 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 04:36:19,763 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 04:36:19,763 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-03-08 04:36:19,763 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 04:36:19,763 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 04:36:19,763 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~head!base,]]] [2025-03-08 04:36:19,763 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2025-03-08 04:36:19,763 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 04:36:19,763 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 04:36:19,763 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~head!base,]]] [2025-03-08 04:36:19,763 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-03-08 04:36:19,763 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-03-08 04:36:19,763 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-03-08 04:36:19,763 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-03-08 04:36:19,763 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!base [2025-03-08 04:36:19,763 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~expected~0 [2025-03-08 04:36:19,763 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 04:36:19,763 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 04:36:19,763 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IntegerLiteral[4]]]]] [2025-03-08 04:36:19,763 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 04:36:19,763 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 04:36:19,763 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-03-08 04:36:19,763 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2025-03-08 04:36:19,763 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2025-03-08 04:36:19,763 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-03-08 04:36:19,764 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 04:36:19,764 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 04:36:19,764 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head!base,]]],[IntegerLiteral[4]]]]] [2025-03-08 04:36:19,764 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-03-08 04:36:19,764 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-03-08 04:36:19,764 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-03-08 04:36:19,764 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!base [2025-03-08 04:36:19,764 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~expected~0 [2025-03-08 04:36:19,764 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 04:36:19,764 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 04:36:19,764 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IntegerLiteral[4]]]]] [2025-03-08 04:36:19,764 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 04:36:19,764 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 04:36:19,764 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-03-08 04:36:19,764 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2025-03-08 04:36:19,764 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-03-08 04:36:19,764 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-03-08 04:36:19,764 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head!base,]]] [2025-03-08 04:36:19,764 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!base [2025-03-08 04:36:19,764 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!offset [2025-03-08 04:36:19,764 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2025-03-08 04:36:19,765 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-03-08 04:36:19,765 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-03-08 04:36:19,765 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-03-08 04:36:19,765 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!base [2025-03-08 04:36:19,765 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 04:36:19,765 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 04:36:19,765 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IntegerLiteral[4]]]]] [2025-03-08 04:36:19,765 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2025-03-08 04:36:19,765 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-03-08 04:36:19,765 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-03-08 04:36:19,765 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-03-08 04:36:19,765 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!base [2025-03-08 04:36:19,765 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2025-03-08 04:36:19,765 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-03-08 04:36:19,765 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-03-08 04:36:19,765 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-03-08 04:36:19,765 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!base [2025-03-08 04:36:19,765 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 04:36:19,765 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 04:36:19,765 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IntegerLiteral[4]]]]] [2025-03-08 04:36:19,766 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 04:36:19,766 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 04:36:19,766 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-03-08 04:36:19,768 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2025-03-08 04:36:19,769 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!base [2025-03-08 04:36:19,769 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!base [2025-03-08 04:36:19,769 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-03-08 04:36:19,769 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2025-03-08 04:36:19,769 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2025-03-08 04:36:19,769 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-03-08 04:36:19,769 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!offset [2025-03-08 04:36:19,769 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2025-03-08 04:36:19,769 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!base [2025-03-08 04:36:19,770 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-03-08 04:36:19,770 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-03-08 04:36:19,770 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-03-08 04:36:19,770 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2025-03-08 04:36:19,770 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-03-08 04:36:19,770 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 04:36:19,770 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 04:36:19,770 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head!base,]]],[IntegerLiteral[4]]]]] [2025-03-08 04:36:19,770 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!offset [2025-03-08 04:36:19,770 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2025-03-08 04:36:19,770 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!base [2025-03-08 04:36:19,770 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!base [2025-03-08 04:36:19,770 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2025-03-08 04:36:19,770 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!base [2025-03-08 04:36:19,770 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-03-08 04:36:19,770 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-03-08 04:36:19,770 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head!base,]]] [2025-03-08 04:36:19,770 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-03-08 04:36:19,770 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-03-08 04:36:19,770 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-03-08 04:36:19,770 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head!base,]]] [2025-03-08 04:36:19,770 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!base [2025-03-08 04:36:19,770 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!offset [2025-03-08 04:36:19,770 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2025-03-08 04:36:19,770 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!base [2025-03-08 04:36:19,771 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!base [2025-03-08 04:36:19,771 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2025-03-08 04:36:19,771 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2025-03-08 04:36:19,771 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2025-03-08 04:36:19,771 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2025-03-08 04:36:19,771 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2025-03-08 04:36:19,771 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-03-08 04:36:19,771 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-03-08 04:36:19,771 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2025-03-08 04:36:19,775 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2025-03-08 04:36:19,776 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2025-03-08 04:36:19,776 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 04:36:19 BoogieIcfgContainer [2025-03-08 04:36:19,776 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 04:36:19,777 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 04:36:19,777 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 04:36:19,777 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 04:36:19,777 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:36:11" (3/4) ... [2025-03-08 04:36:19,779 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 04:36:19,789 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-03-08 04:36:19,789 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-08 04:36:19,789 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 04:36:19,789 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 04:36:19,851 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 04:36:19,851 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 04:36:19,851 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 04:36:19,851 INFO L158 Benchmark]: Toolchain (without parser) took 9487.34ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 111.9MB in the beginning and 132.7MB in the end (delta: -20.8MB). Peak memory consumption was 88.3MB. Max. memory is 16.1GB. [2025-03-08 04:36:19,851 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 121.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 04:36:19,852 INFO L158 Benchmark]: CACSL2BoogieTranslator took 319.57ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 94.0MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 04:36:19,852 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.14ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 92.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 04:36:19,852 INFO L158 Benchmark]: Boogie Preprocessor took 41.79ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 90.1MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 04:36:19,852 INFO L158 Benchmark]: IcfgBuilder took 309.87ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 74.4MB in the end (delta: 15.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 04:36:19,852 INFO L158 Benchmark]: TraceAbstraction took 8701.34ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 73.8MB in the beginning and 138.7MB in the end (delta: -64.9MB). Peak memory consumption was 38.0MB. Max. memory is 16.1GB. [2025-03-08 04:36:19,852 INFO L158 Benchmark]: Witness Printer took 74.21ms. Allocated memory is still 251.7MB. Free memory was 138.7MB in the beginning and 132.7MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 04:36:19,853 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.20ms. Allocated memory is still 201.3MB. Free memory is still 121.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 319.57ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 94.0MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.14ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 92.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.79ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 90.1MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 309.87ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 74.4MB in the end (delta: 15.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 8701.34ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 73.8MB in the beginning and 138.7MB in the end (delta: -64.9MB). Peak memory consumption was 38.0MB. Max. memory is 16.1GB. * Witness Printer took 74.21ms. Allocated memory is still 251.7MB. Free memory was 138.7MB in the beginning and 132.7MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~expected~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~head!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~head!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~head!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~expected~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head!base,]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~expected~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head!base,]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] * 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: 630]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 22 locations, 29 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.4s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 467 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 467 mSDsluCounter, 603 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 59 IncrementalHoareTripleChecker+Unchecked, 436 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1304 IncrementalHoareTripleChecker+Invalid, 1403 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 167 mSDtfsCounter, 1304 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 423 GetRequests, 258 SyntacticMatches, 8 SemanticMatches, 157 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1324 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=8, InterpolantAutomatonStates: 88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 57 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 428 NumberOfCodeBlocks, 403 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 554 ConstructedInterpolants, 4 QuantifiedInterpolants, 2592 SizeOfPredicates, 21 NumberOfNonLiveVariables, 1521 ConjunctsInSsa, 140 ConjunctsInUnsatCore, 24 InterpolantComputations, 7 PerfectInterpolantSequences, 212/302 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 622]: Location Invariant Derived location invariant: (((i <= 0) && (len == 2)) || ((i == 1) && (len == 2))) - InvariantResult [Line: 600]: Location Invariant Derived location invariant: (((index <= 0) || (index <= 0)) || (index == 1)) - InvariantResult [Line: 618]: Location Invariant Derived location invariant: ((((i == 0) && (len == 2)) || ((i == 1) && (len == 2))) || ((i <= 0) && (len == 2))) - InvariantResult [Line: 607]: Location Invariant Derived location invariant: ((((3 == data) && (index == 0)) || ((2 == data) && (index == 0))) || ((index == 1) && (3 == data))) - InvariantResult [Line: 585]: Location Invariant Derived location invariant: ((((2 == len) && (len == 2)) || (len == 2)) || ((1 <= len) && (len == 2))) RESULT: Ultimate proved your program to be correct! [2025-03-08 04:36:19,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE