./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 26d01a9c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/sll2c_prepend_equal.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.graphml --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 f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-17 23:26:43,459 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 23:26:43,461 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 23:26:43,483 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 23:26:43,484 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 23:26:43,486 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 23:26:43,487 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 23:26:43,490 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 23:26:43,491 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 23:26:43,494 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 23:26:43,495 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 23:26:43,497 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 23:26:43,497 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 23:26:43,500 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 23:26:43,501 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 23:26:43,502 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 23:26:43,503 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 23:26:43,504 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 23:26:43,505 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 23:26:43,509 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 23:26:43,510 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 23:26:43,510 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 23:26:43,511 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 23:26:43,512 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 23:26:43,518 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 23:26:43,518 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 23:26:43,518 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 23:26:43,519 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 23:26:43,519 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 23:26:43,520 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 23:26:43,521 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 23:26:43,521 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 23:26:43,522 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 23:26:43,523 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 23:26:43,524 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 23:26:43,524 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 23:26:43,525 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 23:26:43,525 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 23:26:43,525 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 23:26:43,526 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 23:26:43,527 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 23:26:43,528 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-17 23:26:43,555 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 23:26:43,555 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 23:26:43,556 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 23:26:43,556 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 23:26:43,557 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 23:26:43,557 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 23:26:43,557 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 23:26:43,557 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 23:26:43,558 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 23:26:43,558 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 23:26:43,558 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 23:26:43,559 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 23:26:43,559 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 23:26:43,559 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 23:26:43,559 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 23:26:43,559 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 23:26:43,559 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 23:26:43,559 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 23:26:43,560 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 23:26:43,560 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 23:26:43,560 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 23:26:43,560 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 23:26:43,560 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 23:26:43,560 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 23:26:43,560 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 23:26:43,561 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 23:26:43,561 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 23:26:43,561 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 23:26:43,561 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 23:26:43,561 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 23:26:43,561 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 23:26:43,562 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 23:26:43,562 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 23:26:43,562 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 23:26:43,562 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 23:26:43,562 INFO L138 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.graphml 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 -> f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 [2023-02-17 23:26:43,757 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 23:26:43,776 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 23:26:43,777 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 23:26:43,778 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 23:26:43,778 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 23:26:43,779 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2023-02-17 23:26:44,792 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 23:26:44,935 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 23:26:44,935 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2023-02-17 23:26:44,945 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/493b17a31/1f43a439d1aa44419e11ebdc50c9d715/FLAG0405668b8 [2023-02-17 23:26:44,956 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/493b17a31/1f43a439d1aa44419e11ebdc50c9d715 [2023-02-17 23:26:44,958 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 23:26:44,958 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 23:26:44,959 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 23:26:44,959 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 23:26:44,974 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 23:26:44,975 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 11:26:44" (1/1) ... [2023-02-17 23:26:44,976 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41a64125 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 11:26:44, skipping insertion in model container [2023-02-17 23:26:44,976 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 11:26:44" (1/1) ... [2023-02-17 23:26:44,981 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 23:26:45,019 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 23:26:45,176 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i[24458,24471] [2023-02-17 23:26:45,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 23:26:45,189 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 23:26:45,214 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i[24458,24471] [2023-02-17 23:26:45,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 23:26:45,240 INFO L208 MainTranslator]: Completed translation [2023-02-17 23:26:45,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 11:26:45 WrapperNode [2023-02-17 23:26:45,243 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 23:26:45,244 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 23:26:45,244 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 23:26:45,244 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 23:26:45,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 11:26:45" (1/1) ... [2023-02-17 23:26:45,273 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 11:26:45" (1/1) ... [2023-02-17 23:26:45,291 INFO L138 Inliner]: procedures = 127, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 137 [2023-02-17 23:26:45,291 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 23:26:45,292 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 23:26:45,292 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 23:26:45,292 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 23:26:45,298 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 11:26:45" (1/1) ... [2023-02-17 23:26:45,299 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 11:26:45" (1/1) ... [2023-02-17 23:26:45,310 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 11:26:45" (1/1) ... [2023-02-17 23:26:45,310 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 11:26:45" (1/1) ... [2023-02-17 23:26:45,321 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 11:26:45" (1/1) ... [2023-02-17 23:26:45,326 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 11:26:45" (1/1) ... [2023-02-17 23:26:45,327 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 11:26:45" (1/1) ... [2023-02-17 23:26:45,331 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 11:26:45" (1/1) ... [2023-02-17 23:26:45,333 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 23:26:45,338 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 23:26:45,338 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 23:26:45,338 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 23:26:45,339 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 11:26:45" (1/1) ... [2023-02-17 23:26:45,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 23:26:45,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 23:26:45,360 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-02-17 23:26:45,363 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-02-17 23:26:45,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-17 23:26:45,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-17 23:26:45,404 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-02-17 23:26:45,404 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-02-17 23:26:45,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-17 23:26:45,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 23:26:45,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-17 23:26:45,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-17 23:26:45,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-17 23:26:45,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-17 23:26:45,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-17 23:26:45,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 23:26:45,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 23:26:45,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 23:26:45,516 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 23:26:45,518 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 23:26:45,666 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 23:26:45,671 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 23:26:45,671 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-17 23:26:45,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 11:26:45 BoogieIcfgContainer [2023-02-17 23:26:45,673 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 23:26:45,675 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 23:26:45,675 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 23:26:45,678 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 23:26:45,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 11:26:44" (1/3) ... [2023-02-17 23:26:45,678 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76129877 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 11:26:45, skipping insertion in model container [2023-02-17 23:26:45,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 11:26:45" (2/3) ... [2023-02-17 23:26:45,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76129877 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 11:26:45, skipping insertion in model container [2023-02-17 23:26:45,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 11:26:45" (3/3) ... [2023-02-17 23:26:45,680 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_equal.i [2023-02-17 23:26:45,692 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 23:26:45,692 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 23:26:45,735 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 23:26:45,739 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=LoopsAndPotentialCycles, 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;@12da2167, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 23:26:45,739 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 23:26:45,742 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 23:26:45,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-17 23:26:45,747 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 23:26:45,747 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 23:26:45,747 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 23:26:45,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 23:26:45,751 INFO L85 PathProgramCache]: Analyzing trace with hash -483023916, now seen corresponding path program 1 times [2023-02-17 23:26:45,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 23:26:45,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622578565] [2023-02-17 23:26:45,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 23:26:45,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 23:26:45,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:26:45,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 23:26:45,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:26:45,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-17 23:26:45,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:26:45,956 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-17 23:26:45,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 23:26:45,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622578565] [2023-02-17 23:26:45,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622578565] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 23:26:45,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 23:26:45,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 23:26:45,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823428494] [2023-02-17 23:26:45,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 23:26:45,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 23:26:45,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 23:26:46,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 23:26:46,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 23:26:46,003 INFO L87 Difference]: Start difference. First operand has 36 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 23:26:46,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 23:26:46,052 INFO L93 Difference]: Finished difference Result 65 states and 89 transitions. [2023-02-17 23:26:46,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 23:26:46,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2023-02-17 23:26:46,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 23:26:46,058 INFO L225 Difference]: With dead ends: 65 [2023-02-17 23:26:46,058 INFO L226 Difference]: Without dead ends: 28 [2023-02-17 23:26:46,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 23:26:46,062 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 23:26:46,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 23:26:46,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-02-17 23:26:46,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-02-17 23:26:46,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 23:26:46,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2023-02-17 23:26:46,084 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 24 [2023-02-17 23:26:46,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 23:26:46,085 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2023-02-17 23:26:46,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 23:26:46,086 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2023-02-17 23:26:46,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-17 23:26:46,086 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 23:26:46,087 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 23:26:46,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-17 23:26:46,087 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 23:26:46,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 23:26:46,088 INFO L85 PathProgramCache]: Analyzing trace with hash -938400178, now seen corresponding path program 1 times [2023-02-17 23:26:46,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 23:26:46,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598233395] [2023-02-17 23:26:46,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 23:26:46,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 23:26:46,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:26:46,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 23:26:46,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:26:46,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-17 23:26:46,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:26:46,228 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-17 23:26:46,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 23:26:46,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598233395] [2023-02-17 23:26:46,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598233395] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 23:26:46,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 23:26:46,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 23:26:46,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212259127] [2023-02-17 23:26:46,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 23:26:46,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 23:26:46,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 23:26:46,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 23:26:46,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 23:26:46,231 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 23:26:46,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 23:26:46,271 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2023-02-17 23:26:46,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 23:26:46,273 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2023-02-17 23:26:46,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 23:26:46,275 INFO L225 Difference]: With dead ends: 52 [2023-02-17 23:26:46,275 INFO L226 Difference]: Without dead ends: 31 [2023-02-17 23:26:46,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 23:26:46,279 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 23:26:46,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 73 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 23:26:46,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-02-17 23:26:46,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2023-02-17 23:26:46,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 23:26:46,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2023-02-17 23:26:46,291 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 24 [2023-02-17 23:26:46,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 23:26:46,291 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2023-02-17 23:26:46,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 23:26:46,292 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2023-02-17 23:26:46,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-17 23:26:46,293 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 23:26:46,294 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 23:26:46,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-17 23:26:46,294 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 23:26:46,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 23:26:46,294 INFO L85 PathProgramCache]: Analyzing trace with hash 436872902, now seen corresponding path program 1 times [2023-02-17 23:26:46,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 23:26:46,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889862262] [2023-02-17 23:26:46,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 23:26:46,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 23:26:46,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:26:46,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 23:26:46,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:26:46,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 23:26:46,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:26:46,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-17 23:26:46,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:26:46,644 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-17 23:26:46,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 23:26:46,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889862262] [2023-02-17 23:26:46,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889862262] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 23:26:46,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927631657] [2023-02-17 23:26:46,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 23:26:46,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 23:26:46,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 23:26:46,649 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-02-17 23:26:46,695 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-02-17 23:26:46,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:26:46,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 38 conjunts are in the unsatisfiable core [2023-02-17 23:26:46,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 23:26:46,950 INFO L350 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 21 treesize of output 13 [2023-02-17 23:26:47,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 23:26:47,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2023-02-17 23:26:47,051 INFO L350 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 29 treesize of output 17 [2023-02-17 23:26:47,076 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 23:26:47,076 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 23:26:47,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927631657] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 23:26:47,162 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 23:26:47,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2023-02-17 23:26:47,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976029990] [2023-02-17 23:26:47,162 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 23:26:47,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-17 23:26:47,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 23:26:47,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-17 23:26:47,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=521, Unknown=4, NotChecked=0, Total=600 [2023-02-17 23:26:47,164 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 23 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 17 states have internal predecessors, (40), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-17 23:26:47,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 23:26:47,391 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2023-02-17 23:26:47,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-17 23:26:47,391 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 17 states have internal predecessors, (40), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 32 [2023-02-17 23:26:47,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 23:26:47,392 INFO L225 Difference]: With dead ends: 39 [2023-02-17 23:26:47,392 INFO L226 Difference]: Without dead ends: 31 [2023-02-17 23:26:47,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 27 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=150, Invalid=838, Unknown=4, NotChecked=0, Total=992 [2023-02-17 23:26:47,393 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 100 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 23:26:47,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 178 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 23:26:47,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-02-17 23:26:47,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2023-02-17 23:26:47,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 23:26:47,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2023-02-17 23:26:47,397 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 32 [2023-02-17 23:26:47,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 23:26:47,397 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2023-02-17 23:26:47,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 17 states have internal predecessors, (40), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-17 23:26:47,398 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2023-02-17 23:26:47,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-17 23:26:47,398 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 23:26:47,398 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 23:26:47,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-17 23:26:47,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 23:26:47,622 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 23:26:47,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 23:26:47,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1205420011, now seen corresponding path program 1 times [2023-02-17 23:26:47,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 23:26:47,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417166899] [2023-02-17 23:26:47,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 23:26:47,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 23:26:47,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:26:48,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 23:26:48,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:26:48,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 23:26:48,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:26:48,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-17 23:26:48,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:26:48,286 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-17 23:26:48,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 23:26:48,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417166899] [2023-02-17 23:26:48,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417166899] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 23:26:48,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474423487] [2023-02-17 23:26:48,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 23:26:48,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 23:26:48,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 23:26:48,307 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-02-17 23:26:48,308 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-02-17 23:26:48,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:26:48,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 89 conjunts are in the unsatisfiable core [2023-02-17 23:26:48,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 23:26:48,464 INFO L350 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 [2023-02-17 23:26:48,562 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:26:48,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2023-02-17 23:26:48,589 INFO L350 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-02-17 23:26:48,619 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:26:48,619 INFO L350 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 54 treesize of output 63 [2023-02-17 23:26:48,685 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:26:48,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 149 treesize of output 121 [2023-02-17 23:26:48,696 INFO L350 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 97 treesize of output 65 [2023-02-17 23:26:48,704 INFO L350 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 0 case distinctions, treesize of input 39 treesize of output 27 [2023-02-17 23:26:48,714 INFO L350 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 15 treesize of output 11 [2023-02-17 23:26:48,718 INFO L350 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 6 treesize of output 4 [2023-02-17 23:26:48,722 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:26:48,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 23:26:48,805 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:26:48,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 155 treesize of output 169 [2023-02-17 23:26:48,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 23:26:48,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 138 [2023-02-17 23:26:48,816 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:26:48,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 68 [2023-02-17 23:26:48,827 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:26:48,831 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:26:49,012 INFO L350 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 145 treesize of output 113 [2023-02-17 23:26:49,050 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:26:49,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 145 treesize of output 97 [2023-02-17 23:26:49,064 INFO L350 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 14 treesize of output 10 [2023-02-17 23:26:49,066 INFO L350 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 12 treesize of output 8 [2023-02-17 23:26:49,087 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 23:26:49,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 23:26:49,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474423487] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 23:26:49,187 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 23:26:49,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 35 [2023-02-17 23:26:49,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90298314] [2023-02-17 23:26:49,188 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 23:26:49,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-02-17 23:26:49,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 23:26:49,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-02-17 23:26:49,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1282, Unknown=0, NotChecked=0, Total=1406 [2023-02-17 23:26:49,192 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 35 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 27 states have internal predecessors, (48), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-17 23:26:49,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 23:26:49,952 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2023-02-17 23:26:49,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-17 23:26:49,953 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 27 states have internal predecessors, (48), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 35 [2023-02-17 23:26:49,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 23:26:49,953 INFO L225 Difference]: With dead ends: 55 [2023-02-17 23:26:49,954 INFO L226 Difference]: Without dead ends: 46 [2023-02-17 23:26:49,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 638 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=345, Invalid=2411, Unknown=0, NotChecked=0, Total=2756 [2023-02-17 23:26:49,955 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 122 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-17 23:26:49,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 293 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-17 23:26:49,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-02-17 23:26:49,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 31. [2023-02-17 23:26:49,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 23:26:49,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2023-02-17 23:26:49,962 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 35 [2023-02-17 23:26:49,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 23:26:49,963 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2023-02-17 23:26:49,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 27 states have internal predecessors, (48), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-17 23:26:49,963 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2023-02-17 23:26:49,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-17 23:26:49,966 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 23:26:49,966 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 23:26:49,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-17 23:26:50,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-02-17 23:26:50,173 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 23:26:50,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 23:26:50,173 INFO L85 PathProgramCache]: Analyzing trace with hash 790772624, now seen corresponding path program 1 times [2023-02-17 23:26:50,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 23:26:50,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064735858] [2023-02-17 23:26:50,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 23:26:50,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 23:26:50,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:26:51,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 23:26:51,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:26:51,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 23:26:51,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:26:51,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-17 23:26:51,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:26:51,331 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-17 23:26:51,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 23:26:51,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064735858] [2023-02-17 23:26:51,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064735858] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 23:26:51,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346520809] [2023-02-17 23:26:51,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 23:26:51,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 23:26:51,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 23:26:51,345 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) [2023-02-17 23:26:51,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-17 23:26:51,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:26:51,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 127 conjunts are in the unsatisfiable core [2023-02-17 23:26:51,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 23:26:51,487 INFO L350 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 [2023-02-17 23:26:51,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-17 23:26:51,581 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (and (= .cse0 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (= .cse1 |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= .cse0 1))) is different from false [2023-02-17 23:26:51,583 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (and (= .cse0 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (= .cse1 |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= .cse0 1))) is different from true [2023-02-17 23:26:51,588 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse0 0)) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= .cse0 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))) is different from false [2023-02-17 23:26:51,589 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse0 0)) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= .cse0 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))) is different from true [2023-02-17 23:26:51,601 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:26:51,601 INFO L350 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 16 treesize of output 18 [2023-02-17 23:26:51,604 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (let ((.cse0 (select |v_#valid_BEFORE_CALL_7| .cse1))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= .cse0 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse1)) (= |v_#valid_BEFORE_CALL_7| (store |v_#valid_BEFORE_CALL_6| .cse1 .cse0)) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|))))))) is different from false [2023-02-17 23:26:51,605 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (let ((.cse0 (select |v_#valid_BEFORE_CALL_7| .cse1))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= .cse0 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse1)) (= |v_#valid_BEFORE_CALL_7| (store |v_#valid_BEFORE_CALL_6| .cse1 .cse0)) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|))))))) is different from true [2023-02-17 23:26:51,611 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (let ((.cse0 (select |v_#valid_BEFORE_CALL_7| .cse1))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= .cse0 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse1)) (= |v_#valid_BEFORE_CALL_7| (store |v_#valid_BEFORE_CALL_6| .cse1 .cse0)) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|))))))) is different from false [2023-02-17 23:26:51,612 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (let ((.cse0 (select |v_#valid_BEFORE_CALL_7| .cse1))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= .cse0 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse1)) (= |v_#valid_BEFORE_CALL_7| (store |v_#valid_BEFORE_CALL_6| .cse1 .cse0)) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|))))))) is different from true [2023-02-17 23:26:51,618 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (let ((.cse0 (select |v_#valid_BEFORE_CALL_7| .cse1))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= .cse0 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse1)) (= |v_#valid_BEFORE_CALL_7| (store |v_#valid_BEFORE_CALL_6| .cse1 .cse0)) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|))))))) is different from false [2023-02-17 23:26:51,620 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (let ((.cse0 (select |v_#valid_BEFORE_CALL_7| .cse1))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= .cse0 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse1)) (= |v_#valid_BEFORE_CALL_7| (store |v_#valid_BEFORE_CALL_6| .cse1 .cse0)) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|))))))) is different from true [2023-02-17 23:26:51,633 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:26:51,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 80 [2023-02-17 23:26:51,657 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_8|))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_old(#valid)_AFTER_CALL_8| .cse0)) |v_old(#valid)_AFTER_CALL_8|)))))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int)) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (let ((.cse1 (select |v_#valid_BEFORE_CALL_7| .cse2))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= .cse1 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse2)) (= |v_#valid_BEFORE_CALL_7| (store |v_#valid_BEFORE_CALL_6| .cse2 .cse1)) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|))))))) is different from false [2023-02-17 23:26:51,659 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_8|))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_old(#valid)_AFTER_CALL_8| .cse0)) |v_old(#valid)_AFTER_CALL_8|)))))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int)) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (let ((.cse1 (select |v_#valid_BEFORE_CALL_7| .cse2))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= .cse1 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse2)) (= |v_#valid_BEFORE_CALL_7| (store |v_#valid_BEFORE_CALL_6| .cse2 .cse1)) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|))))))) is different from true [2023-02-17 23:26:51,667 INFO L350 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-02-17 23:26:51,672 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_8|))) (and (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0) (= (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_old(#valid)_AFTER_CALL_8| .cse0)) |v_old(#valid)_AFTER_CALL_8|) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse0) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| 1))))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int)) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (let ((.cse1 (select |v_#valid_BEFORE_CALL_7| .cse2))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= .cse1 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse2)) (= |v_#valid_BEFORE_CALL_7| (store |v_#valid_BEFORE_CALL_6| .cse2 .cse1)) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|))))))) is different from false [2023-02-17 23:26:51,674 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_8|))) (and (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0) (= (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_old(#valid)_AFTER_CALL_8| .cse0)) |v_old(#valid)_AFTER_CALL_8|) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse0) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| 1))))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int)) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (let ((.cse1 (select |v_#valid_BEFORE_CALL_7| .cse2))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= .cse1 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse2)) (= |v_#valid_BEFORE_CALL_7| (store |v_#valid_BEFORE_CALL_6| .cse2 .cse1)) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|))))))) is different from true [2023-02-17 23:26:51,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 23:26:51,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-17 23:26:51,710 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_8|))) (let ((.cse1 (select |v_old(#valid)_AFTER_CALL_8| .cse0))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse0) 0) (= .cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (= .cse1 1) (= (store |v_#valid_BEFORE_CALL_9| .cse0 .cse1) |v_old(#valid)_AFTER_CALL_8|) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_sll_circular_create_#res#1.base| 1)))))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int)) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (let ((.cse2 (select |v_#valid_BEFORE_CALL_7| .cse3))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= .cse2 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse3)) (= |v_#valid_BEFORE_CALL_7| (store |v_#valid_BEFORE_CALL_6| .cse3 .cse2)) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|))))))) is different from false [2023-02-17 23:26:51,714 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_8|))) (let ((.cse1 (select |v_old(#valid)_AFTER_CALL_8| .cse0))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse0) 0) (= .cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (= .cse1 1) (= (store |v_#valid_BEFORE_CALL_9| .cse0 .cse1) |v_old(#valid)_AFTER_CALL_8|) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_sll_circular_create_#res#1.base| 1)))))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int)) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (let ((.cse2 (select |v_#valid_BEFORE_CALL_7| .cse3))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= .cse2 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse3)) (= |v_#valid_BEFORE_CALL_7| (store |v_#valid_BEFORE_CALL_6| .cse3 .cse2)) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|))))))) is different from true [2023-02-17 23:26:51,727 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_8|))) (let ((.cse2 (select |v_old(#valid)_AFTER_CALL_8| .cse1)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select |v_old(#valid)_AFTER_CALL_8| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 0) (= .cse2 1) (= (store |v_#valid_BEFORE_CALL_9| .cse1 .cse2) |v_old(#valid)_AFTER_CALL_8|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_8| .cse0 1)) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse1 (select (select |c_#memory_$Pointer$.base| .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_sll_circular_prepend_~data#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int)) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (let ((.cse3 (select |v_#valid_BEFORE_CALL_7| .cse4))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= .cse3 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse4)) (= |v_#valid_BEFORE_CALL_7| (store |v_#valid_BEFORE_CALL_6| .cse4 .cse3)) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|))))))) is different from false [2023-02-17 23:26:51,729 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_8|))) (let ((.cse2 (select |v_old(#valid)_AFTER_CALL_8| .cse1)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select |v_old(#valid)_AFTER_CALL_8| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 0) (= .cse2 1) (= (store |v_#valid_BEFORE_CALL_9| .cse1 .cse2) |v_old(#valid)_AFTER_CALL_8|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_8| .cse0 1)) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse1 (select (select |c_#memory_$Pointer$.base| .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_sll_circular_prepend_~data#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int)) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (let ((.cse3 (select |v_#valid_BEFORE_CALL_7| .cse4))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= .cse3 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse4)) (= |v_#valid_BEFORE_CALL_7| (store |v_#valid_BEFORE_CALL_6| .cse4 .cse3)) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|))))))) is different from true [2023-02-17 23:26:51,739 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:26:51,739 INFO L350 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 30 [2023-02-17 23:26:51,743 INFO L350 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 18 treesize of output 14 [2023-02-17 23:26:51,752 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_8 Int)) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_8|))) (let ((.cse1 (select |v_old(#valid)_AFTER_CALL_8| .cse0))) (and (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimIndex_8) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) (= .cse1 1) (= (store |v_#valid_BEFORE_CALL_9| .cse0 .cse1) |v_old(#valid)_AFTER_CALL_8|) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)))))) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int)) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (let ((.cse2 (select |v_#valid_BEFORE_CALL_7| .cse3))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= .cse2 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse3)) (= |v_#valid_BEFORE_CALL_7| (store |v_#valid_BEFORE_CALL_6| .cse3 .cse2)) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|))))))) is different from false [2023-02-17 23:26:51,754 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_8 Int)) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_8|))) (let ((.cse1 (select |v_old(#valid)_AFTER_CALL_8| .cse0))) (and (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimIndex_8) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) (= .cse1 1) (= (store |v_#valid_BEFORE_CALL_9| .cse0 .cse1) |v_old(#valid)_AFTER_CALL_8|) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)))))) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int)) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (let ((.cse2 (select |v_#valid_BEFORE_CALL_7| .cse3))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= .cse2 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse3)) (= |v_#valid_BEFORE_CALL_7| (store |v_#valid_BEFORE_CALL_6| .cse3 .cse2)) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|))))))) is different from true [2023-02-17 23:26:51,766 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_8 Int)) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_8|))) (let ((.cse1 (select |v_old(#valid)_AFTER_CALL_8| .cse0))) (and (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimIndex_8) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) (= .cse1 1) (= (store |v_#valid_BEFORE_CALL_9| .cse0 .cse1) |v_old(#valid)_AFTER_CALL_8|) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)))))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int)) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (let ((.cse2 (select |v_#valid_BEFORE_CALL_7| .cse3))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= .cse2 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse3)) (= |v_#valid_BEFORE_CALL_7| (store |v_#valid_BEFORE_CALL_6| .cse3 .cse2)) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|))))))) is different from false [2023-02-17 23:26:51,768 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_8 Int)) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_8|))) (let ((.cse1 (select |v_old(#valid)_AFTER_CALL_8| .cse0))) (and (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimIndex_8) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) (= .cse1 1) (= (store |v_#valid_BEFORE_CALL_9| .cse0 .cse1) |v_old(#valid)_AFTER_CALL_8|) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)))))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int)) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (let ((.cse2 (select |v_#valid_BEFORE_CALL_7| .cse3))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= .cse2 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse3)) (= |v_#valid_BEFORE_CALL_7| (store |v_#valid_BEFORE_CALL_6| .cse3 .cse2)) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|))))))) is different from true [2023-02-17 23:26:51,787 INFO L350 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 13 treesize of output 9 [2023-02-17 23:26:51,798 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= |c_node_create_#in~data#1| (select (select |c_#memory_int| |c_node_create_#res#1.base|) (+ |c_node_create_#res#1.offset| 4))) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((v_ArrVal_746 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_746) |c_#memory_$Pointer$.offset|)) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_8 Int)) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_8|))) (let ((.cse1 (select |v_old(#valid)_AFTER_CALL_8| .cse0))) (and (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimIndex_8) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) (= .cse1 1) (= (store |v_#valid_BEFORE_CALL_9| .cse0 .cse1) |v_old(#valid)_AFTER_CALL_8|) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)))))) (exists ((v_ArrVal_744 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_744))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int)) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (let ((.cse2 (select |v_#valid_BEFORE_CALL_7| .cse3))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= .cse2 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse3)) (= |v_#valid_BEFORE_CALL_7| (store |v_#valid_BEFORE_CALL_6| .cse3 .cse2)) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|))))))) is different from false [2023-02-17 23:26:51,800 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= |c_node_create_#in~data#1| (select (select |c_#memory_int| |c_node_create_#res#1.base|) (+ |c_node_create_#res#1.offset| 4))) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((v_ArrVal_746 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_746) |c_#memory_$Pointer$.offset|)) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_8 Int)) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_8|))) (let ((.cse1 (select |v_old(#valid)_AFTER_CALL_8| .cse0))) (and (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimIndex_8) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) (= .cse1 1) (= (store |v_#valid_BEFORE_CALL_9| .cse0 .cse1) |v_old(#valid)_AFTER_CALL_8|) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)))))) (exists ((v_ArrVal_744 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_744))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int)) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (let ((.cse2 (select |v_#valid_BEFORE_CALL_7| .cse3))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= .cse2 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse3)) (= |v_#valid_BEFORE_CALL_7| (store |v_#valid_BEFORE_CALL_6| .cse3 .cse2)) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|))))))) is different from true [2023-02-17 23:26:51,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 23:26:51,828 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:26:51,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 71 [2023-02-17 23:26:51,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 23:26:51,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-17 23:26:51,858 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:26:51,972 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| 1)) (.cse3 (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| .cse8)) (.cse4 (select |c_#memory_$Pointer$.base| .cse8))) (and (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (let ((.cse0 (select |v_#valid_BEFORE_CALL_7| .cse1))) (and (= .cse0 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse1)) (<= .cse2 (+ (- 1) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)) (= |v_#valid_BEFORE_CALL_7| (store |v_#valid_BEFORE_CALL_6| .cse1 .cse0)) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))))) (or (not .cse3) (= (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) .cse4)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= .cse2 (+ (- 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) (+ 4 0))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_8 Int)) (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_12| |v_old(#valid)_AFTER_CALL_10|))) (let ((.cse5 (select |v_old(#valid)_AFTER_CALL_10| .cse6))) (and (= (select |v_#valid_BEFORE_CALL_12| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) 1) (= (select |v_old(#valid)_AFTER_CALL_10| v_arrayElimIndex_8) 0) (= .cse5 1) (= |v_old(#valid)_AFTER_CALL_10| (store |v_#valid_BEFORE_CALL_12| .cse6 .cse5)) (<= .cse2 (+ (- 1) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (select |v_#valid_BEFORE_CALL_12| .cse6) 0))))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (let ((.cse10 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (and (or (= .cse4 .cse7) .cse3) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_8|))) (let ((.cse11 (select |v_old(#valid)_AFTER_CALL_8| .cse9))) (and (= (select |v_old(#valid)_AFTER_CALL_8| .cse8) 0) (= .cse9 (select .cse7 .cse10)) (= (select (store |v_old(#valid)_AFTER_CALL_8| .cse8 1) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse9) 0) (= .cse11 1) (= (store |v_#valid_BEFORE_CALL_9| .cse9 .cse11) |v_old(#valid)_AFTER_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))))) (and (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_8|))) (let ((.cse13 (select |v_old(#valid)_AFTER_CALL_8| .cse12))) (and (= (select |v_old(#valid)_AFTER_CALL_8| .cse8) 0) (= (select (store |v_old(#valid)_AFTER_CALL_8| .cse8 1) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse12) 0) (= .cse13 1) (= (store |v_#valid_BEFORE_CALL_9| .cse12 .cse13) |v_old(#valid)_AFTER_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse12 (select .cse4 .cse10)))))) (not (= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|))))))))) is different from false [2023-02-17 23:26:51,975 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| 1)) (.cse3 (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| .cse8)) (.cse4 (select |c_#memory_$Pointer$.base| .cse8))) (and (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (let ((.cse0 (select |v_#valid_BEFORE_CALL_7| .cse1))) (and (= .cse0 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse1)) (<= .cse2 (+ (- 1) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)) (= |v_#valid_BEFORE_CALL_7| (store |v_#valid_BEFORE_CALL_6| .cse1 .cse0)) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))))) (or (not .cse3) (= (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) .cse4)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= .cse2 (+ (- 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) (+ 4 0))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_8 Int)) (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_12| |v_old(#valid)_AFTER_CALL_10|))) (let ((.cse5 (select |v_old(#valid)_AFTER_CALL_10| .cse6))) (and (= (select |v_#valid_BEFORE_CALL_12| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) 1) (= (select |v_old(#valid)_AFTER_CALL_10| v_arrayElimIndex_8) 0) (= .cse5 1) (= |v_old(#valid)_AFTER_CALL_10| (store |v_#valid_BEFORE_CALL_12| .cse6 .cse5)) (<= .cse2 (+ (- 1) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (select |v_#valid_BEFORE_CALL_12| .cse6) 0))))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (let ((.cse10 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (and (or (= .cse4 .cse7) .cse3) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_8|))) (let ((.cse11 (select |v_old(#valid)_AFTER_CALL_8| .cse9))) (and (= (select |v_old(#valid)_AFTER_CALL_8| .cse8) 0) (= .cse9 (select .cse7 .cse10)) (= (select (store |v_old(#valid)_AFTER_CALL_8| .cse8 1) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse9) 0) (= .cse11 1) (= (store |v_#valid_BEFORE_CALL_9| .cse9 .cse11) |v_old(#valid)_AFTER_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))))) (and (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_8|))) (let ((.cse13 (select |v_old(#valid)_AFTER_CALL_8| .cse12))) (and (= (select |v_old(#valid)_AFTER_CALL_8| .cse8) 0) (= (select (store |v_old(#valid)_AFTER_CALL_8| .cse8 1) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse12) 0) (= .cse13 1) (= (store |v_#valid_BEFORE_CALL_9| .cse12 .cse13) |v_old(#valid)_AFTER_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse12 (select .cse4 .cse10)))))) (not (= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|))))))))) is different from true [2023-02-17 23:26:52,155 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse7 (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1)) (.cse6 (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse7)) (.cse5 (select |c_#memory_$Pointer$.base| .cse7))) (and (exists ((|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_8 Int)) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_12| |v_old(#valid)_AFTER_CALL_10|))) (let ((.cse1 (select |v_old(#valid)_AFTER_CALL_10| .cse2))) (and (= (select |v_#valid_BEFORE_CALL_12| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) 1) (<= .cse0 (+ (- 1) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (select |v_old(#valid)_AFTER_CALL_10| v_arrayElimIndex_8) 0) (= .cse1 1) (= |v_old(#valid)_AFTER_CALL_10| (store |v_#valid_BEFORE_CALL_12| .cse2 .cse1)) (= (select |v_#valid_BEFORE_CALL_12| .cse2) 0))))) (<= .cse0 (+ (- 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ 4 0))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int)) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (let ((.cse3 (select |v_#valid_BEFORE_CALL_7| .cse4))) (and (= .cse3 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse4)) (= |v_#valid_BEFORE_CALL_7| (store |v_#valid_BEFORE_CALL_6| .cse4 .cse3)) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)) (<= .cse0 (+ (- 1) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))))) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= .cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (not .cse6)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (let ((.cse10 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (and (not (= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_8|))) (let ((.cse9 (select |v_old(#valid)_AFTER_CALL_8| .cse8))) (and (= (select |v_old(#valid)_AFTER_CALL_8| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse8) 0) (= .cse9 1) (= (store |v_#valid_BEFORE_CALL_9| .cse8 .cse9) |v_old(#valid)_AFTER_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse8 (select .cse5 .cse10)) (= (select (store |v_old(#valid)_AFTER_CALL_8| .cse7 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0)))))) (and (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_8|))) (let ((.cse13 (select |v_old(#valid)_AFTER_CALL_8| .cse11))) (and (= (select |v_old(#valid)_AFTER_CALL_8| .cse7) 0) (= .cse11 (select .cse12 .cse10)) (= (select |v_#valid_BEFORE_CALL_9| .cse11) 0) (= .cse13 1) (= (store |v_#valid_BEFORE_CALL_9| .cse11 .cse13) |v_old(#valid)_AFTER_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_old(#valid)_AFTER_CALL_8| .cse7 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0))))) (or .cse6 (= .cse5 .cse12))))))))) is different from false [2023-02-17 23:26:52,159 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse7 (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1)) (.cse6 (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse7)) (.cse5 (select |c_#memory_$Pointer$.base| .cse7))) (and (exists ((|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_8 Int)) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_12| |v_old(#valid)_AFTER_CALL_10|))) (let ((.cse1 (select |v_old(#valid)_AFTER_CALL_10| .cse2))) (and (= (select |v_#valid_BEFORE_CALL_12| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) 1) (<= .cse0 (+ (- 1) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (select |v_old(#valid)_AFTER_CALL_10| v_arrayElimIndex_8) 0) (= .cse1 1) (= |v_old(#valid)_AFTER_CALL_10| (store |v_#valid_BEFORE_CALL_12| .cse2 .cse1)) (= (select |v_#valid_BEFORE_CALL_12| .cse2) 0))))) (<= .cse0 (+ (- 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ 4 0))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int)) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (let ((.cse3 (select |v_#valid_BEFORE_CALL_7| .cse4))) (and (= .cse3 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse4)) (= |v_#valid_BEFORE_CALL_7| (store |v_#valid_BEFORE_CALL_6| .cse4 .cse3)) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)) (<= .cse0 (+ (- 1) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))))) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= .cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (not .cse6)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (let ((.cse10 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (and (not (= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_8|))) (let ((.cse9 (select |v_old(#valid)_AFTER_CALL_8| .cse8))) (and (= (select |v_old(#valid)_AFTER_CALL_8| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse8) 0) (= .cse9 1) (= (store |v_#valid_BEFORE_CALL_9| .cse8 .cse9) |v_old(#valid)_AFTER_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse8 (select .cse5 .cse10)) (= (select (store |v_old(#valid)_AFTER_CALL_8| .cse7 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0)))))) (and (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_8|))) (let ((.cse13 (select |v_old(#valid)_AFTER_CALL_8| .cse11))) (and (= (select |v_old(#valid)_AFTER_CALL_8| .cse7) 0) (= .cse11 (select .cse12 .cse10)) (= (select |v_#valid_BEFORE_CALL_9| .cse11) 0) (= .cse13 1) (= (store |v_#valid_BEFORE_CALL_9| .cse11 .cse13) |v_old(#valid)_AFTER_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_old(#valid)_AFTER_CALL_8| .cse7 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0))))) (or .cse6 (= .cse5 .cse12))))))))) is different from true [2023-02-17 23:26:52,350 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse7 (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1)) (.cse6 (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse7)) (.cse5 (select |c_#memory_$Pointer$.base| .cse7))) (and (exists ((|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_8 Int)) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_12| |v_old(#valid)_AFTER_CALL_10|))) (let ((.cse1 (select |v_old(#valid)_AFTER_CALL_10| .cse2))) (and (= (select |v_#valid_BEFORE_CALL_12| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) 1) (<= .cse0 (+ (- 1) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (select |v_old(#valid)_AFTER_CALL_10| v_arrayElimIndex_8) 0) (= .cse1 1) (= |v_old(#valid)_AFTER_CALL_10| (store |v_#valid_BEFORE_CALL_12| .cse2 .cse1)) (= (select |v_#valid_BEFORE_CALL_12| .cse2) 0))))) (<= .cse0 (+ (- 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ 4 0))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int)) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (let ((.cse3 (select |v_#valid_BEFORE_CALL_7| .cse4))) (and (= .cse3 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse4)) (= |v_#valid_BEFORE_CALL_7| (store |v_#valid_BEFORE_CALL_6| .cse4 .cse3)) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)) (<= .cse0 (+ (- 1) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))))) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= .cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (not .cse6)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (let ((.cse10 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (and (not (= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_8|))) (let ((.cse9 (select |v_old(#valid)_AFTER_CALL_8| .cse8))) (and (= (select |v_old(#valid)_AFTER_CALL_8| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse8) 0) (= .cse9 1) (= (store |v_#valid_BEFORE_CALL_9| .cse8 .cse9) |v_old(#valid)_AFTER_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse8 (select .cse5 .cse10)) (= (select (store |v_old(#valid)_AFTER_CALL_8| .cse7 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0)))))) (and (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_8|))) (let ((.cse13 (select |v_old(#valid)_AFTER_CALL_8| .cse11))) (and (= (select |v_old(#valid)_AFTER_CALL_8| .cse7) 0) (= .cse11 (select .cse12 .cse10)) (= (select |v_#valid_BEFORE_CALL_9| .cse11) 0) (= .cse13 1) (= (store |v_#valid_BEFORE_CALL_9| .cse11 .cse13) |v_old(#valid)_AFTER_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_old(#valid)_AFTER_CALL_8| .cse7 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0))))) (or .cse6 (= .cse5 .cse12))))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))))) is different from false [2023-02-17 23:26:52,355 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse7 (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1)) (.cse6 (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse7)) (.cse5 (select |c_#memory_$Pointer$.base| .cse7))) (and (exists ((|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_8 Int)) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_12| |v_old(#valid)_AFTER_CALL_10|))) (let ((.cse1 (select |v_old(#valid)_AFTER_CALL_10| .cse2))) (and (= (select |v_#valid_BEFORE_CALL_12| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) 1) (<= .cse0 (+ (- 1) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (select |v_old(#valid)_AFTER_CALL_10| v_arrayElimIndex_8) 0) (= .cse1 1) (= |v_old(#valid)_AFTER_CALL_10| (store |v_#valid_BEFORE_CALL_12| .cse2 .cse1)) (= (select |v_#valid_BEFORE_CALL_12| .cse2) 0))))) (<= .cse0 (+ (- 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ 4 0))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int)) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (let ((.cse3 (select |v_#valid_BEFORE_CALL_7| .cse4))) (and (= .cse3 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse4)) (= |v_#valid_BEFORE_CALL_7| (store |v_#valid_BEFORE_CALL_6| .cse4 .cse3)) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)) (<= .cse0 (+ (- 1) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))))) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= .cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (not .cse6)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (let ((.cse10 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (and (not (= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_8|))) (let ((.cse9 (select |v_old(#valid)_AFTER_CALL_8| .cse8))) (and (= (select |v_old(#valid)_AFTER_CALL_8| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse8) 0) (= .cse9 1) (= (store |v_#valid_BEFORE_CALL_9| .cse8 .cse9) |v_old(#valid)_AFTER_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse8 (select .cse5 .cse10)) (= (select (store |v_old(#valid)_AFTER_CALL_8| .cse7 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0)))))) (and (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_8|))) (let ((.cse13 (select |v_old(#valid)_AFTER_CALL_8| .cse11))) (and (= (select |v_old(#valid)_AFTER_CALL_8| .cse7) 0) (= .cse11 (select .cse12 .cse10)) (= (select |v_#valid_BEFORE_CALL_9| .cse11) 0) (= .cse13 1) (= (store |v_#valid_BEFORE_CALL_9| .cse11 .cse13) |v_old(#valid)_AFTER_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_old(#valid)_AFTER_CALL_8| .cse7 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0))))) (or .cse6 (= .cse5 .cse12))))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))))) is different from true [2023-02-17 23:26:52,580 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse7 (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1)) (.cse6 (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse7)) (.cse5 (select |c_#memory_$Pointer$.base| .cse7))) (and (exists ((|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_8 Int)) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_12| |v_old(#valid)_AFTER_CALL_10|))) (let ((.cse1 (select |v_old(#valid)_AFTER_CALL_10| .cse2))) (and (= (select |v_#valid_BEFORE_CALL_12| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) 1) (<= .cse0 (+ (- 1) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (select |v_old(#valid)_AFTER_CALL_10| v_arrayElimIndex_8) 0) (= .cse1 1) (= |v_old(#valid)_AFTER_CALL_10| (store |v_#valid_BEFORE_CALL_12| .cse2 .cse1)) (= (select |v_#valid_BEFORE_CALL_12| .cse2) 0))))) (<= .cse0 (+ (- 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ 4 0))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int)) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (let ((.cse3 (select |v_#valid_BEFORE_CALL_7| .cse4))) (and (= .cse3 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse4)) (= |v_#valid_BEFORE_CALL_7| (store |v_#valid_BEFORE_CALL_6| .cse4 .cse3)) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)) (<= .cse0 (+ (- 1) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))))) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= .cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (not .cse6)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (let ((.cse10 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (and (not (= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_8|))) (let ((.cse9 (select |v_old(#valid)_AFTER_CALL_8| .cse8))) (and (= (select |v_old(#valid)_AFTER_CALL_8| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse8) 0) (= .cse9 1) (= (store |v_#valid_BEFORE_CALL_9| .cse8 .cse9) |v_old(#valid)_AFTER_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse8 (select .cse5 .cse10)) (= (select (store |v_old(#valid)_AFTER_CALL_8| .cse7 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0)))))) (and (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_8|))) (let ((.cse13 (select |v_old(#valid)_AFTER_CALL_8| .cse11))) (and (= (select |v_old(#valid)_AFTER_CALL_8| .cse7) 0) (= .cse11 (select .cse12 .cse10)) (= (select |v_#valid_BEFORE_CALL_9| .cse11) 0) (= .cse13 1) (= (store |v_#valid_BEFORE_CALL_9| .cse11 .cse13) |v_old(#valid)_AFTER_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_old(#valid)_AFTER_CALL_8| .cse7 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0))))) (or .cse6 (= .cse5 .cse12))))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))))))) is different from false [2023-02-17 23:26:52,584 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse7 (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1)) (.cse6 (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse7)) (.cse5 (select |c_#memory_$Pointer$.base| .cse7))) (and (exists ((|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_8 Int)) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_12| |v_old(#valid)_AFTER_CALL_10|))) (let ((.cse1 (select |v_old(#valid)_AFTER_CALL_10| .cse2))) (and (= (select |v_#valid_BEFORE_CALL_12| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) 1) (<= .cse0 (+ (- 1) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (select |v_old(#valid)_AFTER_CALL_10| v_arrayElimIndex_8) 0) (= .cse1 1) (= |v_old(#valid)_AFTER_CALL_10| (store |v_#valid_BEFORE_CALL_12| .cse2 .cse1)) (= (select |v_#valid_BEFORE_CALL_12| .cse2) 0))))) (<= .cse0 (+ (- 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ 4 0))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int)) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (let ((.cse3 (select |v_#valid_BEFORE_CALL_7| .cse4))) (and (= .cse3 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse4)) (= |v_#valid_BEFORE_CALL_7| (store |v_#valid_BEFORE_CALL_6| .cse4 .cse3)) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)) (<= .cse0 (+ (- 1) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))))) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= .cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (not .cse6)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (let ((.cse10 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (and (not (= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_8|))) (let ((.cse9 (select |v_old(#valid)_AFTER_CALL_8| .cse8))) (and (= (select |v_old(#valid)_AFTER_CALL_8| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse8) 0) (= .cse9 1) (= (store |v_#valid_BEFORE_CALL_9| .cse8 .cse9) |v_old(#valid)_AFTER_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse8 (select .cse5 .cse10)) (= (select (store |v_old(#valid)_AFTER_CALL_8| .cse7 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0)))))) (and (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_8|))) (let ((.cse13 (select |v_old(#valid)_AFTER_CALL_8| .cse11))) (and (= (select |v_old(#valid)_AFTER_CALL_8| .cse7) 0) (= .cse11 (select .cse12 .cse10)) (= (select |v_#valid_BEFORE_CALL_9| .cse11) 0) (= .cse13 1) (= (store |v_#valid_BEFORE_CALL_9| .cse11 .cse13) |v_old(#valid)_AFTER_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_old(#valid)_AFTER_CALL_8| .cse7 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0))))) (or .cse6 (= .cse5 .cse12))))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))))))) is different from true [2023-02-17 23:26:52,630 INFO L350 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 41 [2023-02-17 23:26:52,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 23:26:52,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 23:26:52,643 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:26:52,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 267 treesize of output 321 [2023-02-17 23:26:52,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 23:26:52,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 23:26:52,657 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:26:52,657 INFO L350 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 371 treesize of output 373 [2023-02-17 23:26:52,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 389 treesize of output 351 [2023-02-17 23:26:52,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 23:26:52,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 23:26:52,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 23:26:52,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2023-02-17 23:26:52,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-17 23:26:52,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 140 treesize of output 107 [2023-02-17 23:26:52,724 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:26:52,733 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:26:52,875 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:26:52,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 152 treesize of output 142 [2023-02-17 23:26:53,607 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:26:53,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 103 [2023-02-17 23:26:53,631 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:26:53,631 INFO L350 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 100 treesize of output 78 [2023-02-17 23:26:53,639 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:26:53,639 INFO L350 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 94 treesize of output 74 [2023-02-17 23:26:53,656 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:26:53,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 378 treesize of output 507 [2023-02-17 23:26:53,681 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:26:53,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 108 treesize of output 108 [2023-02-17 23:26:53,691 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:26:53,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 383 treesize of output 510 [2023-02-17 23:26:53,700 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:26:53,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 112 treesize of output 111 [2023-02-17 23:26:53,708 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:26:53,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 104 [2023-02-17 23:26:53,723 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:26:53,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 288 treesize of output 373 [2023-02-17 23:26:53,733 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:26:53,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 101 [2023-02-17 23:26:53,743 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:26:53,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 98 [2023-02-17 23:26:53,752 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:26:53,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 98 [2023-02-17 23:26:53,761 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:26:53,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 292 treesize of output 376 [2023-02-17 23:26:53,778 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:26:53,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 21 select indices, 21 select index equivalence classes, 0 disjoint index pairs (out of 210 index pairs), introduced 21 new quantified variables, introduced 230 case distinctions, treesize of input 1171 treesize of output 2971 [2023-02-17 23:26:53,823 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:26:53,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 21 select indices, 21 select index equivalence classes, 0 disjoint index pairs (out of 210 index pairs), introduced 21 new quantified variables, introduced 230 case distinctions, treesize of input 1166 treesize of output 2968 [2023-02-17 23:26:53,919 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:26:53,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 91 [2023-02-17 23:26:53,935 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:26:53,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 254 treesize of output 297 [2023-02-17 23:26:56,777 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:26:56,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 88 [2023-02-17 23:26:56,790 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:26:56,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 90 case distinctions, treesize of input 747 treesize of output 1423 [2023-02-17 23:26:56,806 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:26:56,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 92 treesize of output 98 [2023-02-17 23:26:56,817 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:26:56,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 95 [2023-02-17 23:26:56,830 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:26:56,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 90 case distinctions, treesize of input 742 treesize of output 1420 [2023-02-17 23:26:56,848 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:26:56,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 95 [2023-02-17 23:26:56,859 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:26:56,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 268 treesize of output 361 [2023-02-17 23:26:56,870 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:26:56,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 272 treesize of output 364 [2023-02-17 23:26:56,946 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:26:56,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 249 treesize of output 294 [2023-02-17 23:26:56,968 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:26:56,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 101 [2023-02-17 23:26:56,991 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:26:56,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 108 [2023-02-17 23:26:57,017 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:26:57,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 105 [2023-02-17 23:26:57,042 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:26:57,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 103 [2023-02-17 23:26:57,063 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:26:57,063 INFO L350 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 100 treesize of output 78 [2023-02-17 23:26:57,071 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:26:57,071 INFO L350 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 94 treesize of output 74 [2023-02-17 23:26:57,080 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:26:57,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 20 case distinctions, treesize of input 370 treesize of output 483 [2023-02-17 23:26:57,090 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:26:57,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 20 case distinctions, treesize of input 375 treesize of output 486