./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/simple_search_value-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/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-mul-div-a046e57-m [2024-10-12 18:16:25,692 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 18:16:25,751 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 18:16:25,755 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 18:16:25,756 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 18:16:25,785 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 18:16:25,785 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 18:16:25,786 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 18:16:25,786 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 18:16:25,786 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 18:16:25,788 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 18:16:25,789 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 18:16:25,790 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 18:16:25,791 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 18:16:25,792 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 18:16:25,793 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 18:16:25,793 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 18:16:25,794 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 18:16:25,794 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 18:16:25,794 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 18:16:25,794 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 18:16:25,795 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 18:16:25,795 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 18:16:25,796 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 18:16:25,796 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 18:16:25,796 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 18:16:25,797 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 18:16:25,797 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 18:16:25,797 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 18:16:25,798 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 18:16:25,798 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 18:16:25,798 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 18:16:25,798 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 18:16:25,799 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 18:16:25,799 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 18:16:25,799 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 18:16:25,800 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 18:16:25,800 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 18:16:25,800 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 18:16:25,801 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 18:16:25,802 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 18:16:25,802 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 18:16:25,802 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-10-12 18:16:26,041 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 18:16:26,066 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 18:16:26,068 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 18:16:26,070 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 18:16:26,070 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 18:16:26,071 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/simple_search_value-1.i [2024-10-12 18:16:27,628 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 18:16:27,855 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 18:16:27,856 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/simple_search_value-1.i [2024-10-12 18:16:27,874 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be9cfdccd/1d4825a4e7f245ab8897fc594baca90b/FLAG5bdad0f9f [2024-10-12 18:16:27,895 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be9cfdccd/1d4825a4e7f245ab8897fc594baca90b [2024-10-12 18:16:27,899 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 18:16:27,901 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 18:16:27,904 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 18:16:27,905 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 18:16:27,910 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 18:16:27,911 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 06:16:27" (1/1) ... [2024-10-12 18:16:27,912 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49e8d7e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:16:27, skipping insertion in model container [2024-10-12 18:16:27,912 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 06:16:27" (1/1) ... [2024-10-12 18:16:27,958 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 18:16:28,314 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/simple_search_value-1.i[23210,23223] [2024-10-12 18:16:28,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 18:16:28,331 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 18:16:28,384 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/simple_search_value-1.i[23210,23223] [2024-10-12 18:16:28,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 18:16:28,418 INFO L204 MainTranslator]: Completed translation [2024-10-12 18:16:28,419 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:16:28 WrapperNode [2024-10-12 18:16:28,420 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 18:16:28,421 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 18:16:28,421 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 18:16:28,422 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 18:16:28,429 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:16:28" (1/1) ... [2024-10-12 18:16:28,443 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:16:28" (1/1) ... [2024-10-12 18:16:28,467 INFO L138 Inliner]: procedures = 122, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 70 [2024-10-12 18:16:28,468 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 18:16:28,469 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 18:16:28,469 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 18:16:28,469 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 18:16:28,481 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:16:28" (1/1) ... [2024-10-12 18:16:28,481 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:16:28" (1/1) ... [2024-10-12 18:16:28,484 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:16:28" (1/1) ... [2024-10-12 18:16:28,504 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-10-12 18:16:28,508 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:16:28" (1/1) ... [2024-10-12 18:16:28,508 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:16:28" (1/1) ... [2024-10-12 18:16:28,518 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:16:28" (1/1) ... [2024-10-12 18:16:28,524 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:16:28" (1/1) ... [2024-10-12 18:16:28,526 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:16:28" (1/1) ... [2024-10-12 18:16:28,527 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:16:28" (1/1) ... [2024-10-12 18:16:28,530 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 18:16:28,532 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 18:16:28,533 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 18:16:28,533 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 18:16:28,534 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:16:28" (1/1) ... [2024-10-12 18:16:28,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 18:16:28,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:16:28,571 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 18:16:28,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 18:16:28,710 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-10-12 18:16:28,714 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-10-12 18:16:28,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-12 18:16:28,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-12 18:16:28,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-12 18:16:28,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-12 18:16:28,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-12 18:16:28,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 18:16:28,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-12 18:16:28,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-12 18:16:28,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-12 18:16:28,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-12 18:16:28,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 18:16:28,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 18:16:28,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 18:16:28,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 18:16:28,837 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 18:16:28,839 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 18:16:28,873 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-10-12 18:16:29,006 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-10-12 18:16:29,007 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 18:16:29,033 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 18:16:29,033 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-12 18:16:29,033 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:16:29 BoogieIcfgContainer [2024-10-12 18:16:29,034 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 18:16:29,037 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 18:16:29,038 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 18:16:29,042 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 18:16:29,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 06:16:27" (1/3) ... [2024-10-12 18:16:29,043 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67fe0d9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 06:16:29, skipping insertion in model container [2024-10-12 18:16:29,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:16:28" (2/3) ... [2024-10-12 18:16:29,043 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67fe0d9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 06:16:29, skipping insertion in model container [2024-10-12 18:16:29,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:16:29" (3/3) ... [2024-10-12 18:16:29,048 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_search_value-1.i [2024-10-12 18:16:29,061 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 18:16:29,061 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 18:16:29,107 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 18:16:29,116 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;@779d4088, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 18:16:29,117 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 18:16:29,121 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 21 states have internal predecessors, (30), 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-10-12 18:16:29,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-12 18:16:29,130 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:16:29,130 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:16:29,131 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:16:29,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:16:29,137 INFO L85 PathProgramCache]: Analyzing trace with hash 357278617, now seen corresponding path program 1 times [2024-10-12 18:16:29,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:16:29,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374920346] [2024-10-12 18:16:29,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:16:29,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:16:29,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:16:29,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:16:29,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:16:29,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374920346] [2024-10-12 18:16:29,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374920346] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:16:29,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:16:29,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 18:16:29,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165307449] [2024-10-12 18:16:29,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:16:29,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 18:16:29,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:16:29,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 18:16:29,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 18:16:29,359 INFO L87 Difference]: Start difference. First operand has 23 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 21 states have internal predecessors, (30), 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.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:16:29,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:16:29,382 INFO L93 Difference]: Finished difference Result 34 states and 47 transitions. [2024-10-12 18:16:29,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 18:16:29,385 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2024-10-12 18:16:29,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:16:29,391 INFO L225 Difference]: With dead ends: 34 [2024-10-12 18:16:29,392 INFO L226 Difference]: Without dead ends: 17 [2024-10-12 18:16:29,394 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-10-12 18:16:29,400 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:16:29,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:16:29,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-10-12 18:16:29,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-10-12 18:16:29,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:16:29,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2024-10-12 18:16:29,425 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 8 [2024-10-12 18:16:29,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:16:29,426 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-10-12 18:16:29,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:16:29,426 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2024-10-12 18:16:29,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-12 18:16:29,427 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:16:29,427 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:16:29,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 18:16:29,427 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:16:29,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:16:29,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1991764778, now seen corresponding path program 1 times [2024-10-12 18:16:29,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:16:29,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244497060] [2024-10-12 18:16:29,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:16:29,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:16:29,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:16:29,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:16:29,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:16:29,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244497060] [2024-10-12 18:16:29,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244497060] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:16:29,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:16:29,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 18:16:29,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397617295] [2024-10-12 18:16:29,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:16:29,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 18:16:29,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:16:29,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 18:16:29,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 18:16:29,525 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:16:29,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:16:29,550 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2024-10-12 18:16:29,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 18:16:29,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-12 18:16:29,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:16:29,551 INFO L225 Difference]: With dead ends: 27 [2024-10-12 18:16:29,551 INFO L226 Difference]: Without dead ends: 18 [2024-10-12 18:16:29,552 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-10-12 18:16:29,553 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:16:29,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:16:29,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-10-12 18:16:29,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-10-12 18:16:29,559 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-10-12 18:16:29,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2024-10-12 18:16:29,561 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2024-10-12 18:16:29,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:16:29,561 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-10-12 18:16:29,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:16:29,561 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2024-10-12 18:16:29,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-12 18:16:29,562 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:16:29,562 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:16:29,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 18:16:29,563 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:16:29,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:16:29,564 INFO L85 PathProgramCache]: Analyzing trace with hash 2049023080, now seen corresponding path program 1 times [2024-10-12 18:16:29,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:16:29,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984079567] [2024-10-12 18:16:29,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:16:29,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:16:29,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:16:29,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:16:29,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:16:29,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984079567] [2024-10-12 18:16:29,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984079567] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:16:29,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:16:29,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 18:16:29,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186147652] [2024-10-12 18:16:29,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:16:29,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 18:16:29,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:16:29,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 18:16:29,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 18:16:29,725 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:16:29,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:16:29,778 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2024-10-12 18:16:29,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 18:16:29,779 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-12 18:16:29,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:16:29,783 INFO L225 Difference]: With dead ends: 38 [2024-10-12 18:16:29,783 INFO L226 Difference]: Without dead ends: 23 [2024-10-12 18:16:29,784 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-10-12 18:16:29,785 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 5 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:16:29,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 45 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:16:29,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-12 18:16:29,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2024-10-12 18:16:29,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:16:29,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-10-12 18:16:29,794 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 10 [2024-10-12 18:16:29,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:16:29,794 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-10-12 18:16:29,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:16:29,795 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-10-12 18:16:29,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-12 18:16:29,795 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:16:29,795 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:16:29,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 18:16:29,796 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:16:29,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:16:29,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1438995548, now seen corresponding path program 1 times [2024-10-12 18:16:29,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:16:29,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979948389] [2024-10-12 18:16:29,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:16:29,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:16:29,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:16:29,946 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 18:16:29,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:16:29,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979948389] [2024-10-12 18:16:29,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979948389] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:16:29,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:16:29,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 18:16:29,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000791352] [2024-10-12 18:16:29,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:16:29,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 18:16:29,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:16:29,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 18:16:29,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 18:16:29,952 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:16:30,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:16:30,015 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2024-10-12 18:16:30,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 18:16:30,016 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-12 18:16:30,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:16:30,017 INFO L225 Difference]: With dead ends: 31 [2024-10-12 18:16:30,017 INFO L226 Difference]: Without dead ends: 28 [2024-10-12 18:16:30,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-10-12 18:16:30,020 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:16:30,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 30 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:16:30,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-12 18:16:30,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 21. [2024-10-12 18:16:30,027 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-10-12 18:16:30,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2024-10-12 18:16:30,032 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 15 [2024-10-12 18:16:30,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:16:30,032 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2024-10-12 18:16:30,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:16:30,032 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2024-10-12 18:16:30,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-12 18:16:30,034 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:16:30,034 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:16:30,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 18:16:30,035 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:16:30,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:16:30,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1477352526, now seen corresponding path program 1 times [2024-10-12 18:16:30,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:16:30,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735292794] [2024-10-12 18:16:30,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:16:30,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:16:30,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:16:30,200 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 18:16:30,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:16:30,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735292794] [2024-10-12 18:16:30,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735292794] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:16:30,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420217316] [2024-10-12 18:16:30,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:16:30,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:16:30,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:16:30,204 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-10-12 18:16:30,206 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-10-12 18:16:30,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:16:30,313 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 18:16:30,320 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:16:30,378 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 18:16:30,379 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:16:30,417 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 18:16:30,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420217316] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:16:30,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:16:30,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-10-12 18:16:30,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149204772] [2024-10-12 18:16:30,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:16:30,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 18:16:30,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:16:30,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 18:16:30,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-12 18:16:30,421 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:16:30,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:16:30,535 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2024-10-12 18:16:30,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 18:16:30,536 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-10-12 18:16:30,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:16:30,537 INFO L225 Difference]: With dead ends: 55 [2024-10-12 18:16:30,537 INFO L226 Difference]: Without dead ends: 39 [2024-10-12 18:16:30,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2024-10-12 18:16:30,539 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 12 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:16:30,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 88 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:16:30,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-12 18:16:30,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2024-10-12 18:16:30,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:16:30,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2024-10-12 18:16:30,547 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 20 [2024-10-12 18:16:30,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:16:30,548 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2024-10-12 18:16:30,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:16:30,548 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2024-10-12 18:16:30,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-12 18:16:30,549 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:16:30,549 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:16:30,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 18:16:30,750 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-10-12 18:16:30,751 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:16:30,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:16:30,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1302450726, now seen corresponding path program 2 times [2024-10-12 18:16:30,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:16:30,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916968453] [2024-10-12 18:16:30,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:16:30,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:16:30,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:16:31,003 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 18:16:31,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:16:31,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916968453] [2024-10-12 18:16:31,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916968453] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:16:31,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610475891] [2024-10-12 18:16:31,003 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 18:16:31,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:16:31,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:16:31,006 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-10-12 18:16:31,008 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-10-12 18:16:31,153 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 18:16:31,153 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 18:16:31,155 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-12 18:16:31,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:16:31,214 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 18:16:31,215 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:16:31,316 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 18:16:31,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610475891] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:16:31,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:16:31,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-10-12 18:16:31,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695703048] [2024-10-12 18:16:31,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:16:31,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-12 18:16:31,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:16:31,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-12 18:16:31,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2024-10-12 18:16:31,319 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:16:31,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:16:31,520 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2024-10-12 18:16:31,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-12 18:16:31,520 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 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 35 [2024-10-12 18:16:31,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:16:31,521 INFO L225 Difference]: With dead ends: 85 [2024-10-12 18:16:31,522 INFO L226 Difference]: Without dead ends: 69 [2024-10-12 18:16:31,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=211, Invalid=341, Unknown=0, NotChecked=0, Total=552 [2024-10-12 18:16:31,523 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 18 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:16:31,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 93 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:16:31,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-12 18:16:31,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2024-10-12 18:16:31,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.0769230769230769) internal successors, (70), 65 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:16:31,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2024-10-12 18:16:31,530 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 35 [2024-10-12 18:16:31,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:16:31,530 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2024-10-12 18:16:31,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:16:31,531 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2024-10-12 18:16:31,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-12 18:16:31,532 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:16:31,532 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:16:31,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-12 18:16:31,733 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-10-12 18:16:31,733 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:16:31,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:16:31,734 INFO L85 PathProgramCache]: Analyzing trace with hash -2036934490, now seen corresponding path program 3 times [2024-10-12 18:16:31,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:16:31,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649254150] [2024-10-12 18:16:31,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:16:31,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:16:31,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:16:35,372 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 1 proven. 91 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2024-10-12 18:16:35,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:16:35,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649254150] [2024-10-12 18:16:35,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649254150] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:16:35,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670031010] [2024-10-12 18:16:35,374 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-12 18:16:35,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:16:35,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:16:35,376 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-10-12 18:16:35,379 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-10-12 18:16:43,059 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-10-12 18:16:43,059 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 18:16:43,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 120 conjuncts are in the unsatisfiable core [2024-10-12 18:16:43,081 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:16:43,113 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-10-12 18:16:43,216 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-12 18:16:43,217 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-10-12 18:16:43,289 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-10-12 18:16:43,359 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-12 18:16:43,359 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-10-12 18:16:43,439 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-12 18:16:43,440 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-10-12 18:16:43,521 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-12 18:16:43,522 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-10-12 18:16:43,548 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-10-12 18:16:43,652 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-10-12 18:16:43,652 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-10-12 18:16:43,733 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-12 18:16:43,734 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-10-12 18:16:43,825 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-10-12 18:16:43,825 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-10-12 18:16:43,906 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-12 18:16:43,906 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-10-12 18:16:43,952 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-10-12 18:16:43,953 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-10-12 18:16:44,022 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-12 18:16:44,022 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-10-12 18:16:44,070 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-10-12 18:16:44,070 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-10-12 18:16:44,135 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-12 18:16:44,136 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-10-12 18:16:44,181 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-10-12 18:16:44,182 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-10-12 18:16:44,225 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-12 18:16:44,225 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-10-12 18:16:44,276 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-10-12 18:16:44,276 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-10-12 18:16:44,365 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-12 18:16:44,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 17 treesize of output 16 [2024-10-12 18:16:44,419 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-10-12 18:16:44,419 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-10-12 18:16:44,490 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-12 18:16:44,491 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-10-12 18:16:44,532 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-10-12 18:16:44,532 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-10-12 18:16:44,671 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-12 18:16:44,672 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-10-12 18:16:44,677 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-10-12 18:16:44,739 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:16:44,740 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-10-12 18:16:44,826 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-10-12 18:16:44,849 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 14 proven. 130 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-12 18:16:44,849 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:16:44,963 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:16:44,964 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-10-12 18:16:44,991 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 67 treesize of output 63 [2024-10-12 18:16:45,429 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:16:45,431 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-10-12 18:16:49,468 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_1 Int) (v_ArrVal_596 (Array Int 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_ArrVal_596) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 0)) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_1))) (= (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_2 Int)) (or (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_1) v_subst_2 v_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-10-12 18:16:49,546 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_3 Int) (v_subst_1 Int) (v_ArrVal_596 (Array Int Int))) (or (not (= (select (select (store (store .cse0 v_subst_3 v_arrayElimArr_1) v_subst_1 v_ArrVal_596) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0)) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_1))) (= (select v_arrayElimArr_1 .cse2) 0))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_prenex_1 (Array Int Int)) (v_subst_4 Int) (v_subst_2 Int)) (or (= (select v_arrayElimArr_1 .cse2) 0) (not (= (select (select (store (store .cse0 v_subst_4 v_arrayElimArr_1) v_subst_2 v_prenex_1) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0))))))) is different from false [2024-10-12 18:16:49,589 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:16:49,589 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-10-12 18:16:49,634 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse1 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (and (or (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_prenex_1 (Array Int Int)) (v_subst_4 Int) (v_prenex_3 (Array Int Int)) (v_subst_2 Int)) (or (= (select v_prenex_3 4) 0) (not (= (select (select (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_2) v_subst_4 v_prenex_3) v_subst_2 v_prenex_1) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 0)) (= (select v_arrayElimArr_2 .cse1) 0))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (forall ((v_arrayElimArr_2 (Array Int Int))) (or (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int)) (v_subst_3 Int) (v_subst_1 Int) (v_ArrVal_596 (Array Int Int))) (or (= (select v_arrayElimArr_1 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_1) (not (= (select (select (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_2) v_subst_3 v_arrayElimArr_1) v_subst_1 v_ArrVal_596) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 0)))) (= (select v_arrayElimArr_2 .cse1) 0))))) is different from false [2024-10-12 18:16:49,767 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4)) (.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (or (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_subst_5 Int) (v_prenex_1 (Array Int Int)) (v_subst_4 Int) (v_prenex_3 (Array Int Int)) (v_subst_2 Int)) (or (= (select v_prenex_3 4) 0) (= (select v_arrayElimArr_2 .cse0) 0) (not (= (select (select (store (store (store .cse1 v_subst_5 v_arrayElimArr_2) v_subst_4 v_prenex_3) v_subst_2 v_prenex_1) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0))))) (forall ((v_arrayElimArr_2 (Array Int Int))) (or (= (select v_arrayElimArr_2 .cse0) 0) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_subst_6 Int) (v_subst_3 Int) (v_subst_1 Int) (v_ArrVal_596 (Array Int Int))) (or (= (select v_arrayElimArr_1 4) 0) (not (= (select (select (store (store (store .cse1 v_subst_6 v_arrayElimArr_2) v_subst_3 v_arrayElimArr_1) v_subst_1 v_ArrVal_596) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_1))))))) is different from false [2024-10-12 18:16:49,825 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:16:49,825 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-10-12 18:16:53,888 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_3 (Array Int Int))) (or (= (select v_arrayElimArr_3 .cse0) 0) (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int)) (v_subst_6 Int) (v_subst_3 Int) (v_prenex_5 (Array Int Int)) (v_subst_1 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_prenex_5) v_subst_3 v_arrayElimArr_1) v_subst_1 v_ArrVal_596) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0)) (= (select v_arrayElimArr_1 4) 0) (= (select v_prenex_5 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_1))))) (or (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_5 Int) (v_prenex_1 (Array Int Int)) (v_subst_4 Int) (v_prenex_3 (Array Int Int)) (v_subst_2 Int)) (or (= (select v_arrayElimArr_3 .cse0) 0) (= (select v_prenex_3 4) 0) (= (select v_arrayElimArr_2 4) 0) (not (= (select (select (store (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) v_subst_5 v_arrayElimArr_2) v_subst_4 v_prenex_3) v_subst_2 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-10-12 18:16:54,019 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse0 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4))) (and (or (forall ((v_arrayElimArr_2 (Array Int Int)) (v_subst_8 Int) (v_arrayElimArr_3 (Array Int Int)) (v_subst_5 Int) (v_prenex_1 (Array Int Int)) (v_subst_4 Int) (v_prenex_3 (Array Int Int)) (v_subst_2 Int)) (or (= (select v_arrayElimArr_3 .cse0) 0) (= (select v_prenex_3 4) 0) (not (= (select (select (store (store (store (store .cse1 v_subst_8 v_arrayElimArr_3) v_subst_5 v_arrayElimArr_2) v_subst_4 v_prenex_3) v_subst_2 v_prenex_1) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (= (select v_arrayElimArr_2 4) 0))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (forall ((v_arrayElimArr_3 (Array Int Int))) (or (forall ((v_arrayElimArr_1 (Array Int Int)) (v_subst_7 Int) (v_subst_6 Int) (v_subst_3 Int) (v_prenex_5 (Array Int Int)) (v_subst_1 Int) (v_ArrVal_596 (Array Int Int))) (or (not (= (select (select (store (store (store (store .cse1 v_subst_7 v_arrayElimArr_3) v_subst_6 v_prenex_5) v_subst_3 v_arrayElimArr_1) v_subst_1 v_ArrVal_596) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (= (select v_arrayElimArr_1 4) 0) (= (select v_prenex_5 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_1))) (= (select v_arrayElimArr_3 .cse0) 0))))) is different from false [2024-10-12 18:16:54,101 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:16:54,102 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-10-12 18:16:54,187 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (or (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_subst_8 Int) (v_arrayElimArr_3 (Array Int Int)) (v_subst_5 Int) (v_prenex_1 (Array Int Int)) (v_subst_4 Int) (v_prenex_3 (Array Int Int)) (v_subst_2 Int)) (or (not (= (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) v_subst_8 v_arrayElimArr_3) v_subst_5 v_arrayElimArr_2) v_subst_4 v_prenex_3) v_subst_2 v_prenex_1) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 0)) (= (select v_arrayElimArr_4 .cse1) 0) (= (select v_prenex_3 4) 0) (= (select v_arrayElimArr_2 4) 0) (= (select v_arrayElimArr_3 4) 0))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (= (select v_arrayElimArr_4 .cse1) 0) (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int)) (v_subst_7 Int) (v_subst_6 Int) (v_subst_3 Int) (v_prenex_5 (Array Int Int)) (v_subst_1 Int) (v_ArrVal_596 (Array Int Int)) (v_prenex_7 (Array Int Int))) (or (= (select v_prenex_7 4) 0) (= (select v_arrayElimArr_1 4) 0) (= (select v_prenex_5 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_1) (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_prenex_7) v_subst_6 v_prenex_5) v_subst_3 v_arrayElimArr_1) v_subst_1 v_ArrVal_596) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 0)))))))) is different from false [2024-10-12 18:16:54,367 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_subst_9 Int) (v_arrayElimArr_1 (Array Int Int)) (v_subst_7 Int) (v_subst_6 Int) (v_subst_3 Int) (v_prenex_5 (Array Int Int)) (v_subst_1 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_9 v_arrayElimArr_4) v_subst_7 v_prenex_7) v_subst_6 v_prenex_5) v_subst_3 v_arrayElimArr_1) v_subst_1 v_ArrVal_596) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0)) (= (select v_arrayElimArr_1 4) 0) (= (select v_prenex_5 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_1))) (= (select v_arrayElimArr_4 .cse2) 0))) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_subst_8 Int) (v_arrayElimArr_3 (Array Int Int)) (v_subst_5 Int) (v_prenex_1 (Array Int Int)) (v_subst_4 Int) (v_prenex_3 (Array Int Int)) (v_subst_2 Int) (v_subst_10 Int)) (or (= (select v_prenex_3 4) 0) (not (= (select (select (store (store (store (store (store .cse0 v_subst_10 v_arrayElimArr_4) v_subst_8 v_arrayElimArr_3) v_subst_5 v_arrayElimArr_2) v_subst_4 v_prenex_3) v_subst_2 v_prenex_1) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0)) (= (select v_arrayElimArr_4 .cse2) 0) (= (select v_arrayElimArr_2 4) 0) (= (select v_arrayElimArr_3 4) 0))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)))) is different from false [2024-10-12 18:16:54,453 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:16:54,454 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-10-12 18:16:54,576 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (or (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_arrayElimArr_5 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_5 Int) (v_prenex_1 (Array Int Int)) (v_subst_4 Int) (v_prenex_3 (Array Int Int)) (v_subst_2 Int) (v_subst_10 Int) (v_prenex_9 (Array Int Int)) (v_subst_8 Int)) (or (= (select v_prenex_3 4) 0) (not (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) v_subst_10 v_prenex_9) v_subst_8 v_arrayElimArr_3) v_subst_5 v_arrayElimArr_2) v_subst_4 v_prenex_3) v_subst_2 v_prenex_1) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 0)) (= (select v_prenex_9 4) 0) (= (select v_arrayElimArr_5 .cse1) 0) (= (select v_arrayElimArr_2 4) 0) (= (select v_arrayElimArr_3 4) 0)))) (forall ((v_arrayElimArr_5 (Array Int Int))) (or (= (select v_arrayElimArr_5 .cse1) 0) (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int)) (v_subst_9 Int) (v_arrayElimArr_4 (Array Int Int)) (v_subst_7 Int) (v_subst_6 Int) (v_subst_3 Int) (v_prenex_5 (Array Int Int)) (v_subst_1 Int) (v_ArrVal_596 (Array Int Int)) (v_prenex_7 (Array Int Int))) (or (= (select v_prenex_7 4) 0) (= (select v_arrayElimArr_1 4) 0) (= (select v_prenex_5 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_1) (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_9 v_arrayElimArr_4) v_subst_7 v_prenex_7) v_subst_6 v_prenex_5) v_subst_3 v_arrayElimArr_1) v_subst_1 v_ArrVal_596) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (= (select v_arrayElimArr_4 4) 0))))))) is different from false [2024-10-12 18:16:54,777 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_5 (Array Int Int))) (or (forall ((v_subst_12 Int) (v_arrayElimArr_1 (Array Int Int)) (v_subst_9 Int) (v_arrayElimArr_4 (Array Int Int)) (v_subst_7 Int) (v_subst_6 Int) (v_subst_3 Int) (v_prenex_5 (Array Int Int)) (v_subst_1 Int) (v_ArrVal_596 (Array Int Int)) (v_prenex_7 (Array Int Int))) (or (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_prenex_7) v_subst_6 v_prenex_5) v_subst_3 v_arrayElimArr_1) v_subst_1 v_ArrVal_596) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0)) (= (select v_prenex_7 4) 0) (= (select v_arrayElimArr_1 4) 0) (= (select v_prenex_5 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_1) (= (select v_arrayElimArr_4 4) 0))) (= (select v_arrayElimArr_5 .cse2) 0))) (or (forall ((v_arrayElimArr_5 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_5 Int) (v_prenex_1 (Array Int Int)) (v_subst_4 Int) (v_prenex_3 (Array Int Int)) (v_subst_11 Int) (v_subst_2 Int) (v_subst_10 Int) (v_prenex_9 (Array Int Int)) (v_subst_8 Int)) (or (= (select v_prenex_3 4) 0) (= (select v_prenex_9 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_arrayElimArr_3) v_subst_5 v_arrayElimArr_2) v_subst_4 v_prenex_3) v_subst_2 v_prenex_1) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0)) (= (select v_arrayElimArr_5 .cse2) 0) (= (select v_arrayElimArr_2 4) 0) (= (select v_arrayElimArr_3 4) 0))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)))) is different from false [2024-10-12 18:16:54,866 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:16:54,867 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-10-12 18:16:58,974 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 ((v_arrayElimArr_5 (Array Int Int)) (v_subst_12 Int) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_subst_6 Int) (v_subst_3 Int) (v_subst_1 Int) (v_ArrVal_596 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_7 (Array Int Int)) (v_subst_9 Int) (v_subst_7 Int)) (or (= (select v_prenex_7 4) 0) (= (select v_arrayElimArr_5 4) 0) (= (select v_arrayElimArr_1 4) 0) (= (select v_prenex_5 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_1) (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_prenex_7) v_subst_6 v_prenex_5) v_subst_3 v_arrayElimArr_1) v_subst_1 v_ArrVal_596) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0)) (= (select v_arrayElimArr_4 4) 0))))) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_5 Int) (v_prenex_1 (Array Int Int)) (v_subst_4 Int) (v_prenex_3 (Array Int Int)) (v_subst_11 Int) (v_subst_2 Int) (v_subst_10 Int) (v_prenex_9 (Array Int Int)) (v_subst_8 Int) (v_prenex_11 (Array Int Int))) (or (= (select v_arrayElimArr_6 .cse0) 0) (= (select v_prenex_11 4) 0) (= (select v_prenex_3 4) 0) (= (select v_prenex_9 4) 0) (not (= (select (select (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) v_subst_11 v_prenex_11) v_subst_10 v_prenex_9) v_subst_8 v_arrayElimArr_3) v_subst_5 v_arrayElimArr_2) v_subst_4 v_prenex_3) v_subst_2 v_prenex_1) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0)) (= (select v_arrayElimArr_2 4) 0) (= (select v_arrayElimArr_3 4) 0))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)))) is different from false [2024-10-12 18:16:59,190 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 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_subst_14 Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_5 Int) (v_prenex_1 (Array Int Int)) (v_subst_4 Int) (v_prenex_3 (Array Int Int)) (v_subst_11 Int) (v_subst_2 Int) (v_subst_10 Int) (v_prenex_9 (Array Int Int)) (v_subst_8 Int) (v_prenex_11 (Array Int Int))) (or (= (select v_prenex_11 4) 0) (= (select v_prenex_3 4) 0) (= (select v_prenex_9 4) 0) (not (= (select (select (store (store (store (store (store (store (store .cse0 v_subst_14 v_arrayElimArr_6) v_subst_11 v_prenex_11) v_subst_10 v_prenex_9) v_subst_8 v_arrayElimArr_3) v_subst_5 v_arrayElimArr_2) v_subst_4 v_prenex_3) v_subst_2 v_prenex_1) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0)) (= (select v_arrayElimArr_6 .cse2) 0) (= (select v_arrayElimArr_2 4) 0) (= (select v_arrayElimArr_3 4) 0)))) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (forall ((v_arrayElimArr_5 (Array Int Int)) (v_subst_13 Int) (v_subst_12 Int) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_subst_6 Int) (v_subst_3 Int) (v_subst_1 Int) (v_ArrVal_596 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_7 (Array Int Int)) (v_subst_9 Int) (v_subst_7 Int)) (or (not (= (select (select (store (store (store (store (store (store (store .cse0 v_subst_13 v_arrayElimArr_6) v_subst_12 v_arrayElimArr_5) v_subst_9 v_arrayElimArr_4) v_subst_7 v_prenex_7) v_subst_6 v_prenex_5) v_subst_3 v_arrayElimArr_1) v_subst_1 v_ArrVal_596) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0)) (= (select v_prenex_7 4) 0) (= (select v_arrayElimArr_5 4) 0) (= (select v_arrayElimArr_1 4) 0) (= (select v_prenex_5 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_1) (= (select v_arrayElimArr_4 4) 0))) (= (select v_arrayElimArr_6 .cse2) 0))))) is different from false [2024-10-12 18:16:59,330 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:16:59,330 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-10-12 18:17:03,480 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_7 (Array Int Int))) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_subst_13 Int) (v_subst_12 Int) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_subst_6 Int) (v_subst_3 Int) (v_subst_1 Int) (v_ArrVal_596 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_7 (Array Int Int)) (v_subst_9 Int) (v_subst_7 Int)) (or (= (select v_arrayElimArr_6 4) 0) (= (select v_prenex_7 4) 0) (= (select v_arrayElimArr_5 4) 0) (= (select v_arrayElimArr_1 4) 0) (= (select v_prenex_5 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_1) (not (= (select (select (store (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) v_subst_13 v_arrayElimArr_6) v_subst_12 v_arrayElimArr_5) v_subst_9 v_arrayElimArr_4) v_subst_7 v_prenex_7) v_subst_6 v_prenex_5) v_subst_3 v_arrayElimArr_1) v_subst_1 v_ArrVal_596) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 0)) (= (select v_arrayElimArr_4 4) 0))) (= (select v_arrayElimArr_7 .cse1) 0))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((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_3 (Array Int Int)) (v_subst_5 Int) (v_prenex_1 (Array Int Int)) (v_subst_4 Int) (v_prenex_3 (Array Int Int)) (v_subst_11 Int) (v_subst_2 Int) (v_subst_10 Int) (v_prenex_9 (Array Int Int)) (v_subst_8 Int) (v_prenex_13 (Array Int Int)) (v_prenex_11 (Array Int Int))) (or (not (= (select (select (store (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) v_subst_14 v_prenex_13) v_subst_11 v_prenex_11) v_subst_10 v_prenex_9) v_subst_8 v_arrayElimArr_3) v_subst_5 v_arrayElimArr_2) v_subst_4 v_prenex_3) v_subst_2 v_prenex_1) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 0)) (= (select v_prenex_11 4) 0) (= (select v_prenex_3 4) 0) (= (select v_prenex_9 4) 0) (= (select v_prenex_13 4) 0) (= (select v_arrayElimArr_2 4) 0) (= (select v_arrayElimArr_3 4) 0) (= (select v_arrayElimArr_7 .cse1) 0)))))) is different from false [2024-10-12 18:17:03,742 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4)) (.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (or (forall ((v_subst_14 Int) (v_arrayElimArr_7 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (v_subst_16 Int) (v_arrayElimArr_3 (Array Int Int)) (v_subst_5 Int) (v_prenex_1 (Array Int Int)) (v_subst_4 Int) (v_prenex_3 (Array Int Int)) (v_subst_11 Int) (v_subst_2 Int) (v_subst_10 Int) (v_prenex_9 (Array Int Int)) (v_subst_8 Int) (v_prenex_13 (Array Int Int)) (v_prenex_11 (Array Int Int))) (or (= (select v_prenex_11 4) 0) (= (select v_prenex_3 4) 0) (= (select v_arrayElimArr_7 .cse0) 0) (= (select v_prenex_9 4) 0) (= (select v_prenex_13 4) 0) (not (= (select (select (store (store (store (store (store (store (store (store .cse1 v_subst_16 v_arrayElimArr_7) v_subst_14 v_prenex_13) v_subst_11 v_prenex_11) v_subst_10 v_prenex_9) v_subst_8 v_arrayElimArr_3) v_subst_5 v_arrayElimArr_2) v_subst_4 v_prenex_3) v_subst_2 v_prenex_1) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (= (select v_arrayElimArr_2 4) 0) (= (select v_arrayElimArr_3 4) 0))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (forall ((v_arrayElimArr_7 (Array Int Int))) (or (= (select v_arrayElimArr_7 .cse0) 0) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_subst_15 Int) (v_arrayElimArr_5 (Array Int Int)) (v_subst_13 Int) (v_subst_12 Int) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_subst_6 Int) (v_subst_3 Int) (v_subst_1 Int) (v_ArrVal_596 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_7 (Array Int Int)) (v_subst_9 Int) (v_subst_7 Int)) (or (= (select v_arrayElimArr_6 4) 0) (= (select v_prenex_7 4) 0) (= (select v_arrayElimArr_5 4) 0) (not (= (select (select (store (store (store (store (store (store (store (store .cse1 v_subst_15 v_arrayElimArr_7) v_subst_13 v_arrayElimArr_6) v_subst_12 v_arrayElimArr_5) v_subst_9 v_arrayElimArr_4) v_subst_7 v_prenex_7) v_subst_6 v_prenex_5) v_subst_3 v_arrayElimArr_1) v_subst_1 v_ArrVal_596) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (= (select v_arrayElimArr_1 4) 0) (= (select v_prenex_5 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_1) (= (select v_arrayElimArr_4 4) 0))))))) is different from false [2024-10-12 18:17:03,851 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:17:03,851 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-10-12 18:17:04,011 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse1 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (and (or (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_subst_14 Int) (v_arrayElimArr_8 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_16 Int) (v_subst_5 Int) (v_prenex_1 (Array Int Int)) (v_subst_4 Int) (v_prenex_3 (Array Int Int)) (v_subst_11 Int) (v_subst_2 Int) (v_subst_10 Int) (v_prenex_9 (Array Int Int)) (v_subst_8 Int) (v_prenex_13 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_prenex_15 (Array Int Int))) (or (= (select v_prenex_11 4) 0) (= (select v_prenex_3 4) 0) (= (select v_prenex_9 4) 0) (= (select v_prenex_13 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_prenex_15) v_subst_14 v_prenex_13) v_subst_11 v_prenex_11) v_subst_10 v_prenex_9) v_subst_8 v_arrayElimArr_3) v_subst_5 v_arrayElimArr_2) v_subst_4 v_prenex_3) v_subst_2 v_prenex_1) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 0)) (= (select v_arrayElimArr_8 .cse1) 0) (= (select v_arrayElimArr_2 4) 0) (= (select v_arrayElimArr_3 4) 0) (= (select v_prenex_15 4) 0)))) (forall ((v_arrayElimArr_8 (Array Int Int))) (or (forall ((v_subst_15 Int) (v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_subst_13 Int) (v_arrayElimArr_7 (Array Int Int)) (v_subst_12 Int) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_subst_6 Int) (v_subst_3 Int) (v_subst_1 Int) (v_ArrVal_596 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_7 (Array Int Int)) (v_subst_9 Int) (v_subst_7 Int)) (or (= (select v_arrayElimArr_6 4) 0) (= (select v_prenex_7 4) 0) (= (select v_arrayElimArr_5 4) 0) (not (= (select (select (store (store (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) v_subst_15 v_arrayElimArr_7) v_subst_13 v_arrayElimArr_6) v_subst_12 v_arrayElimArr_5) v_subst_9 v_arrayElimArr_4) v_subst_7 v_prenex_7) v_subst_6 v_prenex_5) v_subst_3 v_arrayElimArr_1) v_subst_1 v_ArrVal_596) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 0)) (= 0 (select v_arrayElimArr_7 4)) (= (select v_arrayElimArr_1 4) 0) (= (select v_prenex_5 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_1) (= (select v_arrayElimArr_4 4) 0))) (= (select v_arrayElimArr_8 .cse1) 0))))) is different from false [2024-10-12 18:17:04,333 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_568 (Array Int Int)) (v_arrayElimArr_8 (Array Int Int))) (or (forall ((v_subst_15 Int) (v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_subst_13 Int) (v_arrayElimArr_7 (Array Int Int)) (v_subst_12 Int) (v_subst_18 Int) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_subst_6 Int) (v_subst_3 Int) (v_subst_1 Int) (v_ArrVal_596 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_7 (Array Int Int)) (v_subst_9 Int) (v_subst_7 Int)) (or (= (select v_arrayElimArr_6 4) 0) (= (select v_prenex_7 4) 0) (= (select v_arrayElimArr_5 4) 0) (= 0 (select v_arrayElimArr_7 4)) (= (select v_arrayElimArr_1 4) 0) (= (select v_prenex_5 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_1) (not (= (select (select (store (store (store (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_568) v_subst_18 v_arrayElimArr_8) v_subst_15 v_arrayElimArr_7) v_subst_13 v_arrayElimArr_6) v_subst_12 v_arrayElimArr_5) v_subst_9 v_arrayElimArr_4) v_subst_7 v_prenex_7) v_subst_6 v_prenex_5) v_subst_3 v_arrayElimArr_1) v_subst_1 v_ArrVal_596) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 0)) (= (select v_arrayElimArr_4 4) 0))) (= (select v_arrayElimArr_8 .cse1) 0))) (or (forall ((v_subst_14 Int) (v_arrayElimArr_8 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (v_subst_17 Int) (v_arrayElimArr_3 (Array Int Int)) (v_subst_16 Int) (v_subst_5 Int) (v_prenex_1 (Array Int Int)) (v_subst_4 Int) (v_prenex_3 (Array Int Int)) (v_subst_11 Int) (v_subst_2 Int) (v_subst_10 Int) (v_ArrVal_568 (Array Int Int)) (v_prenex_9 (Array Int Int)) (v_subst_8 Int) (v_prenex_13 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_prenex_15 (Array Int Int))) (or (= (select v_prenex_11 4) 0) (= (select v_prenex_3 4) 0) (= (select v_arrayElimArr_8 .cse1) 0) (= (select v_prenex_9 4) 0) (= (select v_prenex_13 4) 0) (not (= (select (select (store (store (store (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_568) v_subst_17 v_arrayElimArr_8) v_subst_16 v_prenex_15) v_subst_14 v_prenex_13) v_subst_11 v_prenex_11) v_subst_10 v_prenex_9) v_subst_8 v_arrayElimArr_3) v_subst_5 v_arrayElimArr_2) v_subst_4 v_prenex_3) v_subst_2 v_prenex_1) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 0)) (= (select v_arrayElimArr_2 4) 0) (= (select v_arrayElimArr_3 4) 0) (= (select v_prenex_15 4) 0))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)))) is different from false [2024-10-12 18:17:04,954 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:17:04,955 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-10-12 18:17:04,963 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-12 18:17:10,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:17:10,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 316728068276225 treesize of output 316521909846022 [2024-10-12 18:17:45,731 WARN L286 SmtUtils]: Spent 34.93s on a formula simplification. DAG size of input: 99903 DAG size of output: 216 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-12 18:17:46,063 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:17:46,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 9208 treesize of output 9182 [2024-10-12 18:17:46,213 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 9170 treesize of output 9166 [2024-10-12 18:17:46,423 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:17:46,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 9172 treesize of output 9050 [2024-10-12 18:17:46,688 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:17:46,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 9044 treesize of output 8538 [2024-10-12 18:17:46,862 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:17:46,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 8532 treesize of output 7514 [2024-10-12 18:17:47,054 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:17:47,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 7508 treesize of output 7258 [2024-10-12 18:17:47,268 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:17:47,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 7252 treesize of output 7242 [2024-10-12 18:17:47,472 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:17:47,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 7236 treesize of output 7178 [2024-10-12 18:17:47,684 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:17:47,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 7172 treesize of output 7170 [2024-10-12 18:17:57,630 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 244 not checked. [2024-10-12 18:17:57,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670031010] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:17:57,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:17:57,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 16, 29] total 51 [2024-10-12 18:17:57,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437341344] [2024-10-12 18:17:57,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:17:57,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-12 18:17:57,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:17:57,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-12 18:17:57,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1140, Unknown=37, NotChecked=1328, Total=2652 [2024-10-12 18:17:57,639 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand has 52 states, 52 states have (on average 2.3461538461538463) internal successors, (122), 51 states have internal predecessors, (122), 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)