./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b5317dae 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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c0706d1a5964bb8391155a217bd6084c2519a4607ef121976461541c97aecebc --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 03:49:14,511 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 03:49:14,513 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 03:49:14,541 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 03:49:14,541 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 03:49:14,544 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 03:49:14,545 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 03:49:14,546 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 03:49:14,548 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 03:49:14,551 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 03:49:14,552 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 03:49:14,553 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 03:49:14,554 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 03:49:14,555 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 03:49:14,556 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 03:49:14,557 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 03:49:14,558 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 03:49:14,559 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 03:49:14,560 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 03:49:14,563 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 03:49:14,564 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 03:49:14,565 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 03:49:14,565 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 03:49:14,566 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 03:49:14,571 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 03:49:14,572 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 03:49:14,572 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 03:49:14,573 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 03:49:14,573 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 03:49:14,574 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 03:49:14,574 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 03:49:14,575 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 03:49:14,576 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 03:49:14,576 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 03:49:14,577 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 03:49:14,577 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 03:49:14,577 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 03:49:14,578 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 03:49:14,578 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 03:49:14,579 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 03:49:14,579 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 03:49:14,580 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-16 03:49:14,595 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 03:49:14,596 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 03:49:14,596 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 03:49:14,596 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 03:49:14,597 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 03:49:14,597 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 03:49:14,597 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 03:49:14,597 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 03:49:14,598 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 03:49:14,598 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 03:49:14,598 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 03:49:14,598 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-16 03:49:14,598 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 03:49:14,598 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 03:49:14,599 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 03:49:14,599 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-16 03:49:14,599 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-16 03:49:14,599 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-16 03:49:14,599 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 03:49:14,599 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-16 03:49:14,599 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 03:49:14,600 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 03:49:14,600 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 03:49:14,600 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 03:49:14,600 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 03:49:14,600 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:49:14,600 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 03:49:14,601 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 03:49:14,601 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 03:49:14,601 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 03:49:14,601 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 03:49:14,601 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 03:49:14,602 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 03:49:14,602 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 03:49:14,602 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> c0706d1a5964bb8391155a217bd6084c2519a4607ef121976461541c97aecebc [2023-02-16 03:49:14,781 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 03:49:14,802 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 03:49:14,803 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 03:49:14,804 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 03:49:14,805 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 03:49:14,806 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i [2023-02-16 03:49:15,833 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 03:49:15,996 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 03:49:15,996 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i [2023-02-16 03:49:16,005 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d7b9699f/90731cc5c0884728aed64699a54b960c/FLAG95b957cc5 [2023-02-16 03:49:16,015 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d7b9699f/90731cc5c0884728aed64699a54b960c [2023-02-16 03:49:16,017 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 03:49:16,018 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 03:49:16,019 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 03:49:16,019 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 03:49:16,021 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 03:49:16,021 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:49:16" (1/1) ... [2023-02-16 03:49:16,022 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f5db5f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:49:16, skipping insertion in model container [2023-02-16 03:49:16,022 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:49:16" (1/1) ... [2023-02-16 03:49:16,029 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 03:49:16,064 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 03:49:16,226 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-ext3-properties/sll_circular_traversal-2.i[24092,24105] [2023-02-16 03:49:16,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:49:16,238 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 03:49:16,270 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-ext3-properties/sll_circular_traversal-2.i[24092,24105] [2023-02-16 03:49:16,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:49:16,288 INFO L208 MainTranslator]: Completed translation [2023-02-16 03:49:16,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:49:16 WrapperNode [2023-02-16 03:49:16,288 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 03:49:16,289 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 03:49:16,289 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 03:49:16,289 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 03:49:16,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:49:16" (1/1) ... [2023-02-16 03:49:16,306 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:49:16" (1/1) ... [2023-02-16 03:49:16,323 INFO L138 Inliner]: procedures = 122, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 88 [2023-02-16 03:49:16,325 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 03:49:16,326 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 03:49:16,326 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 03:49:16,326 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 03:49:16,331 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:49:16" (1/1) ... [2023-02-16 03:49:16,332 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:49:16" (1/1) ... [2023-02-16 03:49:16,334 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:49:16" (1/1) ... [2023-02-16 03:49:16,334 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:49:16" (1/1) ... [2023-02-16 03:49:16,340 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:49:16" (1/1) ... [2023-02-16 03:49:16,342 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:49:16" (1/1) ... [2023-02-16 03:49:16,343 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:49:16" (1/1) ... [2023-02-16 03:49:16,344 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:49:16" (1/1) ... [2023-02-16 03:49:16,345 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 03:49:16,346 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 03:49:16,346 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 03:49:16,346 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 03:49:16,347 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:49:16" (1/1) ... [2023-02-16 03:49:16,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:49:16,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:49:16,390 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-16 03:49:16,408 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-16 03:49:16,420 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-02-16 03:49:16,420 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-02-16 03:49:16,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-16 03:49:16,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-16 03:49:16,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-16 03:49:16,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 03:49:16,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-16 03:49:16,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-16 03:49:16,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-16 03:49:16,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-16 03:49:16,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 03:49:16,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 03:49:16,519 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 03:49:16,521 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 03:49:16,559 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-02-16 03:49:16,762 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 03:49:16,766 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 03:49:16,767 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-02-16 03:49:16,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:49:16 BoogieIcfgContainer [2023-02-16 03:49:16,768 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 03:49:16,770 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 03:49:16,770 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 03:49:16,772 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 03:49:16,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 03:49:16" (1/3) ... [2023-02-16 03:49:16,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d7b1c6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 03:49:16, skipping insertion in model container [2023-02-16 03:49:16,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:49:16" (2/3) ... [2023-02-16 03:49:16,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d7b1c6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 03:49:16, skipping insertion in model container [2023-02-16 03:49:16,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:49:16" (3/3) ... [2023-02-16 03:49:16,774 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_circular_traversal-2.i [2023-02-16 03:49:16,786 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 03:49:16,786 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2023-02-16 03:49:16,826 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 03:49:16,832 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@331a6545, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 03:49:16,833 INFO L358 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2023-02-16 03:49:16,837 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 35 states have (on average 2.0) internal successors, (70), 61 states have internal predecessors, (70), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:49:16,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-16 03:49:16,842 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:49:16,842 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-16 03:49:16,843 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-16 03:49:16,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:49:16,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1079622, now seen corresponding path program 1 times [2023-02-16 03:49:16,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:49:16,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392161396] [2023-02-16 03:49:16,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:49:16,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:49:16,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:49:17,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:49:17,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:49:17,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392161396] [2023-02-16 03:49:17,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392161396] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:49:17,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:49:17,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:49:17,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897068804] [2023-02-16 03:49:17,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:49:17,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:49:17,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:49:17,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:49:17,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:49:17,060 INFO L87 Difference]: Start difference. First operand has 63 states, 35 states have (on average 2.0) internal successors, (70), 61 states have internal predecessors, (70), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:49:17,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:49:17,141 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2023-02-16 03:49:17,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:49:17,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-02-16 03:49:17,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:49:17,147 INFO L225 Difference]: With dead ends: 76 [2023-02-16 03:49:17,148 INFO L226 Difference]: Without dead ends: 70 [2023-02-16 03:49:17,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-16 03:49:17,152 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 50 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:49:17,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 55 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:49:17,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-02-16 03:49:17,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 54. [2023-02-16 03:49:17,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.78125) internal successors, (57), 53 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:49:17,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2023-02-16 03:49:17,175 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 4 [2023-02-16 03:49:17,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:49:17,175 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2023-02-16 03:49:17,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:49:17,176 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2023-02-16 03:49:17,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-16 03:49:17,176 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:49:17,176 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-16 03:49:17,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-16 03:49:17,176 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-16 03:49:17,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:49:17,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1079623, now seen corresponding path program 1 times [2023-02-16 03:49:17,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:49:17,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414725696] [2023-02-16 03:49:17,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:49:17,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:49:17,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:49:17,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:49:17,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:49:17,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414725696] [2023-02-16 03:49:17,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414725696] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:49:17,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:49:17,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:49:17,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125527136] [2023-02-16 03:49:17,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:49:17,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:49:17,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:49:17,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:49:17,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:49:17,253 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:49:17,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:49:17,299 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2023-02-16 03:49:17,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:49:17,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-02-16 03:49:17,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:49:17,309 INFO L225 Difference]: With dead ends: 51 [2023-02-16 03:49:17,309 INFO L226 Difference]: Without dead ends: 51 [2023-02-16 03:49:17,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-16 03:49:17,313 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 50 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:49:17,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 34 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:49:17,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-02-16 03:49:17,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-02-16 03:49:17,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.6875) internal successors, (54), 50 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:49:17,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2023-02-16 03:49:17,320 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 4 [2023-02-16 03:49:17,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:49:17,321 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2023-02-16 03:49:17,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:49:17,321 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2023-02-16 03:49:17,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-16 03:49:17,321 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:49:17,324 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:49:17,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-16 03:49:17,325 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-16 03:49:17,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:49:17,327 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248729, now seen corresponding path program 1 times [2023-02-16 03:49:17,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:49:17,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399020963] [2023-02-16 03:49:17,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:49:17,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:49:17,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:49:17,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:49:17,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:49:17,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399020963] [2023-02-16 03:49:17,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399020963] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:49:17,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:49:17,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:49:17,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229521354] [2023-02-16 03:49:17,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:49:17,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:49:17,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:49:17,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:49:17,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:49:17,406 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:49:17,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:49:17,464 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2023-02-16 03:49:17,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:49:17,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-16 03:49:17,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:49:17,465 INFO L225 Difference]: With dead ends: 82 [2023-02-16 03:49:17,466 INFO L226 Difference]: Without dead ends: 82 [2023-02-16 03:49:17,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-16 03:49:17,468 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 39 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:49:17,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 95 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:49:17,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-02-16 03:49:17,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 49. [2023-02-16 03:49:17,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.625) internal successors, (52), 48 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:49:17,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2023-02-16 03:49:17,476 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 9 [2023-02-16 03:49:17,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:49:17,476 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2023-02-16 03:49:17,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:49:17,476 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2023-02-16 03:49:17,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-16 03:49:17,478 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:49:17,478 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:49:17,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-16 03:49:17,478 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-16 03:49:17,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:49:17,482 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248730, now seen corresponding path program 1 times [2023-02-16 03:49:17,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:49:17,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337341809] [2023-02-16 03:49:17,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:49:17,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:49:17,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:49:17,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:49:17,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:49:17,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337341809] [2023-02-16 03:49:17,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337341809] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:49:17,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:49:17,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:49:17,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971470086] [2023-02-16 03:49:17,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:49:17,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:49:17,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:49:17,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:49:17,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:49:17,595 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:49:17,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:49:17,636 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2023-02-16 03:49:17,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:49:17,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-16 03:49:17,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:49:17,639 INFO L225 Difference]: With dead ends: 84 [2023-02-16 03:49:17,639 INFO L226 Difference]: Without dead ends: 84 [2023-02-16 03:49:17,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-16 03:49:17,644 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 42 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:49:17,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 104 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:49:17,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-02-16 03:49:17,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 47. [2023-02-16 03:49:17,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 32 states have (on average 1.5625) internal successors, (50), 46 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:49:17,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2023-02-16 03:49:17,647 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 9 [2023-02-16 03:49:17,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:49:17,647 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2023-02-16 03:49:17,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:49:17,647 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2023-02-16 03:49:17,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-16 03:49:17,648 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:49:17,648 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:49:17,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-16 03:49:17,648 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-16 03:49:17,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:49:17,648 INFO L85 PathProgramCache]: Analyzing trace with hash 427661500, now seen corresponding path program 1 times [2023-02-16 03:49:17,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:49:17,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026444095] [2023-02-16 03:49:17,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:49:17,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:49:17,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:49:17,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:49:17,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:49:17,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026444095] [2023-02-16 03:49:17,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026444095] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:49:17,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:49:17,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:49:17,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044347771] [2023-02-16 03:49:17,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:49:17,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:49:17,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:49:17,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:49:17,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:49:17,709 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:49:17,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:49:17,714 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2023-02-16 03:49:17,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:49:17,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-02-16 03:49:17,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:49:17,716 INFO L225 Difference]: With dead ends: 52 [2023-02-16 03:49:17,716 INFO L226 Difference]: Without dead ends: 52 [2023-02-16 03:49:17,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:49:17,716 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 4 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:49:17,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 90 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:49:17,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-02-16 03:49:17,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2023-02-16 03:49:17,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 33 states have (on average 1.5454545454545454) internal successors, (51), 47 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:49:17,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2023-02-16 03:49:17,719 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 11 [2023-02-16 03:49:17,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:49:17,719 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2023-02-16 03:49:17,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:49:17,720 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2023-02-16 03:49:17,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-16 03:49:17,720 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:49:17,720 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:49:17,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-16 03:49:17,720 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-16 03:49:17,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:49:17,720 INFO L85 PathProgramCache]: Analyzing trace with hash 200371689, now seen corresponding path program 1 times [2023-02-16 03:49:17,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:49:17,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176627458] [2023-02-16 03:49:17,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:49:17,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:49:17,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:49:17,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:49:17,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:49:17,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176627458] [2023-02-16 03:49:17,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176627458] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:49:17,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912707691] [2023-02-16 03:49:17,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:49:17,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:49:17,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:49:17,777 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-16 03:49:17,778 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-16 03:49:17,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:49:17,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-16 03:49:17,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:49:17,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:49:17,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:49:17,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:49:17,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912707691] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:49:17,956 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:49:17,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-02-16 03:49:17,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264858620] [2023-02-16 03:49:17,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:49:17,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 03:49:17,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:49:17,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 03:49:17,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:49:17,959 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:49:17,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:49:17,979 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2023-02-16 03:49:17,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 03:49:17,980 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-16 03:49:17,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:49:17,980 INFO L225 Difference]: With dead ends: 63 [2023-02-16 03:49:17,980 INFO L226 Difference]: Without dead ends: 63 [2023-02-16 03:49:17,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:49:17,981 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 8 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:49:17,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 138 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:49:17,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-02-16 03:49:17,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2023-02-16 03:49:17,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 48 states have (on average 1.375) internal successors, (66), 62 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:49:17,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2023-02-16 03:49:17,984 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 16 [2023-02-16 03:49:17,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:49:17,985 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2023-02-16 03:49:17,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:49:17,985 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2023-02-16 03:49:17,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-16 03:49:17,985 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:49:17,986 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:49:17,992 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-16 03:49:18,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-02-16 03:49:18,191 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-16 03:49:18,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:49:18,191 INFO L85 PathProgramCache]: Analyzing trace with hash 527522044, now seen corresponding path program 2 times [2023-02-16 03:49:18,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:49:18,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753162830] [2023-02-16 03:49:18,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:49:18,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:49:18,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:49:18,350 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-02-16 03:49:18,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:49:18,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753162830] [2023-02-16 03:49:18,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753162830] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:49:18,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:49:18,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:49:18,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665983128] [2023-02-16 03:49:18,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:49:18,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:49:18,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:49:18,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:49:18,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:49:18,353 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:49:18,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:49:18,444 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2023-02-16 03:49:18,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:49:18,444 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-02-16 03:49:18,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:49:18,445 INFO L225 Difference]: With dead ends: 75 [2023-02-16 03:49:18,445 INFO L226 Difference]: Without dead ends: 75 [2023-02-16 03:49:18,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-16 03:49:18,446 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 124 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:49:18,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 66 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:49:18,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-02-16 03:49:18,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 60. [2023-02-16 03:49:18,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 59 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:49:18,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2023-02-16 03:49:18,452 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 31 [2023-02-16 03:49:18,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:49:18,453 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2023-02-16 03:49:18,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:49:18,453 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2023-02-16 03:49:18,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-16 03:49:18,454 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:49:18,454 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:49:18,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-16 03:49:18,454 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-16 03:49:18,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:49:18,455 INFO L85 PathProgramCache]: Analyzing trace with hash 527522045, now seen corresponding path program 1 times [2023-02-16 03:49:18,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:49:18,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535873817] [2023-02-16 03:49:18,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:49:18,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:49:18,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:49:18,658 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-16 03:49:18,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:49:18,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535873817] [2023-02-16 03:49:18,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535873817] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:49:18,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:49:18,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:49:18,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874159199] [2023-02-16 03:49:18,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:49:18,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:49:18,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:49:18,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:49:18,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:49:18,663 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:49:18,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:49:18,751 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2023-02-16 03:49:18,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 03:49:18,752 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-02-16 03:49:18,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:49:18,753 INFO L225 Difference]: With dead ends: 66 [2023-02-16 03:49:18,753 INFO L226 Difference]: Without dead ends: 66 [2023-02-16 03:49:18,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-16 03:49:18,754 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 131 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:49:18,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 47 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:49:18,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-02-16 03:49:18,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2023-02-16 03:49:18,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 62 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:49:18,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2023-02-16 03:49:18,770 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 31 [2023-02-16 03:49:18,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:49:18,770 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2023-02-16 03:49:18,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:49:18,770 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2023-02-16 03:49:18,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-16 03:49:18,771 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:49:18,771 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:49:18,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-16 03:49:18,771 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-16 03:49:18,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:49:18,772 INFO L85 PathProgramCache]: Analyzing trace with hash 142544431, now seen corresponding path program 1 times [2023-02-16 03:49:18,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:49:18,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691733653] [2023-02-16 03:49:18,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:49:18,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:49:18,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:49:19,384 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-16 03:49:19,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:49:19,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691733653] [2023-02-16 03:49:19,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691733653] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:49:19,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035088316] [2023-02-16 03:49:19,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:49:19,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:49:19,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:49:19,387 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-16 03:49:19,389 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-16 03:49:19,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:49:19,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-16 03:49:19,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:49:19,636 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-16 03:49:19,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:49:19,687 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 21 treesize of output 20 [2023-02-16 03:49:19,739 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 15 treesize of output 7 [2023-02-16 03:49:19,753 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-16 03:49:19,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:49:19,954 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-16 03:49:19,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035088316] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:49:19,954 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:49:19,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2023-02-16 03:49:19,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859350892] [2023-02-16 03:49:19,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:49:19,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-16 03:49:19,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:49:19,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-16 03:49:19,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2023-02-16 03:49:19,956 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand has 25 states, 25 states have (on average 2.56) internal successors, (64), 25 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:49:20,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:49:20,179 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2023-02-16 03:49:20,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 03:49:20,179 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.56) internal successors, (64), 25 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-02-16 03:49:20,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:49:20,179 INFO L225 Difference]: With dead ends: 63 [2023-02-16 03:49:20,179 INFO L226 Difference]: Without dead ends: 63 [2023-02-16 03:49:20,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=204, Invalid=726, Unknown=0, NotChecked=0, Total=930 [2023-02-16 03:49:20,180 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 189 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:49:20,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 325 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:49:20,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-02-16 03:49:20,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2023-02-16 03:49:20,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 62 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:49:20,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2023-02-16 03:49:20,182 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 33 [2023-02-16 03:49:20,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:49:20,182 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2023-02-16 03:49:20,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.56) internal successors, (64), 25 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:49:20,182 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2023-02-16 03:49:20,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-16 03:49:20,182 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:49:20,182 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:49:20,190 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-16 03:49:20,383 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,SelfDestructingSolverStorable8 [2023-02-16 03:49:20,383 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-16 03:49:20,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:49:20,384 INFO L85 PathProgramCache]: Analyzing trace with hash 2041941388, now seen corresponding path program 1 times [2023-02-16 03:49:20,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:49:20,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709562194] [2023-02-16 03:49:20,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:49:20,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:49:20,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:49:20,935 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-16 03:49:20,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:49:20,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709562194] [2023-02-16 03:49:20,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709562194] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:49:20,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877795923] [2023-02-16 03:49:20,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:49:20,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:49:20,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:49:20,937 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-16 03:49:20,939 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-16 03:49:21,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:49:21,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 45 conjunts are in the unsatisfiable core [2023-02-16 03:49:21,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:49:21,073 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-16 03:49:21,099 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:49:21,100 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2023-02-16 03:49:21,116 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-16 03:49:21,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:49:21,128 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 31 treesize of output 26 [2023-02-16 03:49:21,176 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-16 03:49:21,176 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2023-02-16 03:49:21,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:49:21,355 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-16 03:49:21,355 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2023-02-16 03:49:21,365 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:49:21,365 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 34 treesize of output 25 [2023-02-16 03:49:21,379 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-16 03:49:21,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:49:21,528 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-16 03:49:21,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877795923] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:49:21,528 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:49:21,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 25 [2023-02-16 03:49:21,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047275467] [2023-02-16 03:49:21,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:49:21,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-16 03:49:21,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:49:21,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-16 03:49:21,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650 [2023-02-16 03:49:21,530 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand has 26 states, 25 states have (on average 2.68) internal successors, (67), 26 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:49:22,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:49:22,296 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2023-02-16 03:49:22,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-16 03:49:22,307 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.68) internal successors, (67), 26 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-02-16 03:49:22,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:49:22,308 INFO L225 Difference]: With dead ends: 98 [2023-02-16 03:49:22,308 INFO L226 Difference]: Without dead ends: 98 [2023-02-16 03:49:22,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 61 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=377, Invalid=1345, Unknown=0, NotChecked=0, Total=1722 [2023-02-16 03:49:22,309 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 377 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:49:22,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 205 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:49:22,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-02-16 03:49:22,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 68. [2023-02-16 03:49:22,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 67 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:49:22,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2023-02-16 03:49:22,311 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 37 [2023-02-16 03:49:22,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:49:22,311 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2023-02-16 03:49:22,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.68) internal successors, (67), 26 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:49:22,311 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2023-02-16 03:49:22,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-16 03:49:22,312 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:49:22,312 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:49:22,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-16 03:49:22,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:49:22,517 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-16 03:49:22,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:49:22,517 INFO L85 PathProgramCache]: Analyzing trace with hash 2041941389, now seen corresponding path program 1 times [2023-02-16 03:49:22,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:49:22,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756885909] [2023-02-16 03:49:22,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:49:22,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:49:22,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:49:23,323 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 25 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-16 03:49:23,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:49:23,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756885909] [2023-02-16 03:49:23,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756885909] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:49:23,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313081658] [2023-02-16 03:49:23,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:49:23,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:49:23,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:49:23,338 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 03:49:23,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-16 03:49:23,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:49:23,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 63 conjunts are in the unsatisfiable core [2023-02-16 03:49:23,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:49:23,473 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-16 03:49:23,504 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:49:23,504 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2023-02-16 03:49:23,537 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-16 03:49:23,542 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-16 03:49:23,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:49:23,568 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 21 treesize of output 20 [2023-02-16 03:49:23,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:49:23,573 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 31 treesize of output 26 [2023-02-16 03:49:23,622 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-16 03:49:23,623 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2023-02-16 03:49:23,631 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-16 03:49:23,632 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2023-02-16 03:49:23,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:49:23,806 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-16 03:49:23,806 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 55 [2023-02-16 03:49:23,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:49:23,814 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-16 03:49:23,814 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 44 [2023-02-16 03:49:23,827 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:49:23,827 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 43 [2023-02-16 03:49:23,833 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:49:23,834 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 28 [2023-02-16 03:49:23,873 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-16 03:49:23,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:49:24,373 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-16 03:49:24,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313081658] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:49:24,374 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:49:24,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 11] total 30 [2023-02-16 03:49:24,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336599225] [2023-02-16 03:49:24,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:49:24,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-16 03:49:24,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:49:24,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-16 03:49:24,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=830, Unknown=0, NotChecked=0, Total=930 [2023-02-16 03:49:24,376 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand has 31 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 31 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:49:25,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:49:25,862 INFO L93 Difference]: Finished difference Result 111 states and 118 transitions. [2023-02-16 03:49:25,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-16 03:49:25,863 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 31 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-02-16 03:49:25,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:49:25,863 INFO L225 Difference]: With dead ends: 111 [2023-02-16 03:49:25,863 INFO L226 Difference]: Without dead ends: 111 [2023-02-16 03:49:25,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 56 SyntacticMatches, 6 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=537, Invalid=1719, Unknown=0, NotChecked=0, Total=2256 [2023-02-16 03:49:25,864 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 1039 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1039 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 03:49:25,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1039 Valid, 202 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-16 03:49:25,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-02-16 03:49:25,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 74. [2023-02-16 03:49:25,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 64 states have (on average 1.25) internal successors, (80), 73 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:49:25,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2023-02-16 03:49:25,866 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 37 [2023-02-16 03:49:25,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:49:25,866 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2023-02-16 03:49:25,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 31 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:49:25,866 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2023-02-16 03:49:25,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-16 03:49:25,867 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:49:25,867 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:49:25,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-16 03:49:26,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:49:26,072 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-16 03:49:26,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:49:26,073 INFO L85 PathProgramCache]: Analyzing trace with hash -494379329, now seen corresponding path program 1 times [2023-02-16 03:49:26,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:49:26,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584863709] [2023-02-16 03:49:26,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:49:26,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:49:26,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:49:27,127 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-16 03:49:27,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:49:27,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584863709] [2023-02-16 03:49:27,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584863709] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:49:27,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003886056] [2023-02-16 03:49:27,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:49:27,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:49:27,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:49:27,129 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 03:49:27,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-16 03:49:27,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:49:27,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 77 conjunts are in the unsatisfiable core [2023-02-16 03:49:27,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:49:27,358 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-16 03:49:27,449 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-16 03:49:27,459 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-16 03:49:27,459 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 28 [2023-02-16 03:49:27,462 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-16 03:49:27,468 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-16 03:49:27,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:49:27,522 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 33 treesize of output 28 [2023-02-16 03:49:27,531 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-16 03:49:27,531 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 36 [2023-02-16 03:49:27,533 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 03:49:27,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:49:27,548 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 21 treesize of output 20 [2023-02-16 03:49:27,631 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-16 03:49:27,631 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2023-02-16 03:49:27,643 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-16 03:49:27,643 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2023-02-16 03:49:27,650 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 23 treesize of output 22 [2023-02-16 03:49:27,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:49:27,864 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-16 03:49:27,864 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 57 [2023-02-16 03:49:27,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:49:27,873 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-16 03:49:27,873 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 46 [2023-02-16 03:49:27,883 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-16 03:49:27,883 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 51 [2023-02-16 03:49:27,905 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 03:49:27,922 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:49:27,922 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 34 [2023-02-16 03:49:27,931 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:49:27,933 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 33 [2023-02-16 03:49:28,057 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 15 treesize of output 7 [2023-02-16 03:49:28,083 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-16 03:49:28,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:49:28,384 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_971) .cse0) (+ (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (= .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (forall ((v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_971) (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (+ .cse1 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (= .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) is different from false [2023-02-16 03:49:29,775 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (+ |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 4)) (.cse5 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (let ((.cse39 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse63 (select (store (let ((.cse64 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse64 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse64 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse63 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse63 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|))))))))) (.cse3 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (or (= (select v_ArrVal_971 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse62 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse62 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse62 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse5) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) (.cse44 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse60 (select (store (let ((.cse61 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse61 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse61 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse60 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse60 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|))))))))) (.cse1 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (or (= (select v_ArrVal_971 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse59 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse59 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse59 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse5) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) (.cse2 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (= (select (select (store (let ((.cse58 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse58 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse58 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse5) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (.cse0 (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|))) (and (or .cse0 (and .cse1 .cse2 .cse3)) (or .cse0 (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= (select (select (store (let ((.cse4 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse4 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse4 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse5) |c_ULTIMATE.start_main_~data_init~0#1|)))) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (let ((.cse11 (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select (select (store (let ((.cse37 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse37 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse37 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse5) |c_ULTIMATE.start_main_~data_init~0#1|)))) (.cse6 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse35 (select (store (let ((.cse36 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse36 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse36 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse35 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse35 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (.cse17 (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select v_ArrVal_971 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse34 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse34 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse34 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse5) |c_ULTIMATE.start_main_~data_init~0#1|)))) (.cse27 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse32 (select (store (let ((.cse33 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse33 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse33 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse32 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse32 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (.cse10 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (= (select (select (store (let ((.cse31 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse31 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse31 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse5) |c_ULTIMATE.start_main_~data_init~0#1|))))) (.cse16 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (or (= (select v_ArrVal_971 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse30 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse30 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse30 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse5) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (.cse28 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (or (= (select v_ArrVal_971 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse29 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse29 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse29 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse5) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (and .cse6 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse7 (select (store (let ((.cse9 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse9 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse9 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse7 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse7 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|)))))) .cse10 (or .cse0 .cse11) (or .cse0 (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse12 (select (store (let ((.cse13 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse13 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse13 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select .cse12 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse12 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|))))) (or .cse0 (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse14 (select (store (let ((.cse15 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse15 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse15 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select .cse14 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse14 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|))))) .cse16 (or .cse0 .cse17) (or (and .cse10 .cse11 (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse18 (select (store (let ((.cse19 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse19 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse19 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse18 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse18 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select v_ArrVal_971 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse20 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse20 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse20 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse5) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse16 .cse6 (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select v_ArrVal_971 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse21 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse21 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse21 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse5) |c_ULTIMATE.start_main_~data_init~0#1|))) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (= (select (select (store (let ((.cse22 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse22 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse22 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse5) |c_ULTIMATE.start_main_~data_init~0#1|)) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse23 (select (store (let ((.cse24 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse24 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse24 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse23 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse23 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse25 (select (store (let ((.cse26 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse26 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse26 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse25 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse25 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse17 .cse27 .cse28) .cse0) .cse27 .cse28 (or .cse0 (and .cse10 .cse16 .cse28))))) (or .cse0 (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= (select v_ArrVal_971 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse38 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse38 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse38 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse5) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse39 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse40 (select (store (let ((.cse41 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse41 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse41 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse40 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse40 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) .cse3 (or .cse0 (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse42 (select (store (let ((.cse43 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse43 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse43 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= (select .cse42 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse42 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|))))) .cse44 .cse1 .cse2 (or .cse0 (and (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (= (select (select (store (let ((.cse45 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse45 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse45 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse5) |c_ULTIMATE.start_main_~data_init~0#1|)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (or (= (select v_ArrVal_971 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse46 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse46 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse46 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse5) |c_ULTIMATE.start_main_~data_init~0#1|))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (or (= (select v_ArrVal_971 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse47 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse47 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse47 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse5) |c_ULTIMATE.start_main_~data_init~0#1|))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse48 (select (store (let ((.cse49 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse49 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse49 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse48 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse48 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse50 (select (store (let ((.cse51 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse51 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse51 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse50 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse50 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|)))))) .cse39 .cse3 .cse44 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select v_ArrVal_971 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse52 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse52 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse52 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse5) |c_ULTIMATE.start_main_~data_init~0#1|))))) .cse1 .cse2 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse53 (select (store (let ((.cse54 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse54 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse54 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse53 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse53 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select (select (store (let ((.cse55 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse55 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse55 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse5) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (or .cse0 (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse56 (select (store (let ((.cse57 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse57 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse57 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= (select .cse56 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse56 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) is different from false [2023-02-16 03:49:30,631 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (let ((.cse0 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse62 (select (store (let ((.cse63 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse63 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse63 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse62 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse62 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|))))))))) (.cse4 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (or (= (select v_ArrVal_971 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse61 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse61 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse61 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) (.cse9 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse59 (select (store (let ((.cse60 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse60 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse60 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse59 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse59 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|))))))))) (.cse10 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (= (select (select (store (let ((.cse58 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse58 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse58 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (.cse15 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (or (= (select v_ArrVal_971 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse57 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse57 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse57 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) (.cse17 (= 0 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|))) (and (or (and .cse0 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse1 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse1 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (or (= (select v_ArrVal_971 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse3 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse3 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse3 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|))))) .cse4 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse5 (select (store (let ((.cse6 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse6 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse6 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse5 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse5 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (or (= (select v_ArrVal_971 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse7 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse7 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse7 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select v_ArrVal_971 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse8 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse8 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse8 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|))))) .cse9 .cse10 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse11 (select (store (let ((.cse12 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse12 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse12 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse11 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse11 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse13 (select (store (let ((.cse14 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse14 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse14 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse13 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse13 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))))) .cse15 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select (select (store (let ((.cse16 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse16 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse16 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))))) .cse17) .cse0 (or (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse18 (select (store (let ((.cse19 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse19 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse19 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= (select .cse18 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse18 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse17) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse20 (select (store (let ((.cse21 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse21 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse21 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse20 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse20 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) (or (and .cse10 .cse15 .cse4) .cse17) (or (let ((.cse28 (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select (select (store (let ((.cse52 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse52 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse52 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))) (.cse27 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse50 (select (store (let ((.cse51 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse51 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse51 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse50 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse50 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (.cse26 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse48 (select (store (let ((.cse49 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse49 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse49 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse48 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse48 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (.cse22 (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select v_ArrVal_971 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse47 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse47 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse47 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))) (.cse25 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (= (select (select (store (let ((.cse46 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse46 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse46 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|))))) (.cse38 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (or (= (select v_ArrVal_971 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse45 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse45 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse45 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (.cse39 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (or (= (select v_ArrVal_971 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse44 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse44 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse44 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (and (or .cse22 .cse17) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse23 (select (store (let ((.cse24 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse24 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse24 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse23 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse23 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))))) .cse25 .cse26 .cse27 (or .cse28 .cse17) (or .cse17 (and .cse25 .cse28 (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse29 (select (store (let ((.cse30 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse30 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse30 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse29 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse29 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse27 (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select v_ArrVal_971 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse31 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse31 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse31 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|))) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (= (select (select (store (let ((.cse32 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse32 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse32 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select v_ArrVal_971 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse33 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse33 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse33 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse26 (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse34 (select (store (let ((.cse35 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse35 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse35 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse34 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse34 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse36 (select (store (let ((.cse37 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse37 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse37 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse36 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse36 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse22 .cse38 .cse39)) .cse38 (or .cse17 (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse40 (select (store (let ((.cse41 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse41 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse41 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select .cse40 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse40 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|))))) (or .cse17 (and .cse25 .cse38 .cse39)) .cse39 (or .cse17 (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse42 (select (store (let ((.cse43 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse43 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse43 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select .cse42 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse42 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) .cse4 .cse9 .cse10 .cse15 (or .cse17 (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= (select v_ArrVal_971 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse53 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse53 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse53 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))) (or (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse54 (select (store (let ((.cse55 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse55 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse55 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= (select .cse54 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse54 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse17) (or .cse17 (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= (select (select (store (let ((.cse56 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_964))) (store .cse56 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse56 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|))))))) is different from false [2023-02-16 03:49:31,103 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 4))) (let ((.cse13 (forall ((v_subst_1 Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= v_subst_1 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse62 (select (store (let ((.cse63 (store |c_#memory_int| v_subst_1 v_ArrVal_964))) (store .cse63 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse63 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_1 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse62 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse62 4) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_1)))) (.cse15 (forall ((v_subst_13 Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse60 (select (store (let ((.cse61 (store |c_#memory_int| v_subst_13 v_ArrVal_964))) (store .cse61 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse61 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_13 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse60 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse60 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= v_subst_13 |ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_13)))) (.cse14 (forall ((v_subst_4 Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= v_subst_4 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (or (= (select (select (store (let ((.cse59 (store |c_#memory_int| v_subst_4 v_ArrVal_964))) (store .cse59 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse59 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_4 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|))))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_4)))) (.cse5 (forall ((v_subst_3 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_3) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (or (= (select (select (store (let ((.cse58 (store |c_#memory_int| v_subst_3 v_ArrVal_964))) (store .cse58 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse58 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_3 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 4) |c_ULTIMATE.start_main_~data_init~0#1|))) (= v_subst_3 |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))))) (.cse18 (forall ((v_subst_2 Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= v_subst_2 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (= (select (select (store (let ((.cse57 (store |c_#memory_int| v_subst_2 v_ArrVal_964))) (store .cse57 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse57 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_2 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_2)))) (.cse3 (= 0 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|))) (and (or (forall ((v_ArrVal_964 (Array Int Int)) (v_subst_16 Int) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse1 (select (store (let ((.cse2 (store |c_#memory_int| v_subst_16 v_ArrVal_964))) (store .cse2 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse2 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_16 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_971 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse1 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse1 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_16) (= v_subst_16 |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))) .cse3) (or .cse3 (forall ((v_ArrVal_964 (Array Int Int)) (v_subst_34 Int) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_34) (= (select (select (store (let ((.cse4 (store |c_#memory_int| v_subst_34 v_ArrVal_964))) (store .cse4 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse4 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_34 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_subst_34 |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))) .cse5 (or (and (forall ((v_subst_10 Int)) (or (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (= (select (select (store (let ((.cse6 (store |c_#memory_int| v_subst_10 v_ArrVal_964))) (store .cse6 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse6 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_10 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|)) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_10))) (forall ((v_subst_8 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_8) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (or (= (select v_ArrVal_971 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse7 (store |c_#memory_int| v_subst_8 v_ArrVal_964))) (store .cse7 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse7 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_8 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|))))) (forall ((v_subst_12 Int)) (or (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (or (= (select (select (store (let ((.cse8 (store |c_#memory_int| v_subst_12 v_ArrVal_964))) (store .cse8 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse8 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_12 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_subst_12 |ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_12))) .cse5 (forall ((v_subst_6 Int)) (or (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (or (= (select (select (store (let ((.cse9 (store |c_#memory_int| v_subst_6 v_ArrVal_964))) (store .cse9 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse9 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_6 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_subst_6 |ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_6))) (forall ((v_subst_5 Int)) (or (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (or (= (select (select (store (let ((.cse10 (store |c_#memory_int| v_subst_5 v_ArrVal_964))) (store .cse10 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse10 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_5 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_5))) (forall ((v_subst_11 Int)) (or (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse11 (select (store (let ((.cse12 (store |c_#memory_int| v_subst_11 v_ArrVal_964))) (store .cse12 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse12 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_11 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse11 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse11 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_11))) .cse13 .cse14 .cse15 (forall ((v_subst_7 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_7) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse16 (select (store (let ((.cse17 (store |c_#memory_int| v_subst_7 v_ArrVal_964))) (store .cse17 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse17 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_7 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse16 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse16 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|)))))) .cse18 (forall ((v_subst_9 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_9) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse19 (select (store (let ((.cse20 (store |c_#memory_int| v_subst_9 v_ArrVal_964))) (store .cse20 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse20 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_9 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse19 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse19 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 4) |c_ULTIMATE.start_main_~data_init~0#1|))))))) .cse3) (forall ((v_subst_33 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_33) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= v_subst_33 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse21 (select (store (let ((.cse22 (store |c_#memory_int| v_subst_33 v_ArrVal_964))) (store .cse22 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse22 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_33 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse21 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse21 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 4) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) (or (let ((.cse27 (forall ((v_subst_17 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= v_subst_17 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (or (= (select v_ArrVal_971 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse53 (store |c_#memory_int| v_subst_17 v_ArrVal_964))) (store .cse53 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse53 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_17 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (.cse28 (forall ((v_subst_23 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse51 (select (store (let ((.cse52 (store |c_#memory_int| v_subst_23 v_ArrVal_964))) (store .cse52 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse52 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_23 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse51 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse51 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= v_subst_23 |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))) (.cse29 (forall ((v_subst_19 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (or (= (select (select (store (let ((.cse50 (store |c_#memory_int| v_subst_19 v_ArrVal_964))) (store .cse50 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse50 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_19 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 4) |c_ULTIMATE.start_main_~data_init~0#1|))) (= v_subst_19 |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))) (.cse31 (forall ((v_ArrVal_964 (Array Int Int)) (v_subst_28 Int) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (or (= v_subst_28 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select (select (store (let ((.cse49 (store |c_#memory_int| v_subst_28 v_ArrVal_964))) (store .cse49 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse49 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_28 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|)))) (.cse40 (forall ((v_subst_25 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse47 (select (store (let ((.cse48 (store |c_#memory_int| v_subst_25 v_ArrVal_964))) (store .cse48 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse48 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_25 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse47 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse47 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= v_subst_25 |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))) (.cse39 (forall ((v_ArrVal_964 (Array Int Int)) (v_subst_29 Int) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (or (= (select v_ArrVal_971 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse46 (store |c_#memory_int| v_subst_29 v_ArrVal_964))) (store .cse46 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse46 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_29 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_subst_29 |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))) (.cse36 (forall ((v_subst_27 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (= (select (select (store (let ((.cse45 (store |c_#memory_int| v_subst_27 v_ArrVal_964))) (store .cse45 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse45 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_27 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|)) (= v_subst_27 |ULTIMATE.start_sll_circular_create_~last~0#1.base|))))) (and (or (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int)) (v_subst_32 Int)) (let ((.cse23 (select (store (let ((.cse24 (store |c_#memory_int| v_subst_32 v_ArrVal_964))) (store .cse24 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse24 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_32 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse23 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse23 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_subst_32 |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))) .cse3) (or (and (forall ((v_ArrVal_964 (Array Int Int)) (v_subst_18 Int) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse25 (select (store (let ((.cse26 (store |c_#memory_int| v_subst_18 v_ArrVal_964))) (store .cse26 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse26 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_18 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse25 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse25 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse27 .cse28 .cse29 (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int)) (v_subst_22 Int)) (= (select (select (store (let ((.cse30 (store |c_#memory_int| v_subst_22 v_ArrVal_964))) (store .cse30 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse30 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_22 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|)) .cse31 (forall ((v_ArrVal_964 (Array Int Int)) (v_subst_24 Int) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse32 (select (store (let ((.cse33 (store |c_#memory_int| v_subst_24 v_ArrVal_964))) (store .cse33 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse33 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_24 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse32 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse32 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int)) (v_subst_20 Int)) (let ((.cse34 (select (store (let ((.cse35 (store |c_#memory_int| v_subst_20 v_ArrVal_964))) (store .cse35 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse35 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_20 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse34 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse34 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse36 (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int)) (v_subst_21 Int)) (or (= (select v_ArrVal_971 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse37 (store |c_#memory_int| v_subst_21 v_ArrVal_964))) (store .cse37 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse37 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_21 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 4) |c_ULTIMATE.start_main_~data_init~0#1|))) (forall ((v_ArrVal_964 (Array Int Int)) (v_subst_26 Int) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (or (= (select v_ArrVal_971 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse38 (store |c_#memory_int| v_subst_26 v_ArrVal_964))) (store .cse38 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse38 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_26 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse39 .cse40) .cse3) (or .cse3 (and .cse27 .cse29 .cse36)) .cse27 .cse28 .cse29 (or .cse3 .cse31) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_subst_30 Int)) (or (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse41 (select (store (let ((.cse42 (store |c_#memory_int| v_subst_30 v_ArrVal_964))) (store .cse42 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse42 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_30 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse41 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse41 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= v_subst_30 |ULTIMATE.start_sll_circular_create_~last~0#1.base|))) .cse40 (or (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int)) (v_subst_31 Int)) (let ((.cse43 (select (store (let ((.cse44 (store |c_#memory_int| v_subst_31 v_ArrVal_964))) (store .cse44 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse44 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_31 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse43 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse43 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_subst_31 |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))) .cse3) (or .cse3 .cse39) .cse36)) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0)) .cse13 .cse14 .cse15 (or (forall ((v_ArrVal_964 (Array Int Int)) (v_subst_15 Int) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse54 (select (store (let ((.cse55 (store |c_#memory_int| v_subst_15 v_ArrVal_964))) (store .cse55 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse55 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_15 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_15) (= (select .cse54 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse54 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_subst_15 |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))) .cse3) .cse18 (or .cse3 (and .cse14 .cse5 .cse18)) (or .cse3 (forall ((v_ArrVal_964 (Array Int Int)) (v_subst_14 Int) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (or (= (select v_ArrVal_971 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_14) (= (select (select (store (let ((.cse56 (store |c_#memory_int| v_subst_14 v_ArrVal_964))) (store .cse56 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse56 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_14 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_subst_14 |ULTIMATE.start_sll_circular_create_~last~0#1.base|))))))) is different from false [2023-02-16 03:49:31,219 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:49:31,219 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 37 [2023-02-16 03:49:31,230 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:49:31,231 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 436 treesize of output 432 [2023-02-16 03:49:31,234 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 416 treesize of output 368 [2023-02-16 03:49:31,238 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 424 treesize of output 396 [2023-02-16 03:49:31,246 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 140 treesize of output 132 [2023-02-16 03:49:35,024 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 8 treesize of output 4 [2023-02-16 03:49:35,026 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 03:49:35,032 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 03:49:35,033 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 03:49:35,035 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 03:49:35,036 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 03:49:35,037 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 03:49:35,038 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 03:49:35,039 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 03:49:35,043 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 03:49:35,044 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 03:49:35,045 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 03:49:35,046 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 03:49:35,051 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:49:35,051 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 61 [2023-02-16 03:49:35,053 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:49:35,062 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:49:35,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 549 treesize of output 531 [2023-02-16 03:49:35,087 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:49:35,088 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 515 treesize of output 467 [2023-02-16 03:49:35,093 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:49:35,093 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 467 treesize of output 455 [2023-02-16 03:49:35,511 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:49:35,513 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:49:35,514 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 62 treesize of output 52 [2023-02-16 03:49:35,538 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 8 treesize of output 4 [2023-02-16 03:49:35,540 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 03:49:35,542 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 03:49:35,544 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 03:49:35,546 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 03:49:35,547 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 03:49:35,549 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 03:49:35,550 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 03:49:35,554 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 03:49:35,555 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 03:49:35,556 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 03:49:35,558 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 03:49:35,560 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 03:49:35,565 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:49:35,566 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 37 [2023-02-16 03:49:35,567 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:49:35,568 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:49:35,573 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:49:35,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 43 [2023-02-16 03:49:35,583 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 03:49:35,596 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 41 treesize of output 29 [2023-02-16 03:49:35,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:49:35,604 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2023-02-16 03:49:35,610 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-16 03:49:35,610 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 1 [2023-02-16 03:49:35,616 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-16 03:49:35,617 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 1 [2023-02-16 03:49:35,622 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-16 03:49:35,622 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 1 [2023-02-16 03:49:35,627 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-16 03:49:35,627 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 1 [2023-02-16 03:49:35,632 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-16 03:49:35,633 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 1 [2023-02-16 03:49:35,638 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-16 03:49:35,638 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2023-02-16 03:49:35,643 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-16 03:49:35,644 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 1 [2023-02-16 03:49:35,649 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-16 03:49:35,649 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 1 [2023-02-16 03:49:35,655 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-16 03:49:35,656 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2023-02-16 03:49:35,662 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-16 03:49:35,662 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2023-02-16 03:49:35,667 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-16 03:49:35,668 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2023-02-16 03:49:35,675 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-16 03:49:35,676 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2023-02-16 03:49:35,682 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-16 03:49:35,682 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 1 [2023-02-16 03:49:35,687 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-16 03:49:35,688 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2023-02-16 03:49:35,693 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-16 03:49:35,694 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 1 [2023-02-16 03:49:35,700 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-16 03:49:35,700 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 1 [2023-02-16 03:49:35,706 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-16 03:49:35,706 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2023-02-16 03:49:35,711 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-16 03:49:35,711 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 1 [2023-02-16 03:49:35,719 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-16 03:49:35,719 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2023-02-16 03:49:35,728 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-16 03:49:35,729 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 1 [2023-02-16 03:49:35,735 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-16 03:49:35,735 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 1 [2023-02-16 03:49:35,742 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-16 03:49:35,742 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 1 [2023-02-16 03:49:35,751 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-16 03:49:35,751 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2023-02-16 03:49:35,756 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-16 03:49:35,757 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 1 [2023-02-16 03:49:35,762 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-16 03:49:35,762 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2023-02-16 03:49:35,875 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 16 not checked. [2023-02-16 03:49:35,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003886056] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:49:35,875 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:49:35,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 18] total 47 [2023-02-16 03:49:35,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841477417] [2023-02-16 03:49:35,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:49:35,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-02-16 03:49:35,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:49:35,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-02-16 03:49:35,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1660, Unknown=26, NotChecked=340, Total=2162 [2023-02-16 03:49:35,876 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 47 states, 47 states have (on average 2.0638297872340425) internal successors, (97), 47 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:49:41,981 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse70 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (let ((.cse46 (select .cse70 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (let ((.cse44 (select |c_#memory_int| .cse46)) (.cse67 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 4)) (.cse68 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (.cse45 (+ |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 4))) (let ((.cse2 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (.cse37 (= (select .cse68 .cse45) |c_ULTIMATE.start_main_~data_init~0#1|)) (.cse0 (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (.cse1 (forall ((v_subst_3 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_3) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (or (= (select (select (store (let ((.cse80 (store |c_#memory_int| v_subst_3 v_ArrVal_964))) (store .cse80 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse80 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_3 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 4) |c_ULTIMATE.start_main_~data_init~0#1|))) (= v_subst_3 |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))))) (.cse38 (forall ((v_subst_4 Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= v_subst_4 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (or (= (select (select (store (let ((.cse79 (store |c_#memory_int| v_subst_4 v_ArrVal_964))) (store .cse79 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse79 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_4 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|))))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_4)))) (.cse39 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse40 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse41 (= .cse67 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse42 (select |c_#memory_int| .cse67)) (.cse47 (= .cse46 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (.cse59 (forall ((v_subst_1 Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= v_subst_1 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse77 (select (store (let ((.cse78 (store |c_#memory_int| v_subst_1 v_ArrVal_964))) (store .cse78 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse78 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_1 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse77 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse77 4) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_1)))) (.cse69 (= (select .cse44 4) |c_ULTIMATE.start_main_~data_init~0#1|)) (.cse36 (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0)) (.cse48 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse60 (forall ((v_subst_13 Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse75 (select (store (let ((.cse76 (store |c_#memory_int| v_subst_13 v_ArrVal_964))) (store .cse76 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse76 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_13 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse75 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse75 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= v_subst_13 |ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_13)))) (.cse43 (forall ((v_subst_2 Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= v_subst_2 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (= (select (select (store (let ((.cse74 (store |c_#memory_int| v_subst_2 v_ArrVal_964))) (store .cse74 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse74 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_2 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse4) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_2)))) (.cse6 (= 0 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|))) (and (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) .cse0 (= |c_ULTIMATE.start_main_~data_init~0#1| 1) .cse1 .cse2 (or (let ((.cse9 (forall ((v_subst_17 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= v_subst_17 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (or (= (select v_ArrVal_971 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse35 (store |c_#memory_int| v_subst_17 v_ArrVal_964))) (store .cse35 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse35 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_17 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse4) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (.cse10 (forall ((v_subst_23 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse33 (select (store (let ((.cse34 (store |c_#memory_int| v_subst_23 v_ArrVal_964))) (store .cse34 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse34 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_23 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse33 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse33 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= v_subst_23 |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))) (.cse11 (forall ((v_subst_19 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (or (= (select (select (store (let ((.cse32 (store |c_#memory_int| v_subst_19 v_ArrVal_964))) (store .cse32 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse32 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_19 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 4) |c_ULTIMATE.start_main_~data_init~0#1|))) (= v_subst_19 |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))) (.cse13 (forall ((v_ArrVal_964 (Array Int Int)) (v_subst_28 Int) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (or (= v_subst_28 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select (select (store (let ((.cse31 (store |c_#memory_int| v_subst_28 v_ArrVal_964))) (store .cse31 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse31 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_28 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse4) |c_ULTIMATE.start_main_~data_init~0#1|)))) (.cse22 (forall ((v_subst_25 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse29 (select (store (let ((.cse30 (store |c_#memory_int| v_subst_25 v_ArrVal_964))) (store .cse30 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse30 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_25 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse29 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse29 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= v_subst_25 |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))) (.cse21 (forall ((v_ArrVal_964 (Array Int Int)) (v_subst_29 Int) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (or (= (select v_ArrVal_971 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse28 (store |c_#memory_int| v_subst_29 v_ArrVal_964))) (store .cse28 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse28 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_29 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_subst_29 |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))) (.cse18 (forall ((v_subst_27 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (= (select (select (store (let ((.cse27 (store |c_#memory_int| v_subst_27 v_ArrVal_964))) (store .cse27 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse27 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_27 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse4) |c_ULTIMATE.start_main_~data_init~0#1|)) (= v_subst_27 |ULTIMATE.start_sll_circular_create_~last~0#1.base|))))) (and (or (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int)) (v_subst_32 Int)) (let ((.cse3 (select (store (let ((.cse5 (store |c_#memory_int| v_subst_32 v_ArrVal_964))) (store .cse5 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse5 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_32 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse3 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse3 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_subst_32 |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))) .cse6) (or (and (forall ((v_ArrVal_964 (Array Int Int)) (v_subst_18 Int) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse7 (select (store (let ((.cse8 (store |c_#memory_int| v_subst_18 v_ArrVal_964))) (store .cse8 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse8 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_18 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse7 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse7 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse9 .cse10 .cse11 (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int)) (v_subst_22 Int)) (= (select (select (store (let ((.cse12 (store |c_#memory_int| v_subst_22 v_ArrVal_964))) (store .cse12 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse12 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_22 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse4) |c_ULTIMATE.start_main_~data_init~0#1|)) .cse13 (forall ((v_ArrVal_964 (Array Int Int)) (v_subst_24 Int) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse14 (select (store (let ((.cse15 (store |c_#memory_int| v_subst_24 v_ArrVal_964))) (store .cse15 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse15 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_24 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse14 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse14 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int)) (v_subst_20 Int)) (let ((.cse16 (select (store (let ((.cse17 (store |c_#memory_int| v_subst_20 v_ArrVal_964))) (store .cse17 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse17 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_20 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse16 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse16 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse18 (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int)) (v_subst_21 Int)) (or (= (select v_ArrVal_971 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse19 (store |c_#memory_int| v_subst_21 v_ArrVal_964))) (store .cse19 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse19 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_21 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 4) |c_ULTIMATE.start_main_~data_init~0#1|))) (forall ((v_ArrVal_964 (Array Int Int)) (v_subst_26 Int) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (or (= (select v_ArrVal_971 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse20 (store |c_#memory_int| v_subst_26 v_ArrVal_964))) (store .cse20 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse20 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_26 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse4) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse21 .cse22) .cse6) (or .cse6 (and .cse9 .cse11 .cse18)) .cse9 .cse10 .cse11 (or .cse6 .cse13) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_subst_30 Int)) (or (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse23 (select (store (let ((.cse24 (store |c_#memory_int| v_subst_30 v_ArrVal_964))) (store .cse24 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse24 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_30 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse23 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse23 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= v_subst_30 |ULTIMATE.start_sll_circular_create_~last~0#1.base|))) .cse22 (or (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int)) (v_subst_31 Int)) (let ((.cse25 (select (store (let ((.cse26 (store |c_#memory_int| v_subst_31 v_ArrVal_964))) (store .cse26 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse26 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_31 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse25 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse25 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_subst_31 |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))) .cse6) (or .cse6 .cse21) .cse18)) .cse36) .cse37 (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) .cse38 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) .cse6 (or .cse39 (and .cse2 (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (and .cse37 .cse0)))) (= .cse40 0) (or .cse41 (= (select .cse42 4) |c_ULTIMATE.start_main_~data_init~0#1|)) (or .cse6 (and .cse38 .cse1 .cse43)) (not .cse39) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (and (or (and (= (select .cse44 .cse45) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse46))) .cse47) (= .cse48 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (forall ((v_ArrVal_964 (Array Int Int)) (v_subst_16 Int) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse49 (select (store (let ((.cse50 (store |c_#memory_int| v_subst_16 v_ArrVal_964))) (store .cse50 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse50 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_16 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_971 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse49 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse49 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_16) (= v_subst_16 |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))) .cse6) (or .cse6 (forall ((v_ArrVal_964 (Array Int Int)) (v_subst_34 Int) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_34) (= (select (select (store (let ((.cse51 (store |c_#memory_int| v_subst_34 v_ArrVal_964))) (store .cse51 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse51 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_34 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_subst_34 |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))) (or (and (forall ((v_subst_10 Int)) (or (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (= (select (select (store (let ((.cse52 (store |c_#memory_int| v_subst_10 v_ArrVal_964))) (store .cse52 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse52 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_10 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse4) |c_ULTIMATE.start_main_~data_init~0#1|)) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_10))) (forall ((v_subst_8 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_8) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (or (= (select v_ArrVal_971 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse53 (store |c_#memory_int| v_subst_8 v_ArrVal_964))) (store .cse53 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse53 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_8 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse4) |c_ULTIMATE.start_main_~data_init~0#1|))))) (forall ((v_subst_12 Int)) (or (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (or (= (select (select (store (let ((.cse54 (store |c_#memory_int| v_subst_12 v_ArrVal_964))) (store .cse54 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse54 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_12 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_subst_12 |ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_12))) .cse1 (forall ((v_subst_6 Int)) (or (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (or (= (select (select (store (let ((.cse55 (store |c_#memory_int| v_subst_6 v_ArrVal_964))) (store .cse55 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse55 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_6 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_subst_6 |ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_6))) (forall ((v_subst_5 Int)) (or (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (or (= (select (select (store (let ((.cse56 (store |c_#memory_int| v_subst_5 v_ArrVal_964))) (store .cse56 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse56 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_5 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_5))) (forall ((v_subst_11 Int)) (or (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse57 (select (store (let ((.cse58 (store |c_#memory_int| v_subst_11 v_ArrVal_964))) (store .cse58 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse58 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_11 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse57 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse57 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_11))) .cse59 .cse38 .cse60 (forall ((v_subst_7 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_7) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse61 (select (store (let ((.cse62 (store |c_#memory_int| v_subst_7 v_ArrVal_964))) (store .cse62 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse62 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_7 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse61 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse61 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|)))))) .cse43 (forall ((v_subst_9 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_9) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse63 (select (store (let ((.cse64 (store |c_#memory_int| v_subst_9 v_ArrVal_964))) (store .cse64 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse64 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_9 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse63 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse63 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 4) |c_ULTIMATE.start_main_~data_init~0#1|))))))) .cse6) (= |c_ULTIMATE.start_sll_circular_create_~data#1| |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_subst_33 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_33) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= v_subst_33 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse65 (select (store (let ((.cse66 (store |c_#memory_int| v_subst_33 v_ArrVal_964))) (store .cse66 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse66 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_33 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse65 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse65 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 4) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) (or .cse39 (and (= .cse40 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (or .cse41 (and (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse67)) (= (select .cse42 .cse45) |c_ULTIMATE.start_main_~data_init~0#1|))))) (= (select .cse68 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (or .cse69 .cse47) .cse59 (or (= (select .cse70 0) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (and .cse69 (exists ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (and (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))))) .cse36 (= .cse48 0) .cse60 (or (forall ((v_ArrVal_964 (Array Int Int)) (v_subst_15 Int) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse71 (select (store (let ((.cse72 (store |c_#memory_int| v_subst_15 v_ArrVal_964))) (store .cse72 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse72 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_15 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_15) (= (select .cse71 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse71 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_subst_15 |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))) .cse6) .cse43 (or .cse6 (forall ((v_ArrVal_964 (Array Int Int)) (v_subst_14 Int) (v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (or (= (select v_ArrVal_971 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_14) (= (select (select (store (let ((.cse73 (store |c_#memory_int| v_subst_14 v_ArrVal_964))) (store .cse73 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse73 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_969))) v_subst_14 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_subst_14 |ULTIMATE.start_sll_circular_create_~last~0#1.base|))))))))) is different from true [2023-02-16 03:49:43,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:49:43,962 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2023-02-16 03:49:43,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-16 03:49:43,967 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.0638297872340425) internal successors, (97), 47 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2023-02-16 03:49:43,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:49:43,967 INFO L225 Difference]: With dead ends: 92 [2023-02-16 03:49:43,967 INFO L226 Difference]: Without dead ends: 92 [2023-02-16 03:49:43,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=498, Invalid=3527, Unknown=27, NotChecked=640, Total=4692 [2023-02-16 03:49:43,969 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 226 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 1076 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 1396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 292 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-16 03:49:43,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 322 Invalid, 1396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1076 Invalid, 0 Unknown, 292 Unchecked, 0.8s Time] [2023-02-16 03:49:43,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-02-16 03:49:43,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 74. [2023-02-16 03:49:43,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 64 states have (on average 1.234375) internal successors, (79), 73 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:49:43,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2023-02-16 03:49:43,970 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 39 [2023-02-16 03:49:43,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:49:43,970 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2023-02-16 03:49:43,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.0638297872340425) internal successors, (97), 47 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:49:43,971 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2023-02-16 03:49:43,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-16 03:49:43,971 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:49:43,971 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:49:43,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-16 03:49:44,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-02-16 03:49:44,172 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-16 03:49:44,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:49:44,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1852999400, now seen corresponding path program 1 times [2023-02-16 03:49:44,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:49:44,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898721364] [2023-02-16 03:49:44,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:49:44,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:49:44,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:49:44,602 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-16 03:49:44,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:49:44,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898721364] [2023-02-16 03:49:44,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898721364] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:49:44,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609512049] [2023-02-16 03:49:44,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:49:44,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:49:44,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:49:44,604 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 03:49:44,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-16 03:49:44,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:49:44,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 56 conjunts are in the unsatisfiable core [2023-02-16 03:49:44,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:49:44,733 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-16 03:49:44,748 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 03:49:44,748 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 21 [2023-02-16 03:49:44,762 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:49:44,762 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-02-16 03:49:44,783 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 03:49:44,783 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 21 [2023-02-16 03:49:44,849 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-02-16 03:49:44,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-02-16 03:49:44,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-16 03:49:44,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:49:44,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2023-02-16 03:49:44,982 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 32 treesize of output 30 [2023-02-16 03:49:45,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 10 [2023-02-16 03:49:45,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:49:45,131 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 22 treesize of output 21 [2023-02-16 03:49:45,136 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:49:45,137 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 11 [2023-02-16 03:49:45,177 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-16 03:49:45,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:49:45,344 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:49:45,344 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 30 [2023-02-16 03:49:45,347 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 33 treesize of output 25 [2023-02-16 03:49:45,351 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-16 03:49:45,551 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-16 03:49:45,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609512049] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:49:45,552 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:49:45,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15] total 36 [2023-02-16 03:49:45,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111708324] [2023-02-16 03:49:45,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:49:45,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-02-16 03:49:45,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:49:45,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-02-16 03:49:45,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1118, Unknown=1, NotChecked=0, Total=1260 [2023-02-16 03:49:45,553 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand has 36 states, 36 states have (on average 2.361111111111111) internal successors, (85), 36 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:49:46,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:49:46,285 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2023-02-16 03:49:46,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-16 03:49:46,285 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.361111111111111) internal successors, (85), 36 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2023-02-16 03:49:46,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:49:46,286 INFO L225 Difference]: With dead ends: 83 [2023-02-16 03:49:46,286 INFO L226 Difference]: Without dead ends: 83 [2023-02-16 03:49:46,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 60 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=493, Invalid=2056, Unknown=1, NotChecked=0, Total=2550 [2023-02-16 03:49:46,288 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 326 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:49:46,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 402 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:49:46,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-02-16 03:49:46,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 68. [2023-02-16 03:49:46,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 67 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:49:46,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2023-02-16 03:49:46,290 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 40 [2023-02-16 03:49:46,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:49:46,291 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2023-02-16 03:49:46,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.361111111111111) internal successors, (85), 36 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:49:46,291 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2023-02-16 03:49:46,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-16 03:49:46,293 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:49:46,294 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:49:46,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-16 03:49:46,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:49:46,501 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-16 03:49:46,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:49:46,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1769728484, now seen corresponding path program 2 times [2023-02-16 03:49:46,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:49:46,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050989981] [2023-02-16 03:49:46,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:49:46,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:49:46,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:49:48,073 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 22 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:49:48,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:49:48,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050989981] [2023-02-16 03:49:48,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050989981] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:49:48,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433316405] [2023-02-16 03:49:48,074 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 03:49:48,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:49:48,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:49:48,075 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 03:49:48,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-16 03:49:48,209 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 03:49:48,210 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 03:49:48,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 102 conjunts are in the unsatisfiable core [2023-02-16 03:49:48,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:49:48,231 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-16 03:49:48,258 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 03:49:48,259 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 21 [2023-02-16 03:49:48,314 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-16 03:49:48,318 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-16 03:49:48,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:49:48,360 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 21 treesize of output 20 [2023-02-16 03:49:48,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:49:48,364 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 31 treesize of output 26 [2023-02-16 03:49:48,411 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-16 03:49:48,423 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-16 03:49:48,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 26 [2023-02-16 03:49:48,490 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-16 03:49:48,490 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 32 [2023-02-16 03:49:48,498 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-02-16 03:49:48,498 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2023-02-16 03:49:48,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:49:48,587 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-16 03:49:48,587 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 1 case distinctions, treesize of input 89 treesize of output 62 [2023-02-16 03:49:48,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:49:48,602 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-16 03:49:48,602 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2023-02-16 03:49:48,760 INFO L321 Elim1Store]: treesize reduction 24, result has 56.4 percent of original size [2023-02-16 03:49:48,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 76 [2023-02-16 03:49:48,779 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-02-16 03:49:48,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 28 [2023-02-16 03:49:49,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:49:49,294 INFO L321 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2023-02-16 03:49:49,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 144 treesize of output 115 [2023-02-16 03:49:49,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:49:49,300 INFO L321 Elim1Store]: treesize reduction 60, result has 1.6 percent of original size [2023-02-16 03:49:49,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 151 treesize of output 151 [2023-02-16 03:49:49,742 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 13 treesize of output 9 [2023-02-16 03:49:49,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:49:49,846 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-02-16 03:49:49,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 100 treesize of output 76 [2023-02-16 03:49:49,863 INFO L321 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2023-02-16 03:49:49,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 83 treesize of output 80 [2023-02-16 03:49:49,924 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:49:49,941 INFO L321 Elim1Store]: treesize reduction 37, result has 35.1 percent of original size [2023-02-16 03:49:49,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 118 treesize of output 83 [2023-02-16 03:49:49,962 INFO L321 Elim1Store]: treesize reduction 17, result has 54.1 percent of original size [2023-02-16 03:49:49,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 65 treesize of output 59 [2023-02-16 03:49:50,118 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:49:50,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:49:51,261 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 24 treesize of output 22 [2023-02-16 03:49:52,183 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:49:52,188 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:49:52,190 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:49:52,522 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:49:52,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433316405] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:49:52,522 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:49:52,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 19] total 53 [2023-02-16 03:49:52,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151444162] [2023-02-16 03:49:52,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:49:52,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-02-16 03:49:52,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:49:52,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-02-16 03:49:52,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=2660, Unknown=0, NotChecked=0, Total=2862 [2023-02-16 03:49:52,524 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand has 54 states, 53 states have (on average 2.1320754716981134) internal successors, (113), 54 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:50:31,767 WARN L233 SmtUtils]: Spent 34.62s on a formula simplification. DAG size of input: 241 DAG size of output: 139 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)