./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_remove_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce3c186-4b8c-4dbc-8d59-142052a2d61d/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce3c186-4b8c-4dbc-8d59-142052a2d61d/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce3c186-4b8c-4dbc-8d59-142052a2d61d/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce3c186-4b8c-4dbc-8d59-142052a2d61d/bin/utaipan-verify-YMUCfTKeje/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_remove_all.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce3c186-4b8c-4dbc-8d59-142052a2d61d/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce3c186-4b8c-4dbc-8d59-142052a2d61d/bin/utaipan-verify-YMUCfTKeje --witnessprinter.witness.filename witness --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cd9bd7b6c1446abd728b90c98a54cb367face4c5994cfeca4979c2dbc50ad4d3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 06:42:22,599 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:42:22,662 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce3c186-4b8c-4dbc-8d59-142052a2d61d/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-09 06:42:22,668 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:42:22,669 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:42:22,697 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:42:22,697 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:42:22,698 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:42:22,698 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:42:22,699 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:42:22,699 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 06:42:22,700 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 06:42:22,700 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 06:42:22,700 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 06:42:22,701 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 06:42:22,701 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 06:42:22,702 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 06:42:22,702 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 06:42:22,703 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 06:42:22,704 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 06:42:22,705 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 06:42:22,709 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 06:42:22,710 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 06:42:22,710 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 06:42:22,710 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:42:22,711 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:42:22,711 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:42:22,711 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:42:22,712 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:42:22,713 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 06:42:22,715 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 06:42:22,716 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 06:42:22,716 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:42:22,717 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 06:42:22,717 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:42:22,717 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 06:42:22,717 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:42:22,718 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:42:22,719 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:42:22,719 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 06:42:22,720 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:42:22,720 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:42:22,720 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:42:22,721 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:42:22,721 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 06:42:22,722 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:42:22,722 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:42:22,722 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 06:42:22,722 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:42:22,723 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce3c186-4b8c-4dbc-8d59-142052a2d61d/bin/utaipan-verify-YMUCfTKeje/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce3c186-4b8c-4dbc-8d59-142052a2d61d/bin/utaipan-verify-YMUCfTKeje Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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 -> Taipan 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 -> cd9bd7b6c1446abd728b90c98a54cb367face4c5994cfeca4979c2dbc50ad4d3 [2024-11-09 06:42:23,070 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:42:23,102 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:42:23,105 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:42:23,108 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:42:23,108 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:42:23,110 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce3c186-4b8c-4dbc-8d59-142052a2d61d/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/list-simple/sll2c_remove_all.i Unable to find full path for "g++" [2024-11-09 06:42:25,257 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:42:25,506 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:42:25,507 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce3c186-4b8c-4dbc-8d59-142052a2d61d/sv-benchmarks/c/list-simple/sll2c_remove_all.i [2024-11-09 06:42:25,528 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce3c186-4b8c-4dbc-8d59-142052a2d61d/bin/utaipan-verify-YMUCfTKeje/data/cbbe82c4d/1594a0f353914ed89a4a4bcd3c786890/FLAGa3429e7c8 [2024-11-09 06:42:25,845 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce3c186-4b8c-4dbc-8d59-142052a2d61d/bin/utaipan-verify-YMUCfTKeje/data/cbbe82c4d/1594a0f353914ed89a4a4bcd3c786890 [2024-11-09 06:42:25,847 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:42:25,849 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:42:25,850 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:42:25,850 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:42:25,856 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:42:25,857 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:42:25" (1/1) ... [2024-11-09 06:42:25,858 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ab3251c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:42:25, skipping insertion in model container [2024-11-09 06:42:25,859 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:42:25" (1/1) ... [2024-11-09 06:42:25,899 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:42:26,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:42:26,342 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:42:26,391 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:42:26,423 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:42:26,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:42:26 WrapperNode [2024-11-09 06:42:26,423 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:42:26,424 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:42:26,424 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:42:26,425 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:42:26,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:42:26" (1/1) ... [2024-11-09 06:42:26,444 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:42:26" (1/1) ... [2024-11-09 06:42:26,470 INFO L138 Inliner]: procedures = 126, calls = 37, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 117 [2024-11-09 06:42:26,471 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:42:26,471 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:42:26,475 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:42:26,475 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:42:26,491 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:42:26" (1/1) ... [2024-11-09 06:42:26,491 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:42:26" (1/1) ... [2024-11-09 06:42:26,495 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:42:26" (1/1) ... [2024-11-09 06:42:26,496 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:42:26" (1/1) ... [2024-11-09 06:42:26,503 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:42:26" (1/1) ... [2024-11-09 06:42:26,507 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:42:26" (1/1) ... [2024-11-09 06:42:26,509 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:42:26" (1/1) ... [2024-11-09 06:42:26,510 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:42:26" (1/1) ... [2024-11-09 06:42:26,513 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:42:26,514 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:42:26,514 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:42:26,515 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:42:26,516 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:42:26" (1/1) ... [2024-11-09 06:42:26,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:42:26,536 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce3c186-4b8c-4dbc-8d59-142052a2d61d/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:42:26,555 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce3c186-4b8c-4dbc-8d59-142052a2d61d/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 06:42:26,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce3c186-4b8c-4dbc-8d59-142052a2d61d/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 06:42:26,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 06:42:26,589 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-09 06:42:26,589 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-09 06:42:26,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 06:42:26,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:42:26,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 06:42:26,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 06:42:26,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 06:42:26,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 06:42:26,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-09 06:42:26,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 06:42:26,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:42:26,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:42:26,731 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:42:26,733 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:42:27,188 INFO L? ?]: Removed 104 outVars from TransFormulas that were not future-live. [2024-11-09 06:42:27,188 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:42:27,250 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:42:27,251 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 06:42:27,252 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:42:27 BoogieIcfgContainer [2024-11-09 06:42:27,252 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:42:27,256 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:42:27,258 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:42:27,262 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:42:27,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:42:25" (1/3) ... [2024-11-09 06:42:27,264 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12132a1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:42:27, skipping insertion in model container [2024-11-09 06:42:27,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:42:26" (2/3) ... [2024-11-09 06:42:27,265 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12132a1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:42:27, skipping insertion in model container [2024-11-09 06:42:27,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:42:27" (3/3) ... [2024-11-09 06:42:27,269 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_remove_all.i [2024-11-09 06:42:27,286 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:42:27,286 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2024-11-09 06:42:27,343 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:42:27,351 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@53394bca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:42:27,352 INFO L334 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2024-11-09 06:42:27,357 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 41 states have (on average 2.268292682926829) internal successors, (93), 83 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 06:42:27,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 06:42:27,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:42:27,367 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 06:42:27,367 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-09 06:42:27,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:42:27,374 INFO L85 PathProgramCache]: Analyzing trace with hash 181024210, now seen corresponding path program 1 times [2024-11-09 06:42:27,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:42:27,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486539634] [2024-11-09 06:42:27,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:42:27,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:42:27,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:42:27,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:42:27,877 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:42:27,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486539634] [2024-11-09 06:42:27,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486539634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:42:27,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:42:27,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:42:27,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957826408] [2024-11-09 06:42:27,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:42:27,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:42:27,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:42:27,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:42:27,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:42:27,935 INFO L87 Difference]: Start difference. First operand has 87 states, 41 states have (on average 2.268292682926829) internal successors, (93), 83 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:42:28,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:42:28,093 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2024-11-09 06:42:28,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:42:28,096 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-09 06:42:28,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:42:28,104 INFO L225 Difference]: With dead ends: 84 [2024-11-09 06:42:28,104 INFO L226 Difference]: Without dead ends: 82 [2024-11-09 06:42:28,106 INFO L431 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 [2024-11-09 06:42:28,109 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 1 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:42:28,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 127 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:42:28,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-09 06:42:28,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-09 06:42:28,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 39 states have (on average 2.1538461538461537) internal successors, (84), 78 states have internal predecessors, (84), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 06:42:28,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2024-11-09 06:42:28,154 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 5 [2024-11-09 06:42:28,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:42:28,155 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2024-11-09 06:42:28,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:42:28,155 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2024-11-09 06:42:28,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 06:42:28,156 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:42:28,156 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 06:42:28,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 06:42:28,157 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-09 06:42:28,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:42:28,157 INFO L85 PathProgramCache]: Analyzing trace with hash 181024209, now seen corresponding path program 1 times [2024-11-09 06:42:28,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:42:28,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037723615] [2024-11-09 06:42:28,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:42:28,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:42:28,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:42:28,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:42:28,235 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:42:28,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037723615] [2024-11-09 06:42:28,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037723615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:42:28,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:42:28,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:42:28,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735493387] [2024-11-09 06:42:28,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:42:28,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:42:28,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:42:28,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:42:28,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:42:28,239 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:42:28,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:42:28,355 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2024-11-09 06:42:28,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:42:28,356 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-09 06:42:28,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:42:28,357 INFO L225 Difference]: With dead ends: 80 [2024-11-09 06:42:28,357 INFO L226 Difference]: Without dead ends: 80 [2024-11-09 06:42:28,358 INFO L431 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 [2024-11-09 06:42:28,360 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 1 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:42:28,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 119 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:42:28,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-09 06:42:28,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-09 06:42:28,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 39 states have (on average 2.1025641025641026) internal successors, (82), 76 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 06:42:28,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2024-11-09 06:42:28,375 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 5 [2024-11-09 06:42:28,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:42:28,375 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2024-11-09 06:42:28,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:42:28,377 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2024-11-09 06:42:28,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 06:42:28,379 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:42:28,379 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:42:28,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 06:42:28,380 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-09 06:42:28,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:42:28,382 INFO L85 PathProgramCache]: Analyzing trace with hash 10965989, now seen corresponding path program 1 times [2024-11-09 06:42:28,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:42:28,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143250152] [2024-11-09 06:42:28,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:42:28,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:42:28,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:42:28,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:42:28,484 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:42:28,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143250152] [2024-11-09 06:42:28,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143250152] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:42:28,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:42:28,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:42:28,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591661022] [2024-11-09 06:42:28,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:42:28,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:42:28,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:42:28,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:42:28,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:42:28,488 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 06:42:28,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:42:28,529 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2024-11-09 06:42:28,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:42:28,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-11-09 06:42:28,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:42:28,531 INFO L225 Difference]: With dead ends: 81 [2024-11-09 06:42:28,532 INFO L226 Difference]: Without dead ends: 81 [2024-11-09 06:42:28,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:42:28,533 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 5 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:42:28,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 141 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 06:42:28,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-09 06:42:28,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-09 06:42:28,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 40 states have (on average 2.05) internal successors, (82), 77 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 06:42:28,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2024-11-09 06:42:28,541 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 10 [2024-11-09 06:42:28,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:42:28,543 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2024-11-09 06:42:28,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 06:42:28,543 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2024-11-09 06:42:28,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 06:42:28,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:42:28,544 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:42:28,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 06:42:28,545 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-09 06:42:28,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:42:28,546 INFO L85 PathProgramCache]: Analyzing trace with hash 827075244, now seen corresponding path program 1 times [2024-11-09 06:42:28,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:42:28,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555054532] [2024-11-09 06:42:28,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:42:28,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:42:28,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:42:28,807 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 06:42:28,808 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:42:28,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555054532] [2024-11-09 06:42:28,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555054532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:42:28,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:42:28,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:42:28,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405400943] [2024-11-09 06:42:28,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:42:28,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:42:28,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:42:28,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:42:28,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:42:28,813 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 06:42:29,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:42:29,029 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2024-11-09 06:42:29,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:42:29,030 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2024-11-09 06:42:29,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:42:29,031 INFO L225 Difference]: With dead ends: 80 [2024-11-09 06:42:29,031 INFO L226 Difference]: Without dead ends: 80 [2024-11-09 06:42:29,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:42:29,032 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 1 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:42:29,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 227 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:42:29,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-09 06:42:29,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-09 06:42:29,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 40 states have (on average 2.025) internal successors, (81), 76 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 06:42:29,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2024-11-09 06:42:29,047 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 18 [2024-11-09 06:42:29,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:42:29,048 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2024-11-09 06:42:29,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 06:42:29,049 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2024-11-09 06:42:29,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 06:42:29,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:42:29,050 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:42:29,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 06:42:29,050 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-09 06:42:29,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:42:29,051 INFO L85 PathProgramCache]: Analyzing trace with hash 827075245, now seen corresponding path program 1 times [2024-11-09 06:42:29,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:42:29,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224521435] [2024-11-09 06:42:29,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:42:29,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:42:29,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:42:29,400 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:42:29,401 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:42:29,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224521435] [2024-11-09 06:42:29,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224521435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:42:29,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:42:29,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:42:29,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713468393] [2024-11-09 06:42:29,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:42:29,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:42:29,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:42:29,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:42:29,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:42:29,407 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand has 6 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 06:42:29,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:42:29,617 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2024-11-09 06:42:29,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:42:29,618 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2024-11-09 06:42:29,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:42:29,619 INFO L225 Difference]: With dead ends: 79 [2024-11-09 06:42:29,619 INFO L226 Difference]: Without dead ends: 79 [2024-11-09 06:42:29,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:42:29,621 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:42:29,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 251 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:42:29,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-09 06:42:29,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-09 06:42:29,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 40 states have (on average 2.0) internal successors, (80), 75 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 06:42:29,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2024-11-09 06:42:29,630 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 18 [2024-11-09 06:42:29,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:42:29,630 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2024-11-09 06:42:29,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 06:42:29,631 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2024-11-09 06:42:29,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 06:42:29,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:42:29,632 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:42:29,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 06:42:29,632 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-09 06:42:29,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:42:29,633 INFO L85 PathProgramCache]: Analyzing trace with hash 250501666, now seen corresponding path program 1 times [2024-11-09 06:42:29,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:42:29,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233179826] [2024-11-09 06:42:29,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:42:29,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:42:29,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:42:30,016 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:42:30,017 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:42:30,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233179826] [2024-11-09 06:42:30,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233179826] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:42:30,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211717444] [2024-11-09 06:42:30,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:42:30,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:42:30,020 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce3c186-4b8c-4dbc-8d59-142052a2d61d/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:42:30,022 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce3c186-4b8c-4dbc-8d59-142052a2d61d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:42:30,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce3c186-4b8c-4dbc-8d59-142052a2d61d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 06:42:30,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:42:30,156 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 06:42:30,163 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:42:30,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 06:42:30,277 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-09 06:42:30,366 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 06:42:30,366 INFO L378 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 19 treesize of output 16 [2024-11-09 06:42:30,385 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-11-09 06:42:30,385 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:42:30,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211717444] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:42:30,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [12691089] [2024-11-09 06:42:30,490 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2024-11-09 06:42:30,490 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:42:30,494 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:42:30,500 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:42:30,500 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:42:32,580 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 146 for LOIs [2024-11-09 06:42:33,193 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:42:40,655 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1001#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| Int)) (not (= (select |#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 1))) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~data#1| 1))' at error location [2024-11-09 06:42:40,655 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:42:40,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 06:42:40,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2024-11-09 06:42:40,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044462291] [2024-11-09 06:42:40,655 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 06:42:40,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 06:42:40,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:42:40,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 06:42:40,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=433, Unknown=2, NotChecked=42, Total=552 [2024-11-09 06:42:40,657 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand has 11 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 06:42:41,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:42:41,028 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2024-11-09 06:42:41,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 06:42:41,029 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 20 [2024-11-09 06:42:41,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:42:41,030 INFO L225 Difference]: With dead ends: 78 [2024-11-09 06:42:41,030 INFO L226 Difference]: Without dead ends: 78 [2024-11-09 06:42:41,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=88, Invalid=514, Unknown=2, NotChecked=46, Total=650 [2024-11-09 06:42:41,031 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 1 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:42:41,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 319 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 312 Invalid, 0 Unknown, 78 Unchecked, 0.3s Time] [2024-11-09 06:42:41,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-09 06:42:41,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-09 06:42:41,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 40 states have (on average 1.975) internal successors, (79), 74 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 06:42:41,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2024-11-09 06:42:41,046 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 20 [2024-11-09 06:42:41,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:42:41,047 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2024-11-09 06:42:41,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 06:42:41,047 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2024-11-09 06:42:41,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 06:42:41,047 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:42:41,048 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:42:41,075 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce3c186-4b8c-4dbc-8d59-142052a2d61d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 06:42:41,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce3c186-4b8c-4dbc-8d59-142052a2d61d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:42:41,249 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-09 06:42:41,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:42:41,249 INFO L85 PathProgramCache]: Analyzing trace with hash 250501667, now seen corresponding path program 1 times [2024-11-09 06:42:41,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:42:41,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795093909] [2024-11-09 06:42:41,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:42:41,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:42:41,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:42:41,685 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:42:41,685 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:42:41,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795093909] [2024-11-09 06:42:41,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795093909] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:42:41,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923032606] [2024-11-09 06:42:41,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:42:41,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:42:41,686 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce3c186-4b8c-4dbc-8d59-142052a2d61d/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:42:41,689 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce3c186-4b8c-4dbc-8d59-142052a2d61d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:42:41,690 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce3c186-4b8c-4dbc-8d59-142052a2d61d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 06:42:41,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:42:41,797 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 06:42:41,803 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:42:41,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 06:42:41,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 06:42:41,978 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-09 06:42:42,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:42:42,013 INFO L378 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 14 treesize of output 9 [2024-11-09 06:42:42,022 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 06:42:42,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 06:42:42,059 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-09 06:42:42,059 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:42:42,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923032606] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:42:42,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [903641312] [2024-11-09 06:42:42,207 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2024-11-09 06:42:42,207 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:42:42,207 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:42:42,208 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:42:42,208 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:42:43,341 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 146 for LOIs [2024-11-09 06:42:43,826 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:42:49,753 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1264#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| Int)) (<= (select |#length| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 3)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~data#1| 1))' at error location [2024-11-09 06:42:49,753 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:42:49,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 06:42:49,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2024-11-09 06:42:49,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392693222] [2024-11-09 06:42:49,754 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 06:42:49,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 06:42:49,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:42:49,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 06:42:49,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=767, Unknown=1, NotChecked=56, Total=930 [2024-11-09 06:42:49,756 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand has 17 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 06:42:50,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:42:50,261 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2024-11-09 06:42:50,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 06:42:50,262 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 20 [2024-11-09 06:42:50,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:42:50,264 INFO L225 Difference]: With dead ends: 86 [2024-11-09 06:42:50,264 INFO L226 Difference]: Without dead ends: 86 [2024-11-09 06:42:50,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=121, Invalid=874, Unknown=1, NotChecked=60, Total=1056 [2024-11-09 06:42:50,266 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 5 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:42:50,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 340 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 467 Invalid, 0 Unknown, 90 Unchecked, 0.4s Time] [2024-11-09 06:42:50,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-09 06:42:50,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2024-11-09 06:42:50,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 79 states have internal predecessors, (85), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:42:50,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2024-11-09 06:42:50,273 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 20 [2024-11-09 06:42:50,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:42:50,273 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2024-11-09 06:42:50,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 06:42:50,274 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2024-11-09 06:42:50,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 06:42:50,274 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:42:50,275 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:42:50,298 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce3c186-4b8c-4dbc-8d59-142052a2d61d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 06:42:50,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce3c186-4b8c-4dbc-8d59-142052a2d61d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:42:50,476 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-09 06:42:50,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:42:50,476 INFO L85 PathProgramCache]: Analyzing trace with hash 214064715, now seen corresponding path program 1 times [2024-11-09 06:42:50,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:42:50,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080165770] [2024-11-09 06:42:50,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:42:50,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:42:50,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:42:50,552 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 06:42:50,552 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:42:50,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080165770] [2024-11-09 06:42:50,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080165770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:42:50,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:42:50,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:42:50,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763066224] [2024-11-09 06:42:50,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:42:50,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:42:50,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:42:50,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:42:50,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:42:50,554 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 06:42:50,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:42:50,611 INFO L93 Difference]: Finished difference Result 137 states and 146 transitions. [2024-11-09 06:42:50,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:42:50,612 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-11-09 06:42:50,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:42:50,613 INFO L225 Difference]: With dead ends: 137 [2024-11-09 06:42:50,613 INFO L226 Difference]: Without dead ends: 137 [2024-11-09 06:42:50,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:42:50,614 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 111 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:42:50,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 146 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:42:50,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-09 06:42:50,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 86. [2024-11-09 06:42:50,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 47 states have (on average 1.851063829787234) internal successors, (87), 81 states have internal predecessors, (87), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:42:50,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2024-11-09 06:42:50,620 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 22 [2024-11-09 06:42:50,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:42:50,620 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2024-11-09 06:42:50,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 06:42:50,621 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2024-11-09 06:42:50,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 06:42:50,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:42:50,621 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:42:50,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 06:42:50,622 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-09 06:42:50,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:42:50,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1954004710, now seen corresponding path program 1 times [2024-11-09 06:42:50,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:42:50,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81573371] [2024-11-09 06:42:50,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:42:50,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:42:50,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:42:50,944 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 06:42:50,944 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:42:50,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81573371] [2024-11-09 06:42:50,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81573371] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:42:50,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977597454] [2024-11-09 06:42:50,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:42:50,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:42:50,945 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce3c186-4b8c-4dbc-8d59-142052a2d61d/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:42:50,947 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce3c186-4b8c-4dbc-8d59-142052a2d61d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:42:50,948 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce3c186-4b8c-4dbc-8d59-142052a2d61d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 06:42:51,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:42:51,068 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 06:42:51,071 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:42:51,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 06:42:51,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 06:42:51,133 WARN L851 $PredicateComparison]: unable to prove that (and (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_34| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_34| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_34| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_34| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base| .cse0)))))) is different from false [2024-11-09 06:42:51,135 WARN L873 $PredicateComparison]: unable to prove that (and (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_34| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_34| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_34| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_34| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base| .cse0)))))) is different from true [2024-11-09 06:42:51,157 WARN L851 $PredicateComparison]: unable to prove that (and (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_34| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_34| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_34| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_34| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse0))))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from false [2024-11-09 06:42:51,159 WARN L873 $PredicateComparison]: unable to prove that (and (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_34| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_34| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_34| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_34| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse0))))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from true [2024-11-09 06:42:51,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 06:42:51,223 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2024-11-09 06:42:51,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:42:51,271 INFO L378 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 14 treesize of output 9 [2024-11-09 06:42:51,296 WARN L851 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_36| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_36| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (exists ((|v_#valid_BEFORE_CALL_34| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_34| |v_#valid_BEFORE_CALL_36|))) (and (= (select |v_#valid_BEFORE_CALL_34| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_36| (store |v_#valid_BEFORE_CALL_34| .cse0 (select |v_#valid_BEFORE_CALL_36| .cse0))) (= .cse0 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)))))) (<= (+ |node_create_~temp~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2024-11-09 06:42:51,299 WARN L873 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_36| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_36| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (exists ((|v_#valid_BEFORE_CALL_34| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_34| |v_#valid_BEFORE_CALL_36|))) (and (= (select |v_#valid_BEFORE_CALL_34| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_36| (store |v_#valid_BEFORE_CALL_34| .cse0 (select |v_#valid_BEFORE_CALL_36| .cse0))) (= .cse0 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)))))) (<= (+ |node_create_~temp~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from true [2024-11-09 06:42:51,419 WARN L851 $PredicateComparison]: unable to prove that (or (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| Int)) (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 1))) (exists ((|node_create_~temp~0#1.base| Int) (|v_#valid_BEFORE_CALL_34| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_34| |v_#valid_BEFORE_CALL_36|))) (and (= (select |v_#valid_BEFORE_CALL_34| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_36| (store |v_#valid_BEFORE_CALL_34| .cse0 (select |v_#valid_BEFORE_CALL_36| .cse0))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_36| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= (select |c_#valid| .cse0) 1) (<= (+ |node_create_~temp~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2024-11-09 06:42:51,423 WARN L873 $PredicateComparison]: unable to prove that (or (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| Int)) (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 1))) (exists ((|node_create_~temp~0#1.base| Int) (|v_#valid_BEFORE_CALL_34| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_34| |v_#valid_BEFORE_CALL_36|))) (and (= (select |v_#valid_BEFORE_CALL_34| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_36| (store |v_#valid_BEFORE_CALL_34| .cse0 (select |v_#valid_BEFORE_CALL_36| .cse0))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_36| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= (select |c_#valid| .cse0) 1) (<= (+ |node_create_~temp~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from true [2024-11-09 06:42:51,482 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|node_create_~temp~0#1.base| Int) (|v_#valid_BEFORE_CALL_34| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_34| |v_#valid_BEFORE_CALL_36|))) (and (= |v_#valid_BEFORE_CALL_36| (store |v_#valid_BEFORE_CALL_34| .cse0 (select |v_#valid_BEFORE_CALL_36| .cse0))) (<= (+ |node_create_~temp~0#1.base| 2) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_36| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 1 (select |v_#valid_BEFORE_CALL_34| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|)) (= (select |c_#valid| .cse0) 1)))) (and (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) 1) (exists ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| Int)) (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 1)))) is different from false [2024-11-09 06:42:51,485 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|node_create_~temp~0#1.base| Int) (|v_#valid_BEFORE_CALL_34| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_34| |v_#valid_BEFORE_CALL_36|))) (and (= |v_#valid_BEFORE_CALL_36| (store |v_#valid_BEFORE_CALL_34| .cse0 (select |v_#valid_BEFORE_CALL_36| .cse0))) (<= (+ |node_create_~temp~0#1.base| 2) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_36| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 1 (select |v_#valid_BEFORE_CALL_34| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|)) (= (select |c_#valid| .cse0) 1)))) (and (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) 1) (exists ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| Int)) (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 1)))) is different from true [2024-11-09 06:42:51,485 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2024-11-09 06:42:51,486 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:42:51,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977597454] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:42:51,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1548099498] [2024-11-09 06:42:51,595 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2024-11-09 06:42:51,596 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:42:51,596 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:42:51,596 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:42:51,596 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:42:52,528 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 146 for LOIs [2024-11-09 06:42:52,974 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:42:58,145 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1787#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~i~0#1| 0) (exists ((|v_#memory_int_73| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_89| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_89| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| Int)) (and (= (store |v_#memory_$Pointer$.base_89| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_$Pointer$.base_89| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |#memory_$Pointer$.base|) (<= 4 (select |#length| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|)) (= (select |#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 1) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_89| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_$Pointer$.offset_89| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 0))) (= |#memory_int| (store |v_#memory_int_73| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_int_73| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0)))))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_remove_first_~head#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (not (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-09 06:42:58,145 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:42:58,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 06:42:58,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2024-11-09 06:42:58,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049596606] [2024-11-09 06:42:58,146 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 06:42:58,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 06:42:58,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:42:58,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 06:42:58,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=662, Unknown=11, NotChecked=342, Total=1122 [2024-11-09 06:42:58,148 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand has 18 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 06:42:58,295 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (or .cse0 (exists ((|v_#valid_BEFORE_CALL_34| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_34| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_34| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_34| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base| .cse1))))))) is different from false [2024-11-09 06:42:58,298 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (or .cse0 (exists ((|v_#valid_BEFORE_CALL_34| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_34| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_34| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_34| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base| .cse1))))))) is different from true [2024-11-09 06:42:58,301 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (exists ((|v_#valid_BEFORE_CALL_34| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_34| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_34| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_34| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse1))))) (or .cse0 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2024-11-09 06:42:58,304 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (exists ((|v_#valid_BEFORE_CALL_34| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_34| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_34| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_34| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse1))))) (or .cse0 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2024-11-09 06:42:58,308 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_36| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_36| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (exists ((|v_#valid_BEFORE_CALL_34| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_34| |v_#valid_BEFORE_CALL_36|))) (and (= (select |v_#valid_BEFORE_CALL_34| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_36| (store |v_#valid_BEFORE_CALL_34| .cse1 (select |v_#valid_BEFORE_CALL_36| .cse1))) (= .cse1 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)))))) (<= (+ |node_create_~temp~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|)))) (or .cse0 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2024-11-09 06:42:58,311 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_36| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_36| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (exists ((|v_#valid_BEFORE_CALL_34| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_34| |v_#valid_BEFORE_CALL_36|))) (and (= (select |v_#valid_BEFORE_CALL_34| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_36| (store |v_#valid_BEFORE_CALL_34| .cse1 (select |v_#valid_BEFORE_CALL_36| .cse1))) (= .cse1 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)))))) (<= (+ |node_create_~temp~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|)))) (or .cse0 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from true [2024-11-09 06:42:58,315 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (or (and .cse0 (exists ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| Int)) (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 1))) (exists ((|node_create_~temp~0#1.base| Int) (|v_#valid_BEFORE_CALL_34| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_34| |v_#valid_BEFORE_CALL_36|))) (and (= (select |v_#valid_BEFORE_CALL_34| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_36| (store |v_#valid_BEFORE_CALL_34| .cse1 (select |v_#valid_BEFORE_CALL_36| .cse1))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_36| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= (select |c_#valid| .cse1) 1) (<= (+ |node_create_~temp~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|))))))) is different from false [2024-11-09 06:42:58,317 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (or (and .cse0 (exists ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| Int)) (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 1))) (exists ((|node_create_~temp~0#1.base| Int) (|v_#valid_BEFORE_CALL_34| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_34| |v_#valid_BEFORE_CALL_36|))) (and (= (select |v_#valid_BEFORE_CALL_34| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_36| (store |v_#valid_BEFORE_CALL_34| .cse1 (select |v_#valid_BEFORE_CALL_36| .cse1))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_36| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= (select |c_#valid| .cse1) 1) (<= (+ |node_create_~temp~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|))))))) is different from true [2024-11-09 06:42:58,324 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) 1))) (and .cse0 (or (exists ((|node_create_~temp~0#1.base| Int) (|v_#valid_BEFORE_CALL_34| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_34| |v_#valid_BEFORE_CALL_36|))) (and (= |v_#valid_BEFORE_CALL_36| (store |v_#valid_BEFORE_CALL_34| .cse1 (select |v_#valid_BEFORE_CALL_36| .cse1))) (<= (+ |node_create_~temp~0#1.base| 2) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_36| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 1 (select |v_#valid_BEFORE_CALL_34| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|)) (= (select |c_#valid| .cse1) 1)))) (and .cse0 (exists ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| Int)) (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 1)))))) is different from false [2024-11-09 06:42:58,327 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) 1))) (and .cse0 (or (exists ((|node_create_~temp~0#1.base| Int) (|v_#valid_BEFORE_CALL_34| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_34| |v_#valid_BEFORE_CALL_36|))) (and (= |v_#valid_BEFORE_CALL_36| (store |v_#valid_BEFORE_CALL_34| .cse1 (select |v_#valid_BEFORE_CALL_36| .cse1))) (<= (+ |node_create_~temp~0#1.base| 2) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_36| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 1 (select |v_#valid_BEFORE_CALL_34| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|)) (= (select |c_#valid| .cse1) 1)))) (and .cse0 (exists ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| Int)) (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 1)))))) is different from true [2024-11-09 06:42:58,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:42:58,814 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2024-11-09 06:42:58,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 06:42:58,814 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 23 [2024-11-09 06:42:58,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:42:58,815 INFO L225 Difference]: With dead ends: 127 [2024-11-09 06:42:58,815 INFO L226 Difference]: Without dead ends: 127 [2024-11-09 06:42:58,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=138, Invalid=815, Unknown=21, NotChecked=748, Total=1722 [2024-11-09 06:42:58,817 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 116 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 1484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 955 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:42:58,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 348 Invalid, 1484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 515 Invalid, 0 Unknown, 955 Unchecked, 0.5s Time] [2024-11-09 06:42:58,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-09 06:42:58,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 88. [2024-11-09 06:42:58,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 53 states have (on average 1.7735849056603774) internal successors, (94), 83 states have internal predecessors, (94), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:42:58,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 100 transitions. [2024-11-09 06:42:58,828 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 100 transitions. Word has length 23 [2024-11-09 06:42:58,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:42:58,829 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 100 transitions. [2024-11-09 06:42:58,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 06:42:58,829 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 100 transitions. [2024-11-09 06:42:58,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 06:42:58,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:42:58,830 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:42:58,855 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce3c186-4b8c-4dbc-8d59-142052a2d61d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 06:42:59,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce3c186-4b8c-4dbc-8d59-142052a2d61d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:42:59,031 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-09 06:42:59,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:42:59,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1954004709, now seen corresponding path program 1 times [2024-11-09 06:42:59,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:42:59,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123676199] [2024-11-09 06:42:59,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:42:59,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:42:59,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:42:59,600 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:42:59,600 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:42:59,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123676199] [2024-11-09 06:42:59,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123676199] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:42:59,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100425417] [2024-11-09 06:42:59,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:42:59,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:42:59,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce3c186-4b8c-4dbc-8d59-142052a2d61d/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:42:59,603 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce3c186-4b8c-4dbc-8d59-142052a2d61d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:42:59,608 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce3c186-4b8c-4dbc-8d59-142052a2d61d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 06:42:59,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:42:59,746 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 06:42:59,750 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:42:59,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 06:42:59,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 06:42:59,811 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2024-11-09 06:42:59,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:42:59,844 INFO L378 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 14 treesize of output 9 [2024-11-09 06:42:59,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 06:42:59,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:42:59,917 INFO L378 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 14 treesize of output 9 [2024-11-09 06:42:59,984 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 06:42:59,985 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:43:00,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100425417] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:43:00,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [765749697] [2024-11-09 06:43:00,185 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2024-11-09 06:43:00,185 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:43:00,186 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:43:00,186 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:43:00,186 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:43:01,065 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 146 for LOIs [2024-11-09 06:43:01,410 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:43:06,850 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2140#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~i~0#1| 0) (exists ((|v_#memory_int_87| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| Int) (|v_#memory_$Pointer$.base_103| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_103| (Array Int (Array Int Int)))) (and (= (select |#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 1) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_103| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_$Pointer$.offset_103| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0 0))) (= |#memory_int| (store |v_#memory_int_87| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_int_87| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0)))) (<= 4 (select |#length| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|)) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_103| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_$Pointer$.base_103| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)))))) (<= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 3) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-09 06:43:06,850 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:43:06,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 06:43:06,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 13 [2024-11-09 06:43:06,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783294117] [2024-11-09 06:43:06,851 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 06:43:06,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 06:43:06,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:43:06,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 06:43:06,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=820, Unknown=1, NotChecked=58, Total=992 [2024-11-09 06:43:06,853 INFO L87 Difference]: Start difference. First operand 88 states and 100 transitions. Second operand has 15 states, 11 states have (on average 3.090909090909091) internal successors, (34), 13 states have internal predecessors, (34), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 06:43:07,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:43:07,232 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2024-11-09 06:43:07,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 06:43:07,232 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 3.090909090909091) internal successors, (34), 13 states have internal predecessors, (34), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 23 [2024-11-09 06:43:07,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:43:07,233 INFO L225 Difference]: With dead ends: 79 [2024-11-09 06:43:07,233 INFO L226 Difference]: Without dead ends: 79 [2024-11-09 06:43:07,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=143, Invalid=982, Unknown=1, NotChecked=64, Total=1190 [2024-11-09 06:43:07,234 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 187 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 65 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:43:07,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 154 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 234 Invalid, 0 Unknown, 65 Unchecked, 0.2s Time] [2024-11-09 06:43:07,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-09 06:43:07,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-09 06:43:07,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 74 states have internal predecessors, (82), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:43:07,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2024-11-09 06:43:07,240 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 23 [2024-11-09 06:43:07,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:43:07,240 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2024-11-09 06:43:07,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 3.090909090909091) internal successors, (34), 13 states have internal predecessors, (34), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 06:43:07,240 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2024-11-09 06:43:07,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 06:43:07,241 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:43:07,243 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:43:07,261 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce3c186-4b8c-4dbc-8d59-142052a2d61d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 06:43:07,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce3c186-4b8c-4dbc-8d59-142052a2d61d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:43:07,444 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-09 06:43:07,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:43:07,444 INFO L85 PathProgramCache]: Analyzing trace with hash -444603855, now seen corresponding path program 1 times [2024-11-09 06:43:07,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:43:07,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480346775] [2024-11-09 06:43:07,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:43:07,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:43:07,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:43:07,666 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 06:43:07,667 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:43:07,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480346775] [2024-11-09 06:43:07,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480346775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:43:07,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:43:07,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:43:07,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944500224] [2024-11-09 06:43:07,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:43:07,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 06:43:07,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:43:07,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 06:43:07,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 06:43:07,670 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand has 10 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 06:43:07,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:43:07,966 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2024-11-09 06:43:07,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 06:43:07,967 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-11-09 06:43:07,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:43:07,968 INFO L225 Difference]: With dead ends: 102 [2024-11-09 06:43:07,968 INFO L226 Difference]: Without dead ends: 102 [2024-11-09 06:43:07,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-09 06:43:07,969 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 54 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:43:07,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 282 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 06:43:07,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-09 06:43:07,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 80. [2024-11-09 06:43:07,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.537037037037037) internal successors, (83), 75 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:43:07,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2024-11-09 06:43:07,976 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 24 [2024-11-09 06:43:07,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:43:07,977 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2024-11-09 06:43:07,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 06:43:07,977 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2024-11-09 06:43:07,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 06:43:07,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:43:07,982 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:43:07,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 06:43:07,983 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-09 06:43:07,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:43:07,983 INFO L85 PathProgramCache]: Analyzing trace with hash -444603854, now seen corresponding path program 1 times [2024-11-09 06:43:07,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:43:07,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208559427] [2024-11-09 06:43:07,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:43:07,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:43:08,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:43:08,335 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:43:08,335 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:43:08,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208559427] [2024-11-09 06:43:08,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208559427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:43:08,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:43:08,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:43:08,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681136698] [2024-11-09 06:43:08,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:43:08,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 06:43:08,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:43:08,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 06:43:08,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 06:43:08,337 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 06:43:08,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:43:08,593 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2024-11-09 06:43:08,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 06:43:08,594 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-11-09 06:43:08,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:43:08,595 INFO L225 Difference]: With dead ends: 103 [2024-11-09 06:43:08,595 INFO L226 Difference]: Without dead ends: 103 [2024-11-09 06:43:08,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-09 06:43:08,596 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 54 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:43:08,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 356 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:43:08,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-09 06:43:08,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 80. [2024-11-09 06:43:08,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.5) internal successors, (81), 75 states have internal predecessors, (81), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:43:08,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2024-11-09 06:43:08,600 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 24 [2024-11-09 06:43:08,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:43:08,601 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2024-11-09 06:43:08,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 06:43:08,601 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2024-11-09 06:43:08,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 06:43:08,602 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:43:08,602 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:43:08,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 06:43:08,602 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-09 06:43:08,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:43:08,603 INFO L85 PathProgramCache]: Analyzing trace with hash -897813820, now seen corresponding path program 1 times [2024-11-09 06:43:08,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:43:08,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491807950] [2024-11-09 06:43:08,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:43:08,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:43:08,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:43:08,650 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 06:43:08,651 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:43:08,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491807950] [2024-11-09 06:43:08,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491807950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:43:08,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:43:08,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:43:08,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316487722] [2024-11-09 06:43:08,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:43:08,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:43:08,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:43:08,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:43:08,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:43:08,653 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 06:43:08,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:43:08,722 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2024-11-09 06:43:08,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:43:08,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-11-09 06:43:08,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:43:08,724 INFO L225 Difference]: With dead ends: 79 [2024-11-09 06:43:08,724 INFO L226 Difference]: Without dead ends: 79 [2024-11-09 06:43:08,724 INFO L431 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 [2024-11-09 06:43:08,725 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 30 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:43:08,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 61 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:43:08,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-09 06:43:08,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 74. [2024-11-09 06:43:08,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 49 states have (on average 1.530612244897959) internal successors, (75), 69 states have internal predecessors, (75), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:43:08,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2024-11-09 06:43:08,729 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 25 [2024-11-09 06:43:08,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:43:08,730 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2024-11-09 06:43:08,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 06:43:08,730 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2024-11-09 06:43:08,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 06:43:08,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:43:08,731 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:43:08,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 06:43:08,731 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-09 06:43:08,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:43:08,731 INFO L85 PathProgramCache]: Analyzing trace with hash -2010122713, now seen corresponding path program 1 times [2024-11-09 06:43:08,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:43:08,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922410823] [2024-11-09 06:43:08,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:43:08,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:43:08,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:43:08,947 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 06:43:08,948 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:43:08,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922410823] [2024-11-09 06:43:08,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922410823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:43:08,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:43:08,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:43:08,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606042141] [2024-11-09 06:43:08,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:43:08,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 06:43:08,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:43:08,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 06:43:08,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 06:43:08,950 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 06:43:09,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:43:09,235 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2024-11-09 06:43:09,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 06:43:09,235 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2024-11-09 06:43:09,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:43:09,236 INFO L225 Difference]: With dead ends: 92 [2024-11-09 06:43:09,236 INFO L226 Difference]: Without dead ends: 92 [2024-11-09 06:43:09,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-09 06:43:09,237 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 54 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:43:09,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 262 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:43:09,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-09 06:43:09,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 76. [2024-11-09 06:43:09,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 53 states have (on average 1.490566037735849) internal successors, (79), 71 states have internal predecessors, (79), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:43:09,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2024-11-09 06:43:09,241 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 28 [2024-11-09 06:43:09,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:43:09,241 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2024-11-09 06:43:09,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 06:43:09,242 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2024-11-09 06:43:09,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 06:43:09,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:43:09,242 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:43:09,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 06:43:09,243 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-09 06:43:09,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:43:09,243 INFO L85 PathProgramCache]: Analyzing trace with hash -2010122712, now seen corresponding path program 1 times [2024-11-09 06:43:09,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:43:09,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048675508] [2024-11-09 06:43:09,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:43:09,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:43:09,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:43:09,700 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:43:09,701 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:43:09,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048675508] [2024-11-09 06:43:09,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048675508] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:43:09,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:43:09,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:43:09,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424473523] [2024-11-09 06:43:09,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:43:09,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 06:43:09,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:43:09,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 06:43:09,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 06:43:09,703 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand has 10 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 06:43:10,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:43:10,025 INFO L93 Difference]: Finished difference Result 98 states and 108 transitions. [2024-11-09 06:43:10,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 06:43:10,025 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2024-11-09 06:43:10,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:43:10,026 INFO L225 Difference]: With dead ends: 98 [2024-11-09 06:43:10,026 INFO L226 Difference]: Without dead ends: 98 [2024-11-09 06:43:10,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-09 06:43:10,029 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 59 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:43:10,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 331 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 06:43:10,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-09 06:43:10,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 80. [2024-11-09 06:43:10,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 57 states have (on average 1.456140350877193) internal successors, (83), 75 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:43:10,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2024-11-09 06:43:10,033 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 28 [2024-11-09 06:43:10,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:43:10,034 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2024-11-09 06:43:10,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 06:43:10,034 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2024-11-09 06:43:10,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 06:43:10,035 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:43:10,035 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:43:10,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 06:43:10,035 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-09 06:43:10,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:43:10,035 INFO L85 PathProgramCache]: Analyzing trace with hash -2010139534, now seen corresponding path program 1 times [2024-11-09 06:43:10,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:43:10,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28493924] [2024-11-09 06:43:10,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:43:10,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:43:10,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:43:10,228 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:43:10,228 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:43:10,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28493924] [2024-11-09 06:43:10,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28493924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:43:10,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:43:10,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:43:10,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361198692] [2024-11-09 06:43:10,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:43:10,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 06:43:10,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:43:10,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 06:43:10,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 06:43:10,232 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand has 10 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 06:43:10,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:43:10,431 INFO L93 Difference]: Finished difference Result 109 states and 123 transitions. [2024-11-09 06:43:10,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 06:43:10,432 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2024-11-09 06:43:10,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:43:10,432 INFO L225 Difference]: With dead ends: 109 [2024-11-09 06:43:10,432 INFO L226 Difference]: Without dead ends: 109 [2024-11-09 06:43:10,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-09 06:43:10,433 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 52 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:43:10,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 392 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:43:10,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-09 06:43:10,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 92. [2024-11-09 06:43:10,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 69 states have (on average 1.5072463768115942) internal successors, (104), 87 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:43:10,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 110 transitions. [2024-11-09 06:43:10,437 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 110 transitions. Word has length 28 [2024-11-09 06:43:10,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:43:10,438 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 110 transitions. [2024-11-09 06:43:10,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 06:43:10,438 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 110 transitions. [2024-11-09 06:43:10,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 06:43:10,439 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:43:10,439 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:43:10,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 06:43:10,439 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-09 06:43:10,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:43:10,440 INFO L85 PathProgramCache]: Analyzing trace with hash 2110183973, now seen corresponding path program 1 times [2024-11-09 06:43:10,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:43:10,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82324174] [2024-11-09 06:43:10,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:43:10,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:43:10,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:43:10,660 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:43:10,661 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:43:10,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82324174] [2024-11-09 06:43:10,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82324174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:43:10,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:43:10,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:43:10,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912434792] [2024-11-09 06:43:10,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:43:10,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 06:43:10,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:43:10,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 06:43:10,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 06:43:10,663 INFO L87 Difference]: Start difference. First operand 92 states and 110 transitions. Second operand has 10 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 06:43:10,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:43:10,971 INFO L93 Difference]: Finished difference Result 108 states and 127 transitions. [2024-11-09 06:43:10,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 06:43:10,972 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2024-11-09 06:43:10,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:43:10,973 INFO L225 Difference]: With dead ends: 108 [2024-11-09 06:43:10,974 INFO L226 Difference]: Without dead ends: 108 [2024-11-09 06:43:10,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-09 06:43:10,975 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 43 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:43:10,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 335 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 06:43:10,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-09 06:43:10,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 95. [2024-11-09 06:43:10,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 72 states have (on average 1.4861111111111112) internal successors, (107), 90 states have internal predecessors, (107), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:43:10,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 113 transitions. [2024-11-09 06:43:10,980 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 113 transitions. Word has length 29 [2024-11-09 06:43:10,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:43:10,980 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 113 transitions. [2024-11-09 06:43:10,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 06:43:10,980 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 113 transitions. [2024-11-09 06:43:10,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 06:43:10,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:43:10,981 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-09 06:43:10,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 06:43:10,981 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-09 06:43:10,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:43:10,982 INFO L85 PathProgramCache]: Analyzing trace with hash 119830560, now seen corresponding path program 2 times [2024-11-09 06:43:10,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:43:10,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029569496] [2024-11-09 06:43:10,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:43:10,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:43:11,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:43:11,051 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 06:43:11,051 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:43:11,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029569496] [2024-11-09 06:43:11,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029569496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:43:11,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:43:11,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:43:11,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419741065] [2024-11-09 06:43:11,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:43:11,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:43:11,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:43:11,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:43:11,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:43:11,054 INFO L87 Difference]: Start difference. First operand 95 states and 113 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 06:43:11,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:43:11,086 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2024-11-09 06:43:11,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:43:11,087 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2024-11-09 06:43:11,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:43:11,088 INFO L225 Difference]: With dead ends: 88 [2024-11-09 06:43:11,088 INFO L226 Difference]: Without dead ends: 88 [2024-11-09 06:43:11,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:43:11,089 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:43:11,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 06:43:11,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-09 06:43:11,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-09 06:43:11,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 67 states have (on average 1.4776119402985075) internal successors, (99), 84 states have internal predecessors, (99), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 06:43:11,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 103 transitions. [2024-11-09 06:43:11,093 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 103 transitions. Word has length 30 [2024-11-09 06:43:11,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:43:11,093 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 103 transitions. [2024-11-09 06:43:11,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 06:43:11,093 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 103 transitions. [2024-11-09 06:43:11,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 06:43:11,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:43:11,094 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:43:11,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 06:43:11,094 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-09 06:43:11,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:43:11,095 INFO L85 PathProgramCache]: Analyzing trace with hash 991193812, now seen corresponding path program 1 times [2024-11-09 06:43:11,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:43:11,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451372611] [2024-11-09 06:43:11,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:43:11,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:43:11,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:43:11,292 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 06:43:11,292 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:43:11,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451372611] [2024-11-09 06:43:11,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451372611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:43:11,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:43:11,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:43:11,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523439537] [2024-11-09 06:43:11,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:43:11,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 06:43:11,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:43:11,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 06:43:11,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 06:43:11,293 INFO L87 Difference]: Start difference. First operand 88 states and 103 transitions. Second operand has 10 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 06:43:11,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:43:11,573 INFO L93 Difference]: Finished difference Result 98 states and 114 transitions. [2024-11-09 06:43:11,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 06:43:11,574 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2024-11-09 06:43:11,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:43:11,575 INFO L225 Difference]: With dead ends: 98 [2024-11-09 06:43:11,575 INFO L226 Difference]: Without dead ends: 98 [2024-11-09 06:43:11,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-09 06:43:11,576 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 34 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:43:11,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 256 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:43:11,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-09 06:43:11,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 89. [2024-11-09 06:43:11,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 68 states have (on average 1.4705882352941178) internal successors, (100), 85 states have internal predecessors, (100), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 06:43:11,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 104 transitions. [2024-11-09 06:43:11,581 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 104 transitions. Word has length 30 [2024-11-09 06:43:11,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:43:11,581 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 104 transitions. [2024-11-09 06:43:11,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 06:43:11,581 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 104 transitions. [2024-11-09 06:43:11,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 06:43:11,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:43:11,582 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:43:11,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 06:43:11,583 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-09 06:43:11,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:43:11,583 INFO L85 PathProgramCache]: Analyzing trace with hash 662237192, now seen corresponding path program 1 times [2024-11-09 06:43:11,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:43:11,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293534622] [2024-11-09 06:43:11,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:43:11,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:43:11,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:43:11,891 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:43:11,891 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:43:11,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293534622] [2024-11-09 06:43:11,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293534622] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:43:11,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088039073] [2024-11-09 06:43:11,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:43:11,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:43:11,892 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce3c186-4b8c-4dbc-8d59-142052a2d61d/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:43:11,893 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce3c186-4b8c-4dbc-8d59-142052a2d61d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:43:11,897 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce3c186-4b8c-4dbc-8d59-142052a2d61d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 06:43:12,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:43:12,053 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 06:43:12,056 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:43:12,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:43:12,182 INFO L378 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 14 treesize of output 9 [2024-11-09 06:43:12,185 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 06:43:12,185 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:43:12,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088039073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:43:12,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:43:12,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 15 [2024-11-09 06:43:12,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659679778] [2024-11-09 06:43:12,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:43:12,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 06:43:12,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:43:12,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 06:43:12,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-11-09 06:43:12,188 INFO L87 Difference]: Start difference. First operand 89 states and 104 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 06:43:12,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:43:12,306 INFO L93 Difference]: Finished difference Result 88 states and 102 transitions. [2024-11-09 06:43:12,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:43:12,307 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2024-11-09 06:43:12,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:43:12,308 INFO L225 Difference]: With dead ends: 88 [2024-11-09 06:43:12,308 INFO L226 Difference]: Without dead ends: 88 [2024-11-09 06:43:12,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2024-11-09 06:43:12,309 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 92 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:43:12,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 74 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:43:12,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-09 06:43:12,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-09 06:43:12,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 68 states have (on average 1.4411764705882353) internal successors, (98), 84 states have internal predecessors, (98), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 06:43:12,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 102 transitions. [2024-11-09 06:43:12,315 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 102 transitions. Word has length 31 [2024-11-09 06:43:12,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:43:12,316 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 102 transitions. [2024-11-09 06:43:12,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 06:43:12,316 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 102 transitions. [2024-11-09 06:43:12,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 06:43:12,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:43:12,317 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:43:12,338 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce3c186-4b8c-4dbc-8d59-142052a2d61d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 06:43:12,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce3c186-4b8c-4dbc-8d59-142052a2d61d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:43:12,520 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-09 06:43:12,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:43:12,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1702875797, now seen corresponding path program 1 times [2024-11-09 06:43:12,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:43:12,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389926745] [2024-11-09 06:43:12,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:43:12,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:43:12,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:43:13,228 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:43:13,228 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:43:13,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389926745] [2024-11-09 06:43:13,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389926745] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:43:13,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747316186] [2024-11-09 06:43:13,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:43:13,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:43:13,229 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce3c186-4b8c-4dbc-8d59-142052a2d61d/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:43:13,231 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce3c186-4b8c-4dbc-8d59-142052a2d61d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:43:13,233 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce3c186-4b8c-4dbc-8d59-142052a2d61d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 06:43:13,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:43:13,447 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-09 06:43:13,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:43:13,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 06:43:13,621 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 06:43:13,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 06:43:13,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 06:43:13,756 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-09 06:43:13,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 41 [2024-11-09 06:43:13,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 06:43:14,013 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 06:43:14,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 20 [2024-11-09 06:43:14,016 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:43:14,016 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:43:14,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2024-11-09 06:43:14,066 INFO L349 Elim1Store]: treesize reduction 5, result has 77.3 percent of original size [2024-11-09 06:43:14,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2024-11-09 06:43:14,076 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1028 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1028))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse0)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select .cse1 .cse0) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) is different from false [2024-11-09 06:43:14,094 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:43:14,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 37 [2024-11-09 06:43:14,156 INFO L349 Elim1Store]: treesize reduction 21, result has 67.2 percent of original size [2024-11-09 06:43:14,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 115 treesize of output 131 [2024-11-09 06:43:14,173 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:43:14,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 100 [2024-11-09 06:43:14,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747316186] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:43:14,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1419031333] [2024-11-09 06:43:14,596 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2024-11-09 06:43:14,597 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:43:14,598 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:43:14,598 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:43:14,598 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:43:15,608 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 146 for LOIs [2024-11-09 06:43:15,924 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:43:32,695 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4524#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~i~0#1| 0) (exists ((|v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_32| Int)) (not (= (select |#valid| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_32|) 1))) (<= 2 |ULTIMATE.start_sll_circular_remove_first_~head#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_remove_first_~head#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-09 06:43:32,696 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:43:32,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 06:43:32,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 27 [2024-11-09 06:43:32,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948914187] [2024-11-09 06:43:32,696 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 06:43:32,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-09 06:43:32,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:43:32,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-09 06:43:32,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=2363, Unknown=6, NotChecked=98, Total=2652 [2024-11-09 06:43:32,699 INFO L87 Difference]: Start difference. First operand 88 states and 102 transitions. Second operand has 28 states, 23 states have (on average 2.347826086956522) internal successors, (54), 23 states have internal predecessors, (54), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 06:43:33,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:43:33,653 INFO L93 Difference]: Finished difference Result 98 states and 114 transitions. [2024-11-09 06:43:33,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 06:43:33,654 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 23 states have (on average 2.347826086956522) internal successors, (54), 23 states have internal predecessors, (54), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 32 [2024-11-09 06:43:33,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:43:33,654 INFO L225 Difference]: With dead ends: 98 [2024-11-09 06:43:33,654 INFO L226 Difference]: Without dead ends: 98 [2024-11-09 06:43:33,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 729 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=254, Invalid=3166, Unknown=6, NotChecked=114, Total=3540 [2024-11-09 06:43:33,656 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 104 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 06:43:33,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 595 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 06:43:33,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-09 06:43:33,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 89. [2024-11-09 06:43:33,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 69 states have (on average 1.4492753623188406) internal successors, (100), 85 states have internal predecessors, (100), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 06:43:33,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 104 transitions. [2024-11-09 06:43:33,663 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 104 transitions. Word has length 32 [2024-11-09 06:43:33,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:43:33,664 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 104 transitions. [2024-11-09 06:43:33,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 23 states have (on average 2.347826086956522) internal successors, (54), 23 states have internal predecessors, (54), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 06:43:33,664 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 104 transitions. [2024-11-09 06:43:33,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 06:43:33,673 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:43:33,673 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:43:33,694 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce3c186-4b8c-4dbc-8d59-142052a2d61d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 06:43:33,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce3c186-4b8c-4dbc-8d59-142052a2d61d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:43:33,874 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-09 06:43:33,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:43:33,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1702875798, now seen corresponding path program 1 times [2024-11-09 06:43:33,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:43:33,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429523167] [2024-11-09 06:43:33,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:43:33,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:43:33,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:43:34,798 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:43:34,799 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:43:34,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429523167] [2024-11-09 06:43:34,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429523167] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:43:34,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994803006] [2024-11-09 06:43:34,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:43:34,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:43:34,800 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce3c186-4b8c-4dbc-8d59-142052a2d61d/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:43:34,801 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce3c186-4b8c-4dbc-8d59-142052a2d61d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:43:34,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce3c186-4b8c-4dbc-8d59-142052a2d61d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 06:43:35,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:43:35,065 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 94 conjuncts are in the unsatisfiable core [2024-11-09 06:43:35,070 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:43:35,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 06:43:35,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 06:43:35,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 06:43:35,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 06:43:35,494 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 06:43:35,495 INFO L378 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 14 treesize of output 13 [2024-11-09 06:43:35,512 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 06:43:35,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 06:43:35,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 06:43:35,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-09 06:43:35,730 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-09 06:43:35,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 53 [2024-11-09 06:43:35,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2024-11-09 06:43:36,145 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 06:43:36,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 27 [2024-11-09 06:43:36,156 INFO L378 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 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 06:43:36,200 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:43:36,201 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:43:36,638 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1122 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse0 (select (select .cse2 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| .cse0)) (forall ((v_ArrVal_1123 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1123))) (let ((.cse1 (select (select .cse3 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse1)) (< (+ (select (select .cse2 .cse1) .cse0) 3) (select |c_#length| (select (select .cse3 .cse1) .cse0))))))) (< .cse0 0))))) (forall ((v_ArrVal_1122 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse4 (select (select .cse5 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| .cse4)) (< .cse4 0) (forall ((v_ArrVal_1123 (Array Int Int))) (let ((.cse6 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1123) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< 0 (+ (select (select .cse5 .cse6) .cse4) 1)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse6)))))))))) is different from false [2024-11-09 06:43:36,711 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:43:36,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 62 [2024-11-09 06:43:36,730 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-11-09 06:43:36,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 106 [2024-11-09 06:43:36,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2024-11-09 06:43:36,876 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:43:36,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 93 [2024-11-09 06:43:36,935 INFO L349 Elim1Store]: treesize reduction 21, result has 77.7 percent of original size [2024-11-09 06:43:36,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 312 treesize of output 320 [2024-11-09 06:43:36,962 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:43:36,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 278 treesize of output 253 [2024-11-09 06:43:53,249 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 06:43:53,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 22 [2024-11-09 06:43:53,302 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 06:43:53,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 1 [2024-11-09 06:43:53,576 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 06:43:53,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2024-11-09 06:43:55,263 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 06:43:55,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 1 [2024-11-09 06:43:55,281 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 06:43:55,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 1 [2024-11-09 06:44:17,112 WARN L286 SmtUtils]: Spent 11.92s on a formula simplification. DAG size of input: 613 DAG size of output: 561 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 06:44:26,881 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse311 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (.cse24 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (.cse4 (select |c_#length| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (.cse74 (select |c_#length| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (.cse86 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (let ((.cse96 (not .cse86)) (.cse82 (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_1122 (Array Int Int))) (let ((.cse364 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse363 (select (select .cse364 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse362 (+ 3 (select (select .cse364 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse363)))) (or (< .cse362 .cse4) (not (= .cse363 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< (+ 3 (select v_ArrVal_1122 .cse363)) .cse74) (< .cse363 0) (< .cse362 .cse74))))))))) (.cse34 (< |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0)) (.cse23 (forall ((v_ArrVal_1122 (Array Int Int))) (let ((.cse361 (select v_ArrVal_1122 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse361 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse361 0) (< (+ 3 (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse361)) .cse4))))) (.cse15 (select |c_#length| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (.cse35 (not .cse24)) (.cse345 (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_1122 (Array Int Int))) (let ((.cse359 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse360 (select (select .cse359 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< (+ 3 (select (select .cse359 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse360)) .cse4) (not (= .cse360 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (= .cse360 |c_ULTIMATE.start_main_~#s~0#1.offset|) (< .cse360 0)))))))) (.cse49 (not .cse311))) (and (forall ((v_arrayElimIndex_6 Int)) (or (forall ((v_arrayElimCell_46 Int) (v_ArrVal_1122 (Array Int Int)) (v_arrayElimCell_48 Int)) (let ((.cse5 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122)) (.cse2 (select v_ArrVal_1122 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select |c_#length| v_arrayElimCell_48)) (.cse3 (+ 3 (select (select .cse5 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse2))) (.cse0 (+ (select (select .cse5 v_arrayElimIndex_6) .cse2) 3))) (or (< .cse0 .cse1) (not (= .cse2 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse3 .cse1) (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|) (< .cse2 0) (< .cse3 .cse4) (< .cse0 (select |c_#length| v_arrayElimCell_46)))))) (= v_arrayElimIndex_6 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|))) (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_arrayElimCell_47 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| v_arrayElimCell_47) (forall ((v_ArrVal_1122 (Array Int Int))) (let ((.cse9 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse8 (select (select .cse9 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse7 (+ 3 (select (select .cse9 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse8)))) (or (< .cse7 .cse4) (not (= .cse8 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse7 (select |c_#length| v_arrayElimCell_47)) (< .cse8 0)))))))))) (forall ((v_arrayElimCell_47 Int) (v_ArrVal_1122 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse10 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse11 (select (select .cse10 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< (+ 3 (select (select .cse10 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse11)) .cse4) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse11 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_arrayElimCell_47) (= .cse11 |c_ULTIMATE.start_main_~#s~0#1.offset|) (< (+ (select (select .cse10 v_arrayElimCell_47) .cse11) 3) .cse4) (< .cse11 0))))) (forall ((v_ArrVal_1122 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse13 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse12 (select (select .cse13 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse12 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< 0 (+ 1 (select (select .cse13 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse12))) (< .cse12 0))))) (forall ((v_arrayElimIndex_6 Int) (v_ArrVal_1122 (Array Int Int))) (let ((.cse17 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122)) (.cse16 (select v_ArrVal_1122 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse14 (+ 3 (select (select .cse17 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse16)))) (or (< .cse14 .cse15) (not (= .cse16 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse16 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_arrayElimIndex_6) (< .cse14 .cse4) (< (+ (select (select .cse17 v_arrayElimIndex_6) .cse16) 3) .cse4))))) (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (forall ((v_arrayElimCell_47 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| v_arrayElimCell_47) (forall ((v_ArrVal_1122 (Array Int Int)) (v_arrayElimCell_48 Int) (v_arrayElimCell_43 Int)) (let ((.cse22 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse20 (select (select .cse22 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse19 (+ 3 (select (select .cse22 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse20))) (.cse18 (+ (select (select .cse22 v_arrayElimCell_47) .cse20) 3)) (.cse21 (select |c_#length| v_arrayElimCell_48))) (or (< .cse18 (select |c_#length| v_arrayElimCell_43)) (< .cse19 .cse4) (not (= .cse20 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse19 .cse21) (< .cse18 .cse21) (= .cse20 |c_ULTIMATE.start_main_~#s~0#1.offset|) (< .cse20 0)))))))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|))) (or .cse23 .cse24) (forall ((v_arrayElimCell_47 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_arrayElimCell_47) (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_1122 (Array Int Int))) (let ((.cse27 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse26 (select (select .cse27 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse25 (+ 3 (select (select .cse27 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse26)))) (or (< .cse25 .cse4) (not (= .cse26 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse25 (select |c_#length| v_arrayElimCell_47)) (< (+ (select (select .cse27 v_arrayElimCell_47) .cse26) 3) .cse4) (< .cse26 0)))))) (= v_arrayElimCell_47 |ULTIMATE.start_main_~#s~0#1.base|))))) (or (forall ((v_arrayElimIndex_6 Int) (v_ArrVal_1122 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse28 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse29 (select (select .cse28 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (< (+ 3 (select (select .cse28 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse29)) .cse4) (not (= .cse29 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< (+ (select (select .cse28 v_arrayElimIndex_6) .cse29) 3) .cse4) (< .cse29 0) (= v_arrayElimIndex_6 |ULTIMATE.start_main_~#s~0#1.base|))))) .cse24) (or (forall ((v_arrayElimCell_47 Int) (v_ArrVal_1122 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse30 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse31 (select (select .cse30 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (< (+ 3 (select (select .cse30 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse31)) .cse4) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse31 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_arrayElimCell_47) (< (+ (select (select .cse30 v_arrayElimCell_47) .cse31) 3) .cse4) (< .cse31 0) (= v_arrayElimCell_47 |ULTIMATE.start_main_~#s~0#1.base|))))) .cse24) (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_1122 (Array Int Int)) (v_arrayElimCell_48 Int)) (let ((.cse32 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse33 (select (select .cse32 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< (+ 3 (select (select .cse32 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse33)) .cse4) (not (= .cse33 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< (+ 3 (select v_ArrVal_1122 .cse33)) (select |c_#length| v_arrayElimCell_48)) (= .cse33 |c_ULTIMATE.start_main_~#s~0#1.offset|) (< .cse33 0))))))) (or (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse34 .cse35) (forall ((v_ArrVal_1122 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse40 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse37 (select (select .cse40 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse36 (+ 3 (select (select .cse40 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse37)))) (or (< .cse36 .cse4) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse37 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (forall ((v_arrayElimCell_47 Int)) (let ((.cse38 (select |c_#length| v_arrayElimCell_47)) (.cse39 (+ (select (select .cse40 v_arrayElimCell_47) .cse37) 3))) (or (< .cse36 .cse38) (< .cse39 .cse38) (< .cse39 .cse4)))) (= .cse37 |c_ULTIMATE.start_main_~#s~0#1.offset|) (< .cse37 0)))))) (or (and (or (forall ((v_arrayElimCell_47 Int) (v_ArrVal_1122 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimCell_43 Int)) (let ((.cse42 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse43 (select (select .cse42 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse41 (+ (select (select .cse42 v_arrayElimCell_47) .cse43) 3))) (or (< .cse41 (select |c_#length| v_arrayElimCell_43)) (< (+ 3 (select (select .cse42 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse43)) .cse4) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse43 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse41 (select |c_#length| v_arrayElimCell_47)) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| v_arrayElimCell_47) (< .cse43 0) (= v_arrayElimCell_47 |ULTIMATE.start_main_~#s~0#1.base|)))))) .cse24) (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_arrayElimCell_47 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| v_arrayElimCell_47) (= v_arrayElimCell_47 |ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_1122 (Array Int Int)) (v_arrayElimCell_43 Int)) (let ((.cse48 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse46 (select (select .cse48 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse45 (+ 3 (select (select .cse48 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse46))) (.cse44 (+ (select (select .cse48 v_arrayElimCell_47) .cse46) 3)) (.cse47 (select |c_#length| v_arrayElimCell_47))) (or (< .cse44 (select |c_#length| v_arrayElimCell_43)) (< .cse45 .cse4) (not (= .cse46 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse45 .cse47) (< .cse44 .cse47) (< .cse46 0))))))))))) .cse49) (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_arrayElimCell_47 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| v_arrayElimCell_47) (forall ((v_ArrVal_1122 (Array Int Int)) (v_arrayElimCell_43 Int)) (let ((.cse54 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse52 (select (select .cse54 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse51 (+ 3 (select (select .cse54 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse52))) (.cse50 (+ (select (select .cse54 v_arrayElimCell_47) .cse52) 3)) (.cse53 (select |c_#length| v_arrayElimCell_47))) (or (< .cse50 (select |c_#length| v_arrayElimCell_43)) (< .cse51 .cse4) (not (= .cse52 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse51 .cse53) (< .cse50 .cse53) (= .cse52 |c_ULTIMATE.start_main_~#s~0#1.offset|) (< .cse52 0)))))))))) (forall ((v_ArrVal_1122 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse59 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse56 (select (select .cse59 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse55 (+ 3 (select (select .cse59 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse56)))) (or (< .cse55 .cse4) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse56 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (= .cse56 |c_ULTIMATE.start_main_~#s~0#1.offset|) (< .cse56 0) (forall ((v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse57 (select |c_#length| v_arrayElimCell_48)) (.cse58 (+ (select (select .cse59 v_arrayElimCell_47) .cse56) 3))) (or (< .cse55 .cse57) (< .cse58 .cse57) (< .cse58 .cse4))))))))) (or .cse35 (forall ((v_arrayElimCell_47 Int) (v_ArrVal_1122 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse61 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse60 (select (select .cse61 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse62 (select |c_#length| v_arrayElimCell_47)) (.cse63 (+ (select (select .cse61 v_arrayElimCell_47) .cse60) 3))) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse60 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< (+ 3 (select (select .cse61 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse60)) .cse62) (< .cse63 .cse62) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| v_arrayElimCell_47) (< .cse63 .cse15) (< .cse60 0))))))) (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_1122 (Array Int Int)) (v_arrayElimCell_48 Int)) (let ((.cse67 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse65 (select (select .cse67 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse64 (+ 3 (select (select .cse67 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse65))) (.cse66 (select |c_#length| v_arrayElimCell_48))) (or (< .cse64 .cse4) (not (= .cse65 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse64 .cse66) (< (+ 3 (select v_ArrVal_1122 .cse65)) .cse66) (= .cse65 |c_ULTIMATE.start_main_~#s~0#1.offset|) (< .cse65 0)))))))) (forall ((v_ArrVal_1122 (Array Int Int))) (let ((.cse68 (select v_ArrVal_1122 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse68 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< 0 (+ (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse68) 1)) (< .cse68 0)))) (forall ((v_arrayElimIndex_6 Int)) (or (forall ((v_ArrVal_1122 (Array Int Int)) (v_arrayElimCell_46 Int) (v_arrayElimCell_48 Int)) (let ((.cse71 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122)) (.cse69 (select v_ArrVal_1122 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse70 (+ 3 (select (select .cse71 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse69)))) (or (not (= .cse69 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse70 (select |c_#length| v_arrayElimCell_48)) (= .cse69 |c_ULTIMATE.start_main_~#s~0#1.offset|) (< .cse69 0) (< .cse70 .cse4) (< (+ (select (select .cse71 v_arrayElimIndex_6) .cse69) 3) (select |c_#length| v_arrayElimCell_46)))))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_arrayElimIndex_6) (= v_arrayElimIndex_6 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|))) (or (and (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_1122 (Array Int Int))) (let ((.cse72 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse73 (select (select .cse72 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< (+ 3 (select (select .cse72 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse73)) .cse4) (not (= .cse73 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< (+ 3 (select v_ArrVal_1122 .cse73)) .cse74) (= .cse73 |c_ULTIMATE.start_main_~#s~0#1.offset|) (< .cse73 0))))))) (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_1122 (Array Int Int))) (let ((.cse77 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse76 (select (select .cse77 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse75 (+ 3 (select (select .cse77 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse76)))) (or (< .cse75 .cse4) (not (= .cse76 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< (+ 3 (select v_ArrVal_1122 .cse76)) .cse74) (= .cse76 |c_ULTIMATE.start_main_~#s~0#1.offset|) (< .cse76 0) (< .cse75 .cse74)))))))) (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_1122 (Array Int Int))) (let ((.cse78 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse79 (select (select .cse78 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< (+ 3 (select (select .cse78 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse79)) .cse4) (not (= .cse79 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< (+ 3 (select v_ArrVal_1122 .cse79)) .cse74) (< .cse79 0))))))) (or (and (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_1122 (Array Int Int))) (let ((.cse80 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse81 (select (select .cse80 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< (+ 3 (select (select .cse80 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse81)) .cse4) (not (= .cse81 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< (+ 3 (select v_ArrVal_1122 .cse81)) .cse74) (< .cse81 0))))))) .cse82) .cse49)) .cse24) (or (and (or (forall ((v_arrayElimCell_47 Int) (v_ArrVal_1122 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse85 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse83 (select (select .cse85 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse84 (+ (select (select .cse85 v_arrayElimCell_47) .cse83) 3))) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse83 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse84 (select |c_#length| v_arrayElimCell_47)) (< (+ (select (select .cse85 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse83) 3) .cse4) (< .cse84 .cse4) (< .cse83 0)))))) .cse86) (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_arrayElimCell_47 Int) (v_ArrVal_1122 (Array Int Int))) (let ((.cse91 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse89 (select (select .cse91 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse88 (select |c_#length| v_arrayElimCell_47)) (.cse87 (+ (select (select .cse91 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse89) 3)) (.cse90 (+ (select (select .cse91 v_arrayElimCell_47) .cse89) 3))) (or (< .cse87 .cse88) (not (= .cse89 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse90 .cse88) (< .cse87 .cse4) (< .cse90 .cse4) (< .cse89 0)))))))) (or (forall ((v_arrayElimCell_47 Int) (v_ArrVal_1122 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse92 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse93 (select (select .cse92 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse94 (select |c_#length| v_arrayElimCell_47)) (.cse95 (+ (select (select .cse92 v_arrayElimCell_47) .cse93) 3))) (or (< (+ (select (select .cse92 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse93) 3) .cse94) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse93 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse95 .cse94) (< .cse95 .cse4) (< .cse93 0)))))) .cse96)) .cse49) (or (and (or (forall ((v_arrayElimCell_47 Int) (v_ArrVal_1122 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse97 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse98 (select (select .cse97 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< (+ 3 (select (select .cse97 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse98)) .cse4) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse98 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_arrayElimCell_47) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| v_arrayElimCell_47) (< (+ (select (select .cse97 v_arrayElimCell_47) .cse98) 3) .cse15) (< .cse98 0))))) .cse24) (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_arrayElimCell_47 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_arrayElimCell_47) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| v_arrayElimCell_47) (forall ((v_ArrVal_1122 (Array Int Int))) (let ((.cse101 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse100 (select (select .cse101 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse99 (+ 3 (select (select .cse101 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse100)))) (or (< .cse99 .cse4) (not (= .cse100 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse99 (select |c_#length| v_arrayElimCell_47)) (< (+ (select (select .cse101 v_arrayElimCell_47) .cse100) 3) .cse15) (< .cse100 0))))))))))) .cse49) (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_arrayElimCell_47 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| v_arrayElimCell_47) (= v_arrayElimCell_47 |ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_1122 (Array Int Int)) (v_arrayElimCell_43 Int)) (let ((.cse106 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse104 (select (select .cse106 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse103 (+ 3 (select (select .cse106 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse104))) (.cse102 (+ (select (select .cse106 v_arrayElimCell_47) .cse104) 3)) (.cse105 (select |c_#length| v_arrayElimCell_47))) (or (< .cse102 (select |c_#length| v_arrayElimCell_43)) (< .cse103 .cse4) (not (= .cse104 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse103 .cse105) (< .cse102 .cse105) (< .cse104 0)))))))))) (forall ((v_arrayElimIndex_6 Int)) (or (forall ((v_arrayElimCell_46 Int) (v_ArrVal_1122 (Array Int Int))) (let ((.cse110 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122)) (.cse108 (select v_ArrVal_1122 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse107 (+ 3 (select (select .cse110 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse108))) (.cse109 (+ (select (select .cse110 v_arrayElimIndex_6) .cse108) 3))) (or (< .cse107 .cse15) (not (= .cse108 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse109 .cse15) (= .cse108 |c_ULTIMATE.start_main_~#s~0#1.offset|) (< .cse108 0) (< .cse107 .cse4) (< .cse109 (select |c_#length| v_arrayElimCell_46)))))) (= v_arrayElimIndex_6 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|))) (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_arrayElimCell_47 Int) (v_ArrVal_1122 (Array Int Int))) (let ((.cse113 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse112 (select (select .cse113 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse111 (+ 3 (select (select .cse113 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse112)))) (or (< .cse111 .cse4) (not (= .cse112 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse111 (select |c_#length| v_arrayElimCell_47)) (= .cse112 |c_ULTIMATE.start_main_~#s~0#1.offset|) (< .cse112 0)))))))) (or (forall ((v_arrayElimIndex_6 Int) (v_ArrVal_1122 (Array Int Int))) (let ((.cse116 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122)) (.cse114 (select v_ArrVal_1122 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse115 (+ (select (select .cse116 v_arrayElimIndex_6) .cse114) 3))) (or (not (= .cse114 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse115 .cse15) (< .cse114 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_arrayElimIndex_6) (< (+ 3 (select (select .cse116 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse114)) .cse4) (< .cse115 .cse4))))) .cse24) (forall ((v_arrayElimCell_47 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_1122 (Array Int Int))) (let ((.cse121 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse118 (select (select .cse121 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse117 (+ 3 (select (select .cse121 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse118))) (.cse119 (select |c_#length| v_arrayElimCell_47)) (.cse120 (+ (select (select .cse121 v_arrayElimCell_47) .cse118) 3))) (or (< .cse117 .cse4) (not (= .cse118 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse117 .cse119) (< .cse120 .cse119) (< .cse120 .cse4) (< .cse118 0)))))) (= v_arrayElimCell_47 |ULTIMATE.start_main_~#s~0#1.base|))) (forall ((v_arrayElimIndex_6 Int)) (or (forall ((v_ArrVal_1122 (Array Int Int))) (let ((.cse122 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122)) (.cse123 (select v_ArrVal_1122 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse124 (+ 3 (select (select .cse122 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse123)))) (or (< (+ (select (select .cse122 v_arrayElimIndex_6) .cse123) 3) (select |c_#length| v_arrayElimIndex_6)) (< .cse124 .cse15) (not (= .cse123 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse123 0) (< .cse124 .cse4))))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_arrayElimIndex_6) (= v_arrayElimIndex_6 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|))) (or (forall ((v_arrayElimCell_47 Int) (v_ArrVal_1122 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimCell_43 Int)) (let ((.cse127 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse126 (select (select .cse127 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse125 (+ (select (select .cse127 v_arrayElimCell_47) .cse126) 3)) (.cse128 (select |c_#length| v_arrayElimCell_47))) (or (< .cse125 (select |c_#length| v_arrayElimCell_43)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse126 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< (+ 3 (select (select .cse127 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse126)) .cse128) (< .cse125 .cse128) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| v_arrayElimCell_47) (< .cse126 0) (= v_arrayElimCell_47 |ULTIMATE.start_main_~#s~0#1.base|)))))) .cse35) (or (forall ((v_ArrVal_1122 (Array Int Int))) (let ((.cse131 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122)) (.cse130 (select v_ArrVal_1122 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse129 (+ 3 (select (select .cse131 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse130)))) (or (< .cse129 .cse15) (not (= .cse130 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse130 0) (< (+ 3 (select (select .cse131 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse130)) .cse4) (< .cse129 .cse4))))) .cse86) (forall ((v_arrayElimIndex_6 Int) (v_ArrVal_1122 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse135 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse133 (select (select .cse135 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse132 (+ 3 (select (select .cse135 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse133))) (.cse134 (+ (select (select .cse135 v_arrayElimIndex_6) .cse133) 3))) (or (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (< .cse132 .cse4) (not (= .cse133 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse132 .cse15) (< .cse134 .cse4) (< .cse133 0) (= v_arrayElimIndex_6 |ULTIMATE.start_main_~#s~0#1.base|) (< .cse134 .cse15)))))) (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_arrayElimCell_47 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| v_arrayElimCell_47) (forall ((v_ArrVal_1122 (Array Int Int))) (let ((.cse138 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse137 (select (select .cse138 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse136 (+ 3 (select (select .cse138 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse137)))) (or (< .cse136 .cse4) (not (= .cse137 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse136 (select |c_#length| v_arrayElimCell_47)) (= .cse137 |c_ULTIMATE.start_main_~#s~0#1.offset|) (< .cse137 0)))))))))) (or (forall ((v_arrayElimCell_47 Int) (v_ArrVal_1122 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse140 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse139 (select (select .cse140 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse139 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_arrayElimCell_47) (< (+ (select (select .cse140 v_arrayElimCell_47) .cse139) 3) .cse4) (< .cse139 0) (< (+ 3 (select v_ArrVal_1122 .cse139)) (select |c_#length| v_arrayElimCell_47)) (= v_arrayElimCell_47 |ULTIMATE.start_main_~#s~0#1.base|))))) .cse35) (or (forall ((v_ArrVal_1122 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse141 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse142 (select (select .cse141 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (< (+ 3 (select (select .cse141 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse142)) .cse4) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse142 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< (+ 3 (select v_ArrVal_1122 .cse142)) .cse74) (< .cse142 0))))) .cse24) (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_arrayElimCell_47 Int)) (or (forall ((v_ArrVal_1122 (Array Int Int))) (let ((.cse145 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse144 (select (select .cse145 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse143 (+ 3 (select (select .cse145 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse144)))) (or (< .cse143 .cse4) (not (= .cse144 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse143 (select |c_#length| v_arrayElimCell_47)) (< .cse144 0)))))) (= v_arrayElimCell_47 |ULTIMATE.start_main_~#s~0#1.base|))))) (forall ((v_ArrVal_1122 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse146 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse147 (select (select .cse146 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< (+ 3 (select (select .cse146 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse147)) .cse4) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse147 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< (+ 3 (select v_ArrVal_1122 .cse147)) .cse74) (= .cse147 |c_ULTIMATE.start_main_~#s~0#1.offset|) (< .cse147 0))))) (or (and (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_arrayElimCell_47 Int)) (or (forall ((v_ArrVal_1122 (Array Int Int)) (v_arrayElimCell_43 Int)) (let ((.cse148 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse149 (select (select .cse148 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse150 (+ 3 (select (select .cse148 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse149)))) (or (< (+ (select (select .cse148 v_arrayElimCell_47) .cse149) 3) (select |c_#length| v_arrayElimCell_43)) (< .cse150 .cse4) (not (= .cse149 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse150 (select |c_#length| v_arrayElimCell_47)) (< .cse149 0)))))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_arrayElimCell_47) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| v_arrayElimCell_47) (= v_arrayElimCell_47 |ULTIMATE.start_main_~#s~0#1.base|))))) (or (forall ((v_arrayElimCell_47 Int) (v_ArrVal_1122 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimCell_43 Int)) (let ((.cse151 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse152 (select (select .cse151 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< (+ (select (select .cse151 v_arrayElimCell_47) .cse152) 3) (select |c_#length| v_arrayElimCell_43)) (< (+ 3 (select (select .cse151 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse152)) .cse4) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse152 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_arrayElimCell_47) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| v_arrayElimCell_47) (< .cse152 0) (= v_arrayElimCell_47 |ULTIMATE.start_main_~#s~0#1.base|))))) .cse24)) .cse49) (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_arrayElimCell_47 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_arrayElimCell_47) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| v_arrayElimCell_47) (forall ((v_ArrVal_1122 (Array Int Int)) (v_arrayElimCell_43 Int)) (let ((.cse153 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse154 (select (select .cse153 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse155 (+ 3 (select (select .cse153 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse154)))) (or (< (+ (select (select .cse153 v_arrayElimCell_47) .cse154) 3) (select |c_#length| v_arrayElimCell_43)) (< .cse155 .cse4) (not (= .cse154 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse155 (select |c_#length| v_arrayElimCell_47)) (= .cse154 |c_ULTIMATE.start_main_~#s~0#1.offset|) (< .cse154 0)))))))))) (forall ((v_ArrVal_1122 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse158 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse157 (select (select .cse158 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse156 (+ 3 (select (select .cse158 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse157)))) (or (< .cse156 .cse4) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse157 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< (+ 3 (select v_ArrVal_1122 .cse157)) .cse74) (= .cse157 |c_ULTIMATE.start_main_~#s~0#1.offset|) (< .cse157 0) (< .cse156 .cse74)))))) (forall ((v_ArrVal_1122 (Array Int Int))) (let ((.cse160 (select v_ArrVal_1122 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse159 (+ 3 (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse160)))) (or (< .cse159 .cse15) (not (= .cse160 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (= .cse160 |c_ULTIMATE.start_main_~#s~0#1.offset|) (< .cse160 0) (< .cse159 .cse4) (< (+ (select v_ArrVal_1122 .cse160) 3) .cse15))))) (forall ((v_arrayElimIndex_6 Int) (v_ArrVal_1122 (Array Int Int))) (let ((.cse163 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122)) (.cse161 (select v_ArrVal_1122 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse162 (+ (select (select .cse163 v_arrayElimIndex_6) .cse161) 3))) (or (not (= .cse161 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse162 .cse15) (= .cse161 |c_ULTIMATE.start_main_~#s~0#1.offset|) (< .cse161 0) (< (+ 3 (select (select .cse163 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse161)) .cse4) (< .cse162 .cse4))))) (forall ((v_ArrVal_1122 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimCell_48 Int)) (let ((.cse164 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse165 (select (select .cse164 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< (+ 3 (select (select .cse164 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse165)) .cse4) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse165 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< (+ 3 (select v_ArrVal_1122 .cse165)) (select |c_#length| v_arrayElimCell_48)) (= .cse165 |c_ULTIMATE.start_main_~#s~0#1.offset|) (< .cse165 0))))) (or (forall ((v_arrayElimCell_47 Int) (v_ArrVal_1122 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse166 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse167 (select (select .cse166 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse168 (+ (select (select .cse166 v_arrayElimCell_47) .cse167) 3))) (or (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (< (+ 3 (select (select .cse166 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse167)) .cse4) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse167 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse168 (select |c_#length| v_arrayElimCell_47)) (< .cse168 .cse4) (< .cse167 0) (= v_arrayElimCell_47 |ULTIMATE.start_main_~#s~0#1.base|)))))) .cse24) (or (forall ((v_arrayElimCell_47 Int) (v_ArrVal_1122 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse170 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse169 (select (select .cse170 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse169 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< (+ 3 (select (select .cse170 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse169)) (select |c_#length| v_arrayElimCell_47)) (< .cse169 0) (= v_arrayElimCell_47 |ULTIMATE.start_main_~#s~0#1.base|))))) .cse35) (or .cse35 (forall ((v_arrayElimCell_47 Int) (v_ArrVal_1122 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse174 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse171 (select (select .cse174 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse172 (+ (select (select .cse174 v_arrayElimCell_47) .cse171) 3)) (.cse173 (select |c_#length| v_arrayElimCell_47))) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse171 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse172 .cse173) (< .cse172 .cse4) (< .cse171 0) (< (+ 3 (select v_ArrVal_1122 .cse171)) .cse173) (= v_arrayElimCell_47 |ULTIMATE.start_main_~#s~0#1.base|))))))) (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_arrayElimCell_47 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_arrayElimCell_47) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| v_arrayElimCell_47) (forall ((v_ArrVal_1122 (Array Int Int))) (let ((.cse177 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse176 (select (select .cse177 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse175 (+ 3 (select (select .cse177 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse176)))) (or (< .cse175 .cse4) (not (= .cse176 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse175 (select |c_#length| v_arrayElimCell_47)) (< (+ (select (select .cse177 v_arrayElimCell_47) .cse176) 3) .cse15) (< .cse176 0)))))))))) (forall ((v_ArrVal_1122 (Array Int Int)) (v_arrayElimCell_48 Int)) (let ((.cse178 (select v_ArrVal_1122 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse179 (+ 3 (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse178)))) (or (not (= .cse178 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse179 (select |c_#length| v_arrayElimCell_48)) (= .cse178 |c_ULTIMATE.start_main_~#s~0#1.offset|) (< .cse178 0) (< .cse179 .cse4))))) (or (and (or .cse96 (forall ((v_arrayElimCell_47 Int) (v_ArrVal_1122 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse180 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse181 (select (select .cse180 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< (+ (select (select .cse180 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse181) 3) (select |c_#length| v_arrayElimCell_47)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse181 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_arrayElimCell_47) (< (+ (select (select .cse180 v_arrayElimCell_47) .cse181) 3) .cse4) (< .cse181 0)))))) (forall ((v_arrayElimCell_47 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_arrayElimCell_47) (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_1122 (Array Int Int))) (let ((.cse184 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse183 (select (select .cse184 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse182 (+ (select (select .cse184 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse183) 3))) (or (< .cse182 (select |c_#length| v_arrayElimCell_47)) (not (= .cse183 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse182 .cse4) (< (+ (select (select .cse184 v_arrayElimCell_47) .cse183) 3) .cse4) (< .cse183 0)))))))))) (or (forall ((v_arrayElimCell_47 Int) (v_ArrVal_1122 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse186 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse185 (select (select .cse186 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse185 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_arrayElimCell_47) (< (+ (select (select .cse186 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse185) 3) .cse4) (< (+ (select (select .cse186 v_arrayElimCell_47) .cse185) 3) .cse4) (< .cse185 0))))) .cse86)) .cse49) (or (and (forall ((v_ArrVal_1122 (Array Int Int))) (let ((.cse189 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122)) (.cse187 (select v_ArrVal_1122 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse188 (+ 3 (select (select .cse189 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse187)))) (or (not (= .cse187 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse188 .cse15) (< .cse187 0) (< .cse188 .cse4) (< (+ 3 (select (select .cse189 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse187)) .cse4))))) (or .cse96 (forall ((v_ArrVal_1122 (Array Int Int))) (let ((.cse191 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122)) (.cse190 (select v_ArrVal_1122 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse190 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< (+ 3 (select (select .cse191 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse190)) .cse15) (< .cse190 0) (< (+ 3 (select (select .cse191 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse190)) .cse4))))) .cse23 (or (forall ((v_ArrVal_1122 (Array Int Int))) (let ((.cse193 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122)) (.cse192 (select v_ArrVal_1122 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse192 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse192 0) (< (+ 3 (select (select .cse193 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse192)) .cse4) (< (+ 3 (select (select .cse193 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse192)) .cse4)))) .cse86)) .cse24) (forall ((v_ArrVal_1122 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimCell_48 Int)) (let ((.cse197 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse195 (select (select .cse197 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse194 (+ 3 (select (select .cse197 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse195))) (.cse196 (select |c_#length| v_arrayElimCell_48))) (or (< .cse194 .cse4) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse195 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse194 .cse196) (< (+ 3 (select v_ArrVal_1122 .cse195)) .cse196) (= .cse195 |c_ULTIMATE.start_main_~#s~0#1.offset|) (< .cse195 0)))))) (or (and (or (forall ((v_ArrVal_1122 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse199 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse198 (select (select .cse199 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse198 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< (+ 3 (select v_ArrVal_1122 .cse198)) .cse74) (< (+ (select (select .cse199 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse198) 3) .cse4) (< .cse198 0))))) .cse86) (or .cse96 (forall ((v_ArrVal_1122 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse201 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse200 (select (select .cse201 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse200 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse200 0) (< (+ (select (select .cse201 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse200) 3) .cse74)))))) (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_1122 (Array Int Int))) (let ((.cse204 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse202 (select (select .cse204 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse203 (+ (select (select .cse204 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse202) 3))) (or (not (= .cse202 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< (+ 3 (select v_ArrVal_1122 .cse202)) .cse74) (< .cse203 .cse4) (< .cse202 0) (< .cse203 .cse74))))))))) .cse49) (forall ((v_ArrVal_1122 (Array Int Int)) (v_arrayElimCell_48 Int)) (let ((.cse205 (select v_ArrVal_1122 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse207 (select |c_#length| v_arrayElimCell_48)) (.cse206 (+ 3 (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse205)))) (or (not (= .cse205 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse206 .cse207) (< (+ (select v_ArrVal_1122 .cse205) 3) .cse207) (= .cse205 |c_ULTIMATE.start_main_~#s~0#1.offset|) (< .cse205 0) (< .cse206 .cse4))))) (forall ((v_ArrVal_1122 (Array Int Int))) (let ((.cse211 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122)) (.cse209 (select v_ArrVal_1122 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse210 (+ 3 (select (select .cse211 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse209))) (.cse208 (+ 3 (select (select .cse211 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse209)))) (or (< .cse208 .cse15) (not (= .cse209 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse210 .cse15) (< .cse209 0) (< .cse210 .cse4) (< .cse208 .cse4))))) (forall ((v_ArrVal_1122 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse212 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse213 (select (select .cse212 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< (+ 3 (select (select .cse212 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse213)) .cse4) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse213 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (= .cse213 |c_ULTIMATE.start_main_~#s~0#1.offset|) (< .cse213 0))))) (forall ((v_arrayElimCell_47 Int) (v_ArrVal_1122 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimCell_43 Int)) (let ((.cse215 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse216 (select (select .cse215 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse214 (+ (select (select .cse215 v_arrayElimCell_47) .cse216) 3))) (or (< .cse214 (select |c_#length| v_arrayElimCell_43)) (< (+ 3 (select (select .cse215 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse216)) .cse4) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse216 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse214 (select |c_#length| v_arrayElimCell_47)) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| v_arrayElimCell_47) (= .cse216 |c_ULTIMATE.start_main_~#s~0#1.offset|) (< .cse216 0)))))) (forall ((v_ArrVal_1122 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse217 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse218 (select (select .cse217 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< (+ 3 (select (select .cse217 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse218)) .cse4) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse218 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (= .cse218 |c_ULTIMATE.start_main_~#s~0#1.offset|) (forall ((v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse219 (+ (select (select .cse217 v_arrayElimCell_47) .cse218) 3))) (or (< .cse219 (select |c_#length| v_arrayElimCell_48)) (< .cse219 .cse4)))) (< .cse218 0))))) (or (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_arrayElimCell_47 Int)) (or (forall ((v_ArrVal_1122 (Array Int Int))) (let ((.cse222 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse221 (select (select .cse222 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse220 (+ 3 (select (select .cse222 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse221)))) (or (< .cse220 .cse4) (not (= .cse221 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse220 (select |c_#length| v_arrayElimCell_47)) (< .cse221 0)))))) (= v_arrayElimCell_47 |ULTIMATE.start_main_~#s~0#1.base|))))) .cse49) (or .cse35 (forall ((v_arrayElimCell_47 Int) (v_ArrVal_1122 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse224 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse223 (select (select .cse224 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse223 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< (+ 3 (select (select .cse224 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse223)) (select |c_#length| v_arrayElimCell_47)) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| v_arrayElimCell_47) (< .cse223 0)))))) (forall ((v_ArrVal_1122 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse226 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse225 (select (select .cse226 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse225 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< 0 (+ 1 (select (select .cse226 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse225))) (forall ((v_arrayElimCell_41 Int)) (< 0 (+ (select (select .cse226 v_arrayElimCell_41) .cse225) 1))) (< .cse225 0))))) (or .cse96 (forall ((v_ArrVal_1122 (Array Int Int))) (let ((.cse229 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122)) (.cse228 (select v_ArrVal_1122 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse227 (+ 3 (select (select .cse229 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse228)))) (or (< .cse227 .cse15) (not (= .cse228 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< (+ 3 (select (select .cse229 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse228)) .cse15) (< .cse228 0) (< .cse227 .cse4)))))) (forall ((v_arrayElimCell_47 Int) (v_ArrVal_1122 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimCell_48 Int) (v_arrayElimCell_43 Int)) (let ((.cse231 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse232 (select (select .cse231 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse230 (+ (select (select .cse231 v_arrayElimCell_47) .cse232) 3))) (or (< .cse230 (select |c_#length| v_arrayElimCell_43)) (< (+ 3 (select (select .cse231 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse232)) .cse4) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse232 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse230 (select |c_#length| v_arrayElimCell_48)) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| v_arrayElimCell_47) (= .cse232 |c_ULTIMATE.start_main_~#s~0#1.offset|) (< .cse232 0)))))) (forall ((v_ArrVal_1122 (Array Int Int))) (let ((.cse233 (select v_ArrVal_1122 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse233 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (= .cse233 |c_ULTIMATE.start_main_~#s~0#1.offset|) (< .cse233 0) (< (+ 3 (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse233)) .cse4) (< (+ (select v_ArrVal_1122 .cse233) 3) .cse15)))) (or (and .cse82 (or (forall ((v_ArrVal_1122 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse234 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse235 (select (select .cse234 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< (+ 3 (select (select .cse234 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse235)) .cse4) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse235 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< (+ 3 (select v_ArrVal_1122 .cse235)) .cse74) (< .cse235 0))))) .cse24)) .cse49) (or .cse34 .cse35 (< (+ 3 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|) .cse74)) (forall ((v_ArrVal_1122 (Array Int Int))) (let ((.cse236 (select v_ArrVal_1122 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse236 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (= .cse236 |c_ULTIMATE.start_main_~#s~0#1.offset|) (< .cse236 0) (< (+ 3 (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse236)) .cse4)))) (forall ((v_arrayElimIndex_6 Int)) (or (forall ((v_ArrVal_1122 (Array Int Int)) (v_arrayElimCell_46 Int)) (let ((.cse239 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122)) (.cse238 (select v_ArrVal_1122 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse237 (+ 3 (select (select .cse239 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse238)))) (or (< .cse237 .cse15) (not (= .cse238 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse238 0) (< .cse237 .cse4) (< (+ (select (select .cse239 v_arrayElimIndex_6) .cse238) 3) (select |c_#length| v_arrayElimCell_46)))))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_arrayElimIndex_6) (= v_arrayElimIndex_6 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|))) (forall ((v_arrayElimIndex_6 Int)) (or (forall ((v_ArrVal_1122 (Array Int Int))) (let ((.cse243 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122)) (.cse242 (select v_ArrVal_1122 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse240 (+ (select (select .cse243 v_arrayElimIndex_6) .cse242) 3)) (.cse241 (+ 3 (select (select .cse243 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse242)))) (or (< .cse240 (select |c_#length| v_arrayElimIndex_6)) (< .cse241 .cse15) (not (= .cse242 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse240 .cse15) (< .cse242 0) (< .cse241 .cse4))))) (= v_arrayElimIndex_6 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|))) (forall ((v_ArrVal_1122 (Array Int Int))) (let ((.cse245 (select v_ArrVal_1122 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse244 (+ 3 (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse245)))) (or (< .cse244 .cse15) (not (= .cse245 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (= .cse245 |c_ULTIMATE.start_main_~#s~0#1.offset|) (< .cse245 0) (< .cse244 .cse4))))) (forall ((v_arrayElimCell_47 Int) (v_ArrVal_1122 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimCell_43 Int)) (let ((.cse246 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse247 (select (select .cse246 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< (+ (select (select .cse246 v_arrayElimCell_47) .cse247) 3) (select |c_#length| v_arrayElimCell_43)) (< (+ 3 (select (select .cse246 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse247)) .cse4) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse247 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_arrayElimCell_47) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| v_arrayElimCell_47) (= .cse247 |c_ULTIMATE.start_main_~#s~0#1.offset|) (< .cse247 0))))) (or (forall ((v_ArrVal_1122 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse249 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse248 (select (select .cse249 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse248 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse248 0) (< (+ 3 (select (select .cse249 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse248)) .cse74))))) .cse35) (forall ((v_arrayElimIndex_6 Int) (v_ArrVal_1122 (Array Int Int))) (let ((.cse253 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122)) (.cse251 (select v_ArrVal_1122 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse250 (+ 3 (select (select .cse253 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse251))) (.cse252 (+ (select (select .cse253 v_arrayElimIndex_6) .cse251) 3))) (or (< .cse250 .cse15) (not (= .cse251 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse252 .cse15) (= .cse251 |c_ULTIMATE.start_main_~#s~0#1.offset|) (< .cse251 0) (< .cse250 .cse4) (< .cse252 .cse4))))) (or (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_arrayElimCell_47 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| v_arrayElimCell_47) (forall ((v_ArrVal_1122 (Array Int Int))) (let ((.cse256 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse255 (select (select .cse256 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse254 (+ 3 (select (select .cse256 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse255)))) (or (< .cse254 .cse4) (not (= .cse255 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse254 (select |c_#length| v_arrayElimCell_47)) (< .cse255 0)))))))))) .cse49) (forall ((v_ArrVal_1122 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse258 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse257 (select (select .cse258 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse257 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< 0 (+ 1 (select (select .cse258 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse257))) (forall ((v_arrayElimCell_42 Int)) (< 0 (+ (select (select .cse258 v_arrayElimCell_42) .cse257) 1))) (< .cse257 0))))) (or .cse35 (forall ((v_arrayElimCell_47 Int) (v_ArrVal_1122 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse260 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse259 (select (select .cse260 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse259 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< (+ 3 (select (select .cse260 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse259)) (select |c_#length| v_arrayElimCell_47)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_arrayElimCell_47) (< (+ (select (select .cse260 v_arrayElimCell_47) .cse259) 3) .cse15) (< .cse259 0)))))) (forall ((v_arrayElimIndex_6 Int)) (or (forall ((v_ArrVal_1122 (Array Int Int)) (v_arrayElimCell_46 Int)) (let ((.cse263 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122)) (.cse262 (select v_ArrVal_1122 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse261 (+ 3 (select (select .cse263 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse262)))) (or (< .cse261 .cse15) (not (= .cse262 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (= .cse262 |c_ULTIMATE.start_main_~#s~0#1.offset|) (< .cse262 0) (< .cse261 .cse4) (< (+ (select (select .cse263 v_arrayElimIndex_6) .cse262) 3) (select |c_#length| v_arrayElimCell_46)))))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_arrayElimIndex_6) (= v_arrayElimIndex_6 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|))) (forall ((v_arrayElimIndex_6 Int) (v_ArrVal_1122 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse264 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse265 (select (select .cse264 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< (+ 3 (select (select .cse264 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse265)) .cse4) (not (= .cse265 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (= .cse265 |c_ULTIMATE.start_main_~#s~0#1.offset|) (< (+ (select (select .cse264 v_arrayElimIndex_6) .cse265) 3) .cse4) (< .cse265 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_arrayElimIndex_6))))) (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_arrayElimCell_47 Int)) (or (forall ((v_ArrVal_1122 (Array Int Int))) (let ((.cse270 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse267 (select (select .cse270 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse266 (+ 3 (select (select .cse270 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse267))) (.cse268 (select |c_#length| v_arrayElimCell_47)) (.cse269 (+ (select (select .cse270 v_arrayElimCell_47) .cse267) 3))) (or (< .cse266 .cse4) (not (= .cse267 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse266 .cse268) (< .cse269 .cse268) (< .cse269 .cse15) (< .cse267 0)))))) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| v_arrayElimCell_47))))) (forall ((v_arrayElimIndex_6 Int)) (or (forall ((v_arrayElimCell_46 Int) (v_ArrVal_1122 (Array Int Int))) (let ((.cse274 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122)) (.cse272 (select v_ArrVal_1122 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse271 (+ 3 (select (select .cse274 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse272))) (.cse273 (+ (select (select .cse274 v_arrayElimIndex_6) .cse272) 3))) (or (< .cse271 .cse15) (not (= .cse272 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse273 .cse15) (< .cse272 0) (< .cse271 .cse4) (< .cse273 (select |c_#length| v_arrayElimCell_46)))))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_arrayElimIndex_6) (= v_arrayElimIndex_6 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|))) (or (forall ((v_arrayElimCell_47 Int) (v_ArrVal_1122 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimCell_43 Int)) (let ((.cse275 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse276 (select (select .cse275 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< (+ (select (select .cse275 v_arrayElimCell_47) .cse276) 3) (select |c_#length| v_arrayElimCell_43)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse276 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< (+ 3 (select (select .cse275 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse276)) (select |c_#length| v_arrayElimCell_47)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_arrayElimCell_47) (< .cse276 0) (= v_arrayElimCell_47 |ULTIMATE.start_main_~#s~0#1.base|))))) .cse35) (or (forall ((v_arrayElimCell_47 Int) (v_ArrVal_1122 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse277 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse278 (select (select .cse277 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (< (+ 3 (select (select .cse277 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse278)) .cse4) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse278 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_arrayElimCell_47) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| v_arrayElimCell_47) (< (+ (select (select .cse277 v_arrayElimCell_47) .cse278) 3) .cse15) (< .cse278 0))))) .cse24) (forall ((v_ArrVal_1122 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse281 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse280 (select (select .cse281 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse279 (+ 3 (select (select .cse281 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse280)))) (or (< .cse279 .cse4) (not (= .cse280 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (forall ((v_arrayElimCell_48 Int)) (< .cse279 (select |c_#length| v_arrayElimCell_48))) (= .cse280 |c_ULTIMATE.start_main_~#s~0#1.offset|) (forall ((v_arrayElimIndex_6 Int)) (or (< (+ (select (select .cse281 v_arrayElimIndex_6) .cse280) 3) .cse4) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_arrayElimIndex_6))) (< .cse280 0)))))) (forall ((v_arrayElimCell_47 Int) (v_ArrVal_1122 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse282 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse283 (select (select .cse282 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse284 (+ (select (select .cse282 v_arrayElimCell_47) .cse283) 3))) (or (< (+ 3 (select (select .cse282 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse283)) .cse4) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse283 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse284 (select |c_#length| v_arrayElimCell_47)) (= .cse283 |c_ULTIMATE.start_main_~#s~0#1.offset|) (< .cse284 .cse4) (< .cse283 0)))))) (or (and (forall ((v_arrayElimIndex_6 Int)) (or (forall ((v_arrayElimCell_46 Int) (v_ArrVal_1122 (Array Int Int))) (let ((.cse287 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122)) (.cse285 (select v_ArrVal_1122 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse286 (+ (select (select .cse287 v_arrayElimIndex_6) .cse285) 3))) (or (not (= .cse285 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse286 .cse15) (= .cse285 |c_ULTIMATE.start_main_~#s~0#1.offset|) (< .cse285 0) (< (+ 3 (select (select .cse287 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse285)) .cse4) (< .cse286 (select |c_#length| v_arrayElimCell_46)))))) (= v_arrayElimIndex_6 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|))) (forall ((v_arrayElimIndex_6 Int)) (or (forall ((v_ArrVal_1122 (Array Int Int)) (v_arrayElimCell_46 Int)) (let ((.cse289 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122)) (.cse288 (select v_ArrVal_1122 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse288 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse288 0) (< (+ 3 (select (select .cse289 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse288)) .cse4) (< (+ (select (select .cse289 v_arrayElimIndex_6) .cse288) 3) (select |c_#length| v_arrayElimCell_46))))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_arrayElimIndex_6) (= v_arrayElimIndex_6 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|))) (forall ((v_arrayElimIndex_6 Int)) (or (forall ((v_ArrVal_1122 (Array Int Int))) (let ((.cse292 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122)) (.cse291 (select v_ArrVal_1122 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse290 (+ (select (select .cse292 v_arrayElimIndex_6) .cse291) 3))) (or (< .cse290 (select |c_#length| v_arrayElimIndex_6)) (not (= .cse291 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse290 .cse15) (< .cse291 0) (< (+ 3 (select (select .cse292 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse291)) .cse4))))) (= v_arrayElimIndex_6 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|))) (forall ((v_ArrVal_1122 (Array Int Int))) (let ((.cse293 (select v_ArrVal_1122 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse293 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse293 0) (< (+ 3 (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse293)) .cse4) (< (+ (select v_ArrVal_1122 .cse293) 3) .cse15)))) (forall ((v_arrayElimIndex_6 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_arrayElimIndex_6) (forall ((v_ArrVal_1122 (Array Int Int)) (v_arrayElimCell_46 Int)) (let ((.cse295 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122)) (.cse294 (select v_ArrVal_1122 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse294 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (= .cse294 |c_ULTIMATE.start_main_~#s~0#1.offset|) (< .cse294 0) (< (+ 3 (select (select .cse295 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse294)) .cse4) (< (+ (select (select .cse295 v_arrayElimIndex_6) .cse294) 3) (select |c_#length| v_arrayElimCell_46))))) (= v_arrayElimIndex_6 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|))) .cse23 (forall ((v_arrayElimIndex_6 Int)) (or (forall ((v_arrayElimCell_46 Int) (v_ArrVal_1122 (Array Int Int))) (let ((.cse298 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122)) (.cse296 (select v_ArrVal_1122 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse297 (+ (select (select .cse298 v_arrayElimIndex_6) .cse296) 3))) (or (not (= .cse296 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse297 .cse15) (< .cse296 0) (< (+ 3 (select (select .cse298 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse296)) .cse4) (< .cse297 (select |c_#length| v_arrayElimCell_46)))))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_arrayElimIndex_6) (= v_arrayElimIndex_6 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|))) (forall ((v_arrayElimIndex_6 Int)) (or (forall ((v_ArrVal_1122 (Array Int Int))) (let ((.cse299 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122)) (.cse300 (select v_ArrVal_1122 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< (+ (select (select .cse299 v_arrayElimIndex_6) .cse300) 3) (select |c_#length| v_arrayElimIndex_6)) (not (= .cse300 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse300 0) (< (+ 3 (select (select .cse299 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse300)) .cse4)))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_arrayElimIndex_6) (= v_arrayElimIndex_6 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)))) .cse24) (or (forall ((v_arrayElimCell_47 Int) (v_ArrVal_1122 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimCell_43 Int)) (let ((.cse302 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse303 (select (select .cse302 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse301 (+ (select (select .cse302 v_arrayElimCell_47) .cse303) 3))) (or (< .cse301 (select |c_#length| v_arrayElimCell_43)) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (< (+ 3 (select (select .cse302 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse303)) .cse4) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse303 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse301 (select |c_#length| v_arrayElimCell_47)) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| v_arrayElimCell_47) (< .cse303 0) (= v_arrayElimCell_47 |ULTIMATE.start_main_~#s~0#1.base|)))))) .cse24) (or (and (forall ((v_arrayElimCell_46 Int) (v_ArrVal_1122 (Array Int Int))) (let ((.cse307 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122)) (.cse306 (select v_ArrVal_1122 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse304 (+ 3 (select (select .cse307 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse306))) (.cse305 (+ 3 (select (select .cse307 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse306)))) (or (< .cse304 (select |c_#length| v_arrayElimCell_46)) (< .cse305 .cse15) (not (= .cse306 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse304 .cse15) (< .cse306 0) (< .cse305 .cse4))))) (forall ((v_ArrVal_1122 (Array Int Int)) (v_arrayElimCell_46 Int)) (let ((.cse308 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122)) (.cse309 (select v_ArrVal_1122 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse310 (+ 3 (select (select .cse308 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse309)))) (or (< (+ 3 (select (select .cse308 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse309)) (select |c_#length| v_arrayElimCell_46)) (< .cse310 .cse15) (not (= .cse309 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse309 0) (< .cse310 .cse4)))))) .cse311 .cse86) (or (and (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_arrayElimCell_47 Int)) (or (forall ((v_ArrVal_1122 (Array Int Int))) (let ((.cse316 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse313 (select (select .cse316 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse312 (+ 3 (select (select .cse316 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse313))) (.cse314 (select |c_#length| v_arrayElimCell_47)) (.cse315 (+ (select (select .cse316 v_arrayElimCell_47) .cse313) 3))) (or (< .cse312 .cse4) (not (= .cse313 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse312 .cse314) (< .cse315 .cse314) (< .cse315 .cse15) (< .cse313 0)))))) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| v_arrayElimCell_47))))) (or .cse24 (forall ((v_arrayElimCell_47 Int) (v_ArrVal_1122 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse317 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse318 (select (select .cse317 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse319 (+ (select (select .cse317 v_arrayElimCell_47) .cse318) 3))) (or (< (+ 3 (select (select .cse317 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse318)) .cse4) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse318 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse319 (select |c_#length| v_arrayElimCell_47)) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| v_arrayElimCell_47) (< .cse319 .cse15) (< .cse318 0)))))))) .cse49) (forall ((v_ArrVal_1122 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse324 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse321 (select (select .cse324 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse320 (+ 3 (select (select .cse324 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse321)))) (or (< .cse320 .cse4) (not (= .cse321 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (forall ((v_arrayElimIndex_6 Int) (v_arrayElimCell_48 Int)) (let ((.cse323 (select |c_#length| v_arrayElimCell_48)) (.cse322 (+ (select (select .cse324 v_arrayElimIndex_6) .cse321) 3))) (or (< .cse322 .cse323) (< .cse320 .cse323) (< .cse322 .cse4)))) (= .cse321 |c_ULTIMATE.start_main_~#s~0#1.offset|) (< .cse321 0)))))) (forall ((v_arrayElimCell_47 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_arrayElimCell_47) (forall ((v_ArrVal_1122 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse327 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse326 (select (select .cse327 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse325 (+ 3 (select (select .cse327 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse326)))) (or (< .cse325 .cse4) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse326 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse325 (select |c_#length| v_arrayElimCell_47)) (= .cse326 |c_ULTIMATE.start_main_~#s~0#1.offset|) (< (+ (select (select .cse327 v_arrayElimCell_47) .cse326) 3) .cse4) (< .cse326 0)))))))) (forall ((v_arrayElimIndex_6 Int) (v_ArrVal_1122 (Array Int Int))) (let ((.cse330 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122)) (.cse329 (select v_ArrVal_1122 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse328 (+ 3 (select (select .cse330 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse329)))) (or (< .cse328 .cse15) (not (= .cse329 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (= .cse329 |c_ULTIMATE.start_main_~#s~0#1.offset|) (< .cse329 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_arrayElimIndex_6) (< .cse328 .cse4) (< (+ (select (select .cse330 v_arrayElimIndex_6) .cse329) 3) .cse4))))) (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_1122 (Array Int Int))) (let ((.cse333 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse332 (select (select .cse333 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse331 (+ 3 (select (select .cse333 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse332)))) (or (< .cse331 .cse4) (not (= .cse332 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< (+ 3 (select v_ArrVal_1122 .cse332)) .cse74) (< .cse332 0) (< .cse331 .cse74)))))))) (forall ((v_ArrVal_1122 (Array Int Int))) (let ((.cse335 (select v_ArrVal_1122 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse334 (+ 3 (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse335)))) (or (< .cse334 .cse15) (not (= .cse335 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse335 0) (< .cse334 .cse4) (< (+ (select v_ArrVal_1122 .cse335) 3) .cse15))))) (forall ((v_ArrVal_1122 (Array Int Int)) (v_arrayElimCell_48 Int)) (let ((.cse336 (select v_ArrVal_1122 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse336 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< (+ (select v_ArrVal_1122 .cse336) 3) (select |c_#length| v_arrayElimCell_48)) (= .cse336 |c_ULTIMATE.start_main_~#s~0#1.offset|) (< .cse336 0) (< (+ 3 (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse336)) .cse4)))) (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_arrayElimCell_47 Int)) (or (forall ((v_ArrVal_1122 (Array Int Int)) (v_arrayElimCell_43 Int)) (let ((.cse337 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse338 (select (select .cse337 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse339 (+ 3 (select (select .cse337 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse338)))) (or (< (+ (select (select .cse337 v_arrayElimCell_47) .cse338) 3) (select |c_#length| v_arrayElimCell_43)) (< .cse339 .cse4) (not (= .cse338 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse339 (select |c_#length| v_arrayElimCell_47)) (< .cse338 0)))))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_arrayElimCell_47) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| v_arrayElimCell_47) (= v_arrayElimCell_47 |ULTIMATE.start_main_~#s~0#1.base|))))) (forall ((v_ArrVal_1122 (Array Int Int))) (let ((.cse341 (select v_ArrVal_1122 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse340 (+ 3 (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse341)))) (or (< .cse340 .cse15) (not (= .cse341 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse341 0) (< .cse340 .cse4))))) (or (forall ((v_arrayElimCell_47 Int) (v_ArrVal_1122 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse342 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse343 (select (select .cse342 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse344 (+ (select (select .cse342 v_arrayElimCell_47) .cse343) 3))) (or (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (< (+ 3 (select (select .cse342 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse343)) .cse4) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse343 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse344 (select |c_#length| v_arrayElimCell_47)) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| v_arrayElimCell_47) (< .cse344 .cse15) (< .cse343 0)))))) .cse24) (or (and .cse345 (or (forall ((v_ArrVal_1122 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse346 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse347 (select (select .cse346 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< (+ 3 (select (select .cse346 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse347)) .cse4) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse347 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse347 0))))) .cse49) (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_1122 (Array Int Int))) (let ((.cse348 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse349 (select (select .cse348 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< (+ 3 (select (select .cse348 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse349)) .cse4) (not (= .cse349 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse349 0))))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))) .cse24) (or (forall ((v_arrayElimCell_47 Int) (v_ArrVal_1122 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimCell_43 Int)) (let ((.cse350 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse351 (select (select .cse350 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< (+ (select (select .cse350 v_arrayElimCell_47) .cse351) 3) (select |c_#length| v_arrayElimCell_43)) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (< (+ 3 (select (select .cse350 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse351)) .cse4) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse351 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_arrayElimCell_47) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| v_arrayElimCell_47) (< .cse351 0) (= v_arrayElimCell_47 |ULTIMATE.start_main_~#s~0#1.base|))))) .cse24) (or (and (or .cse35 (forall ((v_arrayElimCell_47 Int) (v_ArrVal_1122 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse353 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse352 (select (select .cse353 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse352 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< (+ 3 (select (select .cse353 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse352)) (select |c_#length| v_arrayElimCell_47)) (< .cse352 0)))))) (or (and .cse345 (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (forall ((v_ArrVal_1122 (Array Int Int))) (let ((.cse354 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse355 (select (select .cse354 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< (+ 3 (select (select .cse354 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse355)) .cse4) (not (= .cse355 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse355 0))))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))) .cse24) (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (forall ((v_arrayElimCell_47 Int) (v_ArrVal_1122 (Array Int Int))) (let ((.cse358 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1122))) (let ((.cse357 (select (select .cse358 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse356 (+ 3 (select (select .cse358 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse357)))) (or (< .cse356 .cse4) (not (= .cse357 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< .cse356 (select |c_#length| v_arrayElimCell_47)) (< .cse357 0)))))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))) .cse49)))) is different from false [2024-11-09 06:44:30,856 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:44:30,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 11044 treesize of output 7024