./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 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 13:00:01,883 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 13:00:01,926 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 13:00:01,935 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 13:00:01,935 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 13:00:01,952 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 13:00:01,953 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 13:00:01,953 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 13:00:01,953 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 13:00:01,954 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 13:00:01,954 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 13:00:01,954 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 13:00:01,955 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 13:00:01,955 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 13:00:01,955 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 13:00:01,956 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 13:00:01,956 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 13:00:01,956 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 13:00:01,957 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 13:00:01,957 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 13:00:01,957 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 13:00:01,958 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 13:00:01,958 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 13:00:01,958 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 13:00:01,958 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 13:00:01,959 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 13:00:01,959 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 13:00:01,959 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 13:00:01,959 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 13:00:01,960 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 13:00:01,960 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 13:00:01,960 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 13:00:01,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 13:00:01,961 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 13:00:01,961 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 13:00:01,961 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 13:00:01,961 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 13:00:01,962 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 13:00:01,962 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 13:00:01,962 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 13:00:01,962 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 13:00:01,963 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 13:00:01,963 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9339a3186df1139a7984a9803a310ef99d020bdafafac2d122ebd6ff2b132483 [2024-11-18 13:00:02,180 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 13:00:02,204 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 13:00:02,207 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 13:00:02,208 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 13:00:02,208 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 13:00:02,210 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 [2024-11-18 13:00:03,619 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 13:00:03,984 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 13:00:03,984 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/simple_search_value-1.i [2024-11-18 13:00:04,013 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55545c258/d961ebca75f84a7b8173edc3abb96bc8/FLAG11773888b [2024-11-18 13:00:04,223 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55545c258/d961ebca75f84a7b8173edc3abb96bc8 [2024-11-18 13:00:04,227 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 13:00:04,229 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 13:00:04,231 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 13:00:04,231 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 13:00:04,235 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 13:00:04,236 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:00:04" (1/1) ... [2024-11-18 13:00:04,237 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dfb6d55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:00:04, skipping insertion in model container [2024-11-18 13:00:04,237 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:00:04" (1/1) ... [2024-11-18 13:00:04,279 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 13:00:04,574 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] [2024-11-18 13:00:04,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 13:00:04,584 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 13:00:04,624 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] [2024-11-18 13:00:04,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 13:00:04,655 INFO L204 MainTranslator]: Completed translation [2024-11-18 13:00:04,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:00:04 WrapperNode [2024-11-18 13:00:04,655 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 13:00:04,656 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 13:00:04,656 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 13:00:04,656 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 13:00:04,662 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:00:04" (1/1) ... [2024-11-18 13:00:04,679 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:00:04" (1/1) ... [2024-11-18 13:00:04,695 INFO L138 Inliner]: procedures = 122, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 70 [2024-11-18 13:00:04,696 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 13:00:04,696 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 13:00:04,696 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 13:00:04,696 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 13:00:04,706 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:00:04" (1/1) ... [2024-11-18 13:00:04,706 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:00:04" (1/1) ... [2024-11-18 13:00:04,708 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:00:04" (1/1) ... [2024-11-18 13:00:04,727 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]. [2024-11-18 13:00:04,728 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:00:04" (1/1) ... [2024-11-18 13:00:04,728 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:00:04" (1/1) ... [2024-11-18 13:00:04,738 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:00:04" (1/1) ... [2024-11-18 13:00:04,747 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:00:04" (1/1) ... [2024-11-18 13:00:04,748 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:00:04" (1/1) ... [2024-11-18 13:00:04,749 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:00:04" (1/1) ... [2024-11-18 13:00:04,751 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 13:00:04,752 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 13:00:04,752 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 13:00:04,752 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 13:00:04,753 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:00:04" (1/1) ... [2024-11-18 13:00:04,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 13:00:04,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:00:04,779 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-18 13:00:04,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-18 13:00:04,846 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-18 13:00:04,846 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-18 13:00:04,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-18 13:00:04,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-18 13:00:04,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-18 13:00:04,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-18 13:00:04,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-18 13:00:04,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 13:00:04,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-18 13:00:04,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-18 13:00:04,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-18 13:00:04,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-18 13:00:04,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 13:00:04,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-18 13:00:04,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 13:00:04,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 13:00:04,988 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 13:00:04,990 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 13:00:05,051 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-18 13:00:05,254 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-18 13:00:05,257 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 13:00:05,267 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 13:00:05,270 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-18 13:00:05,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:00:05 BoogieIcfgContainer [2024-11-18 13:00:05,271 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 13:00:05,278 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 13:00:05,278 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 13:00:05,286 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 13:00:05,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 01:00:04" (1/3) ... [2024-11-18 13:00:05,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e5e16d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:00:05, skipping insertion in model container [2024-11-18 13:00:05,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:00:04" (2/3) ... [2024-11-18 13:00:05,291 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e5e16d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:00:05, skipping insertion in model container [2024-11-18 13:00:05,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:00:05" (3/3) ... [2024-11-18 13:00:05,293 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_search_value-1.i [2024-11-18 13:00:05,322 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 13:00:05,326 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 13:00:05,393 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 13:00:05,401 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;@2498c3ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 13:00:05,402 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 13:00:05,406 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 22 states have (on average 1.5) internal successors, (33), 24 states have internal predecessors, (33), 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) [2024-11-18 13:00:05,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-18 13:00:05,414 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:00:05,415 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:00:05,416 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:00:05,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:00:05,421 INFO L85 PathProgramCache]: Analyzing trace with hash 2087165485, now seen corresponding path program 1 times [2024-11-18 13:00:05,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:00:05,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5438709] [2024-11-18 13:00:05,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:00:05,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:00:05,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:00:05,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:00:05,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:00:05,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5438709] [2024-11-18 13:00:05,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5438709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:00:05,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:00:05,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 13:00:05,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619670249] [2024-11-18 13:00:05,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:00:05,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 13:00:05,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:00:05,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 13:00:05,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 13:00:05,598 INFO L87 Difference]: Start difference. First operand has 26 states, 22 states have (on average 1.5) internal successors, (33), 24 states have internal predecessors, (33), 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) [2024-11-18 13:00:05,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:00:05,609 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2024-11-18 13:00:05,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 13:00:05,611 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 [2024-11-18 13:00:05,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:00:05,615 INFO L225 Difference]: With dead ends: 39 [2024-11-18 13:00:05,615 INFO L226 Difference]: Without dead ends: 18 [2024-11-18 13:00:05,617 INFO L431 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 [2024-11-18 13:00:05,620 INFO L432 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 [2024-11-18 13:00:05,620 INFO L433 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] [2024-11-18 13:00:05,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-18 13:00:05,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-18 13:00:05,640 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) [2024-11-18 13:00:05,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2024-11-18 13:00:05,642 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 9 [2024-11-18 13:00:05,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:00:05,642 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-11-18 13:00:05,642 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) [2024-11-18 13:00:05,643 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2024-11-18 13:00:05,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-18 13:00:05,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:00:05,643 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:00:05,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 13:00:05,644 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:00:05,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:00:05,644 INFO L85 PathProgramCache]: Analyzing trace with hash -2034265922, now seen corresponding path program 1 times [2024-11-18 13:00:05,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:00:05,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608759293] [2024-11-18 13:00:05,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:00:05,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:00:05,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:00:05,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:00:05,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:00:05,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608759293] [2024-11-18 13:00:05,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608759293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:00:05,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:00:05,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 13:00:05,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977337838] [2024-11-18 13:00:05,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:00:05,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 13:00:05,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:00:05,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 13:00:05,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 13:00:05,762 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) [2024-11-18 13:00:05,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:00:05,784 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2024-11-18 13:00:05,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 13:00:05,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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 [2024-11-18 13:00:05,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:00:05,785 INFO L225 Difference]: With dead ends: 28 [2024-11-18 13:00:05,785 INFO L226 Difference]: Without dead ends: 19 [2024-11-18 13:00:05,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 13:00:05,786 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 13:00:05,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 13:00:05,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-18 13:00:05,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-18 13:00:05,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:00:05,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2024-11-18 13:00:05,806 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 11 [2024-11-18 13:00:05,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:00:05,806 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2024-11-18 13:00:05,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) [2024-11-18 13:00:05,810 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2024-11-18 13:00:05,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-18 13:00:05,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:00:05,811 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:00:05,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 13:00:05,811 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:00:05,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:00:05,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1977007620, now seen corresponding path program 1 times [2024-11-18 13:00:05,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:00:05,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228379699] [2024-11-18 13:00:05,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:00:05,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:00:05,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:00:05,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:00:05,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:00:05,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228379699] [2024-11-18 13:00:05,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228379699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:00:05,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:00:05,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 13:00:05,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408305508] [2024-11-18 13:00:05,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:00:05,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 13:00:05,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:00:05,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 13:00:05,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 13:00:05,935 INFO L87 Difference]: Start difference. First operand 19 states and 23 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) [2024-11-18 13:00:05,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:00:05,974 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2024-11-18 13:00:05,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 13:00:05,975 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 [2024-11-18 13:00:05,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:00:05,977 INFO L225 Difference]: With dead ends: 39 [2024-11-18 13:00:05,977 INFO L226 Difference]: Without dead ends: 24 [2024-11-18 13:00:05,977 INFO L431 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 [2024-11-18 13:00:05,978 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 5 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 13:00:05,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 49 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 13:00:05,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-18 13:00:05,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2024-11-18 13:00:05,985 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) [2024-11-18 13:00:05,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2024-11-18 13:00:05,986 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 11 [2024-11-18 13:00:05,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:00:05,986 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2024-11-18 13:00:05,986 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) [2024-11-18 13:00:05,986 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2024-11-18 13:00:05,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-18 13:00:05,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:00:05,987 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:00:05,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 13:00:05,987 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:00:05,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:00:05,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1102443704, now seen corresponding path program 1 times [2024-11-18 13:00:05,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:00:05,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109715653] [2024-11-18 13:00:05,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:00:05,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:00:06,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:00:06,093 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-18 13:00:06,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:00:06,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109715653] [2024-11-18 13:00:06,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109715653] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:00:06,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:00:06,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 13:00:06,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684921414] [2024-11-18 13:00:06,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:00:06,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 13:00:06,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:00:06,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 13:00:06,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 13:00:06,097 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) [2024-11-18 13:00:06,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:00:06,132 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2024-11-18 13:00:06,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 13:00:06,132 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 [2024-11-18 13:00:06,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:00:06,133 INFO L225 Difference]: With dead ends: 32 [2024-11-18 13:00:06,133 INFO L226 Difference]: Without dead ends: 29 [2024-11-18 13:00:06,133 INFO L431 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 [2024-11-18 13:00:06,134 INFO L432 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 [2024-11-18 13:00:06,134 INFO L433 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] [2024-11-18 13:00:06,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-18 13:00:06,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2024-11-18 13:00:06,137 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) [2024-11-18 13:00:06,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-11-18 13:00:06,138 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 16 [2024-11-18 13:00:06,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:00:06,138 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-11-18 13:00:06,138 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) [2024-11-18 13:00:06,138 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-11-18 13:00:06,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-18 13:00:06,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:00:06,139 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:00:06,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 13:00:06,139 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:00:06,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:00:06,140 INFO L85 PathProgramCache]: Analyzing trace with hash 379985990, now seen corresponding path program 1 times [2024-11-18 13:00:06,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:00:06,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213394911] [2024-11-18 13:00:06,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:00:06,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:00:06,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:00:06,235 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-18 13:00:06,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:00:06,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213394911] [2024-11-18 13:00:06,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213394911] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:00:06,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239257774] [2024-11-18 13:00:06,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:00:06,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:00:06,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:00:06,239 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) [2024-11-18 13:00:06,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-18 13:00:06,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:00:06,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-18 13:00:06,320 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:00:06,352 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-18 13:00:06,352 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:00:06,377 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-18 13:00:06,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239257774] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 13:00:06,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 13:00:06,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-18 13:00:06,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906713472] [2024-11-18 13:00:06,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 13:00:06,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-18 13:00:06,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:00:06,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-18 13:00:06,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-18 13:00:06,379 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) [2024-11-18 13:00:06,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:00:06,448 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2024-11-18 13:00:06,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-18 13:00:06,449 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 [2024-11-18 13:00:06,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:00:06,449 INFO L225 Difference]: With dead ends: 56 [2024-11-18 13:00:06,449 INFO L226 Difference]: Without dead ends: 40 [2024-11-18 13:00:06,450 INFO L431 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 [2024-11-18 13:00:06,451 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 12 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 13:00:06,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 67 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 13:00:06,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-18 13:00:06,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2024-11-18 13:00:06,454 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) [2024-11-18 13:00:06,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2024-11-18 13:00:06,455 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 21 [2024-11-18 13:00:06,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:00:06,455 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2024-11-18 13:00:06,455 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) [2024-11-18 13:00:06,455 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2024-11-18 13:00:06,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-18 13:00:06,456 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:00:06,456 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:00:06,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-18 13:00:06,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:00:06,661 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:00:06,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:00:06,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1481516270, now seen corresponding path program 2 times [2024-11-18 13:00:06,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:00:06,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678003412] [2024-11-18 13:00:06,662 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 13:00:06,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:00:06,689 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 13:00:06,689 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 13:00:06,815 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-18 13:00:06,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:00:06,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678003412] [2024-11-18 13:00:06,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678003412] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:00:06,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100771922] [2024-11-18 13:00:06,816 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 13:00:06,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:00:06,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:00:06,817 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) [2024-11-18 13:00:06,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-18 13:00:06,907 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 13:00:06,908 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 13:00:06,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-18 13:00:06,912 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:00:06,946 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-18 13:00:06,947 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:00:07,023 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-18 13:00:07,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100771922] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 13:00:07,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 13:00:07,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-11-18 13:00:07,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196724865] [2024-11-18 13:00:07,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 13:00:07,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-18 13:00:07,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:00:07,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-18 13:00:07,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2024-11-18 13:00:07,025 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) [2024-11-18 13:00:07,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:00:07,160 INFO L93 Difference]: Finished difference Result 86 states and 100 transitions. [2024-11-18 13:00:07,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-18 13:00:07,161 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 [2024-11-18 13:00:07,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:00:07,162 INFO L225 Difference]: With dead ends: 86 [2024-11-18 13:00:07,162 INFO L226 Difference]: Without dead ends: 70 [2024-11-18 13:00:07,162 INFO L431 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 [2024-11-18 13:00:07,163 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 18 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 13:00:07,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 59 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 13:00:07,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-18 13:00:07,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2024-11-18 13:00:07,168 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) [2024-11-18 13:00:07,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2024-11-18 13:00:07,168 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 36 [2024-11-18 13:00:07,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:00:07,169 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2024-11-18 13:00:07,169 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) [2024-11-18 13:00:07,169 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2024-11-18 13:00:07,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-18 13:00:07,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:00:07,170 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:00:07,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-18 13:00:07,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-18 13:00:07,371 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:00:07,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:00:07,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1904311442, now seen corresponding path program 3 times [2024-11-18 13:00:07,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:00:07,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884009100] [2024-11-18 13:00:07,372 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-18 13:00:07,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:00:07,465 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-18 13:00:07,465 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 13:00:10,146 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 1 proven. 129 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-11-18 13:00:10,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:00:10,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884009100] [2024-11-18 13:00:10,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884009100] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:00:10,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864111855] [2024-11-18 13:00:10,147 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-18 13:00:10,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:00:10,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:00:10,149 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) [2024-11-18 13:00:10,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-18 13:00:18,060 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-18 13:00:18,061 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 13:00:18,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 122 conjuncts are in the unsatisfiable core [2024-11-18 13:00:18,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:00:18,112 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 [2024-11-18 13:00:18,166 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-18 13:00:18,167 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 [2024-11-18 13:00:18,208 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 [2024-11-18 13:00:18,249 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-18 13:00:18,250 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 [2024-11-18 13:00:18,315 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-18 13:00:18,315 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 [2024-11-18 13:00:18,366 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-18 13:00:18,366 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 [2024-11-18 13:00:18,380 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 [2024-11-18 13:00:18,446 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-18 13:00:18,447 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 [2024-11-18 13:00:18,505 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-18 13:00:18,505 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 [2024-11-18 13:00:18,566 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-18 13:00:18,566 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 [2024-11-18 13:00:18,634 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-18 13:00:18,634 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 [2024-11-18 13:00:18,670 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-18 13:00:18,670 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 [2024-11-18 13:00:18,728 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-18 13:00:18,728 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 [2024-11-18 13:00:18,773 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-18 13:00:18,773 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 [2024-11-18 13:00:18,833 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-18 13:00:18,833 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 [2024-11-18 13:00:18,871 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-18 13:00:18,872 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 [2024-11-18 13:00:18,909 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-18 13:00:18,909 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 [2024-11-18 13:00:18,947 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-18 13:00:18,947 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 [2024-11-18 13:00:18,985 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-18 13:00:18,985 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 [2024-11-18 13:00:19,022 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-18 13:00:19,023 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 [2024-11-18 13:00:19,059 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-18 13:00:19,060 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 [2024-11-18 13:00:19,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-18 13:00:19,102 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-18 13:00:19,103 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 [2024-11-18 13:00:19,217 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-18 13:00:19,217 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 [2024-11-18 13:00:19,223 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 [2024-11-18 13:00:19,270 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:00:19,271 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 [2024-11-18 13:00:19,327 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 [2024-11-18 13:00:19,344 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 14 proven. 130 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-18 13:00:19,344 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:00:19,425 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:00:19,426 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 40 treesize of output 44 [2024-11-18 13:00:19,436 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 5 treesize of output 3 [2024-11-18 13:00:19,442 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 52 treesize of output 50 [2024-11-18 13:00:19,461 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse0 (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_ArrVal_596 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_596) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0))))) (and (or (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|) .cse0) (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_ArrVal_596 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_596) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0)) (= |c_ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|))) (or .cse0 (< 2 |c_ULTIMATE.start_main_~counter~0#1|))))) is different from false [2024-11-18 13:00:19,507 WARN L851 $PredicateComparison]: unable to prove that (or (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse0 (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_ArrVal_596 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_596) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0))))) (and (or (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|) .cse0) (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_ArrVal_596 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_596) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0)) (= |c_ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|))) (or .cse0 (< 2 |c_ULTIMATE.start_main_~counter~0#1|))))) |c_ULTIMATE.start_main_#t~short5#1|) is different from false [2024-11-18 13:00:19,743 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:00:19,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 51 treesize of output 50 [2024-11-18 13:00:19,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2024-11-18 13:00:23,808 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_subst_2 Int) (v_ArrVal_596 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_2) (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_596) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 0)))) (= (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 [2024-11-18 13:00:23,887 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4)) (.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))) (and (forall ((v_arrayElimArr_1 (Array Int Int))) (or (forall ((v_subst_4 Int) (v_subst_2 Int) (v_ArrVal_596 (Array Int Int))) (or (not (= (select (select (store (store .cse0 v_subst_4 v_arrayElimArr_1) v_subst_2 v_ArrVal_596) |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 .cse2) 0))) (or (forall ((v_arrayElimArr_1 (Array Int Int)) (v_prenex_1 (Array Int Int)) (v_subst_3 Int) (v_subst_1 Int)) (or (= (select v_arrayElimArr_1 .cse2) 0) (not (= (select (select (store (store .cse0 v_subst_3 v_arrayElimArr_1) v_subst_1 v_prenex_1) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)))) is different from false [2024-11-18 13:00:23,941 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:00:23,941 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 [2024-11-18 13:00:27,987 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_2 (Array Int Int))) (or (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int)) (v_subst_4 Int) (v_subst_2 Int) (v_ArrVal_596 (Array Int 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_arrayElimArr_1) v_subst_2 v_ArrVal_596) |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))) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_prenex_1 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_subst_3 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_3 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))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)))) is different from false [2024-11-18 13:00:28,082 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_2 (Array Int Int)) (v_subst_5 Int) (v_prenex_1 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_subst_3 Int) (v_subst_1 Int)) (or (= (select v_prenex_3 4) 0) (not (= (select (select (store (store (store .cse0 v_subst_5 v_arrayElimArr_2) v_subst_3 v_prenex_3) v_subst_1 v_prenex_1) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0)) (= (select v_arrayElimArr_2 .cse2) 0))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (forall ((v_arrayElimArr_2 (Array Int Int))) (or (forall ((v_arrayElimArr_1 (Array Int Int)) (v_subst_6 Int) (v_subst_4 Int) (v_subst_2 Int) (v_ArrVal_596 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_2) (= (select v_arrayElimArr_1 4) 0) (not (= 0 (select (select (store (store (store .cse0 v_subst_6 v_arrayElimArr_2) v_subst_4 v_arrayElimArr_1) v_subst_2 v_ArrVal_596) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))))) (= (select v_arrayElimArr_2 .cse2) 0))))) is different from false [2024-11-18 13:00:28,127 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:00:28,127 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 [2024-11-18 13:00:32,176 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 (forall ((v_arrayElimArr_3 (Array Int Int))) (or (= (select v_arrayElimArr_3 .cse0) 0) (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_subst_6 Int) (v_subst_4 Int) (v_subst_2 Int) (v_ArrVal_596 (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_6 v_arrayElimArr_2) v_subst_4 v_arrayElimArr_1) v_subst_2 v_ArrVal_596) |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_arrayElimArr_2 4) 0))))) (or (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_3 (Array Int Int)) (v_subst_5 Int) (v_prenex_1 (Array Int Int)) (v_subst_3 Int) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_subst_1 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_prenex_3) v_subst_1 v_prenex_1) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0)) (= (select v_arrayElimArr_3 .cse0) 0) (= (select v_prenex_3 4) 0) (= (select v_prenex_5 4) 0))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)))) is different from false [2024-11-18 13:00:32,291 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 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_subst_7 Int) (v_arrayElimArr_3 (Array Int Int)) (v_subst_5 Int) (v_prenex_1 (Array Int Int)) (v_subst_3 Int) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_subst_1 Int)) (or (= (select v_arrayElimArr_3 .cse0) 0) (= (select v_prenex_3 4) 0) (= (select v_prenex_5 4) 0) (not (= (select (select (store (store (store (store .cse1 v_subst_7 v_arrayElimArr_3) v_subst_5 v_prenex_5) v_subst_3 v_prenex_3) v_subst_1 v_prenex_1) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0))))) (forall ((v_arrayElimArr_3 (Array Int Int))) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_subst_8 Int) (v_subst_6 Int) (v_subst_4 Int) (v_subst_2 Int) (v_ArrVal_596 (Array Int Int))) (or (not (= 0 (select (select (store (store (store (store .cse1 v_subst_8 v_arrayElimArr_3) v_subst_6 v_arrayElimArr_2) v_subst_4 v_arrayElimArr_1) v_subst_2 v_ArrVal_596) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_2) (= (select v_arrayElimArr_1 4) 0) (= (select v_arrayElimArr_2 4) 0))) (= (select v_arrayElimArr_3 .cse0) 0))))) is different from false [2024-11-18 13:00:32,338 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:00:32,338 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 [2024-11-18 13:00:36,400 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 (forall ((v_arrayElimArr_4 (Array Int Int))) (or (= (select v_arrayElimArr_4 .cse0) 0) (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_subst_8 Int) (v_subst_6 Int) (v_subst_4 Int) (v_subst_2 Int) (v_ArrVal_596 (Array Int Int)) (v_prenex_7 (Array Int Int))) (or (= (select v_prenex_7 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_2) (= (select v_arrayElimArr_1 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_arrayElimArr_1) v_subst_2 v_ArrVal_596) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0)) (= (select v_arrayElimArr_2 4) 0))))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_7 Int) (v_subst_5 Int) (v_prenex_1 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_subst_3 Int) (v_prenex_5 (Array Int Int)) (v_subst_1 Int)) (or (= (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_7 v_arrayElimArr_3) v_subst_5 v_prenex_5) v_subst_3 v_prenex_3) v_subst_1 v_prenex_1) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0)) (= (select v_prenex_5 4) 0) (= (select v_arrayElimArr_3 4) 0)))))) is different from false [2024-11-18 13:00:36,509 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 (forall ((v_arrayElimArr_4 (Array Int Int))) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_subst_8 Int) (v_subst_6 Int) (v_subst_4 Int) (v_subst_2 Int) (v_subst_10 Int) (v_ArrVal_596 (Array Int Int)) (v_prenex_7 (Array Int Int))) (or (= (select v_prenex_7 4) 0) (not (= (select (select (store (store (store (store (store .cse0 v_subst_10 v_arrayElimArr_4) v_subst_8 v_prenex_7) v_subst_6 v_arrayElimArr_2) v_subst_4 v_arrayElimArr_1) v_subst_2 v_ArrVal_596) |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_arrayElimArr_2 4) 0))) (= (select v_arrayElimArr_4 .cse2) 0))) (or (forall ((v_subst_9 Int) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_7 Int) (v_subst_5 Int) (v_prenex_1 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_subst_3 Int) (v_prenex_5 (Array Int Int)) (v_subst_1 Int)) (or (not (= (select (select (store (store (store (store (store .cse0 v_subst_9 v_arrayElimArr_4) v_subst_7 v_arrayElimArr_3) v_subst_5 v_prenex_5) v_subst_3 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_4 .cse2) 0) (= (select v_prenex_5 4) 0) (= (select v_arrayElimArr_3 4) 0))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)))) is different from false [2024-11-18 13:00:36,571 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:00:36,571 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 [2024-11-18 13:00:40,656 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 (forall ((v_arrayElimArr_5 (Array Int Int))) (or (= (select v_arrayElimArr_5 .cse0) 0) (forall ((v_prenex_9 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_subst_8 Int) (v_subst_6 Int) (v_subst_4 Int) (v_subst_2 Int) (v_subst_10 Int) (v_ArrVal_596 (Array Int Int)) (v_prenex_7 (Array Int Int))) (or (= (select v_prenex_7 4) 0) (not (= 0 (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_prenex_9) v_subst_8 v_prenex_7) v_subst_6 v_arrayElimArr_2) v_subst_4 v_arrayElimArr_1) v_subst_2 v_ArrVal_596) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (= (select v_prenex_9 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_2) (= (select v_arrayElimArr_1 4) 0) (= (select v_arrayElimArr_2 4) 0))))) (or (forall ((v_arrayElimArr_5 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_5 Int) (v_prenex_1 (Array Int Int)) (v_subst_3 Int) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_subst_1 Int) (v_subst_9 Int) (v_subst_7 Int)) (or (= (select v_prenex_3 4) 0) (= (select v_prenex_5 4) 0) (= (select v_arrayElimArr_5 .cse0) 0) (= (select v_arrayElimArr_4 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_arrayElimArr_4) v_subst_7 v_arrayElimArr_3) v_subst_5 v_prenex_5) v_subst_3 v_prenex_3) v_subst_1 v_prenex_1) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0)) (= (select v_arrayElimArr_3 4) 0))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)))) is different from false [2024-11-18 13:00:40,813 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4)) (.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))) (and (forall ((v_arrayElimArr_5 (Array Int Int))) (or (forall ((v_prenex_9 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_subst_8 Int) (v_subst_6 Int) (v_subst_4 Int) (v_subst_11 Int) (v_subst_2 Int) (v_subst_10 Int) (v_ArrVal_596 (Array Int Int)) (v_prenex_7 (Array Int Int))) (or (= (select v_prenex_7 4) 0) (= (select v_prenex_9 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_2) (= (select v_arrayElimArr_1 4) 0) (not (= (select (select (store (store (store (store (store (store .cse0 v_subst_11 v_arrayElimArr_5) v_subst_10 v_prenex_9) v_subst_8 v_prenex_7) v_subst_6 v_arrayElimArr_2) v_subst_4 v_arrayElimArr_1) v_subst_2 v_ArrVal_596) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0)) (= (select v_arrayElimArr_2 4) 0))) (= (select v_arrayElimArr_5 .cse2) 0))) (or (forall ((v_arrayElimArr_5 (Array Int Int)) (v_subst_12 Int) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_5 Int) (v_prenex_1 (Array Int Int)) (v_subst_3 Int) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_subst_1 Int) (v_subst_9 Int) (v_subst_7 Int)) (or (= (select v_prenex_3 4) 0) (= (select v_prenex_5 4) 0) (= (select v_arrayElimArr_5 .cse2) 0) (= (select v_arrayElimArr_4 4) 0) (= (select v_arrayElimArr_3 4) 0) (not (= (select (select (store (store (store (store (store (store .cse0 v_subst_12 v_arrayElimArr_5) v_subst_9 v_arrayElimArr_4) v_subst_7 v_arrayElimArr_3) v_subst_5 v_prenex_5) v_subst_3 v_prenex_3) v_subst_1 v_prenex_1) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)))) is different from false [2024-11-18 13:00:40,875 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:00:40,875 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 [2024-11-18 13:00:44,954 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 (forall ((v_arrayElimArr_6 (Array Int Int))) (or (= (select v_arrayElimArr_6 .cse0) 0) (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_subst_6 Int) (v_subst_4 Int) (v_subst_11 Int) (v_subst_2 Int) (v_subst_10 Int) (v_ArrVal_596 (Array Int Int)) (v_prenex_7 (Array Int Int)) (v_prenex_9 (Array Int Int)) (v_subst_8 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 |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) v_subst_11 v_prenex_11) v_subst_10 v_prenex_9) v_subst_8 v_prenex_7) v_subst_6 v_arrayElimArr_2) v_subst_4 v_arrayElimArr_1) v_subst_2 v_ArrVal_596) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0)) (= (select v_prenex_9 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_2) (= (select v_arrayElimArr_1 4) 0) (= (select v_arrayElimArr_2 4) 0))))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_subst_12 Int) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_5 Int) (v_prenex_1 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_subst_3 Int) (v_prenex_5 (Array Int Int)) (v_subst_1 Int) (v_subst_9 Int) (v_subst_7 Int)) (or (= (select v_arrayElimArr_6 .cse0) 0) (= (select v_arrayElimArr_5 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_12 v_arrayElimArr_5) v_subst_9 v_arrayElimArr_4) v_subst_7 v_arrayElimArr_3) v_subst_5 v_prenex_5) v_subst_3 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_prenex_5 4) 0) (= (select v_arrayElimArr_4 4) 0) (= (select v_arrayElimArr_3 4) 0)))))) is different from false [2024-11-18 13:00:57,442 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:00:57,443 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 [2024-11-18 13:01:03,689 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:01:03,690 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 [2024-11-18 13:01:03,824 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_subst_15 Int) (v_arrayElimArr_5 (Array Int Int)) (v_arrayElimArr_8 (Array Int Int)) (v_subst_13 Int) (v_subst_12 Int) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_5 Int) (v_prenex_1 (Array Int Int)) (v_subst_3 Int) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_subst_1 Int) (v_subst_9 Int) (v_subst_7 Int) (v_prenex_13 (Array Int Int)) (v_prenex_15 (Array Int Int))) (or (= (select v_arrayElimArr_5 4) 0) (= (select v_prenex_3 4) 0) (= (select v_prenex_13 4) 0) (= (select v_prenex_5 4) 0) (= (select v_arrayElimArr_8 .cse0) 0) (not (= 0 (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_prenex_15) v_subst_13 v_prenex_13) v_subst_12 v_arrayElimArr_5) v_subst_9 v_arrayElimArr_4) v_subst_7 v_arrayElimArr_3) v_subst_5 v_prenex_5) v_subst_3 v_prenex_3) v_subst_1 v_prenex_1) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (= (select v_arrayElimArr_4 4) 0) (= (select v_arrayElimArr_3 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_arrayElimArr_6 (Array Int Int)) (v_subst_14 Int) (v_arrayElimArr_7 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_subst_16 Int) (v_subst_6 Int) (v_subst_4 Int) (v_subst_11 Int) (v_subst_2 Int) (v_subst_10 Int) (v_ArrVal_596 (Array Int Int)) (v_prenex_7 (Array Int Int)) (v_prenex_9 (Array Int Int)) (v_subst_8 Int) (v_prenex_11 (Array Int Int))) (or (= (select v_arrayElimArr_6 4) 0) (= (select v_prenex_7 4) 0) (= (select v_prenex_11 4) 0) (= (select v_prenex_9 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_2) (= 0 (select v_arrayElimArr_7 4)) (= (select v_arrayElimArr_1 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_16 v_arrayElimArr_7) v_subst_14 v_arrayElimArr_6) v_subst_11 v_prenex_11) v_subst_10 v_prenex_9) v_subst_8 v_prenex_7) v_subst_6 v_arrayElimArr_2) v_subst_4 v_arrayElimArr_1) v_subst_2 v_ArrVal_596) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0)) (= (select v_arrayElimArr_2 4) 0))))))) is different from false [2024-11-18 13:01:25,142 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:01:25,142 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 [2024-11-18 13:01:25,145 INFO L173 IndexEqualityManager]: detected equality via solver