./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.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-1.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 5b4659b27a54f579598b48dab11e67b47aff28d030592fa757cae575afffc3b5 --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 03:49:07,112 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 03:49:07,114 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 03:49:07,153 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 03:49:07,153 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 03:49:07,156 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 03:49:07,159 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 03:49:07,161 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 03:49:07,164 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 03:49:07,168 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 03:49:07,170 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 03:49:07,172 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 03:49:07,172 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 03:49:07,174 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 03:49:07,176 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 03:49:07,177 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 03:49:07,178 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 03:49:07,179 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 03:49:07,180 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 03:49:07,185 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 03:49:07,187 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 03:49:07,188 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 03:49:07,189 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 03:49:07,190 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 03:49:07,198 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 03:49:07,198 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 03:49:07,199 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 03:49:07,200 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 03:49:07,200 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 03:49:07,202 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 03:49:07,202 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 03:49:07,203 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 03:49:07,204 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 03:49:07,205 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 03:49:07,206 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 03:49:07,206 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 03:49:07,207 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 03:49:07,207 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 03:49:07,207 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 03:49:07,208 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 03:49:07,209 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 03:49:07,210 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:07,237 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 03:49:07,238 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 03:49:07,238 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 03:49:07,239 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 03:49:07,247 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 03:49:07,247 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 03:49:07,248 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 03:49:07,248 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 03:49:07,248 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 03:49:07,248 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 03:49:07,249 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 03:49:07,249 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-16 03:49:07,250 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 03:49:07,250 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 03:49:07,250 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 03:49:07,250 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-16 03:49:07,250 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-16 03:49:07,251 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-16 03:49:07,251 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 03:49:07,251 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-16 03:49:07,251 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 03:49:07,251 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 03:49:07,252 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 03:49:07,252 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 03:49:07,252 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 03:49:07,252 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:49:07,252 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 03:49:07,253 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 03:49:07,253 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 03:49:07,253 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 03:49:07,254 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 03:49:07,254 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 03:49:07,254 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 03:49:07,254 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 03:49:07,254 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 -> 5b4659b27a54f579598b48dab11e67b47aff28d030592fa757cae575afffc3b5 [2023-02-16 03:49:07,481 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 03:49:07,511 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 03:49:07,514 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 03:49:07,515 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 03:49:07,516 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 03:49:07,518 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-1.i [2023-02-16 03:49:08,800 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 03:49:09,054 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 03:49:09,055 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i [2023-02-16 03:49:09,073 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6aaf9b0dc/374ad16379a9431ca2b83009aa55b9d4/FLAGd2813a6bd [2023-02-16 03:49:09,091 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6aaf9b0dc/374ad16379a9431ca2b83009aa55b9d4 [2023-02-16 03:49:09,094 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 03:49:09,096 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 03:49:09,099 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 03:49:09,099 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 03:49:09,102 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 03:49:09,103 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:49:09" (1/1) ... [2023-02-16 03:49:09,104 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59047181 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:49:09, skipping insertion in model container [2023-02-16 03:49:09,104 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:49:09" (1/1) ... [2023-02-16 03:49:09,110 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 03:49:09,140 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 03:49:09,450 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-1.i[24132,24145] [2023-02-16 03:49:09,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:49:09,468 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 03:49:09,518 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-1.i[24132,24145] [2023-02-16 03:49:09,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:49:09,546 INFO L208 MainTranslator]: Completed translation [2023-02-16 03:49:09,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:49:09 WrapperNode [2023-02-16 03:49:09,547 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 03:49:09,548 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 03:49:09,548 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 03:49:09,549 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 03:49:09,554 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:09" (1/1) ... [2023-02-16 03:49:09,581 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:09" (1/1) ... [2023-02-16 03:49:09,608 INFO L138 Inliner]: procedures = 122, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 93 [2023-02-16 03:49:09,609 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 03:49:09,609 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 03:49:09,610 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 03:49:09,610 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 03:49:09,619 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:09" (1/1) ... [2023-02-16 03:49:09,620 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:09" (1/1) ... [2023-02-16 03:49:09,631 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:09" (1/1) ... [2023-02-16 03:49:09,631 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:09" (1/1) ... [2023-02-16 03:49:09,642 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:09" (1/1) ... [2023-02-16 03:49:09,650 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:09" (1/1) ... [2023-02-16 03:49:09,651 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:09" (1/1) ... [2023-02-16 03:49:09,652 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:09" (1/1) ... [2023-02-16 03:49:09,654 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 03:49:09,655 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 03:49:09,655 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 03:49:09,655 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 03:49:09,656 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:49:09" (1/1) ... [2023-02-16 03:49:09,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:49:09,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:49:09,686 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:09,688 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:09,719 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-02-16 03:49:09,720 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-02-16 03:49:09,720 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-16 03:49:09,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-16 03:49:09,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-16 03:49:09,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 03:49:09,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-16 03:49:09,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-16 03:49:09,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-16 03:49:09,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-16 03:49:09,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 03:49:09,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 03:49:09,806 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 03:49:09,808 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 03:49:09,844 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-02-16 03:49:10,099 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 03:49:10,105 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 03:49:10,105 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-02-16 03:49:10,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:49:10 BoogieIcfgContainer [2023-02-16 03:49:10,107 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 03:49:10,109 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 03:49:10,109 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 03:49:10,112 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 03:49:10,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 03:49:09" (1/3) ... [2023-02-16 03:49:10,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@735f1e7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 03:49:10, skipping insertion in model container [2023-02-16 03:49:10,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:49:09" (2/3) ... [2023-02-16 03:49:10,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@735f1e7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 03:49:10, skipping insertion in model container [2023-02-16 03:49:10,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:49:10" (3/3) ... [2023-02-16 03:49:10,114 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_circular_traversal-1.i [2023-02-16 03:49:10,130 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 03:49:10,130 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2023-02-16 03:49:10,167 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 03:49:10,172 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;@5bf7ebd4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 03:49:10,172 INFO L358 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2023-02-16 03:49:10,175 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 39 states have (on average 2.0) internal successors, (78), 68 states have internal predecessors, (78), 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:10,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-16 03:49:10,179 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:49:10,179 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-16 03:49:10,180 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-16 03:49:10,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:49:10,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1079622, now seen corresponding path program 1 times [2023-02-16 03:49:10,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:49:10,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123286095] [2023-02-16 03:49:10,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:49:10,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:49:10,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:49:10,449 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:10,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:49:10,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123286095] [2023-02-16 03:49:10,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123286095] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:49:10,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:49:10,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:49:10,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036095579] [2023-02-16 03:49:10,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:49:10,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:49:10,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:49:10,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:49:10,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:49:10,501 INFO L87 Difference]: Start difference. First operand has 70 states, 39 states have (on average 2.0) internal successors, (78), 68 states have internal predecessors, (78), 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:10,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:49:10,612 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2023-02-16 03:49:10,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:49:10,615 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:10,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:49:10,622 INFO L225 Difference]: With dead ends: 92 [2023-02-16 03:49:10,623 INFO L226 Difference]: Without dead ends: 86 [2023-02-16 03:49:10,624 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:10,627 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 60 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:49:10,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 67 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:49:10,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-02-16 03:49:10,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 61. [2023-02-16 03:49:10,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 60 states have internal predecessors, (65), 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:10,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2023-02-16 03:49:10,669 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 4 [2023-02-16 03:49:10,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:49:10,670 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2023-02-16 03:49:10,670 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:10,670 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2023-02-16 03:49:10,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-16 03:49:10,671 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:49:10,671 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-16 03:49:10,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-16 03:49:10,674 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-16 03:49:10,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:49:10,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1079623, now seen corresponding path program 1 times [2023-02-16 03:49:10,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:49:10,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896875150] [2023-02-16 03:49:10,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:49:10,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:49:10,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:49:10,820 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:10,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:49:10,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896875150] [2023-02-16 03:49:10,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896875150] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:49:10,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:49:10,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:49:10,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663834595] [2023-02-16 03:49:10,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:49:10,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:49:10,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:49:10,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:49:10,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:49:10,826 INFO L87 Difference]: Start difference. First operand 61 states and 65 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:10,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:49:10,883 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2023-02-16 03:49:10,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:49:10,885 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:10,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:49:10,887 INFO L225 Difference]: With dead ends: 58 [2023-02-16 03:49:10,888 INFO L226 Difference]: Without dead ends: 58 [2023-02-16 03:49:10,889 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:10,890 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 58 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 42 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:10,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 42 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:10,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-02-16 03:49:10,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2023-02-16 03:49:10,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 36 states have (on average 1.7222222222222223) internal successors, (62), 57 states have internal predecessors, (62), 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:10,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2023-02-16 03:49:10,902 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 4 [2023-02-16 03:49:10,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:49:10,902 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2023-02-16 03:49:10,902 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:10,902 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2023-02-16 03:49:10,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-16 03:49:10,903 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:49:10,907 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:49:10,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-16 03:49:10,908 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-16 03:49:10,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:49:10,909 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248729, now seen corresponding path program 1 times [2023-02-16 03:49:10,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:49:10,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498570598] [2023-02-16 03:49:10,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:49:10,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:49:10,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:49:10,990 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:10,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:49:10,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498570598] [2023-02-16 03:49:10,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498570598] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:49:10,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:49:10,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:49:10,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646727030] [2023-02-16 03:49:10,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:49:10,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:49:10,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:49:10,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:49:10,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:49:10,993 INFO L87 Difference]: Start difference. First operand 58 states and 62 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:11,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:49:11,063 INFO L93 Difference]: Finished difference Result 98 states and 107 transitions. [2023-02-16 03:49:11,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:49:11,065 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:11,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:49:11,067 INFO L225 Difference]: With dead ends: 98 [2023-02-16 03:49:11,068 INFO L226 Difference]: Without dead ends: 98 [2023-02-16 03:49:11,071 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:11,073 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 49 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:49:11,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 118 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:49:11,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-02-16 03:49:11,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 56. [2023-02-16 03:49:11,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 55 states have internal predecessors, (60), 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:11,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2023-02-16 03:49:11,090 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 9 [2023-02-16 03:49:11,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:49:11,091 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2023-02-16 03:49:11,091 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:11,091 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2023-02-16 03:49:11,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-16 03:49:11,092 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:49:11,092 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:49:11,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-16 03:49:11,093 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-16 03:49:11,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:49:11,093 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248730, now seen corresponding path program 1 times [2023-02-16 03:49:11,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:49:11,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36478243] [2023-02-16 03:49:11,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:49:11,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:49:11,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:49:11,202 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:11,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:49:11,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36478243] [2023-02-16 03:49:11,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36478243] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:49:11,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:49:11,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:49:11,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595631622] [2023-02-16 03:49:11,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:49:11,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:49:11,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:49:11,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:49:11,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:49:11,210 INFO L87 Difference]: Start difference. First operand 56 states and 60 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:11,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:49:11,262 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2023-02-16 03:49:11,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:49:11,263 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:11,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:49:11,265 INFO L225 Difference]: With dead ends: 98 [2023-02-16 03:49:11,265 INFO L226 Difference]: Without dead ends: 98 [2023-02-16 03:49:11,265 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:11,268 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 50 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 128 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:11,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 128 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:11,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-02-16 03:49:11,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 54. [2023-02-16 03:49:11,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 53 states have internal predecessors, (58), 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:11,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2023-02-16 03:49:11,277 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 9 [2023-02-16 03:49:11,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:49:11,278 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2023-02-16 03:49:11,278 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:11,278 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2023-02-16 03:49:11,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-16 03:49:11,279 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:49:11,279 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:49:11,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-16 03:49:11,279 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-16 03:49:11,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:49:11,280 INFO L85 PathProgramCache]: Analyzing trace with hash 427661500, now seen corresponding path program 1 times [2023-02-16 03:49:11,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:49:11,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126823562] [2023-02-16 03:49:11,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:49:11,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:49:11,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:49:11,375 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:11,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:49:11,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126823562] [2023-02-16 03:49:11,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126823562] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:49:11,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:49:11,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:49:11,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657108659] [2023-02-16 03:49:11,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:49:11,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:49:11,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:49:11,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:49:11,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:49:11,378 INFO L87 Difference]: Start difference. First operand 54 states and 58 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:11,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:49:11,389 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2023-02-16 03:49:11,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:49:11,390 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:11,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:49:11,390 INFO L225 Difference]: With dead ends: 59 [2023-02-16 03:49:11,391 INFO L226 Difference]: Without dead ends: 59 [2023-02-16 03:49:11,391 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:11,394 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 4 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 106 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:11,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 106 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:11,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-02-16 03:49:11,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2023-02-16 03:49:11,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 54 states have internal predecessors, (59), 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:11,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2023-02-16 03:49:11,402 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 11 [2023-02-16 03:49:11,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:49:11,404 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2023-02-16 03:49:11,404 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:11,404 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2023-02-16 03:49:11,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-16 03:49:11,405 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:49:11,406 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:11,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-16 03:49:11,407 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-16 03:49:11,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:49:11,408 INFO L85 PathProgramCache]: Analyzing trace with hash 200371689, now seen corresponding path program 1 times [2023-02-16 03:49:11,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:49:11,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424876380] [2023-02-16 03:49:11,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:49:11,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:49:11,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:49:11,519 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:11,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:49:11,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424876380] [2023-02-16 03:49:11,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424876380] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:49:11,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898573335] [2023-02-16 03:49:11,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:49:11,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:49:11,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:49:11,526 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:11,528 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:11,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:49:11,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-16 03:49:11,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:49:11,691 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:11,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:49:11,731 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:11,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898573335] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:49:11,732 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:49:11,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-02-16 03:49:11,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792175992] [2023-02-16 03:49:11,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:49:11,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 03:49:11,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:49:11,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 03:49:11,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:49:11,735 INFO L87 Difference]: Start difference. First operand 55 states and 59 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:11,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:49:11,753 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2023-02-16 03:49:11,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 03:49:11,753 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:11,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:49:11,754 INFO L225 Difference]: With dead ends: 70 [2023-02-16 03:49:11,754 INFO L226 Difference]: Without dead ends: 70 [2023-02-16 03:49:11,754 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:11,759 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 8 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:49:11,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 206 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:49:11,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-02-16 03:49:11,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2023-02-16 03:49:11,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 69 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:11,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2023-02-16 03:49:11,764 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 16 [2023-02-16 03:49:11,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:49:11,764 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2023-02-16 03:49:11,765 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:11,765 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2023-02-16 03:49:11,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-16 03:49:11,766 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:49:11,766 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:11,775 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:11,972 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:11,973 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-16 03:49:11,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:49:11,974 INFO L85 PathProgramCache]: Analyzing trace with hash 527522044, now seen corresponding path program 2 times [2023-02-16 03:49:11,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:49:11,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84725593] [2023-02-16 03:49:11,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:49:11,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:49:12,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:49:12,183 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:12,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:49:12,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84725593] [2023-02-16 03:49:12,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84725593] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:49:12,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:49:12,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:49:12,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261254424] [2023-02-16 03:49:12,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:49:12,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:49:12,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:49:12,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:49:12,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:49:12,188 INFO L87 Difference]: Start difference. First operand 70 states and 74 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:12,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:49:12,352 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2023-02-16 03:49:12,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:49:12,352 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:12,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:49:12,353 INFO L225 Difference]: With dead ends: 92 [2023-02-16 03:49:12,353 INFO L226 Difference]: Without dead ends: 92 [2023-02-16 03:49:12,354 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:12,354 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 158 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:49:12,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 88 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:49:12,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-02-16 03:49:12,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 67. [2023-02-16 03:49:12,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 66 states have internal predecessors, (72), 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:12,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2023-02-16 03:49:12,364 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 31 [2023-02-16 03:49:12,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:49:12,364 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2023-02-16 03:49:12,364 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:12,364 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2023-02-16 03:49:12,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-16 03:49:12,365 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:49:12,365 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:12,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-16 03:49:12,366 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-16 03:49:12,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:49:12,367 INFO L85 PathProgramCache]: Analyzing trace with hash 527522045, now seen corresponding path program 1 times [2023-02-16 03:49:12,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:49:12,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488475507] [2023-02-16 03:49:12,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:49:12,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:49:12,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:49:12,624 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:12,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:49:12,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488475507] [2023-02-16 03:49:12,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488475507] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:49:12,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:49:12,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:49:12,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062244557] [2023-02-16 03:49:12,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:49:12,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:49:12,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:49:12,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:49:12,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:49:12,630 INFO L87 Difference]: Start difference. First operand 67 states and 72 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:12,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:49:12,776 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2023-02-16 03:49:12,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 03:49:12,777 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:12,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:49:12,777 INFO L225 Difference]: With dead ends: 73 [2023-02-16 03:49:12,778 INFO L226 Difference]: Without dead ends: 73 [2023-02-16 03:49:12,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-16 03:49:12,780 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 155 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:49:12,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 60 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:49:12,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-02-16 03:49:12,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2023-02-16 03:49:12,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 69 states have internal predecessors, (75), 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:12,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2023-02-16 03:49:12,785 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 31 [2023-02-16 03:49:12,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:49:12,786 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2023-02-16 03:49:12,786 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:12,786 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2023-02-16 03:49:12,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-16 03:49:12,787 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:49:12,787 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:12,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-16 03:49:12,788 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-16 03:49:12,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:49:12,788 INFO L85 PathProgramCache]: Analyzing trace with hash 142544443, now seen corresponding path program 1 times [2023-02-16 03:49:12,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:49:12,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360100044] [2023-02-16 03:49:12,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:49:12,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:49:12,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:49:13,511 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:13,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:49:13,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360100044] [2023-02-16 03:49:13,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360100044] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:49:13,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572074659] [2023-02-16 03:49:13,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:49:13,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:49:13,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:49:13,517 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:13,520 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:13,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:49:13,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-16 03:49:13,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:49:13,823 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:13,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:49:13,891 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:13,957 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:13,975 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:13,976 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:49:14,265 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:14,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572074659] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:49:14,266 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:49:14,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2023-02-16 03:49:14,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154764331] [2023-02-16 03:49:14,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:49:14,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-16 03:49:14,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:49:14,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-16 03:49:14,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2023-02-16 03:49:14,269 INFO L87 Difference]: Start difference. First operand 70 states and 75 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:14,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:49:14,498 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2023-02-16 03:49:14,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 03:49:14,499 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:14,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:49:14,500 INFO L225 Difference]: With dead ends: 70 [2023-02-16 03:49:14,500 INFO L226 Difference]: Without dead ends: 70 [2023-02-16 03:49:14,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=204, Invalid=726, Unknown=0, NotChecked=0, Total=930 [2023-02-16 03:49:14,502 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 85 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:49:14,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 315 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:49:14,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-02-16 03:49:14,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2023-02-16 03:49:14,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 69 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:14,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2023-02-16 03:49:14,506 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 33 [2023-02-16 03:49:14,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:49:14,507 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2023-02-16 03:49:14,507 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:14,507 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2023-02-16 03:49:14,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-16 03:49:14,508 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:49:14,508 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:14,519 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:14,717 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:14,718 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-16 03:49:14,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:49:14,718 INFO L85 PathProgramCache]: Analyzing trace with hash 2041941388, now seen corresponding path program 1 times [2023-02-16 03:49:14,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:49:14,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895492018] [2023-02-16 03:49:14,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:49:14,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:49:14,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:49:15,496 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:15,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:49:15,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895492018] [2023-02-16 03:49:15,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895492018] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:49:15,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014476338] [2023-02-16 03:49:15,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:49:15,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:49:15,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:49:15,498 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:15,529 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:15,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:49:15,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 45 conjunts are in the unsatisfiable core [2023-02-16 03:49:15,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:49:15,684 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:15,716 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:49:15,717 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:15,742 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:15,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:49:15,760 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:15,815 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-16 03:49:15,816 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:16,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:49:16,025 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-16 03:49:16,025 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:16,044 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:49:16,045 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:16,068 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:16,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:49:16,310 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:16,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014476338] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:49:16,310 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:49:16,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 25 [2023-02-16 03:49:16,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260439331] [2023-02-16 03:49:16,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:49:16,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-16 03:49:16,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:49:16,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-16 03:49:16,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650 [2023-02-16 03:49:16,314 INFO L87 Difference]: Start difference. First operand 70 states and 74 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:17,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:49:17,599 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2023-02-16 03:49:17,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-16 03:49:17,600 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:17,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:49:17,601 INFO L225 Difference]: With dead ends: 127 [2023-02-16 03:49:17,601 INFO L226 Difference]: Without dead ends: 127 [2023-02-16 03:49:17,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 61 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=410, Invalid=1396, Unknown=0, NotChecked=0, Total=1806 [2023-02-16 03:49:17,602 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 741 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 03:49:17,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 314 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-16 03:49:17,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-02-16 03:49:17,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 75. [2023-02-16 03:49:17,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 61 states have (on average 1.3442622950819672) internal successors, (82), 74 states have internal predecessors, (82), 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,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2023-02-16 03:49:17,605 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 37 [2023-02-16 03:49:17,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:49:17,605 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2023-02-16 03:49:17,605 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:17,605 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2023-02-16 03:49:17,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-16 03:49:17,606 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:49:17,606 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:17,616 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:17,806 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:17,807 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-16 03:49:17,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:49:17,807 INFO L85 PathProgramCache]: Analyzing trace with hash 2041941389, now seen corresponding path program 1 times [2023-02-16 03:49:17,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:49:17,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407260683] [2023-02-16 03:49:17,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:49:17,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:49:17,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:49:18,894 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:18,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:49:18,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407260683] [2023-02-16 03:49:18,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407260683] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:49:18,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938994545] [2023-02-16 03:49:18,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:49:18,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:49:18,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:49:18,897 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:18,924 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:19,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:49:19,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 63 conjunts are in the unsatisfiable core [2023-02-16 03:49:19,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:49:19,068 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:19,115 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:49:19,115 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:19,164 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:19,171 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:19,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:49:19,204 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,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:49:19,210 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:19,272 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-16 03:49:19,272 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:19,284 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-16 03:49:19,284 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:19,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:49:19,487 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-16 03:49:19,488 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:19,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:49:19,499 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-16 03:49:19,500 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:19,523 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:49:19,523 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:19,535 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:49:19,536 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:19,597 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:19,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:49:20,278 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:20,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938994545] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:49:20,279 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:49:20,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 30 [2023-02-16 03:49:20,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234892025] [2023-02-16 03:49:20,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:49:20,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-16 03:49:20,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:49:20,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-16 03:49:20,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=833, Unknown=0, NotChecked=0, Total=930 [2023-02-16 03:49:20,281 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand has 31 states, 30 states have (on average 2.7) internal successors, (81), 31 states have internal predecessors, (81), 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,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:49:22,158 INFO L93 Difference]: Finished difference Result 129 states and 139 transitions. [2023-02-16 03:49:22,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-16 03:49:22,158 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.7) internal successors, (81), 31 states have internal predecessors, (81), 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,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:49:22,159 INFO L225 Difference]: With dead ends: 129 [2023-02-16 03:49:22,159 INFO L226 Difference]: Without dead ends: 129 [2023-02-16 03:49:22,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 57 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=534, Invalid=1722, Unknown=0, NotChecked=0, Total=2256 [2023-02-16 03:49:22,165 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 1269 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1269 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-16 03:49:22,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1269 Valid, 189 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-16 03:49:22,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-02-16 03:49:22,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 82. [2023-02-16 03:49:22,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 81 states have internal predecessors, (90), 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,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2023-02-16 03:49:22,174 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 37 [2023-02-16 03:49:22,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:49:22,174 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2023-02-16 03:49:22,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.7) internal successors, (81), 31 states have internal predecessors, (81), 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,175 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2023-02-16 03:49:22,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-16 03:49:22,176 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:49:22,176 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:22,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-02-16 03:49:22,381 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:22,381 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-16 03:49:22,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:49:22,382 INFO L85 PathProgramCache]: Analyzing trace with hash -494379317, now seen corresponding path program 1 times [2023-02-16 03:49:22,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:49:22,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956715621] [2023-02-16 03:49:22,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:49:22,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:49:22,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:49:23,848 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:23,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:49:23,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956715621] [2023-02-16 03:49:23,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956715621] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:49:23,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447249586] [2023-02-16 03:49:23,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:49:23,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:49:23,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:49:23,851 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:23,877 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:24,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:49:24,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 77 conjunts are in the unsatisfiable core [2023-02-16 03:49:24,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:49:24,171 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:24,280 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:24,294 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-16 03:49:24,294 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:24,298 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:24,306 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:24,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:49:24,359 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:24,371 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-16 03:49:24,371 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:24,375 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 03:49:24,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:49:24,388 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:24,471 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-16 03:49:24,472 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:24,483 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-16 03:49:24,484 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:24,494 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:24,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:49:24,749 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-16 03:49:24,750 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:24,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:49:24,759 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-16 03:49:24,759 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:24,770 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-16 03:49:24,771 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:24,793 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 03:49:24,811 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:49:24,811 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:24,820 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:49:24,821 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:24,958 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:24,985 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:24,985 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:49:25,595 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_~new_head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (= .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= (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_~new_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_~new_head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4)) |c_ULTIMATE.start_main_~data_init~0#1|)))) (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_~new_head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (= .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (= (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_~new_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_~new_head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (+ .cse1 4)) |c_ULTIMATE.start_main_~data_init~0#1|))))) is different from false [2023-02-16 03:49:27,233 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:28,538 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:29,136 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:29,366 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:49:29,366 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:29,378 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:49:29,379 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:29,385 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:29,392 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:29,405 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:33,965 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:33,968 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 03:49:33,971 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 03:49:33,973 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 03:49:33,974 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 03:49:33,976 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 03:49:33,977 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 03:49:33,978 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 03:49:33,980 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 03:49:33,983 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 03:49:33,985 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 03:49:33,986 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 03:49:33,987 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 03:49:33,993 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:49:33,993 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:33,996 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:49:34,005 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:49:34,006 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:34,015 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:49:34,016 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:34,022 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:49:34,023 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:34,519 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:49:34,521 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:49:34,522 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:34,536 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:34,538 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 03:49:34,540 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 03:49:34,542 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 03:49:34,544 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 03:49:34,546 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 03:49:34,548 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 03:49:34,550 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 03:49:34,555 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 03:49:34,557 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 03:49:34,559 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 03:49:34,561 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 03:49:34,563 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 03:49:34,570 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:49:34,571 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:34,573 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:49:34,574 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:49:34,581 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:49:34,582 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:34,592 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 03:49:34,605 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:34,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:49:34,614 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:34,621 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-16 03:49:34,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:34,629 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-16 03:49:34,630 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:34,638 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-16 03:49:34,639 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:34,646 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-16 03:49:34,647 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:34,654 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-16 03:49:34,655 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:34,662 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-16 03:49:34,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:34,670 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-16 03:49:34,671 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:34,678 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-16 03:49:34,678 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:34,685 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-16 03:49:34,685 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:34,693 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-16 03:49:34,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 91 treesize of output 1 [2023-02-16 03:49:34,701 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-16 03:49:34,701 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:34,710 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-16 03:49:34,710 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:34,718 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-16 03:49:34,721 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:34,728 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-16 03:49:34,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 91 treesize of output 1 [2023-02-16 03:49:34,748 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-16 03:49:34,749 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:34,755 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-16 03:49:34,756 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:34,786 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-16 03:49:34,786 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:34,799 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-16 03:49:34,800 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:34,815 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-16 03:49:34,815 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:34,823 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-16 03:49:34,824 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:34,833 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-16 03:49:34,833 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:34,840 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-16 03:49:34,840 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:34,847 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-16 03:49:34,848 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:34,855 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-16 03:49:34,855 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:34,861 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-16 03:49:34,861 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,006 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 15 not checked. [2023-02-16 03:49:35,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447249586] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:49:35,006 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:49:35,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 18] total 47 [2023-02-16 03:49:35,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374786162] [2023-02-16 03:49:35,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:49:35,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-02-16 03:49:35,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:49:35,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-02-16 03:49:35,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1659, Unknown=26, NotChecked=340, Total=2162 [2023-02-16 03:49:35,011 INFO L87 Difference]: Start difference. First operand 82 states and 90 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:42,737 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse72 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (let ((.cse48 (select .cse72 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (let ((.cse46 (select |c_#memory_int| .cse48)) (.cse69 (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)) (.cse70 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (.cse47 (+ |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 .cse70 .cse47) |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 ((.cse82 (store |c_#memory_int| v_subst_3 v_ArrVal_964))) (store .cse82 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse82 |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|)))))) (.cse39 (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 ((.cse81 (store |c_#memory_int| v_subst_4 v_ArrVal_964))) (store .cse81 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse81 |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)))) (.cse40 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse42 (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|)) (.cse43 (= .cse69 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse44 (select |c_#memory_int| .cse69)) (.cse49 (= .cse48 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (.cse61 (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 ((.cse79 (select (store (let ((.cse80 (store |c_#memory_int| v_subst_1 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_1 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse79 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse79 4) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_1)))) (.cse71 (= (select .cse46 4) |c_ULTIMATE.start_main_~data_init~0#1|)) (.cse36 (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0)) (.cse50 (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|)) (.cse62 (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 ((.cse77 (select (store (let ((.cse78 (store |c_#memory_int| v_subst_13 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_13 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse77 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse77 .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)))) (.cse45 (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 ((.cse76 (store |c_#memory_int| v_subst_2 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_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|) (forall ((v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse38 (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_~new_head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (= .cse38 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= (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_~new_head~0#1.base| v_ArrVal_971) .cse38) (+ (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_~new_head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4)) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse39 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) .cse6 (or .cse40 (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)))) (forall ((v_ArrVal_969 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse41 (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_~new_head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (= .cse41 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (= (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_~new_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_~new_head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (+ .cse41 4)) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= .cse42 0) (or .cse43 (= (select .cse44 4) |c_ULTIMATE.start_main_~data_init~0#1|)) (or .cse6 (and .cse39 .cse1 .cse45)) (not .cse40) (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 .cse46 .cse47) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse48))) .cse49) (= .cse50 |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 ((.cse51 (select (store (let ((.cse52 (store |c_#memory_int| v_subst_16 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_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 .cse51 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse51 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 ((.cse53 (store |c_#memory_int| v_subst_34 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_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 ((.cse54 (store |c_#memory_int| v_subst_10 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_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 ((.cse55 (store |c_#memory_int| v_subst_8 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_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 ((.cse56 (store |c_#memory_int| v_subst_12 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_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 ((.cse57 (store |c_#memory_int| v_subst_6 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_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 ((.cse58 (store |c_#memory_int| v_subst_5 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_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 ((.cse59 (select (store (let ((.cse60 (store |c_#memory_int| v_subst_11 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))) v_subst_11 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse59 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse59 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_11))) .cse61 .cse39 .cse62 (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 ((.cse63 (select (store (let ((.cse64 (store |c_#memory_int| v_subst_7 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_7 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse63 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse63 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|)))))) .cse45 (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 ((.cse65 (select (store (let ((.cse66 (store |c_#memory_int| v_subst_9 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_9 v_ArrVal_971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse65 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse65 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 ((.cse67 (select (store (let ((.cse68 (store |c_#memory_int| v_subst_33 v_ArrVal_964))) (store .cse68 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse68 |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 .cse67 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse67 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_971 4) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) (or .cse40 (and (= .cse42 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (or .cse43 (and (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse69)) (= (select .cse44 .cse47) |c_ULTIMATE.start_main_~data_init~0#1|))))) (= (select .cse70 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (or .cse71 .cse49) .cse61 (or (= (select .cse72 0) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (and .cse71 (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 (= .cse50 0) .cse62 (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 ((.cse73 (select (store (let ((.cse74 (store |c_#memory_int| v_subst_15 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_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 .cse73 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse73 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_subst_15 |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))) .cse6) .cse45 (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 ((.cse75 (store |c_#memory_int| v_subst_14 v_ArrVal_964))) (store .cse75 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse75 |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:45,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:49:45,048 INFO L93 Difference]: Finished difference Result 124 states and 133 transitions. [2023-02-16 03:49:45,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-02-16 03:49:45,049 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:45,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:49:45,050 INFO L225 Difference]: With dead ends: 124 [2023-02-16 03:49:45,051 INFO L226 Difference]: Without dead ends: 124 [2023-02-16 03:49:45,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 757 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=543, Invalid=3872, Unknown=27, NotChecked=670, Total=5112 [2023-02-16 03:49:45,054 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 403 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 1207 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 1592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 339 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:49:45,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 363 Invalid, 1592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1207 Invalid, 0 Unknown, 339 Unchecked, 1.2s Time] [2023-02-16 03:49:45,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-02-16 03:49:45,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 85. [2023-02-16 03:49:45,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 84 states have internal predecessors, (96), 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:45,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 96 transitions. [2023-02-16 03:49:45,057 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 96 transitions. Word has length 39 [2023-02-16 03:49:45,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:49:45,058 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 96 transitions. [2023-02-16 03:49:45,058 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:45,058 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 96 transitions. [2023-02-16 03:49:45,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-16 03:49:45,059 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:49:45,059 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:45,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-02-16 03:49:45,265 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:45,266 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-16 03:49:45,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:49:45,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1852999412, now seen corresponding path program 1 times [2023-02-16 03:49:45,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:49:45,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524946511] [2023-02-16 03:49:45,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:49:45,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:49:45,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:49:45,906 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:45,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:49:45,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524946511] [2023-02-16 03:49:45,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524946511] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:49:45,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688641953] [2023-02-16 03:49:45,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:49:45,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:49:45,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:49:45,910 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:45,912 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:46,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:49:46,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 58 conjunts are in the unsatisfiable core [2023-02-16 03:49:46,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:49:46,078 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:46,098 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 03:49:46,099 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:46,118 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 03:49:46,119 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:46,188 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-02-16 03:49:46,189 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:46,340 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2023-02-16 03:49:46,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2023-02-16 03:49:46,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 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:46,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:49:46,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 34 [2023-02-16 03:49:46,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2023-02-16 03:49:46,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-16 03:49:46,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:49:46,846 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:46,856 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:49:46,857 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:46,907 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 28 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:49:46,908 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:49:47,133 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:49:47,134 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:47,137 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:47,144 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:47,482 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 17 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:49:47,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688641953] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:49:47,482 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:49:47,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 16] total 38 [2023-02-16 03:49:47,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818795711] [2023-02-16 03:49:47,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:49:47,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-02-16 03:49:47,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:49:47,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-02-16 03:49:47,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1239, Unknown=2, NotChecked=0, Total=1406 [2023-02-16 03:49:47,484 INFO L87 Difference]: Start difference. First operand 85 states and 96 transitions. Second operand has 38 states, 38 states have (on average 2.5) internal successors, (95), 38 states have internal predecessors, (95), 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:49,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:49:49,034 INFO L93 Difference]: Finished difference Result 106 states and 117 transitions. [2023-02-16 03:49:49,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-16 03:49:49,034 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.5) internal successors, (95), 38 states have internal predecessors, (95), 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:49,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:49:49,035 INFO L225 Difference]: With dead ends: 106 [2023-02-16 03:49:49,035 INFO L226 Difference]: Without dead ends: 106 [2023-02-16 03:49:49,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=629, Invalid=2449, Unknown=2, NotChecked=0, Total=3080 [2023-02-16 03:49:49,036 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 310 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-16 03:49:49,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 504 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-16 03:49:49,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-02-16 03:49:49,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 81. [2023-02-16 03:49:49,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 68 states have (on average 1.3235294117647058) internal successors, (90), 80 states have internal predecessors, (90), 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:49,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2023-02-16 03:49:49,039 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 40 [2023-02-16 03:49:49,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:49:49,040 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2023-02-16 03:49:49,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.5) internal successors, (95), 38 states have internal predecessors, (95), 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:49,040 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2023-02-16 03:49:49,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-16 03:49:49,040 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:49:49,041 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:49,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-02-16 03:49:49,246 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:49,246 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-16 03:49:49,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:49:49,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1769728484, now seen corresponding path program 2 times [2023-02-16 03:49:49,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:49:49,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541739472] [2023-02-16 03:49:49,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:49:49,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:49:49,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:49:51,321 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:51,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:49:51,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541739472] [2023-02-16 03:49:51,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541739472] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:49:51,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992714210] [2023-02-16 03:49:51,322 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 03:49:51,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:49:51,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:49:51,323 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:51,325 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:51,498 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 03:49:51,498 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 03:49:51,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 102 conjunts are in the unsatisfiable core [2023-02-16 03:49:51,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:49:51,533 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:51,574 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 03:49:51,574 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:51,621 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:51,627 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:51,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:49:51,666 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:51,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:49:51,672 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:51,736 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-16 03:49:51,737 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:51,754 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:51,834 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-16 03:49:51,834 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:51,847 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-02-16 03:49:51,847 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:51,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:49:51,978 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-16 03:49:51,979 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 97 treesize of output 66 [2023-02-16 03:49:52,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:49:52,006 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-16 03:49:52,006 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:52,205 INFO L321 Elim1Store]: treesize reduction 24, result has 56.4 percent of original size [2023-02-16 03:49:52,206 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 95 treesize of output 80 [2023-02-16 03:49:52,231 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-02-16 03:49:52,231 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:53,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:49:53,046 INFO L321 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2023-02-16 03:49:53,046 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:53,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:49:53,056 INFO L321 Elim1Store]: treesize reduction 60, result has 1.6 percent of original size [2023-02-16 03:49:53,056 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:53,634 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:53,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:49:53,758 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-02-16 03:49:53,758 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:53,782 INFO L321 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2023-02-16 03:49:53,782 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:53,886 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:49:53,909 INFO L321 Elim1Store]: treesize reduction 37, result has 35.1 percent of original size [2023-02-16 03:49:53,909 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:53,933 INFO L321 Elim1Store]: treesize reduction 17, result has 54.1 percent of original size [2023-02-16 03:49:53,934 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:54,120 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:54,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:49:55,645 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:57,612 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:49:57,627 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:49:57,629 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:49:58,128 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:58,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992714210] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:49:58,129 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:49:58,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 19] total 53 [2023-02-16 03:49:58,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967662919] [2023-02-16 03:49:58,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:49:58,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-02-16 03:49:58,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:49:58,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-02-16 03:49:58,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=2660, Unknown=0, NotChecked=0, Total=2862 [2023-02-16 03:49:58,132 INFO L87 Difference]: Start difference. First operand 81 states and 90 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:38,388 WARN L233 SmtUtils]: Spent 30.42s on a formula simplification. DAG size of input: 241 DAG size of output: 143 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 03:53:04,541 WARN L233 SmtUtils]: Spent 2.21m on a formula simplification. DAG size of input: 283 DAG size of output: 170 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 03:53:06,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-16 03:53:08,677 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (let ((.cse36 (select .cse13 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (let ((.cse37 (= .cse36 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (.cse38 (select (select |c_#memory_$Pointer$.base| .cse36) 0)) (.cse20 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse21 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (let ((.cse11 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (.cse15 (not (<= 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (.cse22 (select |c_#length| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (.cse19 (+ |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 4)) (.cse5 (select .cse21 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse16 (select .cse13 0)) (.cse2 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (.cse10 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (.cse0 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse1 (select .cse20 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse31 (= (select (select |c_#memory_$Pointer$.offset| .cse36) 0) 0)) (.cse34 (= (select |c_#valid| .cse38) 1)) (.cse35 (not (= .cse36 .cse38))) (.cse32 (= .cse38 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (.cse33 (not .cse37))) (and (or .cse0 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (or .cse0 (= .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~1#1.base|) 0) 0) .cse2 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) 0) (or .cse0 (let ((.cse4 (= .cse5 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (and (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse5) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (= .cse3 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= (select |c_#valid| .cse3) 1) .cse4)) (or (= (select (select |c_#memory_$Pointer$.offset| .cse5) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) .cse4)))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~1#1.base|) 0))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| .cse6) 0)) (.cse8 (= (select (select |c_#memory_$Pointer$.offset| .cse6) 0) 0)) (.cse9 (= .cse6 |c_ULTIMATE.start_main_~head~1#1.base|))) (or (and (exists ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (and (= (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_main_~head~1#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0) 0))) (not (= .cse6 .cse7)) (= (select |c_#valid| .cse7) 1) .cse8) (and .cse9 (exists ((v_arrayElimCell_87 Int)) (and (not (= |c_ULTIMATE.start_main_~head~1#1.base| v_arrayElimCell_87)) (= (select |c_#valid| v_arrayElimCell_87) 1)))) (and (not .cse9) (= .cse7 |c_ULTIMATE.start_main_~head~1#1.base|) .cse8) (and .cse9 (exists ((v_arrayElimIndex_3 Int)) (and (= (select (select |c_#memory_$Pointer$.offset| v_arrayElimIndex_3) 0) 0) (not (= v_arrayElimIndex_3 |c_ULTIMATE.start_main_~head~1#1.base|)) (= (select (select |c_#memory_$Pointer$.base| v_arrayElimIndex_3) 0) |c_ULTIMATE.start_main_~head~1#1.base|))))))) (or .cse0 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (and (or (= (select .cse10 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) .cse11) (let ((.cse12 (select .cse13 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (= .cse12 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= (select |c_#valid| .cse12) 1) .cse11)))) (<= (select |c_#length| |c_ULTIMATE.start_main_~head~1#1.base|) 8) (or (and (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_34| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_34|) (forall ((v_ArrVal_1353 Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_34| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_34|) 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4 v_ArrVal_1353)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0)) (forall ((v_ArrVal_1354 Int) (v_ArrVal_1339 Int)) (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_34| v_ArrVal_1339) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_34| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_34|) 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4 v_ArrVal_1354)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) 1)))) (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_34| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_34|) (forall ((v_ArrVal_1354 Int) (v_ArrVal_1339 Int)) (let ((.cse14 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_34| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_34|) 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4 v_ArrVal_1354)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_34| v_ArrVal_1339) .cse14) 1) (= .cse14 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_34|))))))) .cse15) (or (= (select |c_#valid| .cse16) 1) .cse11) (= |c_ULTIMATE.start_main_~ptr~0#1.base| |c_ULTIMATE.start_main_~head~1#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (or (= (select .cse10 0) 0) .cse11) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (or (let ((.cse18 (store .cse21 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (and (forall ((v_ArrVal_1354 Int)) (let ((.cse17 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse18 .cse19 v_ArrVal_1354)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= .cse17 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= (select |c_#valid| .cse17) 1)))) (or (forall ((v_ArrVal_1354 Int)) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse18 .cse19 v_ArrVal_1354)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) 1)) (forall ((v_ArrVal_1353 Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (store .cse20 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) .cse19 v_ArrVal_1353)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))) (not (<= (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 8) .cse22)) .cse15) (= 0 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (= 1 (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (or (not (<= 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (and (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_34| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_34|) (forall ((v_ArrVal_1354 Int) (v_ArrVal_1339 Int)) (let ((.cse23 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_34| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_34|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 4 v_ArrVal_1354)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (= .cse23 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_34|) (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_34| v_ArrVal_1339) .cse23) 1)))))) (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_34| Int)) (or (forall ((v_ArrVal_1353 Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_34| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_34|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4 v_ArrVal_1353)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 0)) (forall ((v_ArrVal_1354 Int) (v_ArrVal_1339 Int)) (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_34| v_ArrVal_1339) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_34| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_34|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 4 v_ArrVal_1354)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) 1)) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_34|))))) (= (select |c_#valid| .cse5) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| |c_ULTIMATE.start_main_~head~1#1.offset|) (<= .cse22 8) (or (not (<= (+ .cse1 8) (select |c_#length| .cse5))) (not (<= 0 .cse1)) (and (or (forall ((v_ArrVal_1353 Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse20 .cse19 v_ArrVal_1353)) .cse5) .cse1) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (forall ((v_ArrVal_1354 Int)) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse21 .cse19 v_ArrVal_1354)) .cse5) .cse1)) 1))) (forall ((v_ArrVal_1354 Int)) (let ((.cse24 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse21 .cse19 v_ArrVal_1354)) .cse5) .cse1))) (or (= .cse24 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= (select |c_#valid| .cse24) 1)))))) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= (select |c_#length| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 8) (= 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (let ((.cse29 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|))) (let ((.cse27 (select .cse29 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (let ((.cse25 (select (select |c_#memory_$Pointer$.base| .cse27) 0)) (.cse26 (= (select (select |c_#memory_$Pointer$.offset| .cse27) 0) 0)) (.cse28 (= (select .cse29 0) |c_ULTIMATE.start_sll_circular_create_#res#1.base|))) (or (and (= (select |c_#valid| .cse25) 1) (exists ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (and (= (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) .cse26 (not (= .cse27 .cse25))) (and (= .cse25 |c_ULTIMATE.start_sll_circular_create_#res#1.base|) .cse26 (not (= .cse27 |c_ULTIMATE.start_sll_circular_create_#res#1.base|))) (and .cse28 (exists ((v_arrayElimIndex_3 Int)) (and (= (select (select |c_#memory_$Pointer$.base| v_arrayElimIndex_3) 0) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (not (= v_arrayElimIndex_3 |c_ULTIMATE.start_sll_circular_create_#res#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| v_arrayElimIndex_3) 0) 0)))) (and .cse28 (exists ((v_arrayElimCell_87 Int)) (and (= (select |c_#valid| v_arrayElimCell_87) 1) (not (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| v_arrayElimCell_87))))))))) (let ((.cse30 (= .cse16 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (and .cse30 (exists ((v_arrayElimCell_87 Int)) (and (= (select |c_#valid| v_arrayElimCell_87) 1) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_arrayElimCell_87))))) (and .cse30 (exists ((v_arrayElimIndex_3 Int)) (and (= (select (select |c_#memory_$Pointer$.offset| v_arrayElimIndex_3) 0) 0) (= (select (select |c_#memory_$Pointer$.base| v_arrayElimIndex_3) 0) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (not (= v_arrayElimIndex_3 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))))) (and .cse31 .cse32 .cse33) (and .cse34 .cse35 .cse31 (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|)))))) (or .cse0 .cse2) (= |c_ULTIMATE.start_main_~head~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (= (select .cse10 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0) (or .cse0 (= .cse1 0)) .cse31 (or (and .cse34 .cse35) (and (exists ((v_arrayElimCell_87 Int)) (and (= (select |c_#valid| v_arrayElimCell_87) 1) (not (= .cse36 v_arrayElimCell_87)))) .cse37) (and .cse32 .cse33))))))) is different from false [2023-02-16 03:53:10,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:53:10,509 INFO L93 Difference]: Finished difference Result 114 states and 121 transitions. [2023-02-16 03:53:10,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-02-16 03:53:10,510 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 43 [2023-02-16 03:53:10,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:53:10,510 INFO L225 Difference]: With dead ends: 114 [2023-02-16 03:53:10,510 INFO L226 Difference]: Without dead ends: 114 [2023-02-16 03:53:10,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 48 SyntacticMatches, 9 SemanticMatches, 84 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2118 ImplicationChecksByTransitivity, 193.1s TimeCoverageRelationStatistics Valid=731, Invalid=6410, Unknown=3, NotChecked=166, Total=7310 [2023-02-16 03:53:10,512 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 280 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 1516 mSolverCounterSat, 90 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 1608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1516 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:53:10,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 329 Invalid, 1608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1516 Invalid, 1 Unknown, 1 Unchecked, 4.3s Time] [2023-02-16 03:53:10,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-02-16 03:53:10,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 84. [2023-02-16 03:53:10,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 71 states have (on average 1.3380281690140845) internal successors, (95), 83 states have internal predecessors, (95), 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:53:10,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 95 transitions. [2023-02-16 03:53:10,516 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 95 transitions. Word has length 43 [2023-02-16 03:53:10,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:53:10,516 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 95 transitions. [2023-02-16 03:53:10,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has 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:53:10,516 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 95 transitions. [2023-02-16 03:53:10,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-16 03:53:10,517 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:53:10,517 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:53:10,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-16 03:53:10,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:53:10,721 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-16 03:53:10,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:53:10,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1769728483, now seen corresponding path program 2 times [2023-02-16 03:53:10,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:53:10,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030242957] [2023-02-16 03:53:10,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:53:10,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:53:10,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:53:12,837 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 39 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:53:12,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:53:12,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030242957] [2023-02-16 03:53:12,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030242957] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:53:12,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478852341] [2023-02-16 03:53:12,837 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 03:53:12,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:53:12,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:53:12,841 INFO L229 MonitoredProcess]: Starting monitored process 9 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:53:12,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-16 03:53:13,040 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 03:53:13,041 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 03:53:13,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 100 conjunts are in the unsatisfiable core [2023-02-16 03:53:13,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:53:13,083 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:53:13,098 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:53:13,206 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 03:53:13,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-16 03:53:13,211 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 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-16 03:53:13,267 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:53:13,275 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:53:13,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:53:13,325 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:53:13,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:53:13,332 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:53:13,440 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-16 03:53:13,440 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:53:13,530 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-16 03:53:13,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 37 treesize of output 32 [2023-02-16 03:53:13,542 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-02-16 03:53:13,542 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:53:13,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:53:13,667 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-16 03:53:13,668 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:53:13,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:53:13,676 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-16 03:53:13,677 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 97 treesize of output 66 [2023-02-16 03:53:13,909 INFO L321 Elim1Store]: treesize reduction 24, result has 56.4 percent of original size [2023-02-16 03:53:13,909 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 95 treesize of output 80 [2023-02-16 03:53:13,929 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-02-16 03:53:13,930 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:53:14,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:53:14,603 INFO L321 Elim1Store]: treesize reduction 60, result has 1.6 percent of original size [2023-02-16 03:53:14,604 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 141 treesize of output 149 [2023-02-16 03:53:14,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:53:14,616 INFO L321 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2023-02-16 03:53:14,616 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 134 treesize of output 109 [2023-02-16 03:53:15,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:53:15,197 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:53:15,215 INFO L321 Elim1Store]: treesize reduction 72, result has 20.9 percent of original size [2023-02-16 03:53:15,215 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 95 treesize of output 96 [2023-02-16 03:53:15,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:53:15,226 INFO L321 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2023-02-16 03:53:15,227 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 88 treesize of output 68 [2023-02-16 03:53:15,317 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:53:15,336 INFO L321 Elim1Store]: treesize reduction 37, result has 35.1 percent of original size [2023-02-16 03:53:15,337 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 106 treesize of output 75 [2023-02-16 03:53:15,360 INFO L321 Elim1Store]: treesize reduction 17, result has 54.1 percent of original size [2023-02-16 03:53:15,360 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 50 treesize of output 52 [2023-02-16 03:53:15,469 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:53:15,470 INFO L328 TraceCheckSpWp]: Computing backward predicates...