./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/recursified_loop-crafted/recursified_simple_array_index_value_1-1.i --full-output --preprocessor.use.memory.slicer false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6ae2ee47 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 ../../../trunk/examples/svcomp/recursified_loop-crafted/recursified_simple_array_index_value_1-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 affe6b2992f7714f4bd95d6011e70945dc7608cfcd3847461bdcd80eeea00f05 --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 20:57:25,661 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 20:57:25,732 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-22 20:57:25,737 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 20:57:25,738 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 20:57:25,763 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 20:57:25,764 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 20:57:25,764 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 20:57:25,764 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-22 20:57:25,767 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-22 20:57:25,768 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 20:57:25,768 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 20:57:25,769 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 20:57:25,770 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 20:57:25,770 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 20:57:25,770 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 20:57:25,770 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-22 20:57:25,770 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 20:57:25,771 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-22 20:57:25,771 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 20:57:25,771 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 20:57:25,771 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-22 20:57:25,772 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 20:57:25,772 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-22 20:57:25,772 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 20:57:25,772 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-22 20:57:25,772 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 20:57:25,773 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 20:57:25,773 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 20:57:25,773 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 20:57:25,774 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 20:57:25,774 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 20:57:25,775 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 20:57:25,775 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 20:57:25,775 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-22 20:57:25,775 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-22 20:57:25,775 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-22 20:57:25,775 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 20:57:25,776 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 20:57:25,776 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-22 20:57:25,776 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 20:57:25,776 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 20:57:25,776 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 -> affe6b2992f7714f4bd95d6011e70945dc7608cfcd3847461bdcd80eeea00f05 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-22 20:57:25,997 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 20:57:26,023 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 20:57:26,025 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 20:57:26,026 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 20:57:26,026 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 20:57:26,027 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursified_loop-crafted/recursified_simple_array_index_value_1-1.i [2023-11-22 20:57:27,079 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 20:57:27,229 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 20:57:27,230 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursified_loop-crafted/recursified_simple_array_index_value_1-1.i [2023-11-22 20:57:27,235 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0022e6c10/d0c4821b0dc848f3845826592d7f82d1/FLAG74f6fb899 [2023-11-22 20:57:27,244 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0022e6c10/d0c4821b0dc848f3845826592d7f82d1 [2023-11-22 20:57:27,246 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 20:57:27,247 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 20:57:27,248 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 20:57:27,248 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 20:57:27,251 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 20:57:27,252 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 08:57:27" (1/1) ... [2023-11-22 20:57:27,253 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49ea479b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:57:27, skipping insertion in model container [2023-11-22 20:57:27,253 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 08:57:27" (1/1) ... [2023-11-22 20:57:27,267 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 20:57:27,375 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursified_loop-crafted/recursified_simple_array_index_value_1-1.i[1692,1705] [2023-11-22 20:57:27,386 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 20:57:27,393 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 20:57:27,402 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursified_loop-crafted/recursified_simple_array_index_value_1-1.i[1692,1705] [2023-11-22 20:57:27,406 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 20:57:27,417 INFO L206 MainTranslator]: Completed translation [2023-11-22 20:57:27,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:57:27 WrapperNode [2023-11-22 20:57:27,421 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 20:57:27,422 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 20:57:27,422 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 20:57:27,422 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 20:57:27,428 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:57:27" (1/1) ... [2023-11-22 20:57:27,435 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:57:27" (1/1) ... [2023-11-22 20:57:27,448 INFO L138 Inliner]: procedures = 17, calls = 32, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 18 [2023-11-22 20:57:27,448 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 20:57:27,448 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 20:57:27,448 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 20:57:27,449 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 20:57:27,455 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:57:27" (1/1) ... [2023-11-22 20:57:27,456 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:57:27" (1/1) ... [2023-11-22 20:57:27,457 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:57:27" (1/1) ... [2023-11-22 20:57:27,457 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:57:27" (1/1) ... [2023-11-22 20:57:27,461 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:57:27" (1/1) ... [2023-11-22 20:57:27,462 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:57:27" (1/1) ... [2023-11-22 20:57:27,463 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:57:27" (1/1) ... [2023-11-22 20:57:27,464 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:57:27" (1/1) ... [2023-11-22 20:57:27,465 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 20:57:27,466 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 20:57:27,466 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 20:57:27,466 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 20:57:27,467 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:57:27" (1/1) ... [2023-11-22 20:57:27,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 20:57:27,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 20:57:27,507 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-22 20:57:27,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-22 20:57:27,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 20:57:27,552 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_32_to_33_0 [2023-11-22 20:57:27,552 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_32_to_33_0 [2023-11-22 20:57:27,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-22 20:57:27,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-22 20:57:27,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-22 20:57:27,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 20:57:27,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 20:57:27,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-22 20:57:27,553 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-22 20:57:27,553 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-22 20:57:27,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-22 20:57:27,554 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_36_to_40_0 [2023-11-22 20:57:27,554 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_36_to_40_0 [2023-11-22 20:57:27,615 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 20:57:27,617 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 20:57:27,754 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 20:57:27,788 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 20:57:27,788 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-22 20:57:27,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 08:57:27 BoogieIcfgContainer [2023-11-22 20:57:27,789 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 20:57:27,790 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 20:57:27,791 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 20:57:27,794 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 20:57:27,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 08:57:27" (1/3) ... [2023-11-22 20:57:27,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66d06d38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 08:57:27, skipping insertion in model container [2023-11-22 20:57:27,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:57:27" (2/3) ... [2023-11-22 20:57:27,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66d06d38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 08:57:27, skipping insertion in model container [2023-11-22 20:57:27,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 08:57:27" (3/3) ... [2023-11-22 20:57:27,798 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_simple_array_index_value_1-1.i [2023-11-22 20:57:27,813 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 20:57:27,814 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-22 20:57:27,847 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 20:57:27,852 INFO L357 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, mHoare=true, 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;@6c040c78, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 20:57:27,852 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-22 20:57:27,855 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 20 states have internal predecessors, (22), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-22 20:57:27,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-22 20:57:27,861 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 20:57:27,862 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 20:57:27,862 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 20:57:27,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 20:57:27,866 INFO L85 PathProgramCache]: Analyzing trace with hash -861965109, now seen corresponding path program 1 times [2023-11-22 20:57:27,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 20:57:27,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997244011] [2023-11-22 20:57:27,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:57:27,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 20:57:28,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:57:28,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:57:28,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:57:28,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 20:57:28,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 20:57:28,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997244011] [2023-11-22 20:57:28,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997244011] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 20:57:28,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 20:57:28,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 20:57:28,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830903795] [2023-11-22 20:57:28,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 20:57:28,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 20:57:28,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 20:57:28,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 20:57:28,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 20:57:28,478 INFO L87 Difference]: Start difference. First operand has 28 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 20 states have internal predecessors, (22), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 20:57:28,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 20:57:28,641 INFO L93 Difference]: Finished difference Result 54 states and 70 transitions. [2023-11-22 20:57:28,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 20:57:28,644 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2023-11-22 20:57:28,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 20:57:28,650 INFO L225 Difference]: With dead ends: 54 [2023-11-22 20:57:28,650 INFO L226 Difference]: Without dead ends: 26 [2023-11-22 20:57:28,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-22 20:57:28,658 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 16 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 20:57:28,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 40 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 20:57:28,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-22 20:57:28,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-11-22 20:57:28,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-22 20:57:28,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2023-11-22 20:57:28,692 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 15 [2023-11-22 20:57:28,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 20:57:28,692 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2023-11-22 20:57:28,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 20:57:28,693 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2023-11-22 20:57:28,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-22 20:57:28,694 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 20:57:28,694 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 20:57:28,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-22 20:57:28,694 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 20:57:28,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 20:57:28,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1296273823, now seen corresponding path program 1 times [2023-11-22 20:57:28,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 20:57:28,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243413212] [2023-11-22 20:57:28,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:57:28,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 20:57:28,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:57:29,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:57:29,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:57:29,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 20:57:29,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:57:29,439 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 20:57:29,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 20:57:29,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243413212] [2023-11-22 20:57:29,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243413212] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 20:57:29,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126995042] [2023-11-22 20:57:29,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:57:29,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 20:57:29,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 20:57:29,443 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) [2023-11-22 20:57:29,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-22 20:57:29,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:57:29,512 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-22 20:57:29,519 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 20:57:29,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-22 20:57:29,578 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 10 treesize of output 8 [2023-11-22 20:57:30,247 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 20:57:30,247 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 20:57:30,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126995042] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 20:57:30,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 20:57:30,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2023-11-22 20:57:30,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291946407] [2023-11-22 20:57:30,497 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 20:57:30,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-22 20:57:30,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 20:57:30,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-22 20:57:30,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2023-11-22 20:57:30,499 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 14 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 12 states have internal predecessors, (20), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-22 20:57:32,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 20:57:32,118 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2023-11-22 20:57:32,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-22 20:57:32,118 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 12 states have internal predecessors, (20), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 20 [2023-11-22 20:57:32,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 20:57:32,119 INFO L225 Difference]: With dead ends: 54 [2023-11-22 20:57:32,119 INFO L226 Difference]: Without dead ends: 37 [2023-11-22 20:57:32,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2023-11-22 20:57:32,120 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 23 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-22 20:57:32,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 43 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-22 20:57:32,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-11-22 20:57:32,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2023-11-22 20:57:32,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2023-11-22 20:57:32,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2023-11-22 20:57:32,127 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 20 [2023-11-22 20:57:32,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 20:57:32,128 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2023-11-22 20:57:32,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 12 states have internal predecessors, (20), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-22 20:57:32,128 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2023-11-22 20:57:32,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-22 20:57:32,129 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 20:57:32,129 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 20:57:32,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-22 20:57:32,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 20:57:32,341 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 20:57:32,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 20:57:32,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1383115103, now seen corresponding path program 2 times [2023-11-22 20:57:32,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 20:57:32,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185919424] [2023-11-22 20:57:32,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:57:32,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 20:57:32,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:57:32,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:57:32,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:57:33,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 20:57:33,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:57:33,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 20:57:33,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:57:34,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 20:57:34,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:57:34,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 20:57:34,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:57:34,332 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-22 20:57:34,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 20:57:34,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185919424] [2023-11-22 20:57:34,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185919424] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 20:57:34,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778772669] [2023-11-22 20:57:34,335 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-22 20:57:34,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 20:57:34,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 20:57:34,336 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) [2023-11-22 20:57:34,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-22 20:57:34,457 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-22 20:57:34,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 20:57:34,460 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 93 conjunts are in the unsatisfiable core [2023-11-22 20:57:34,464 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 20:57:34,468 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 10 treesize of output 8 [2023-11-22 20:57:34,471 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 11 treesize of output 7 [2023-11-22 20:57:42,880 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (and (<= 1000 (mod (select .cse0 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 4294967296)) (let ((.cse94 (select (select |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base|) |c_func_to_recursive_line_32_to_33_0_#in~index.offset|))) (let ((.cse93 (mod .cse94 4294967296))) (let ((.cse46 (<= 2147483648 .cse93)) (.cse15 (select |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base|)) (.cse16 (* .cse93 4)) (.cse17 (mod .cse94 2)) (.cse18 (<= .cse93 2147483647))) (or (let ((.cse1 (select |c_#memory_int| |c_func_to_recursive_line_32_to_33_0_#in~array.base|))) (and (= |c_#memory_int| (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base| .cse1) |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse0)) (or (and (exists ((v_prenex_16 Int) (v_prenex_48 Int) (v_DerPreprocessor_5 (Array Int Int)) (v_prenex_44 Int) (v_prenex_45 (Array Int Int))) (let ((.cse3 (store .cse15 (+ .cse16 v_prenex_48) .cse17))) (let ((.cse14 (select (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base| .cse3) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (let ((.cse13 (+ (select .cse14 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) (let ((.cse12 (store .cse14 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| .cse13))) (let ((.cse4 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base| v_DerPreprocessor_5) |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse12) |c_func_to_recursive_line_32_to_33_0_#in~array.base|))) (let ((.cse8 (store .cse4 (+ (* (mod .cse13 4294967296) 4) v_prenex_44) (mod .cse13 2)))) (let ((.cse11 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse12) |c_func_to_recursive_line_32_to_33_0_#in~array.base| .cse8) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (let ((.cse10 (+ (select .cse11 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) (let ((.cse6 (store .cse11 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| .cse10))) (let ((.cse9 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base| v_prenex_45) |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse6) |c_func_to_recursive_line_32_to_33_0_#in~array.base|)) (.cse2 (mod .cse10 4294967296))) (let ((.cse7 (store .cse9 (+ (* 4 .cse2) v_prenex_16) (mod .cse10 2)))) (and (<= .cse2 2147483647) (= .cse3 .cse4) (= .cse0 (let ((.cse5 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse6) |c_func_to_recursive_line_32_to_33_0_#in~array.base| .cse7) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (store .cse5 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| (+ 1 (select .cse5 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|))))) (= .cse8 .cse9) (= .cse1 .cse7)))))))))))))) .cse18) (and (exists ((v_prenex_48 Int) (v_DerPreprocessor_5 (Array Int Int)) (v_prenex_47 Int) (v_prenex_46 (Array Int Int)) (v_prenex_19 Int)) (let ((.cse20 (store .cse15 (+ .cse16 v_prenex_48) .cse17))) (let ((.cse31 (select (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base| .cse20) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (let ((.cse30 (+ (select .cse31 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) (let ((.cse29 (store .cse31 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| .cse30))) (let ((.cse21 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base| v_DerPreprocessor_5) |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse29) |c_func_to_recursive_line_32_to_33_0_#in~array.base|)) (.cse19 (mod .cse30 4294967296))) (let ((.cse25 (store .cse21 (+ (- 17179869184) (* .cse19 4) v_prenex_19) (mod .cse30 2)))) (let ((.cse28 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse29) |c_func_to_recursive_line_32_to_33_0_#in~array.base| .cse25) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (let ((.cse27 (+ (select .cse28 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) (let ((.cse23 (store .cse28 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| .cse27))) (let ((.cse26 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base| v_prenex_46) |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse23) |c_func_to_recursive_line_32_to_33_0_#in~array.base|))) (let ((.cse24 (store .cse26 (+ (- 17179869184) (* (mod .cse27 4294967296) 4) v_prenex_47) (mod .cse27 2)))) (and (<= 2147483648 .cse19) (= .cse20 .cse21) (= .cse0 (let ((.cse22 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse23) |c_func_to_recursive_line_32_to_33_0_#in~array.base| .cse24) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (store .cse22 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| (+ (select .cse22 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1)))) (= .cse24 .cse1) (= .cse25 .cse26)))))))))))))) .cse18) (and (exists ((v_prenex_48 Int) (v_prenex_18 Int) (v_DerPreprocessor_2 (Array Int Int)) (v_prenex_17 Int) (v_DerPreprocessor_5 (Array Int Int))) (let ((.cse33 (store .cse15 (+ .cse16 v_prenex_48) .cse17))) (let ((.cse45 (select (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base| .cse33) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (let ((.cse44 (+ (select .cse45 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) (let ((.cse43 (store .cse45 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| .cse44))) (let ((.cse34 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base| v_DerPreprocessor_5) |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse43) |c_func_to_recursive_line_32_to_33_0_#in~array.base|)) (.cse37 (mod .cse44 4294967296))) (let ((.cse38 (store .cse34 (+ (* .cse37 4) v_prenex_18) (mod .cse44 2)))) (let ((.cse42 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse43) |c_func_to_recursive_line_32_to_33_0_#in~array.base| .cse38) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (let ((.cse41 (+ (select .cse42 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) (let ((.cse36 (store .cse42 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| .cse41))) (let ((.cse39 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base| v_DerPreprocessor_2) |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse36) |c_func_to_recursive_line_32_to_33_0_#in~array.base|)) (.cse40 (mod .cse41 4294967296))) (let ((.cse32 (store .cse39 (+ (- 17179869184) v_prenex_17 (* .cse40 4)) (mod .cse41 2)))) (and (= .cse1 .cse32) (= .cse33 .cse34) (= (let ((.cse35 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse36) |c_func_to_recursive_line_32_to_33_0_#in~array.base| .cse32) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (store .cse35 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| (+ (select .cse35 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) .cse0) (<= .cse37 2147483647) (= .cse38 .cse39) (<= 2147483648 .cse40)))))))))))))) .cse18) (and .cse46 (exists ((func_to_recursive_line_32_to_33_0_~array.offset Int) (v_DerPreprocessor_5 (Array Int Int)) (v_prenex_47 Int) (v_prenex_46 (Array Int Int)) (v_prenex_19 Int)) (let ((.cse48 (store .cse15 (+ (- 17179869184) .cse16 func_to_recursive_line_32_to_33_0_~array.offset) .cse17))) (let ((.cse58 (select (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base| .cse48) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (let ((.cse57 (+ (select .cse58 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) (let ((.cse56 (store .cse58 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| .cse57))) (let ((.cse49 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base| v_DerPreprocessor_5) |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse56) |c_func_to_recursive_line_32_to_33_0_#in~array.base|))) (let ((.cse53 (store .cse49 (+ (- 17179869184) (* (mod .cse57 4294967296) 4) v_prenex_19) (mod .cse57 2)))) (let ((.cse55 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse56) |c_func_to_recursive_line_32_to_33_0_#in~array.base| .cse53) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (let ((.cse54 (+ (select .cse55 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) (let ((.cse51 (store .cse55 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| .cse54))) (let ((.cse52 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base| v_prenex_46) |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse51) |c_func_to_recursive_line_32_to_33_0_#in~array.base|))) (let ((.cse47 (store .cse52 (+ (- 17179869184) (* (mod .cse54 4294967296) 4) v_prenex_47) (mod .cse54 2)))) (and (= .cse47 .cse1) (= .cse48 .cse49) (= (let ((.cse50 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse51) |c_func_to_recursive_line_32_to_33_0_#in~array.base| .cse47) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (store .cse50 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| (+ (select .cse50 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) .cse0) (= .cse52 .cse53)))))))))))))))))) (and (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse0)) (= |c_func_to_recursive_line_32_to_33_0_#in~array.base| |c_func_to_recursive_line_32_to_33_0_#in~index.base|) (or (and .cse46 (exists ((v_prenex_61 Int)) (let ((.cse66 (select (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base| (store .cse15 (+ (- 17179869184) .cse16 v_prenex_61) .cse17)) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (let ((.cse65 (+ (select .cse66 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) (let ((.cse64 (mod .cse65 4294967296))) (and (exists ((func_to_recursive_line_32_to_33_0_~array.offset Int) (v_prenex_12 Int)) (= (let ((.cse59 (select (let ((.cse62 (select (let ((.cse63 (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| (store .cse66 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| .cse65)))) (store .cse63 |c_func_to_recursive_line_32_to_33_0_#in~array.base| (store (select .cse63 |c_func_to_recursive_line_32_to_33_0_#in~array.base|) (+ (- 17179869184) func_to_recursive_line_32_to_33_0_~array.offset (* .cse64 4)) (mod .cse65 2)))) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (let ((.cse61 (+ (select .cse62 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) (let ((.cse60 (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| (store .cse62 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| .cse61)))) (store .cse60 |c_func_to_recursive_line_32_to_33_0_#in~array.base| (store (select .cse60 |c_func_to_recursive_line_32_to_33_0_#in~array.base|) (+ (- 17179869184) v_prenex_12 (* (mod .cse61 4294967296) 4)) (mod .cse61 2)))))) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (store .cse59 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| (+ (select .cse59 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) .cse0)) (<= 2147483648 .cse64))))))) (and (or (exists ((v_prenex_62 Int)) (let ((.cse75 (select (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base| (store .cse15 (+ .cse16 v_prenex_62) .cse17)) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (let ((.cse74 (+ (select .cse75 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) (let ((.cse73 (mod .cse74 4294967296))) (and (exists ((v_prenex_59 Int) (v_prenex_13 Int)) (let ((.cse71 (select (let ((.cse72 (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| (store .cse75 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| .cse74)))) (store .cse72 |c_func_to_recursive_line_32_to_33_0_#in~array.base| (store (select .cse72 |c_func_to_recursive_line_32_to_33_0_#in~array.base|) (+ v_prenex_59 (* .cse73 4)) (mod .cse74 2)))) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (let ((.cse70 (+ (select .cse71 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) (let ((.cse67 (mod .cse70 4294967296))) (and (<= .cse67 2147483647) (= (let ((.cse68 (select (let ((.cse69 (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| (store .cse71 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| .cse70)))) (store .cse69 |c_func_to_recursive_line_32_to_33_0_#in~array.base| (store (select .cse69 |c_func_to_recursive_line_32_to_33_0_#in~array.base|) (+ (* .cse67 4) v_prenex_13) (mod .cse70 2)))) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (store .cse68 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| (+ (select .cse68 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) .cse0)))))) (<= .cse73 2147483647)))))) (exists ((v_prenex_62 Int)) (let ((.cse83 (select (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base| (store .cse15 (+ .cse16 v_prenex_62) .cse17)) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (let ((.cse82 (+ (select .cse83 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) (let ((.cse76 (mod .cse82 4294967296))) (and (<= 2147483648 .cse76) (exists ((func_to_recursive_line_32_to_33_0_~array.offset Int) (v_prenex_12 Int)) (= (let ((.cse77 (select (let ((.cse80 (select (let ((.cse81 (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| (store .cse83 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| .cse82)))) (store .cse81 |c_func_to_recursive_line_32_to_33_0_#in~array.base| (store (select .cse81 |c_func_to_recursive_line_32_to_33_0_#in~array.base|) (+ (- 17179869184) func_to_recursive_line_32_to_33_0_~array.offset (* .cse76 4)) (mod .cse82 2)))) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (let ((.cse79 (+ (select .cse80 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) (let ((.cse78 (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| (store .cse80 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| .cse79)))) (store .cse78 |c_func_to_recursive_line_32_to_33_0_#in~array.base| (store (select .cse78 |c_func_to_recursive_line_32_to_33_0_#in~array.base|) (+ (- 17179869184) (* (mod .cse79 4294967296) 4) v_prenex_12) (mod .cse79 2)))))) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (store .cse77 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| (+ (select .cse77 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) .cse0))))))) (exists ((v_prenex_62 Int)) (let ((.cse92 (select (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base| (store .cse15 (+ .cse16 v_prenex_62) .cse17)) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (let ((.cse91 (+ (select .cse92 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) (let ((.cse90 (mod .cse91 4294967296))) (and (exists ((v_prenex_10 Int) (v_prenex_60 Int)) (let ((.cse88 (select (let ((.cse89 (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| (store .cse92 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| .cse91)))) (store .cse89 |c_func_to_recursive_line_32_to_33_0_#in~array.base| (store (select .cse89 |c_func_to_recursive_line_32_to_33_0_#in~array.base|) (+ v_prenex_10 (* .cse90 4)) (mod .cse91 2)))) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (let ((.cse87 (+ (select .cse88 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) (let ((.cse84 (mod .cse87 4294967296))) (and (<= 2147483648 .cse84) (= .cse0 (let ((.cse85 (select (let ((.cse86 (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| (store .cse88 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| .cse87)))) (store .cse86 |c_func_to_recursive_line_32_to_33_0_#in~array.base| (store (select .cse86 |c_func_to_recursive_line_32_to_33_0_#in~array.base|) (+ (- 17179869184) v_prenex_60 (* 4 .cse84)) (mod .cse87 2)))) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (store .cse85 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| (+ (select .cse85 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))))))))) (<= .cse90 2147483647))))))) .cse18))))))))) is different from false [2023-11-22 20:57:50,961 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (and (<= 1000 (mod (select .cse0 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 4294967296)) (let ((.cse161 (select (select |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base|) |c_func_to_recursive_line_32_to_33_0_#in~index.offset|))) (let ((.cse160 (mod .cse161 4294967296))) (let ((.cse81 (<= .cse160 2147483647)) (.cse21 (select |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base|)) (.cse22 (* .cse160 4)) (.cse23 (mod .cse161 2)) (.cse100 (<= 2147483648 .cse160))) (or (let ((.cse1 (select |c_#memory_int| |c_func_to_recursive_line_32_to_33_0_#in~array.base|))) (and (= |c_#memory_int| (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base| .cse1) |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse0)) (or (and (or (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_prenex_98 Int)) (let ((.cse19 (store .cse21 (+ .cse22 v_prenex_98) .cse23))) (let ((.cse20 (select (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base| .cse19) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (let ((.cse18 (+ (select .cse20 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) (let ((.cse15 (store .cse20 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| .cse18))) (let ((.cse16 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base| v_DerPreprocessor_10) |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse15) |c_func_to_recursive_line_32_to_33_0_#in~array.base|)) (.cse17 (mod .cse18 4294967296))) (and (exists ((v_prenex_16 Int) (v_prenex_48 Int) (v_prenex_44 Int) (v_prenex_84 (Array Int Int)) (v_prenex_45 (Array Int Int))) (let ((.cse9 (store .cse16 (+ (* .cse17 4) v_prenex_48) (mod .cse18 2)))) (let ((.cse14 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse15) |c_func_to_recursive_line_32_to_33_0_#in~array.base| .cse9) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (let ((.cse13 (+ (select .cse14 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) (let ((.cse12 (store .cse14 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| .cse13))) (let ((.cse8 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base| v_prenex_84) |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse12) |c_func_to_recursive_line_32_to_33_0_#in~array.base|))) (let ((.cse7 (store .cse8 (+ (* (mod .cse13 4294967296) 4) v_prenex_44) (mod .cse13 2)))) (let ((.cse11 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse12) |c_func_to_recursive_line_32_to_33_0_#in~array.base| .cse7) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (let ((.cse10 (+ (select .cse11 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) (let ((.cse3 (store .cse11 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| .cse10))) (let ((.cse6 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base| v_prenex_45) |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse3) |c_func_to_recursive_line_32_to_33_0_#in~array.base|)) (.cse5 (mod .cse10 4294967296))) (let ((.cse4 (store .cse6 (+ v_prenex_16 (* .cse5 4)) (mod .cse10 2)))) (and (= .cse0 (let ((.cse2 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse3) |c_func_to_recursive_line_32_to_33_0_#in~array.base| .cse4) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (store .cse2 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| (+ (select .cse2 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1)))) (<= .cse5 2147483647) (= .cse6 .cse7) (= .cse8 .cse9) (= .cse4 .cse1)))))))))))))) (= .cse16 .cse19) (<= .cse17 2147483647)))))))) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_prenex_98 Int)) (let ((.cse25 (store .cse21 (+ .cse22 v_prenex_98) .cse23))) (let ((.cse41 (select (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base| .cse25) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (let ((.cse40 (+ (select .cse41 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) (let ((.cse38 (store .cse41 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| .cse40))) (let ((.cse24 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base| v_DerPreprocessor_10) |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse38) |c_func_to_recursive_line_32_to_33_0_#in~array.base|)) (.cse39 (mod .cse40 4294967296))) (and (= .cse24 .cse25) (exists ((func_to_recursive_line_32_to_33_0_~array.offset Int) (v_DerPreprocessor_5 (Array Int Int)) (v_prenex_47 Int) (v_prenex_46 (Array Int Int)) (v_prenex_19 Int)) (let ((.cse31 (store .cse24 (+ (- 17179869184) (* .cse39 4) func_to_recursive_line_32_to_33_0_~array.offset) (mod .cse40 2)))) (let ((.cse37 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse38) |c_func_to_recursive_line_32_to_33_0_#in~array.base| .cse31) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (let ((.cse36 (+ (select .cse37 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) (let ((.cse35 (store .cse37 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| .cse36))) (let ((.cse32 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base| v_DerPreprocessor_5) |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse35) |c_func_to_recursive_line_32_to_33_0_#in~array.base|))) (let ((.cse28 (store .cse32 (+ (- 17179869184) v_prenex_19 (* (mod .cse36 4294967296) 4)) (mod .cse36 2)))) (let ((.cse34 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse35) |c_func_to_recursive_line_32_to_33_0_#in~array.base| .cse28) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (let ((.cse33 (+ (select .cse34 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) (let ((.cse30 (store .cse34 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| .cse33))) (let ((.cse27 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base| v_prenex_46) |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse30) |c_func_to_recursive_line_32_to_33_0_#in~array.base|))) (let ((.cse26 (store .cse27 (+ (- 17179869184) (* (mod .cse33 4294967296) 4) v_prenex_47) (mod .cse33 2)))) (and (= .cse26 .cse1) (= .cse27 .cse28) (= (let ((.cse29 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse30) |c_func_to_recursive_line_32_to_33_0_#in~array.base| .cse26) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (store .cse29 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| (+ (select .cse29 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) .cse0) (= .cse31 .cse32)))))))))))))) (<= 2147483648 .cse39)))))))) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_prenex_98 Int)) (let ((.cse60 (store .cse21 (+ .cse22 v_prenex_98) .cse23))) (let ((.cse61 (select (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base| .cse60) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (let ((.cse59 (+ (select .cse61 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) (let ((.cse56 (store .cse61 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| .cse59))) (let ((.cse57 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base| v_DerPreprocessor_10) |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse56) |c_func_to_recursive_line_32_to_33_0_#in~array.base|)) (.cse58 (mod .cse59 4294967296))) (and (exists ((v_prenex_18 Int) (v_DerPreprocessor_2 (Array Int Int)) (v_prenex_17 Int) (v_prenex_86 (Array Int Int)) (v_prenex_85 Int)) (let ((.cse47 (store .cse57 (+ (* .cse58 4) v_prenex_85) (mod .cse59 2)))) (let ((.cse55 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse56) |c_func_to_recursive_line_32_to_33_0_#in~array.base| .cse47) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (let ((.cse54 (+ (select .cse55 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) (let ((.cse53 (store .cse55 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| .cse54))) (let ((.cse46 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base| v_prenex_86) |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse53) |c_func_to_recursive_line_32_to_33_0_#in~array.base|)) (.cse48 (mod .cse54 4294967296))) (let ((.cse44 (store .cse46 (+ (* .cse48 4) v_prenex_18) (mod .cse54 2)))) (let ((.cse52 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse53) |c_func_to_recursive_line_32_to_33_0_#in~array.base| .cse44) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (let ((.cse51 (+ (select .cse52 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) (let ((.cse50 (store .cse52 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| .cse51))) (let ((.cse43 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base| v_DerPreprocessor_2) |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse50) |c_func_to_recursive_line_32_to_33_0_#in~array.base|)) (.cse42 (mod .cse51 4294967296))) (let ((.cse45 (store .cse43 (+ (- 17179869184) v_prenex_17 (* .cse42 4)) (mod .cse51 2)))) (and (<= 2147483648 .cse42) (= .cse43 .cse44) (= .cse1 .cse45) (= .cse46 .cse47) (<= .cse48 2147483647) (= (let ((.cse49 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse50) |c_func_to_recursive_line_32_to_33_0_#in~array.base| .cse45) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (store .cse49 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| (+ 1 (select .cse49 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|)))) .cse0)))))))))))))) (= .cse57 .cse60) (<= .cse58 2147483647)))))))) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_prenex_98 Int)) (let ((.cse79 (store .cse21 (+ .cse22 v_prenex_98) .cse23))) (let ((.cse80 (select (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base| .cse79) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (let ((.cse78 (+ (select .cse80 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) (let ((.cse75 (store .cse80 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| .cse78))) (let ((.cse76 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base| v_DerPreprocessor_10) |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse75) |c_func_to_recursive_line_32_to_33_0_#in~array.base|)) (.cse77 (mod .cse78 4294967296))) (and (exists ((v_prenex_89 Int) (v_prenex_87 Int) (v_prenex_88 (Array Int Int)) (v_prenex_90 (Array Int Int)) (v_prenex_91 Int)) (let ((.cse62 (store .cse76 (+ (* .cse77 4) v_prenex_87) (mod .cse78 2)))) (let ((.cse74 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse75) |c_func_to_recursive_line_32_to_33_0_#in~array.base| .cse62) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (let ((.cse73 (+ (select .cse74 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) (let ((.cse72 (store .cse74 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| .cse73))) (let ((.cse63 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base| v_prenex_88) |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse72) |c_func_to_recursive_line_32_to_33_0_#in~array.base|)) (.cse69 (mod .cse73 4294967296))) (let ((.cse64 (store .cse63 (+ (- 17179869184) v_prenex_91 (* .cse69 4)) (mod .cse73 2)))) (let ((.cse71 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse72) |c_func_to_recursive_line_32_to_33_0_#in~array.base| .cse64) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (let ((.cse70 (+ (select .cse71 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) (let ((.cse68 (store .cse71 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| .cse70))) (let ((.cse65 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base| v_prenex_90) |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse68) |c_func_to_recursive_line_32_to_33_0_#in~array.base|))) (let ((.cse66 (store .cse65 (+ (- 17179869184) v_prenex_89 (* (mod .cse70 4294967296) 4)) (mod .cse70 2)))) (and (= .cse62 .cse63) (= .cse64 .cse65) (= .cse66 .cse1) (= .cse0 (let ((.cse67 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse68) |c_func_to_recursive_line_32_to_33_0_#in~array.base| .cse66) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (store .cse67 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| (+ (select .cse67 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1)))) (<= 2147483648 .cse69)))))))))))))) (= .cse76 .cse79) (<= .cse77 2147483647))))))))) .cse81) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_prenex_97 Int)) (let ((.cse83 (store .cse21 (+ (- 17179869184) .cse22 v_prenex_97) .cse23))) (let ((.cse99 (select (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base| .cse83) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (let ((.cse98 (+ (select .cse99 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) (let ((.cse96 (store .cse99 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| .cse98))) (let ((.cse82 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base| v_DerPreprocessor_10) |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse96) |c_func_to_recursive_line_32_to_33_0_#in~array.base|)) (.cse97 (mod .cse98 4294967296))) (and (= .cse82 .cse83) (exists ((func_to_recursive_line_32_to_33_0_~array.offset Int) (v_DerPreprocessor_5 (Array Int Int)) (v_prenex_47 Int) (v_prenex_46 (Array Int Int)) (v_prenex_19 Int)) (let ((.cse89 (store .cse82 (+ (- 17179869184) func_to_recursive_line_32_to_33_0_~array.offset (* .cse97 4)) (mod .cse98 2)))) (let ((.cse95 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse96) |c_func_to_recursive_line_32_to_33_0_#in~array.base| .cse89) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (let ((.cse94 (+ 1 (select .cse95 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|)))) (let ((.cse93 (store .cse95 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| .cse94))) (let ((.cse90 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base| v_DerPreprocessor_5) |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse93) |c_func_to_recursive_line_32_to_33_0_#in~array.base|))) (let ((.cse85 (store .cse90 (+ (- 17179869184) (* (mod .cse94 4294967296) 4) v_prenex_19) (mod .cse94 2)))) (let ((.cse92 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse93) |c_func_to_recursive_line_32_to_33_0_#in~array.base| .cse85) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (let ((.cse91 (+ (select .cse92 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) (let ((.cse87 (store .cse92 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| .cse91))) (let ((.cse84 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base| v_prenex_46) |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse87) |c_func_to_recursive_line_32_to_33_0_#in~array.base|))) (let ((.cse88 (store .cse84 (+ (* 4 (mod .cse91 4294967296)) (- 17179869184) v_prenex_47) (mod .cse91 2)))) (and (= .cse84 .cse85) (= .cse0 (let ((.cse86 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse87) |c_func_to_recursive_line_32_to_33_0_#in~array.base| .cse88) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (store .cse86 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| (+ (select .cse86 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1)))) (= .cse88 .cse1) (= .cse89 .cse90)))))))))))))) (<= 2147483648 .cse97)))))))) .cse100)))) (and (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse0)) (= |c_func_to_recursive_line_32_to_33_0_#in~array.base| |c_func_to_recursive_line_32_to_33_0_#in~index.base|) (or (and (or (exists ((func_to_recursive_line_32_to_33_0_~array.offset Int)) (let ((.cse113 (select (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base| (store .cse21 (+ .cse22 func_to_recursive_line_32_to_33_0_~array.offset) .cse23)) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (let ((.cse112 (+ (select .cse113 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) (let ((.cse101 (mod .cse112 4294967296))) (and (<= .cse101 2147483647) (exists ((v_prenex_10 Int) (v_prenex_109 Int) (v_prenex_60 Int)) (let ((.cse110 (select (let ((.cse111 (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| (store .cse113 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| .cse112)))) (store .cse111 |c_func_to_recursive_line_32_to_33_0_#in~array.base| (store (select .cse111 |c_func_to_recursive_line_32_to_33_0_#in~array.base|) (+ v_prenex_109 (* 4 .cse101)) (mod .cse112 2)))) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (let ((.cse109 (+ (select .cse110 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) (let ((.cse107 (mod .cse109 4294967296))) (let ((.cse106 (select (let ((.cse108 (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| (store .cse110 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| .cse109)))) (store .cse108 |c_func_to_recursive_line_32_to_33_0_#in~array.base| (store (select .cse108 |c_func_to_recursive_line_32_to_33_0_#in~array.base|) (+ v_prenex_10 (* 4 .cse107)) (mod .cse109 2)))) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (let ((.cse105 (+ (select .cse106 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) (let ((.cse102 (mod .cse105 4294967296))) (and (<= 2147483648 .cse102) (= .cse0 (let ((.cse103 (select (let ((.cse104 (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| (store .cse106 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| .cse105)))) (store .cse104 |c_func_to_recursive_line_32_to_33_0_#in~array.base| (store (select .cse104 |c_func_to_recursive_line_32_to_33_0_#in~array.base|) (+ (- 17179869184) v_prenex_60 (* .cse102 4)) (mod .cse105 2)))) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (store .cse103 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| (+ (select .cse103 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1)))) (<= .cse107 2147483647)))))))))))))) (exists ((func_to_recursive_line_32_to_33_0_~array.offset Int)) (let ((.cse124 (select (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base| (store .cse21 (+ .cse22 func_to_recursive_line_32_to_33_0_~array.offset) .cse23)) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (let ((.cse123 (+ (select .cse124 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) (let ((.cse114 (mod .cse123 4294967296))) (and (<= 2147483648 .cse114) (exists ((v_prenex_110 Int) (v_prenex_111 Int) (v_prenex_61 Int)) (= (let ((.cse115 (select (let ((.cse118 (select (let ((.cse121 (select (let ((.cse122 (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| (store .cse124 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| .cse123)))) (store .cse122 |c_func_to_recursive_line_32_to_33_0_#in~array.base| (store (select .cse122 |c_func_to_recursive_line_32_to_33_0_#in~array.base|) (+ (- 17179869184) v_prenex_61 (* 4 .cse114)) (mod .cse123 2)))) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (let ((.cse120 (+ (select .cse121 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) (let ((.cse119 (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| (store .cse121 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| .cse120)))) (store .cse119 |c_func_to_recursive_line_32_to_33_0_#in~array.base| (store (select .cse119 |c_func_to_recursive_line_32_to_33_0_#in~array.base|) (+ (- 17179869184) (* (mod .cse120 4294967296) 4) v_prenex_110) (mod .cse120 2)))))) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (let ((.cse117 (+ (select .cse118 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) (let ((.cse116 (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| (store .cse118 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| .cse117)))) (store .cse116 |c_func_to_recursive_line_32_to_33_0_#in~array.base| (store (select .cse116 |c_func_to_recursive_line_32_to_33_0_#in~array.base|) (+ (- 17179869184) (* (mod .cse117 4294967296) 4) v_prenex_111) (mod .cse117 2)))))) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (store .cse115 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| (+ (select .cse115 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) .cse0))))))) (exists ((func_to_recursive_line_32_to_33_0_~array.offset Int)) (let ((.cse136 (select (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base| (store .cse21 (+ .cse22 func_to_recursive_line_32_to_33_0_~array.offset) .cse23)) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (let ((.cse135 (+ (select .cse136 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) (let ((.cse125 (mod .cse135 4294967296))) (and (<= .cse125 2147483647) (exists ((v_prenex_112 Int) (v_prenex_12 Int) (v_prenex_62 Int)) (let ((.cse133 (select (let ((.cse134 (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| (store .cse136 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| .cse135)))) (store .cse134 |c_func_to_recursive_line_32_to_33_0_#in~array.base| (store (select .cse134 |c_func_to_recursive_line_32_to_33_0_#in~array.base|) (+ v_prenex_62 (* 4 .cse125)) (mod .cse135 2)))) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (let ((.cse132 (+ (select .cse133 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) (let ((.cse126 (mod .cse132 4294967296))) (and (<= 2147483648 .cse126) (= (let ((.cse127 (select (let ((.cse130 (select (let ((.cse131 (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| (store .cse133 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| .cse132)))) (store .cse131 |c_func_to_recursive_line_32_to_33_0_#in~array.base| (store (select .cse131 |c_func_to_recursive_line_32_to_33_0_#in~array.base|) (+ (- 17179869184) (* .cse126 4) v_prenex_112) (mod .cse132 2)))) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (let ((.cse129 (+ (select .cse130 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) (let ((.cse128 (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| (store .cse130 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| .cse129)))) (store .cse128 |c_func_to_recursive_line_32_to_33_0_#in~array.base| (store (select .cse128 |c_func_to_recursive_line_32_to_33_0_#in~array.base|) (+ (- 17179869184) v_prenex_12 (* (mod .cse129 4294967296) 4)) (mod .cse129 2)))))) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (store .cse127 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| (+ (select .cse127 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) .cse0))))))))))) (exists ((func_to_recursive_line_32_to_33_0_~array.offset Int)) (let ((.cse148 (select (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base| (store .cse21 (+ .cse22 func_to_recursive_line_32_to_33_0_~array.offset) .cse23)) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (let ((.cse147 (+ (select .cse148 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) (let ((.cse146 (mod .cse147 4294967296))) (and (exists ((v_prenex_59 Int) (v_prenex_13 Int) (v_prenex_108 Int)) (let ((.cse141 (select (let ((.cse144 (select (let ((.cse145 (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| (store .cse148 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| .cse147)))) (store .cse145 |c_func_to_recursive_line_32_to_33_0_#in~array.base| (store (select .cse145 |c_func_to_recursive_line_32_to_33_0_#in~array.base|) (+ v_prenex_108 (* 4 .cse146)) (mod .cse147 2)))) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (let ((.cse143 (+ (select .cse144 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) (let ((.cse142 (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| (store .cse144 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| .cse143)))) (store .cse142 |c_func_to_recursive_line_32_to_33_0_#in~array.base| (store (select .cse142 |c_func_to_recursive_line_32_to_33_0_#in~array.base|) (+ v_prenex_59 (* (mod .cse143 4294967296) 4)) (mod .cse143 2)))))) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (let ((.cse140 (+ (select .cse141 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) (let ((.cse137 (mod .cse140 4294967296))) (and (<= .cse137 2147483647) (= .cse0 (let ((.cse138 (select (let ((.cse139 (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| (store .cse141 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| .cse140)))) (store .cse139 |c_func_to_recursive_line_32_to_33_0_#in~array.base| (store (select .cse139 |c_func_to_recursive_line_32_to_33_0_#in~array.base|) (+ (* .cse137 4) v_prenex_13) (mod .cse140 2)))) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (store .cse138 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| (+ (select .cse138 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))))))))) (<= .cse146 2147483647))))))) .cse81) (and (exists ((v_prenex_99 Int)) (let ((.cse159 (select (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base| (store .cse21 (+ (- 17179869184) .cse22 v_prenex_99) .cse23)) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (let ((.cse158 (+ (select .cse159 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) (let ((.cse149 (mod .cse158 4294967296))) (and (<= 2147483648 .cse149) (exists ((v_prenex_110 Int) (v_prenex_111 Int) (v_prenex_61 Int)) (= .cse0 (let ((.cse150 (select (let ((.cse153 (select (let ((.cse156 (select (let ((.cse157 (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| (store .cse159 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| .cse158)))) (store .cse157 |c_func_to_recursive_line_32_to_33_0_#in~array.base| (store (select .cse157 |c_func_to_recursive_line_32_to_33_0_#in~array.base|) (+ (- 17179869184) v_prenex_61 (* .cse149 4)) (mod .cse158 2)))) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (let ((.cse155 (+ (select .cse156 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) (let ((.cse154 (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| (store .cse156 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| .cse155)))) (store .cse154 |c_func_to_recursive_line_32_to_33_0_#in~array.base| (store (select .cse154 |c_func_to_recursive_line_32_to_33_0_#in~array.base|) (+ (- 17179869184) (* (mod .cse155 4294967296) 4) v_prenex_110) (mod .cse155 2)))))) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (let ((.cse152 (+ (select .cse153 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) (let ((.cse151 (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| (store .cse153 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| .cse152)))) (store .cse151 |c_func_to_recursive_line_32_to_33_0_#in~array.base| (store (select .cse151 |c_func_to_recursive_line_32_to_33_0_#in~array.base|) (+ (- 17179869184) (* (mod .cse152 4294967296) 4) v_prenex_111) (mod .cse152 2)))))) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (store .cse150 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| (+ (select .cse150 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1)))))))))) .cse100))))))))) is different from false [2023-11-22 20:57:52,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 20:57:52,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 560 treesize of output 585 [2023-11-22 20:57:52,755 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-22 20:57:52,757 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 19 trivial. 14 not checked. [2023-11-22 20:57:52,757 INFO L327 TraceCheckSpWp]: Computing backward predicates... Killed by 15