./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-ext2-properties/simple_search_value-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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-ext2-properties/simple_search_value-1.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 9339a3186df1139a7984a9803a310ef99d020bdafafac2d122ebd6ff2b132483 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 13:15:06,387 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 13:15:06,441 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 13:15:06,445 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 13:15:06,445 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 13:15:06,465 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 13:15:06,466 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 13:15:06,466 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 13:15:06,466 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 13:15:06,466 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 13:15:06,466 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 13:15:06,466 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 13:15:06,466 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 13:15:06,466 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 13:15:06,466 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 13:15:06,467 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 13:15:06,467 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 13:15:06,467 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 13:15:06,467 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 13:15:06,467 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 13:15:06,467 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 13:15:06,467 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 13:15:06,467 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 13:15:06,467 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 13:15:06,467 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 13:15:06,467 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 13:15:06,467 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 13:15:06,467 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 13:15:06,467 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 13:15:06,467 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 13:15:06,467 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 13:15:06,467 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 13:15:06,467 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:15:06,467 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 13:15:06,467 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 13:15:06,468 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 13:15:06,468 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 13:15:06,468 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 13:15:06,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 13:15:06,468 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 13:15:06,468 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 13:15:06,468 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 13:15:06,468 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 13:15:06,468 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 -> 9339a3186df1139a7984a9803a310ef99d020bdafafac2d122ebd6ff2b132483 [2025-03-03 13:15:06,686 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 13:15:06,693 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 13:15:06,696 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 13:15:06,697 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 13:15:06,697 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 13:15:06,698 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext2-properties/simple_search_value-1.i [2025-03-03 13:15:07,860 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffeb882b3/1c98aa7029a044598e8bd14eb0127826/FLAGc750a373d [2025-03-03 13:15:08,146 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 13:15:08,147 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/simple_search_value-1.i [2025-03-03 13:15:08,164 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffeb882b3/1c98aa7029a044598e8bd14eb0127826/FLAGc750a373d [2025-03-03 13:15:08,181 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffeb882b3/1c98aa7029a044598e8bd14eb0127826 [2025-03-03 13:15:08,183 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 13:15:08,185 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 13:15:08,186 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 13:15:08,186 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 13:15:08,189 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 13:15:08,191 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:15:08" (1/1) ... [2025-03-03 13:15:08,192 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@117156d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:15:08, skipping insertion in model container [2025-03-03 13:15:08,192 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:15:08" (1/1) ... [2025-03-03 13:15:08,219 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 13:15:08,436 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-ext2-properties/simple_search_value-1.i[23210,23223] [2025-03-03 13:15:08,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:15:08,446 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 13:15:08,478 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-ext2-properties/simple_search_value-1.i[23210,23223] [2025-03-03 13:15:08,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:15:08,496 INFO L204 MainTranslator]: Completed translation [2025-03-03 13:15:08,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:15:08 WrapperNode [2025-03-03 13:15:08,497 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 13:15:08,498 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 13:15:08,498 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 13:15:08,498 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 13:15:08,502 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:15:08" (1/1) ... [2025-03-03 13:15:08,509 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:15:08" (1/1) ... [2025-03-03 13:15:08,522 INFO L138 Inliner]: procedures = 122, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 66 [2025-03-03 13:15:08,522 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 13:15:08,523 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 13:15:08,523 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 13:15:08,523 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 13:15:08,529 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:15:08" (1/1) ... [2025-03-03 13:15:08,529 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:15:08" (1/1) ... [2025-03-03 13:15:08,531 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:15:08" (1/1) ... [2025-03-03 13:15:08,538 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-03 13:15:08,538 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:15:08" (1/1) ... [2025-03-03 13:15:08,539 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:15:08" (1/1) ... [2025-03-03 13:15:08,542 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:15:08" (1/1) ... [2025-03-03 13:15:08,543 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:15:08" (1/1) ... [2025-03-03 13:15:08,543 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:15:08" (1/1) ... [2025-03-03 13:15:08,544 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:15:08" (1/1) ... [2025-03-03 13:15:08,545 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 13:15:08,546 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 13:15:08,546 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 13:15:08,546 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 13:15:08,547 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:15:08" (1/1) ... [2025-03-03 13:15:08,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:15:08,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:15:08,571 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-03 13:15:08,576 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-03 13:15:08,594 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2025-03-03 13:15:08,594 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2025-03-03 13:15:08,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 13:15:08,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 13:15:08,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 13:15:08,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 13:15:08,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-03 13:15:08,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 13:15:08,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-03 13:15:08,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-03 13:15:08,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-03 13:15:08,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-03 13:15:08,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 13:15:08,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 13:15:08,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 13:15:08,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 13:15:08,659 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 13:15:08,660 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 13:15:08,689 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2025-03-03 13:15:08,799 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-03-03 13:15:08,800 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 13:15:08,806 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 13:15:08,807 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 13:15:08,807 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:15:08 BoogieIcfgContainer [2025-03-03 13:15:08,808 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 13:15:08,810 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 13:15:08,810 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 13:15:08,813 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 13:15:08,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 01:15:08" (1/3) ... [2025-03-03 13:15:08,815 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cfd9552 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:15:08, skipping insertion in model container [2025-03-03 13:15:08,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:15:08" (2/3) ... [2025-03-03 13:15:08,815 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cfd9552 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:15:08, skipping insertion in model container [2025-03-03 13:15:08,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:15:08" (3/3) ... [2025-03-03 13:15:08,816 INFO L128 eAbstractionObserver]: Analyzing ICFG simple_search_value-1.i [2025-03-03 13:15:08,828 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 13:15:08,830 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG simple_search_value-1.i that has 2 procedures, 27 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-03 13:15:08,869 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 13:15:08,878 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;@2c87db4c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 13:15:08,878 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 13:15:08,881 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 24 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:15:08,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-03 13:15:08,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:15:08,886 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:15:08,887 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:15:08,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:15:08,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1907014080, now seen corresponding path program 1 times [2025-03-03 13:15:08,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:15:08,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174554792] [2025-03-03 13:15:08,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:15:08,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:15:08,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-03 13:15:08,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-03 13:15:08,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:15:08,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:15:09,008 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-03 13:15:09,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:15:09,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174554792] [2025-03-03 13:15:09,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174554792] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:15:09,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:15:09,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 13:15:09,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720471837] [2025-03-03 13:15:09,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:15:09,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 13:15:09,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:15:09,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 13:15:09,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 13:15:09,032 INFO L87 Difference]: Start difference. First operand has 26 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 24 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-03 13:15:09,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:15:09,041 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2025-03-03 13:15:09,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 13:15:09,043 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2025-03-03 13:15:09,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:15:09,046 INFO L225 Difference]: With dead ends: 39 [2025-03-03 13:15:09,046 INFO L226 Difference]: Without dead ends: 18 [2025-03-03 13:15:09,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 13:15:09,050 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:15:09,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:15:09,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-03-03 13:15:09,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-03-03 13:15:09,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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-03 13:15:09,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2025-03-03 13:15:09,074 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 9 [2025-03-03 13:15:09,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:15:09,074 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-03-03 13:15:09,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-03 13:15:09,075 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2025-03-03 13:15:09,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-03 13:15:09,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:15:09,075 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:15:09,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 13:15:09,078 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:15:09,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:15:09,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1932649859, now seen corresponding path program 1 times [2025-03-03 13:15:09,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:15:09,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800878656] [2025-03-03 13:15:09,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:15:09,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:15:09,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-03 13:15:09,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-03 13:15:09,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:15:09,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:15:09,229 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-03 13:15:09,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:15:09,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800878656] [2025-03-03 13:15:09,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800878656] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:15:09,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:15:09,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 13:15:09,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365886961] [2025-03-03 13:15:09,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:15:09,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 13:15:09,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:15:09,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 13:15:09,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 13:15:09,232 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-03 13:15:09,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:15:09,277 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2025-03-03 13:15:09,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:15:09,279 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2025-03-03 13:15:09,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:15:09,279 INFO L225 Difference]: With dead ends: 38 [2025-03-03 13:15:09,279 INFO L226 Difference]: Without dead ends: 24 [2025-03-03 13:15:09,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-03 13:15:09,280 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 5 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 49 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-03 13:15:09,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 49 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:15:09,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-03 13:15:09,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2025-03-03 13:15:09,285 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-03 13:15:09,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2025-03-03 13:15:09,286 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 11 [2025-03-03 13:15:09,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:15:09,286 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2025-03-03 13:15:09,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-03 13:15:09,286 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2025-03-03 13:15:09,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-03 13:15:09,287 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:15:09,287 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:15:09,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 13:15:09,287 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:15:09,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:15:09,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1682097954, now seen corresponding path program 1 times [2025-03-03 13:15:09,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:15:09,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682860131] [2025-03-03 13:15:09,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:15:09,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:15:09,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-03 13:15:09,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 13:15:09,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:15:09,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:15:09,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 13:15:09,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:15:09,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682860131] [2025-03-03 13:15:09,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682860131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:15:09,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:15:09,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 13:15:09,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896292735] [2025-03-03 13:15:09,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:15:09,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 13:15:09,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:15:09,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 13:15:09,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 13:15:09,434 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-03 13:15:09,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:15:09,471 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2025-03-03 13:15:09,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:15:09,471 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 16 [2025-03-03 13:15:09,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:15:09,472 INFO L225 Difference]: With dead ends: 32 [2025-03-03 13:15:09,472 INFO L226 Difference]: Without dead ends: 29 [2025-03-03 13:15:09,472 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-03 13:15:09,472 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 10 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:15:09,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 34 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:15:09,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-03 13:15:09,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2025-03-03 13:15:09,474 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-03 13:15:09,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2025-03-03 13:15:09,477 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 16 [2025-03-03 13:15:09,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:15:09,478 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2025-03-03 13:15:09,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-03 13:15:09,479 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2025-03-03 13:15:09,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-03 13:15:09,479 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:15:09,479 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:15:09,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 13:15:09,479 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:15:09,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:15:09,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1374651990, now seen corresponding path program 1 times [2025-03-03 13:15:09,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:15:09,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418874645] [2025-03-03 13:15:09,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:15:09,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:15:09,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-03 13:15:09,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-03 13:15:09,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:15:09,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:15:09,627 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 13:15:09,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:15:09,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418874645] [2025-03-03 13:15:09,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418874645] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:15:09,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014029347] [2025-03-03 13:15:09,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:15:09,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:15:09,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:15:09,631 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-03 13:15:09,631 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-03 13:15:09,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-03 13:15:09,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-03 13:15:09,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:15:09,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:15:09,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 13:15:09,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:15:09,749 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 13:15:09,749 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:15:09,778 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 13:15:09,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014029347] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:15:09,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:15:09,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-03 13:15:09,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000163918] [2025-03-03 13:15:09,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:15:09,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 13:15:09,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:15:09,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 13:15:09,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-03 13:15:09,780 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 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-03 13:15:09,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:15:09,854 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2025-03-03 13:15:09,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 13:15:09,855 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 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-03 13:15:09,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:15:09,856 INFO L225 Difference]: With dead ends: 56 [2025-03-03 13:15:09,856 INFO L226 Difference]: Without dead ends: 40 [2025-03-03 13:15:09,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2025-03-03 13:15:09,857 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 12 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:15:09,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 95 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:15:09,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-03 13:15:09,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2025-03-03 13:15:09,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 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-03 13:15:09,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2025-03-03 13:15:09,860 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 21 [2025-03-03 13:15:09,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:15:09,860 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2025-03-03 13:15:09,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 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-03 13:15:09,860 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2025-03-03 13:15:09,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 13:15:09,861 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:15:09,861 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:15:09,867 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-03 13:15:10,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:15:10,065 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:15:10,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:15:10,067 INFO L85 PathProgramCache]: Analyzing trace with hash -749193513, now seen corresponding path program 2 times [2025-03-03 13:15:10,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:15:10,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395384384] [2025-03-03 13:15:10,067 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:15:10,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:15:10,089 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-03 13:15:10,115 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 13:15:10,115 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:15:10,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:15:10,305 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 13:15:10,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:15:10,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395384384] [2025-03-03 13:15:10,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395384384] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:15:10,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858043611] [2025-03-03 13:15:10,306 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:15:10,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:15:10,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:15:10,308 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-03 13:15:10,310 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-03 13:15:10,371 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-03 13:15:10,405 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 13:15:10,406 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:15:10,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:15:10,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 13:15:10,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:15:10,449 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 13:15:10,449 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:15:10,538 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 13:15:10,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858043611] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:15:10,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:15:10,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-03-03 13:15:10,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961500480] [2025-03-03 13:15:10,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:15:10,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 13:15:10,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:15:10,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 13:15:10,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2025-03-03 13:15:10,540 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 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-03 13:15:10,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:15:10,689 INFO L93 Difference]: Finished difference Result 86 states and 100 transitions. [2025-03-03 13:15:10,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-03 13:15:10,689 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 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 36 [2025-03-03 13:15:10,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:15:10,690 INFO L225 Difference]: With dead ends: 86 [2025-03-03 13:15:10,690 INFO L226 Difference]: Without dead ends: 70 [2025-03-03 13:15:10,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=211, Invalid=341, Unknown=0, NotChecked=0, Total=552 [2025-03-03 13:15:10,691 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 18 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:15:10,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 115 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:15:10,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-03 13:15:10,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2025-03-03 13:15:10,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.0757575757575757) internal successors, (71), 66 states have internal predecessors, (71), 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-03 13:15:10,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2025-03-03 13:15:10,695 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 36 [2025-03-03 13:15:10,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:15:10,696 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2025-03-03 13:15:10,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 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-03 13:15:10,696 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2025-03-03 13:15:10,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 13:15:10,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:15:10,697 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:15:10,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 13:15:10,901 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-03 13:15:10,901 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:15:10,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:15:10,902 INFO L85 PathProgramCache]: Analyzing trace with hash -161747721, now seen corresponding path program 3 times [2025-03-03 13:15:10,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:15:10,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725205709] [2025-03-03 13:15:10,902 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:15:10,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:15:10,929 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 66 statements into 11 equivalence classes. [2025-03-03 13:15:11,057 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 13:15:11,058 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-03 13:15:11,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:15:13,972 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 163 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2025-03-03 13:15:13,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:15:13,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725205709] [2025-03-03 13:15:13,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725205709] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:15:13,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980553062] [2025-03-03 13:15:13,973 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:15:13,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:15:13,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:15:13,975 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-03 13:15:13,977 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-03 13:15:14,064 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 66 statements into 11 equivalence classes. [2025-03-03 13:15:21,146 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 13:15:21,146 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-03 13:15:21,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:15:21,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 120 conjuncts are in the unsatisfiable core [2025-03-03 13:15:21,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:15:21,199 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-03 13:15:21,259 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-03 13:15:21,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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-03 13:15:21,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 13:15:21,357 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-03-03 13:15:21,357 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2025-03-03 13:15:21,406 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-03 13:15:21,406 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 33 treesize of output 32 [2025-03-03 13:15:21,457 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-03 13:15:21,457 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 22 [2025-03-03 13:15:21,475 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 13 treesize of output 9 [2025-03-03 13:15:21,541 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2025-03-03 13:15:21,541 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 1 case distinctions, treesize of input 37 treesize of output 25 [2025-03-03 13:15:21,599 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-03 13:15:21,599 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 16 [2025-03-03 13:15:21,657 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2025-03-03 13:15:21,658 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 1 case distinctions, treesize of input 28 treesize of output 20 [2025-03-03 13:15:21,717 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-03 13:15:21,718 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 16 [2025-03-03 13:15:21,753 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2025-03-03 13:15:21,754 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 1 case distinctions, treesize of input 28 treesize of output 20 [2025-03-03 13:15:21,813 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-03 13:15:21,813 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 16 [2025-03-03 13:15:21,846 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2025-03-03 13:15:21,847 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 1 case distinctions, treesize of input 28 treesize of output 20 [2025-03-03 13:15:21,893 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-03 13:15:21,893 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 16 [2025-03-03 13:15:21,927 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2025-03-03 13:15:21,927 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 1 case distinctions, treesize of input 28 treesize of output 20 [2025-03-03 13:15:21,960 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-03 13:15:21,961 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 16 [2025-03-03 13:15:21,989 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2025-03-03 13:15:21,990 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 1 case distinctions, treesize of input 28 treesize of output 20 [2025-03-03 13:15:22,020 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-03 13:15:22,021 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 16 [2025-03-03 13:15:22,052 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2025-03-03 13:15:22,052 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 1 case distinctions, treesize of input 28 treesize of output 20 [2025-03-03 13:15:22,083 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-03 13:15:22,083 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 16 [2025-03-03 13:15:22,114 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2025-03-03 13:15:22,114 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 1 case distinctions, treesize of input 28 treesize of output 20 [2025-03-03 13:15:22,243 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 22 treesize of output 1 [2025-03-03 13:15:22,253 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-03 13:15:22,253 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 16 [2025-03-03 13:15:22,318 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:15:22,319 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 32 treesize of output 28 [2025-03-03 13:15:22,369 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 16 treesize of output 8 [2025-03-03 13:15:22,385 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 14 proven. 130 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-03 13:15:22,385 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:15:22,471 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 170 treesize of output 162 [2025-03-03 13:15:22,499 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse1 (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_ArrVal_583 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_583) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 0))))) (and (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_ArrVal_583 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_583) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 0)) (= |c_ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|))) (or (< 6 |c_ULTIMATE.start_main_~counter~0#1|) .cse1) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|) .cse1)))) is different from false [2025-03-03 13:15:22,731 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:15:22,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 50 [2025-03-03 13:15:26,770 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse1 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (and (forall ((v_arrayElimArr_1 (Array Int Int))) (or (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_ArrVal_583 (Array Int Int)) (v_subst_2 Int)) (or (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_1) v_subst_2 v_ArrVal_583) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 0)) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_2))) (= (select v_arrayElimArr_1 .cse1) 0))) (or (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int)) (v_prenex_1 (Array Int Int)) (v_subst_1 Int)) (or (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_1) v_subst_1 v_prenex_1) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 0)) (= (select v_arrayElimArr_1 .cse1) 0))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)))) is different from false [2025-03-03 13:15:26,830 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse2 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4))) (and (or (forall ((v_arrayElimArr_1 (Array Int Int)) (v_prenex_1 (Array Int Int)) (v_subst_4 Int) (v_subst_1 Int)) (or (not (= (select (select (store (store .cse0 v_subst_4 v_arrayElimArr_1) v_subst_1 v_prenex_1) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0)) (= (select v_arrayElimArr_1 .cse2) 0))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (forall ((v_arrayElimArr_1 (Array Int Int))) (or (forall ((v_subst_3 Int) (v_ArrVal_583 (Array Int Int)) (v_subst_2 Int)) (or (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_2) (not (= (select (select (store (store .cse0 v_subst_3 v_arrayElimArr_1) v_subst_2 v_ArrVal_583) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0)))) (= (select v_arrayElimArr_1 .cse2) 0))))) is different from false [2025-03-03 13:15:26,860 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:15:26,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 66 [2025-03-03 13:15:26,901 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse1 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (and (or (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_prenex_1 (Array Int Int)) (v_subst_4 Int) (v_prenex_3 (Array Int Int)) (v_subst_1 Int)) (or (not (= (select (select (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_2) v_subst_4 v_prenex_3) v_subst_1 v_prenex_1) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 0)) (= (select v_prenex_3 4) 0) (= (select v_arrayElimArr_2 .cse1) 0)))) (forall ((v_arrayElimArr_2 (Array Int Int))) (or (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int)) (v_subst_3 Int) (v_ArrVal_583 (Array Int Int)) (v_subst_2 Int)) (or (not (= (select (select (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_2) v_subst_3 v_arrayElimArr_1) v_subst_2 v_ArrVal_583) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 0)) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_2) (= (select v_arrayElimArr_1 4) 0))) (= (select v_arrayElimArr_2 .cse1) 0))))) is different from false [2025-03-03 13:15:26,978 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4)) (.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_arrayElimArr_2 (Array Int Int))) (or (= (select v_arrayElimArr_2 .cse0) 0) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_subst_5 Int) (v_subst_3 Int) (v_ArrVal_583 (Array Int Int)) (v_subst_2 Int)) (or (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_2) (= (select v_arrayElimArr_1 4) 0) (not (= (select (select (store (store (store .cse1 v_subst_5 v_arrayElimArr_2) v_subst_3 v_arrayElimArr_1) v_subst_2 v_ArrVal_583) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)))))) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (v_subst_6 Int) (v_prenex_1 (Array Int Int)) (v_subst_4 Int) (v_prenex_3 (Array Int Int)) (v_subst_1 Int)) (or (= (select v_prenex_3 4) 0) (= (select v_arrayElimArr_2 .cse0) 0) (not (= (select (select (store (store (store .cse1 v_subst_6 v_arrayElimArr_2) v_subst_4 v_prenex_3) v_subst_1 v_prenex_1) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)))) is different from false [2025-03-03 13:15:27,015 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:15:27,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 82 [2025-03-03 13:15:31,057 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_arrayElimArr_3 (Array Int Int))) (or (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int)) (v_subst_5 Int) (v_subst_3 Int) (v_ArrVal_583 (Array Int Int)) (v_subst_2 Int) (v_prenex_5 (Array Int Int))) (or (not (= (select (select (store (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) v_subst_5 v_prenex_5) v_subst_3 v_arrayElimArr_1) v_subst_2 v_ArrVal_583) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 0)) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_2) (= (select v_arrayElimArr_1 4) 0) (= (select v_prenex_5 4) 0))) (= (select v_arrayElimArr_3 .cse1) 0))) (or (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_6 Int) (v_prenex_1 (Array Int Int)) (v_subst_4 Int) (v_prenex_3 (Array Int Int)) (v_subst_1 Int)) (or (= (select v_arrayElimArr_3 .cse1) 0) (= (select v_prenex_3 4) 0) (= (select v_arrayElimArr_2 4) 0) (not (= (select (select (store (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) v_subst_6 v_arrayElimArr_2) v_subst_4 v_prenex_3) v_subst_1 v_prenex_1) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)))) is different from false [2025-03-03 13:15:31,154 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse0 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4))) (and (or (forall ((v_arrayElimArr_2 (Array Int Int)) (v_subst_8 Int) (v_arrayElimArr_3 (Array Int Int)) (v_subst_6 Int) (v_prenex_1 (Array Int Int)) (v_subst_4 Int) (v_prenex_3 (Array Int Int)) (v_subst_1 Int)) (or (= (select v_arrayElimArr_3 .cse0) 0) (= (select v_prenex_3 4) 0) (not (= (select (select (store (store (store (store .cse1 v_subst_8 v_arrayElimArr_3) v_subst_6 v_arrayElimArr_2) v_subst_4 v_prenex_3) v_subst_1 v_prenex_1) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (= (select v_arrayElimArr_2 4) 0))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (forall ((v_arrayElimArr_3 (Array Int Int))) (or (forall ((v_arrayElimArr_1 (Array Int Int)) (v_subst_7 Int) (v_subst_5 Int) (v_subst_3 Int) (v_ArrVal_583 (Array Int Int)) (v_subst_2 Int) (v_prenex_5 (Array Int Int))) (or (not (= (select (select (store (store (store (store .cse1 v_subst_7 v_arrayElimArr_3) v_subst_5 v_prenex_5) v_subst_3 v_arrayElimArr_1) v_subst_2 v_ArrVal_583) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_2) (= (select v_arrayElimArr_1 4) 0) (= (select v_prenex_5 4) 0))) (= (select v_arrayElimArr_3 .cse0) 0))))) is different from false [2025-03-03 13:15:31,200 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:15:31,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 98 [2025-03-03 13:15:35,272 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (and (or (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_subst_8 Int) (v_subst_6 Int) (v_prenex_1 (Array Int Int)) (v_subst_4 Int) (v_prenex_3 (Array Int Int)) (v_subst_1 Int) (v_prenex_7 (Array Int Int))) (or (= (select v_prenex_7 4) 0) (= (select v_arrayElimArr_4 .cse0) 0) (= (select v_prenex_3 4) 0) (not (= (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) v_subst_8 v_prenex_7) v_subst_6 v_arrayElimArr_2) v_subst_4 v_prenex_3) v_subst_1 v_prenex_1) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0)) (= (select v_arrayElimArr_2 4) 0))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_7 Int) (v_subst_5 Int) (v_subst_3 Int) (v_ArrVal_583 (Array Int Int)) (v_subst_2 Int) (v_prenex_5 (Array Int Int))) (or (not (= (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) v_subst_7 v_arrayElimArr_3) v_subst_5 v_prenex_5) v_subst_3 v_arrayElimArr_1) v_subst_2 v_ArrVal_583) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0)) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_2) (= (select v_arrayElimArr_1 4) 0) (= (select v_prenex_5 4) 0) (= (select v_arrayElimArr_3 4) 0))) (= (select v_arrayElimArr_4 .cse0) 0))))) is different from false [2025-03-03 13:15:35,402 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4)) (.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (or (forall ((v_arrayElimArr_2 (Array Int Int)) (v_subst_9 Int) (v_arrayElimArr_4 (Array Int Int)) (v_subst_8 Int) (v_subst_6 Int) (v_prenex_1 (Array Int Int)) (v_subst_4 Int) (v_prenex_3 (Array Int Int)) (v_subst_1 Int) (v_prenex_7 (Array Int Int))) (or (= (select v_prenex_7 4) 0) (= (select v_prenex_3 4) 0) (= (select v_arrayElimArr_4 .cse0) 0) (not (= (select (select (store (store (store (store (store .cse1 v_subst_9 v_arrayElimArr_4) v_subst_8 v_prenex_7) v_subst_6 v_arrayElimArr_2) v_subst_4 v_prenex_3) v_subst_1 v_prenex_1) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (= (select v_arrayElimArr_2 4) 0))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (= (select v_arrayElimArr_4 .cse0) 0) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_7 Int) (v_subst_5 Int) (v_subst_3 Int) (v_ArrVal_583 (Array Int Int)) (v_subst_2 Int) (v_subst_10 Int) (v_prenex_5 (Array Int Int))) (or (not (= (select (select (store (store (store (store (store .cse1 v_subst_10 v_arrayElimArr_4) v_subst_7 v_arrayElimArr_3) v_subst_5 v_prenex_5) v_subst_3 v_arrayElimArr_1) v_subst_2 v_ArrVal_583) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_2) (= (select v_arrayElimArr_1 4) 0) (= (select v_prenex_5 4) 0) (= (select v_arrayElimArr_3 4) 0))))))) is different from false [2025-03-03 13:15:35,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:15:35,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 114 [2025-03-03 13:15:39,539 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_arrayElimArr_5 (Array Int Int))) (or (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_7 Int) (v_subst_5 Int) (v_subst_3 Int) (v_ArrVal_583 (Array Int Int)) (v_subst_2 Int) (v_subst_10 Int) (v_prenex_5 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_2) (= (select v_arrayElimArr_1 4) 0) (= (select v_prenex_5 4) 0) (= (select v_arrayElimArr_4 4) 0) (= (select v_arrayElimArr_3 4) 0) (not (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) v_subst_10 v_arrayElimArr_4) v_subst_7 v_arrayElimArr_3) v_subst_5 v_prenex_5) v_subst_3 v_arrayElimArr_1) v_subst_2 v_ArrVal_583) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 0)))) (= (select v_arrayElimArr_5 .cse1) 0))) (or (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_9 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_subst_9 Int) (v_subst_8 Int) (v_subst_6 Int) (v_prenex_1 (Array Int Int)) (v_subst_4 Int) (v_prenex_3 (Array Int Int)) (v_subst_1 Int) (v_prenex_7 (Array Int Int))) (or (= (select v_prenex_7 4) 0) (= (select v_prenex_3 4) 0) (= (select v_prenex_9 4) 0) (= (select v_arrayElimArr_5 .cse1) 0) (= (select v_arrayElimArr_2 4) 0) (not (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) v_subst_9 v_prenex_9) v_subst_8 v_prenex_7) v_subst_6 v_arrayElimArr_2) v_subst_4 v_prenex_3) v_subst_1 v_prenex_1) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)))) is different from false [2025-03-03 13:15:39,679 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse0 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4))) (and (or (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_9 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (v_subst_9 Int) (v_subst_8 Int) (v_subst_6 Int) (v_prenex_1 (Array Int Int)) (v_subst_4 Int) (v_prenex_3 (Array Int Int)) (v_subst_11 Int) (v_subst_1 Int) (v_prenex_7 (Array Int Int))) (or (= (select v_prenex_7 4) 0) (= (select v_prenex_3 4) 0) (= (select v_prenex_9 4) 0) (= (select v_arrayElimArr_5 .cse0) 0) (not (= (select (select (store (store (store (store (store (store .cse1 v_subst_11 v_arrayElimArr_5) v_subst_9 v_prenex_9) v_subst_8 v_prenex_7) v_subst_6 v_arrayElimArr_2) v_subst_4 v_prenex_3) v_subst_1 v_prenex_1) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (= (select v_arrayElimArr_2 4) 0))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (forall ((v_arrayElimArr_5 (Array Int Int))) (or (forall ((v_subst_12 Int) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_7 Int) (v_subst_5 Int) (v_subst_3 Int) (v_ArrVal_583 (Array Int Int)) (v_subst_2 Int) (v_subst_10 Int) (v_prenex_5 (Array Int Int))) (or (not (= (select (select (store (store (store (store (store (store .cse1 v_subst_12 v_arrayElimArr_5) v_subst_10 v_arrayElimArr_4) v_subst_7 v_arrayElimArr_3) v_subst_5 v_prenex_5) v_subst_3 v_arrayElimArr_1) v_subst_2 v_ArrVal_583) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_2) (= (select v_arrayElimArr_1 4) 0) (= (select v_prenex_5 4) 0) (= (select v_arrayElimArr_4 4) 0) (= (select v_arrayElimArr_3 4) 0))) (= (select v_arrayElimArr_5 .cse0) 0))))) is different from false [2025-03-03 13:15:39,743 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:15:39,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 130 [2025-03-03 13:15:39,854 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (and (or (forall ((v_arrayElimArr_6 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_subst_6 Int) (v_prenex_1 (Array Int Int)) (v_subst_4 Int) (v_prenex_3 (Array Int Int)) (v_subst_11 Int) (v_subst_1 Int) (v_prenex_7 (Array Int Int)) (v_prenex_9 (Array Int Int)) (v_subst_9 Int) (v_subst_8 Int) (v_prenex_11 (Array Int Int))) (or (= (select v_arrayElimArr_6 .cse0) 0) (= (select v_prenex_7 4) 0) (= (select v_prenex_11 4) 0) (= (select v_prenex_3 4) 0) (= (select v_prenex_9 4) 0) (not (= (select (select (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) v_subst_11 v_prenex_11) v_subst_9 v_prenex_9) v_subst_8 v_prenex_7) v_subst_6 v_arrayElimArr_2) v_subst_4 v_prenex_3) v_subst_1 v_prenex_1) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0)) (= (select v_arrayElimArr_2 4) 0))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (forall ((v_arrayElimArr_5 (Array Int Int)) (v_subst_12 Int) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_5 Int) (v_subst_3 Int) (v_ArrVal_583 (Array Int Int)) (v_subst_2 Int) (v_subst_10 Int) (v_prenex_5 (Array Int Int)) (v_subst_7 Int)) (or (not (= (select (select (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) v_subst_12 v_arrayElimArr_5) v_subst_10 v_arrayElimArr_4) v_subst_7 v_arrayElimArr_3) v_subst_5 v_prenex_5) v_subst_3 v_arrayElimArr_1) v_subst_2 v_ArrVal_583) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0)) (= (select v_arrayElimArr_5 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_2) (= (select v_arrayElimArr_1 4) 0) (= (select v_prenex_5 4) 0) (= (select v_arrayElimArr_4 4) 0) (= (select v_arrayElimArr_3 4) 0))) (= (select v_arrayElimArr_6 .cse0) 0))))) is different from false [2025-03-03 13:15:40,395 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:15:40,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 146 [2025-03-03 13:15:40,501 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse1 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (and (or (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_subst_13 Int) (v_arrayElimArr_7 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_subst_6 Int) (v_prenex_1 (Array Int Int)) (v_subst_4 Int) (v_prenex_3 (Array Int Int)) (v_subst_11 Int) (v_subst_1 Int) (v_prenex_7 (Array Int Int)) (v_prenex_9 (Array Int Int)) (v_subst_9 Int) (v_subst_8 Int) (v_prenex_13 (Array Int Int)) (v_prenex_11 (Array Int Int))) (or (= (select v_prenex_7 4) 0) (= (select v_prenex_11 4) 0) (= (select v_prenex_3 4) 0) (= (select v_prenex_9 4) 0) (not (= (select (select (store (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) v_subst_13 v_prenex_13) v_subst_11 v_prenex_11) v_subst_9 v_prenex_9) v_subst_8 v_prenex_7) v_subst_6 v_arrayElimArr_2) v_subst_4 v_prenex_3) v_subst_1 v_prenex_1) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 0)) (= (select v_prenex_13 4) 0) (= (select v_arrayElimArr_2 4) 0) (= (select v_arrayElimArr_7 .cse1) 0)))) (forall ((v_arrayElimArr_7 (Array Int Int))) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_subst_14 Int) (v_arrayElimArr_5 (Array Int Int)) (v_subst_12 Int) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_5 Int) (v_subst_3 Int) (v_ArrVal_583 (Array Int Int)) (v_subst_2 Int) (v_subst_10 Int) (v_prenex_5 (Array Int Int)) (v_subst_7 Int)) (or (= (select v_arrayElimArr_6 4) 0) (= (select v_arrayElimArr_5 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_2) (= (select v_arrayElimArr_1 4) 0) (= (select v_prenex_5 4) 0) (not (= (select (select (store (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) v_subst_14 v_arrayElimArr_6) v_subst_12 v_arrayElimArr_5) v_subst_10 v_arrayElimArr_4) v_subst_7 v_arrayElimArr_3) v_subst_5 v_prenex_5) v_subst_3 v_arrayElimArr_1) v_subst_2 v_ArrVal_583) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 0)) (= (select v_arrayElimArr_4 4) 0) (= (select v_arrayElimArr_3 4) 0))) (= (select v_arrayElimArr_7 .cse1) 0))))) is different from false [2025-03-03 13:15:40,685 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse2 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4))) (and (or (forall ((v_subst_13 Int) (v_arrayElimArr_7 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (v_subst_16 Int) (v_subst_6 Int) (v_prenex_1 (Array Int Int)) (v_subst_4 Int) (v_prenex_3 (Array Int Int)) (v_subst_11 Int) (v_subst_1 Int) (v_prenex_7 (Array Int Int)) (v_prenex_9 (Array Int Int)) (v_subst_9 Int) (v_subst_8 Int) (v_prenex_13 (Array Int Int)) (v_prenex_11 (Array Int Int))) (or (= (select v_prenex_7 4) 0) (= (select v_prenex_11 4) 0) (not (= (select (select (store (store (store (store (store (store (store (store .cse0 v_subst_16 v_arrayElimArr_7) v_subst_13 v_prenex_13) v_subst_11 v_prenex_11) v_subst_9 v_prenex_9) v_subst_8 v_prenex_7) v_subst_6 v_arrayElimArr_2) v_subst_4 v_prenex_3) v_subst_1 v_prenex_1) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0)) (= (select v_prenex_3 4) 0) (= (select v_arrayElimArr_7 .cse2) 0) (= (select v_prenex_9 4) 0) (= (select v_prenex_13 4) 0) (= (select v_arrayElimArr_2 4) 0))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (forall ((v_arrayElimArr_7 (Array Int Int))) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_subst_15 Int) (v_subst_14 Int) (v_arrayElimArr_5 (Array Int Int)) (v_subst_12 Int) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_5 Int) (v_subst_3 Int) (v_ArrVal_583 (Array Int Int)) (v_subst_2 Int) (v_subst_10 Int) (v_prenex_5 (Array Int Int)) (v_subst_7 Int)) (or (= (select v_arrayElimArr_6 4) 0) (= (select v_arrayElimArr_5 4) 0) (not (= (select (select (store (store (store (store (store (store (store (store .cse0 v_subst_15 v_arrayElimArr_7) v_subst_14 v_arrayElimArr_6) v_subst_12 v_arrayElimArr_5) v_subst_10 v_arrayElimArr_4) v_subst_7 v_arrayElimArr_3) v_subst_5 v_prenex_5) v_subst_3 v_arrayElimArr_1) v_subst_2 v_ArrVal_583) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0)) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_2) (= (select v_arrayElimArr_1 4) 0) (= (select v_prenex_5 4) 0) (= (select v_arrayElimArr_4 4) 0) (= (select v_arrayElimArr_3 4) 0))) (= (select v_arrayElimArr_7 .cse2) 0))))) is different from false [2025-03-03 13:15:40,766 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:15:40,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 162 [2025-03-03 13:15:40,903 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (or (forall ((v_arrayElimArr_8 (Array Int Int)) (v_subst_13 Int) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_subst_16 Int) (v_subst_6 Int) (v_prenex_1 (Array Int Int)) (v_subst_4 Int) (v_prenex_3 (Array Int Int)) (v_subst_11 Int) (v_subst_1 Int) (v_prenex_7 (Array Int Int)) (v_prenex_9 (Array Int Int)) (v_subst_9 Int) (v_subst_8 Int) (v_prenex_13 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_prenex_15 (Array Int Int))) (or (= (select v_prenex_7 4) 0) (= (select v_prenex_11 4) 0) (= (select v_prenex_3 4) 0) (= (select v_prenex_9 4) 0) (= (select v_prenex_13 4) 0) (= (select v_arrayElimArr_8 .cse0) 0) (not (= (select (select (store (store (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) v_subst_16 v_prenex_15) v_subst_13 v_prenex_13) v_subst_11 v_prenex_11) v_subst_9 v_prenex_9) v_subst_8 v_prenex_7) v_subst_6 v_arrayElimArr_2) v_subst_4 v_prenex_3) v_subst_1 v_prenex_1) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0)) (= (select v_arrayElimArr_2 4) 0) (= (select v_prenex_15 4) 0))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (forall ((v_arrayElimArr_8 (Array Int Int))) (or (= (select v_arrayElimArr_8 .cse0) 0) (forall ((v_subst_15 Int) (v_arrayElimArr_6 (Array Int Int)) (v_subst_14 Int) (v_arrayElimArr_5 (Array Int Int)) (v_arrayElimArr_7 (Array Int Int)) (v_subst_12 Int) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_5 Int) (v_subst_3 Int) (v_ArrVal_583 (Array Int Int)) (v_subst_2 Int) (v_subst_10 Int) (v_prenex_5 (Array Int Int)) (v_subst_7 Int)) (or (= (select v_arrayElimArr_6 4) 0) (= (select v_arrayElimArr_5 4) 0) (not (= (select (select (store (store (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) v_subst_15 v_arrayElimArr_7) v_subst_14 v_arrayElimArr_6) v_subst_12 v_arrayElimArr_5) v_subst_10 v_arrayElimArr_4) v_subst_7 v_arrayElimArr_3) v_subst_5 v_prenex_5) v_subst_3 v_arrayElimArr_1) v_subst_2 v_ArrVal_583) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0)) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_2) (= 0 (select v_arrayElimArr_7 4)) (= (select v_arrayElimArr_1 4) 0) (= (select v_prenex_5 4) 0) (= (select v_arrayElimArr_4 4) 0) (= (select v_arrayElimArr_3 4) 0))))))) is different from false [2025-03-03 13:15:42,102 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:15:42,103 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 50 treesize of output 51 [2025-03-03 13:15:42,107 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 13:15:44,923 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:15:44,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 633456136552449 treesize of output 633043819692038 [2025-03-03 13:16:16,942 WARN L286 SmtUtils]: Spent 31.80s on a formula simplification. DAG size of input: 72171 DAG size of output: 227 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-03 13:16:17,125 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 9202 treesize of output 9198 [2025-03-03 13:16:17,244 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:16:17,244 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 9204 treesize of output 9178 [2025-03-03 13:16:17,394 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:16:17,394 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 9172 treesize of output 9050 [2025-03-03 13:16:17,522 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:16:17,522 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 9044 treesize of output 9034 [2025-03-03 13:16:17,649 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:16:17,650 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 9028 treesize of output 8970 [2025-03-03 13:16:17,773 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:16:17,774 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 8964 treesize of output 8714 [2025-03-03 13:16:17,896 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:16:17,897 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 8708 treesize of output 8706 [2025-03-03 13:16:18,025 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:16:18,025 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 8700 treesize of output 8194 [2025-03-03 13:16:18,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:16:18,166 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 8188 treesize of output 7170 [2025-03-03 13:16:19,692 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 18 refuted. 2 times theorem prover too weak. 0 trivial. 236 not checked. [2025-03-03 13:16:19,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980553062] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:16:19,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:16:19,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 30] total 59 [2025-03-03 13:16:19,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605393771] [2025-03-03 13:16:19,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:16:19,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2025-03-03 13:16:19,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:16:19,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2025-03-03 13:16:19,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1677, Unknown=69, NotChecked=1470, Total=3422 [2025-03-03 13:16:19,695 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand has 59 states, 59 states have (on average 2.2203389830508473) internal successors, (131), 59 states have internal predecessors, (131), 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-03 13:16:25,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:16:25,566 INFO L93 Difference]: Finished difference Result 102 states and 119 transitions. [2025-03-03 13:16:25,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 13:16:25,568 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 2.2203389830508473) internal successors, (131), 59 states have internal predecessors, (131), 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 66 [2025-03-03 13:16:25,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:16:25,569 INFO L225 Difference]: With dead ends: 102 [2025-03-03 13:16:25,569 INFO L226 Difference]: Without dead ends: 86 [2025-03-03 13:16:25,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 99 SyntacticMatches, 6 SemanticMatches, 71 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 1108 ImplicationChecksByTransitivity, 22.6s TimeCoverageRelationStatistics Valid=470, Invalid=2814, Unknown=82, NotChecked=1890, Total=5256 [2025-03-03 13:16:25,571 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 62 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 1318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 748 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 13:16:25,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 386 Invalid, 1318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 528 Invalid, 0 Unknown, 748 Unchecked, 1.5s Time] [2025-03-03 13:16:25,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-03 13:16:25,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 76. [2025-03-03 13:16:25,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.0933333333333333) internal successors, (82), 75 states have internal predecessors, (82), 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-03 13:16:25,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2025-03-03 13:16:25,580 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 66 [2025-03-03 13:16:25,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:16:25,580 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2025-03-03 13:16:25,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 2.2203389830508473) internal successors, (131), 59 states have internal predecessors, (131), 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-03 13:16:25,580 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2025-03-03 13:16:25,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 13:16:25,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:16:25,581 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:16:25,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 13:16:25,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:16:25,782 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:16:25,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:16:25,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1024096733, now seen corresponding path program 4 times [2025-03-03 13:16:25,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:16:25,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773144794] [2025-03-03 13:16:25,783 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:16:25,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:16:25,803 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 71 statements into 2 equivalence classes. [2025-03-03 13:16:25,863 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 69 of 71 statements. [2025-03-03 13:16:25,864 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 13:16:25,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:16:28,129 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 5 proven. 91 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2025-03-03 13:16:28,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:16:28,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773144794] [2025-03-03 13:16:28,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773144794] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:16:28,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291540915] [2025-03-03 13:16:28,130 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:16:28,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:16:28,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:16:28,131 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-03 13:16:28,132 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-03 13:16:28,221 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 71 statements into 2 equivalence classes. [2025-03-03 13:16:28,314 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 69 of 71 statements. [2025-03-03 13:16:28,314 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 13:16:28,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:16:28,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 161 conjuncts are in the unsatisfiable core [2025-03-03 13:16:28,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:16:28,335 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-03 13:16:28,451 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 11 treesize of output 7 [2025-03-03 13:16:28,512 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-03 13:16:28,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-03 13:16:28,626 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 23 treesize of output 11 [2025-03-03 13:16:28,870 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2025-03-03 13:16:28,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2025-03-03 13:16:28,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-03 13:16:29,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-03 13:16:29,281 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 16 treesize of output 11 [2025-03-03 13:16:29,408 INFO L349 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2025-03-03 13:16:29,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2025-03-03 13:16:29,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-03 13:16:29,965 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 16 treesize of output 11 [2025-03-03 13:16:30,114 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-03-03 13:16:30,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-03-03 13:16:30,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-03 13:16:31,010 INFO L349 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2025-03-03 13:16:31,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 32 treesize of output 57 [2025-03-03 13:16:31,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-03 13:16:31,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-03 13:16:31,922 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 19 treesize of output 18 [2025-03-03 13:16:32,120 INFO L349 Elim1Store]: treesize reduction 90, result has 33.8 percent of original size [2025-03-03 13:16:32,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 37 treesize of output 69 [2025-03-03 13:16:32,676 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-03 13:16:32,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2025-03-03 13:16:33,342 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-03 13:16:33,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2025-03-03 13:16:33,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 13:16:33,455 INFO L349 Elim1Store]: treesize reduction 24, result has 51.0 percent of original size [2025-03-03 13:16:33,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 46 [2025-03-03 13:16:33,668 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-03 13:16:33,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2025-03-03 13:16:33,899 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-03 13:16:33,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2025-03-03 13:16:34,066 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-03 13:16:34,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2025-03-03 13:16:34,318 INFO L349 Elim1Store]: treesize reduction 28, result has 49.1 percent of original size [2025-03-03 13:16:34,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 40 [2025-03-03 13:16:34,522 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2025-03-03 13:16:34,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 45 [2025-03-03 13:16:35,362 INFO L349 Elim1Store]: treesize reduction 80, result has 63.0 percent of original size [2025-03-03 13:16:35,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 103 treesize of output 187