./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.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_dd4ff59a-263f-48fc-b30b-1f6274e4f3a4/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4ff59a-263f-48fc-b30b-1f6274e4f3a4/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4ff59a-263f-48fc-b30b-1f6274e4f3a4/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4ff59a-263f-48fc-b30b-1f6274e4f3a4/bin/uautomizer-verify-jihMAELWvX/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4ff59a-263f-48fc-b30b-1f6274e4f3a4/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4ff59a-263f-48fc-b30b-1f6274e4f3a4/bin/uautomizer-verify-jihMAELWvX --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4fb6aa6206205a747f158782e93b3c9333c1a2cdc4e8dab70046fca960e31961 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 17:24:27,427 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:24:27,562 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4ff59a-263f-48fc-b30b-1f6274e4f3a4/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-08 17:24:27,567 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:24:27,570 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:24:27,617 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:24:27,620 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:24:27,621 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:24:27,622 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:24:27,624 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:24:27,625 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:24:27,625 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:24:27,626 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:24:27,627 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:24:27,630 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:24:27,630 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:24:27,631 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:24:27,631 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 17:24:27,632 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:24:27,632 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:24:27,633 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-08 17:24:27,638 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-08 17:24:27,638 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-08 17:24:27,639 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:24:27,639 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 17:24:27,640 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:24:27,640 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 17:24:27,640 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:24:27,641 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:24:27,644 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:24:27,644 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:24:27,645 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:24:27,646 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:24:27,647 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:24:27,648 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:24:27,648 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:24:27,648 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 17:24:27,649 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 17:24:27,649 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:24:27,650 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:24:27,650 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:24:27,651 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:24:27,651 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4ff59a-263f-48fc-b30b-1f6274e4f3a4/bin/uautomizer-verify-jihMAELWvX/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_dd4ff59a-263f-48fc-b30b-1f6274e4f3a4/bin/uautomizer-verify-jihMAELWvX 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4fb6aa6206205a747f158782e93b3c9333c1a2cdc4e8dab70046fca960e31961 [2024-11-08 17:24:27,998 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:24:28,033 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:24:28,038 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:24:28,039 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:24:28,040 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:24:28,042 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4ff59a-263f-48fc-b30b-1f6274e4f3a4/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i Unable to find full path for "g++" [2024-11-08 17:24:30,422 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:24:30,851 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:24:30,852 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4ff59a-263f-48fc-b30b-1f6274e4f3a4/sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i [2024-11-08 17:24:30,873 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4ff59a-263f-48fc-b30b-1f6274e4f3a4/bin/uautomizer-verify-jihMAELWvX/data/b2ef95f4b/a232c9e85cb3408cab5d59ee9368ab30/FLAGcc194b2d1 [2024-11-08 17:24:30,898 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4ff59a-263f-48fc-b30b-1f6274e4f3a4/bin/uautomizer-verify-jihMAELWvX/data/b2ef95f4b/a232c9e85cb3408cab5d59ee9368ab30 [2024-11-08 17:24:30,902 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:24:30,904 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:24:30,908 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:24:30,909 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:24:30,917 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:24:30,918 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:24:30" (1/1) ... [2024-11-08 17:24:30,919 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@697b956b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:24:30, skipping insertion in model container [2024-11-08 17:24:30,922 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:24:30" (1/1) ... [2024-11-08 17:24:30,992 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:24:31,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:24:31,556 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:24:31,633 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:24:31,671 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:24:31,672 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:24:31 WrapperNode [2024-11-08 17:24:31,672 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:24:31,673 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:24:31,673 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:24:31,674 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:24:31,683 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:24:31" (1/1) ... [2024-11-08 17:24:31,706 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:24:31" (1/1) ... [2024-11-08 17:24:31,738 INFO L138 Inliner]: procedures = 122, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 95 [2024-11-08 17:24:31,739 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:24:31,740 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:24:31,740 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:24:31,741 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:24:31,756 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:24:31" (1/1) ... [2024-11-08 17:24:31,757 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:24:31" (1/1) ... [2024-11-08 17:24:31,761 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:24:31" (1/1) ... [2024-11-08 17:24:31,783 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 10 writes are split as follows [0, 10]. [2024-11-08 17:24:31,783 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:24:31" (1/1) ... [2024-11-08 17:24:31,784 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:24:31" (1/1) ... [2024-11-08 17:24:31,794 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:24:31" (1/1) ... [2024-11-08 17:24:31,799 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:24:31" (1/1) ... [2024-11-08 17:24:31,801 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:24:31" (1/1) ... [2024-11-08 17:24:31,803 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:24:31" (1/1) ... [2024-11-08 17:24:31,809 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:24:31,810 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:24:31,810 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:24:31,810 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:24:31,814 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:24:31" (1/1) ... [2024-11-08 17:24:31,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:24:31,844 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4ff59a-263f-48fc-b30b-1f6274e4f3a4/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:24:31,865 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4ff59a-263f-48fc-b30b-1f6274e4f3a4/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 17:24:31,870 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4ff59a-263f-48fc-b30b-1f6274e4f3a4/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 17:24:31,916 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-08 17:24:31,916 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-08 17:24:31,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 17:24:31,917 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 17:24:31,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 17:24:31,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 17:24:31,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 17:24:31,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:24:31,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-08 17:24:31,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-08 17:24:31,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-08 17:24:31,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-08 17:24:31,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 17:24:31,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 17:24:31,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 17:24:31,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:24:31,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:24:32,095 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:24:32,098 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:24:32,148 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-08 17:24:32,722 INFO L? ?]: Removed 79 outVars from TransFormulas that were not future-live. [2024-11-08 17:24:32,722 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:24:32,750 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:24:32,750 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-08 17:24:32,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:24:32 BoogieIcfgContainer [2024-11-08 17:24:32,752 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:24:32,756 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:24:32,757 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:24:32,762 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:24:32,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:24:30" (1/3) ... [2024-11-08 17:24:32,763 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55791d11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:24:32, skipping insertion in model container [2024-11-08 17:24:32,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:24:31" (2/3) ... [2024-11-08 17:24:32,767 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55791d11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:24:32, skipping insertion in model container [2024-11-08 17:24:32,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:24:32" (3/3) ... [2024-11-08 17:24:32,769 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_circular_traversal-2.i [2024-11-08 17:24:32,796 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:24:32,796 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 35 error locations. [2024-11-08 17:24:32,870 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:24:32,877 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=PETRI_NET, 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;@290392b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:24:32,877 INFO L334 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2024-11-08 17:24:32,882 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 46 states have (on average 2.0) internal successors, (92), 82 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:24:32,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-08 17:24:32,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:24:32,891 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-08 17:24:32,891 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-08 17:24:32,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:24:32,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1079622, now seen corresponding path program 1 times [2024-11-08 17:24:32,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:24:32,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835216800] [2024-11-08 17:24:32,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:24:32,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:24:33,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:24:33,198 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-08 17:24:33,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:24:33,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835216800] [2024-11-08 17:24:33,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835216800] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:24:33,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:24:33,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:24:33,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574722750] [2024-11-08 17:24:33,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:24:33,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:24:33,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:24:33,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:24:33,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:24:33,256 INFO L87 Difference]: Start difference. First operand has 84 states, 46 states have (on average 2.0) internal successors, (92), 82 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:24:33,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:24:33,409 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2024-11-08 17:24:33,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:24:33,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-08 17:24:33,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:24:33,421 INFO L225 Difference]: With dead ends: 79 [2024-11-08 17:24:33,421 INFO L226 Difference]: Without dead ends: 73 [2024-11-08 17:24:33,424 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-08 17:24:33,428 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 23 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:24:33,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 97 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:24:33,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-08 17:24:33,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-08 17:24:33,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 42 states have (on average 1.8333333333333333) internal successors, (77), 72 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:24:33,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2024-11-08 17:24:33,475 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 4 [2024-11-08 17:24:33,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:24:33,476 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2024-11-08 17:24:33,476 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:24:33,476 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2024-11-08 17:24:33,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-08 17:24:33,477 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:24:33,477 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-08 17:24:33,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 17:24:33,477 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-08 17:24:33,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:24:33,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1079623, now seen corresponding path program 1 times [2024-11-08 17:24:33,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:24:33,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663463086] [2024-11-08 17:24:33,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:24:33,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:24:33,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:24:33,622 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-08 17:24:33,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:24:33,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663463086] [2024-11-08 17:24:33,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663463086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:24:33,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:24:33,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:24:33,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529325604] [2024-11-08 17:24:33,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:24:33,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:24:33,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:24:33,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:24:33,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:24:33,627 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:24:33,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:24:33,734 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2024-11-08 17:24:33,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:24:33,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-08 17:24:33,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:24:33,737 INFO L225 Difference]: With dead ends: 69 [2024-11-08 17:24:33,737 INFO L226 Difference]: Without dead ends: 69 [2024-11-08 17:24:33,738 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-08 17:24:33,739 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 21 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:24:33,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 90 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:24:33,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-08 17:24:33,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-08 17:24:33,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 42 states have (on average 1.7380952380952381) internal successors, (73), 68 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:24:33,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2024-11-08 17:24:33,749 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 4 [2024-11-08 17:24:33,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:24:33,749 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2024-11-08 17:24:33,750 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:24:33,750 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2024-11-08 17:24:33,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 17:24:33,750 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:24:33,751 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:24:33,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 17:24:33,752 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-08 17:24:33,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:24:33,753 INFO L85 PathProgramCache]: Analyzing trace with hash -401961688, now seen corresponding path program 1 times [2024-11-08 17:24:33,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:24:33,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972142676] [2024-11-08 17:24:33,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:24:33,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:24:33,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:24:33,928 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-08 17:24:33,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:24:33,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972142676] [2024-11-08 17:24:33,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972142676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:24:33,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:24:33,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:24:33,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11881928] [2024-11-08 17:24:33,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:24:33,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:24:33,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:24:33,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:24:33,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:24:33,933 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:24:33,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:24:33,994 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2024-11-08 17:24:34,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:24:34,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-08 17:24:34,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:24:34,004 INFO L225 Difference]: With dead ends: 82 [2024-11-08 17:24:34,004 INFO L226 Difference]: Without dead ends: 82 [2024-11-08 17:24:34,005 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-08 17:24:34,006 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 12 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:24:34,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 131 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:24:34,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-08 17:24:34,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 71. [2024-11-08 17:24:34,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 44 states have (on average 1.7045454545454546) internal successors, (75), 70 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:24:34,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2024-11-08 17:24:34,028 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 10 [2024-11-08 17:24:34,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:24:34,029 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2024-11-08 17:24:34,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:24:34,030 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2024-11-08 17:24:34,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 17:24:34,035 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:24:34,035 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:24:34,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 17:24:34,035 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-08 17:24:34,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:24:34,036 INFO L85 PathProgramCache]: Analyzing trace with hash 423353848, now seen corresponding path program 1 times [2024-11-08 17:24:34,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:24:34,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211726235] [2024-11-08 17:24:34,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:24:34,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:24:34,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:24:34,281 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-08 17:24:34,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:24:34,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211726235] [2024-11-08 17:24:34,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211726235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:24:34,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:24:34,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:24:34,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973152907] [2024-11-08 17:24:34,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:24:34,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:24:34,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:24:34,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:24:34,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:24:34,291 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:24:34,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:24:34,408 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2024-11-08 17:24:34,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:24:34,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-08 17:24:34,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:24:34,414 INFO L225 Difference]: With dead ends: 69 [2024-11-08 17:24:34,414 INFO L226 Difference]: Without dead ends: 69 [2024-11-08 17:24:34,415 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-08 17:24:34,419 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 5 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:24:34,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 98 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:24:34,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-08 17:24:34,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-08 17:24:34,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 44 states have (on average 1.6590909090909092) internal successors, (73), 68 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:24:34,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2024-11-08 17:24:34,435 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 11 [2024-11-08 17:24:34,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:24:34,435 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2024-11-08 17:24:34,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:24:34,436 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2024-11-08 17:24:34,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 17:24:34,436 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:24:34,436 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:24:34,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 17:24:34,437 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-08 17:24:34,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:24:34,438 INFO L85 PathProgramCache]: Analyzing trace with hash 423353849, now seen corresponding path program 1 times [2024-11-08 17:24:34,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:24:34,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084981346] [2024-11-08 17:24:34,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:24:34,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:24:34,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:24:34,567 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-08 17:24:34,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:24:34,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084981346] [2024-11-08 17:24:34,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084981346] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:24:34,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:24:34,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:24:34,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764568686] [2024-11-08 17:24:34,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:24:34,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:24:34,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:24:34,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:24:34,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:24:34,571 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:24:34,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:24:34,645 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2024-11-08 17:24:34,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:24:34,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-08 17:24:34,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:24:34,647 INFO L225 Difference]: With dead ends: 67 [2024-11-08 17:24:34,647 INFO L226 Difference]: Without dead ends: 67 [2024-11-08 17:24:34,648 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-08 17:24:34,649 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 5 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:24:34,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 101 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:24:34,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-08 17:24:34,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-08 17:24:34,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 44 states have (on average 1.6136363636363635) internal successors, (71), 66 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:24:34,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2024-11-08 17:24:34,659 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 11 [2024-11-08 17:24:34,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:24:34,660 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2024-11-08 17:24:34,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:24:34,661 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2024-11-08 17:24:34,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 17:24:34,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:24:34,662 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:24:34,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 17:24:34,662 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-08 17:24:34,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:24:34,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1178844741, now seen corresponding path program 1 times [2024-11-08 17:24:34,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:24:34,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456611240] [2024-11-08 17:24:34,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:24:34,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:24:34,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:24:34,900 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-08 17:24:34,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:24:34,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456611240] [2024-11-08 17:24:34,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456611240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:24:34,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:24:34,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:24:34,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834675375] [2024-11-08 17:24:34,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:24:34,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:24:34,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:24:34,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:24:34,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:24:34,905 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:24:35,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:24:35,101 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2024-11-08 17:24:35,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:24:35,102 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-08 17:24:35,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:24:35,103 INFO L225 Difference]: With dead ends: 71 [2024-11-08 17:24:35,103 INFO L226 Difference]: Without dead ends: 71 [2024-11-08 17:24:35,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:24:35,106 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 21 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:24:35,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 145 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:24:35,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-08 17:24:35,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-08 17:24:35,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 48 states have (on average 1.5833333333333333) internal successors, (76), 70 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:24:35,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2024-11-08 17:24:35,116 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 13 [2024-11-08 17:24:35,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:24:35,117 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2024-11-08 17:24:35,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:24:35,118 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2024-11-08 17:24:35,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 17:24:35,118 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:24:35,118 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:24:35,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 17:24:35,119 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-08 17:24:35,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:24:35,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1178844740, now seen corresponding path program 1 times [2024-11-08 17:24:35,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:24:35,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439425108] [2024-11-08 17:24:35,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:24:35,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:24:35,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:24:35,444 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-08 17:24:35,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:24:35,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439425108] [2024-11-08 17:24:35,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439425108] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:24:35,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:24:35,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:24:35,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681830916] [2024-11-08 17:24:35,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:24:35,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:24:35,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:24:35,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:24:35,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:24:35,449 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:24:35,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:24:35,591 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2024-11-08 17:24:35,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:24:35,592 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-08 17:24:35,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:24:35,593 INFO L225 Difference]: With dead ends: 71 [2024-11-08 17:24:35,594 INFO L226 Difference]: Without dead ends: 71 [2024-11-08 17:24:35,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:24:35,595 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 42 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:24:35,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 121 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:24:35,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-08 17:24:35,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-08 17:24:35,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 48 states have (on average 1.5625) internal successors, (75), 70 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:24:35,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2024-11-08 17:24:35,601 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 13 [2024-11-08 17:24:35,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:24:35,602 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2024-11-08 17:24:35,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:24:35,603 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2024-11-08 17:24:35,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 17:24:35,603 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:24:35,604 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:24:35,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 17:24:35,604 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-08 17:24:35,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:24:35,605 INFO L85 PathProgramCache]: Analyzing trace with hash 436754752, now seen corresponding path program 1 times [2024-11-08 17:24:35,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:24:35,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073067344] [2024-11-08 17:24:35,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:24:35,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:24:35,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:24:35,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:24:35,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:24:35,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073067344] [2024-11-08 17:24:35,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073067344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:24:35,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:24:35,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:24:35,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051364223] [2024-11-08 17:24:35,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:24:35,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:24:35,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:24:35,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:24:35,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:24:35,705 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:24:35,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:24:35,838 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2024-11-08 17:24:35,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:24:35,839 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-08 17:24:35,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:24:35,840 INFO L225 Difference]: With dead ends: 69 [2024-11-08 17:24:35,840 INFO L226 Difference]: Without dead ends: 69 [2024-11-08 17:24:35,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:24:35,841 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 8 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:24:35,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 122 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:24:35,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-08 17:24:35,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-08 17:24:35,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 68 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:24:35,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2024-11-08 17:24:35,847 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 17 [2024-11-08 17:24:35,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:24:35,848 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2024-11-08 17:24:35,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:24:35,848 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2024-11-08 17:24:35,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 17:24:35,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:24:35,849 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:24:35,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 17:24:35,849 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-08 17:24:35,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:24:35,850 INFO L85 PathProgramCache]: Analyzing trace with hash 436754753, now seen corresponding path program 1 times [2024-11-08 17:24:35,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:24:35,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315910931] [2024-11-08 17:24:35,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:24:35,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:24:35,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:24:35,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:24:35,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:24:35,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315910931] [2024-11-08 17:24:35,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315910931] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:24:35,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514656158] [2024-11-08 17:24:35,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:24:35,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:24:35,961 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4ff59a-263f-48fc-b30b-1f6274e4f3a4/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:24:35,963 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4ff59a-263f-48fc-b30b-1f6274e4f3a4/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:24:35,972 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4ff59a-263f-48fc-b30b-1f6274e4f3a4/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 17:24:36,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:24:36,169 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 17:24:36,176 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:24:36,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:24:36,261 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:24:36,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:24:36,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514656158] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:24:36,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 17:24:36,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-11-08 17:24:36,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192476282] [2024-11-08 17:24:36,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 17:24:36,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:24:36,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:24:36,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:24:36,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:24:36,335 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:24:36,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:24:36,374 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2024-11-08 17:24:36,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:24:36,375 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-08 17:24:36,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:24:36,376 INFO L225 Difference]: With dead ends: 87 [2024-11-08 17:24:36,376 INFO L226 Difference]: Without dead ends: 87 [2024-11-08 17:24:36,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:24:36,378 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 17 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:24:36,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 128 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:24:36,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-08 17:24:36,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2024-11-08 17:24:36,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 64 states have (on average 1.40625) internal successors, (90), 84 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:24:36,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2024-11-08 17:24:36,390 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 17 [2024-11-08 17:24:36,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:24:36,390 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2024-11-08 17:24:36,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:24:36,395 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2024-11-08 17:24:36,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-08 17:24:36,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:24:36,395 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:24:36,423 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4ff59a-263f-48fc-b30b-1f6274e4f3a4/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 17:24:36,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4ff59a-263f-48fc-b30b-1f6274e4f3a4/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:24:36,600 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-08 17:24:36,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:24:36,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1197858468, now seen corresponding path program 1 times [2024-11-08 17:24:36,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:24:36,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127608118] [2024-11-08 17:24:36,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:24:36,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:24:36,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:24:36,942 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:24:36,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:24:36,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127608118] [2024-11-08 17:24:36,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127608118] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:24:36,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819208129] [2024-11-08 17:24:36,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:24:36,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:24:36,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4ff59a-263f-48fc-b30b-1f6274e4f3a4/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:24:36,948 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4ff59a-263f-48fc-b30b-1f6274e4f3a4/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:24:36,951 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4ff59a-263f-48fc-b30b-1f6274e4f3a4/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 17:24:37,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:24:37,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 17:24:37,137 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:24:37,187 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-08 17:24:37,299 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-08 17:24:37,299 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 12 treesize of output 14 [2024-11-08 17:24:37,351 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:24:37,352 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:24:37,590 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:24:37,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819208129] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:24:37,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 17:24:37,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 4] total 6 [2024-11-08 17:24:37,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632082728] [2024-11-08 17:24:37,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 17:24:37,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:24:37,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:24:37,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:24:37,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:24:37,594 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:24:37,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:24:37,798 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2024-11-08 17:24:37,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:24:37,798 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-08 17:24:37,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:24:37,799 INFO L225 Difference]: With dead ends: 83 [2024-11-08 17:24:37,800 INFO L226 Difference]: Without dead ends: 83 [2024-11-08 17:24:37,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:24:37,801 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 6 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:24:37,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 195 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:24:37,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-08 17:24:37,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-08 17:24:37,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 64 states have (on average 1.34375) internal successors, (86), 82 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:24:37,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2024-11-08 17:24:37,808 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 20 [2024-11-08 17:24:37,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:24:37,808 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2024-11-08 17:24:37,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:24:37,809 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2024-11-08 17:24:37,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-08 17:24:37,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:24:37,810 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:24:37,836 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4ff59a-263f-48fc-b30b-1f6274e4f3a4/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 17:24:38,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4ff59a-263f-48fc-b30b-1f6274e4f3a4/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:24:38,011 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-08 17:24:38,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:24:38,012 INFO L85 PathProgramCache]: Analyzing trace with hash -2121528198, now seen corresponding path program 1 times [2024-11-08 17:24:38,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:24:38,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131855787] [2024-11-08 17:24:38,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:24:38,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:24:38,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:24:38,346 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-08 17:24:38,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:24:38,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131855787] [2024-11-08 17:24:38,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131855787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:24:38,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:24:38,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:24:38,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480583023] [2024-11-08 17:24:38,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:24:38,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:24:38,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:24:38,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:24:38,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:24:38,349 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:24:38,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:24:38,554 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2024-11-08 17:24:38,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:24:38,555 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-08 17:24:38,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:24:38,555 INFO L225 Difference]: With dead ends: 80 [2024-11-08 17:24:38,555 INFO L226 Difference]: Without dead ends: 80 [2024-11-08 17:24:38,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:24:38,556 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 19 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:24:38,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 128 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:24:38,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-08 17:24:38,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-08 17:24:38,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 65 states have (on average 1.2923076923076924) internal successors, (84), 79 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:24:38,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2024-11-08 17:24:38,567 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 41 [2024-11-08 17:24:38,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:24:38,571 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2024-11-08 17:24:38,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:24:38,572 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2024-11-08 17:24:38,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-08 17:24:38,573 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:24:38,573 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:24:38,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 17:24:38,573 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-08 17:24:38,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:24:38,574 INFO L85 PathProgramCache]: Analyzing trace with hash -2121528197, now seen corresponding path program 1 times [2024-11-08 17:24:38,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:24:38,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289846543] [2024-11-08 17:24:38,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:24:38,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:24:38,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:24:39,018 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-08 17:24:39,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:24:39,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289846543] [2024-11-08 17:24:39,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289846543] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:24:39,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:24:39,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:24:39,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666189765] [2024-11-08 17:24:39,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:24:39,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:24:39,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:24:39,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:24:39,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:24:39,020 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:24:39,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:24:39,199 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2024-11-08 17:24:39,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 17:24:39,200 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-08 17:24:39,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:24:39,201 INFO L225 Difference]: With dead ends: 87 [2024-11-08 17:24:39,201 INFO L226 Difference]: Without dead ends: 87 [2024-11-08 17:24:39,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:24:39,202 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 12 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:24:39,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 194 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:24:39,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-08 17:24:39,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2024-11-08 17:24:39,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 68 states have (on average 1.2794117647058822) internal successors, (87), 82 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:24:39,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2024-11-08 17:24:39,206 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 41 [2024-11-08 17:24:39,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:24:39,206 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2024-11-08 17:24:39,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:24:39,206 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2024-11-08 17:24:39,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 17:24:39,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:24:39,208 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:24:39,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 17:24:39,208 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-08 17:24:39,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:24:39,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1955503276, now seen corresponding path program 1 times [2024-11-08 17:24:39,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:24:39,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207233264] [2024-11-08 17:24:39,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:24:39,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:24:39,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:24:40,436 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 12 proven. 19 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 17:24:40,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:24:40,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207233264] [2024-11-08 17:24:40,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207233264] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:24:40,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424586514] [2024-11-08 17:24:40,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:24:40,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:24:40,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4ff59a-263f-48fc-b30b-1f6274e4f3a4/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:24:40,440 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4ff59a-263f-48fc-b30b-1f6274e4f3a4/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:24:40,442 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4ff59a-263f-48fc-b30b-1f6274e4f3a4/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 17:24:40,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:24:40,698 INFO L255 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-08 17:24:40,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:24:40,919 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-08 17:24:40,920 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-08 17:24:41,159 INFO L349 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2024-11-08 17:24:41,160 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 21 treesize of output 33 [2024-11-08 17:24:41,509 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-08 17:24:41,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2024-11-08 17:24:41,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-08 17:24:41,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 17:24:41,742 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 16 treesize of output 11 [2024-11-08 17:24:41,792 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-08 17:24:41,943 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 6 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:24:41,943 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:24:42,064 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_843 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_843) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) is different from false [2024-11-08 17:24:42,166 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:24:42,167 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 21 treesize of output 22 [2024-11-08 17:24:42,174 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 122 treesize of output 110 [2024-11-08 17:24:42,191 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 23 treesize of output 21 [2024-11-08 17:24:42,200 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 20 treesize of output 16 [2024-11-08 17:24:43,576 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:24:43,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 146 treesize of output 216 [2024-11-08 17:24:44,024 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 6 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-08 17:24:44,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424586514] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:24:44,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 17:24:44,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18, 18] total 41 [2024-11-08 17:24:44,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510790035] [2024-11-08 17:24:44,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 17:24:44,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-08 17:24:44,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:24:44,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-08 17:24:44,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1396, Unknown=13, NotChecked=76, Total=1640 [2024-11-08 17:24:44,031 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand has 41 states, 41 states have (on average 2.731707317073171) internal successors, (112), 41 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:24:45,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:24:45,210 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2024-11-08 17:24:45,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 17:24:45,211 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.731707317073171) internal successors, (112), 41 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-11-08 17:24:45,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:24:45,212 INFO L225 Difference]: With dead ends: 83 [2024-11-08 17:24:45,212 INFO L226 Difference]: Without dead ends: 83 [2024-11-08 17:24:45,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=367, Invalid=2173, Unknown=14, NotChecked=98, Total=2652 [2024-11-08 17:24:45,214 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 72 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 17:24:45,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 664 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 501 Invalid, 0 Unknown, 31 Unchecked, 0.6s Time] [2024-11-08 17:24:45,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-08 17:24:45,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-08 17:24:45,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 68 states have (on average 1.2647058823529411) internal successors, (86), 82 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:24:45,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2024-11-08 17:24:45,218 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 45 [2024-11-08 17:24:45,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:24:45,218 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2024-11-08 17:24:45,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.731707317073171) internal successors, (112), 41 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:24:45,219 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2024-11-08 17:24:45,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-08 17:24:45,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:24:45,220 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:24:45,246 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4ff59a-263f-48fc-b30b-1f6274e4f3a4/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 17:24:45,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4ff59a-263f-48fc-b30b-1f6274e4f3a4/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:24:45,425 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-08 17:24:45,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:24:45,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1961743780, now seen corresponding path program 1 times [2024-11-08 17:24:45,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:24:45,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129117530] [2024-11-08 17:24:45,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:24:45,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:24:45,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:24:45,735 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-08 17:24:45,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:24:45,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129117530] [2024-11-08 17:24:45,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129117530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:24:45,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:24:45,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:24:45,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624277677] [2024-11-08 17:24:45,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:24:45,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 17:24:45,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:24:45,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 17:24:45,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:24:45,738 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:24:46,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:24:46,001 INFO L93 Difference]: Finished difference Result 85 states and 87 transitions. [2024-11-08 17:24:46,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 17:24:46,001 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-08 17:24:46,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:24:46,002 INFO L225 Difference]: With dead ends: 85 [2024-11-08 17:24:46,002 INFO L226 Difference]: Without dead ends: 85 [2024-11-08 17:24:46,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:24:46,003 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 36 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:24:46,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 137 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:24:46,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-08 17:24:46,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2024-11-08 17:24:46,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 68 states have (on average 1.2352941176470589) internal successors, (84), 80 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:24:46,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2024-11-08 17:24:46,007 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 47 [2024-11-08 17:24:46,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:24:46,007 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2024-11-08 17:24:46,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:24:46,008 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2024-11-08 17:24:46,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-08 17:24:46,009 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:24:46,009 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:24:46,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 17:24:46,009 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-08 17:24:46,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:24:46,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1961743781, now seen corresponding path program 1 times [2024-11-08 17:24:46,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:24:46,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658091886] [2024-11-08 17:24:46,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:24:46,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:24:46,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:24:46,476 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-08 17:24:46,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:24:46,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658091886] [2024-11-08 17:24:46,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658091886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:24:46,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:24:46,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 17:24:46,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533958357] [2024-11-08 17:24:46,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:24:46,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 17:24:46,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:24:46,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 17:24:46,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:24:46,479 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:24:46,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:24:46,723 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2024-11-08 17:24:46,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 17:24:46,723 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-08 17:24:46,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:24:46,724 INFO L225 Difference]: With dead ends: 83 [2024-11-08 17:24:46,724 INFO L226 Difference]: Without dead ends: 83 [2024-11-08 17:24:46,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-08 17:24:46,725 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 31 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:24:46,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 184 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:24:46,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-08 17:24:46,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2024-11-08 17:24:46,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 78 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:24:46,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2024-11-08 17:24:46,728 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 47 [2024-11-08 17:24:46,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:24:46,729 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2024-11-08 17:24:46,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:24:46,729 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2024-11-08 17:24:46,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-08 17:24:46,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:24:46,730 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:24:46,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 17:24:46,731 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-08 17:24:46,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:24:46,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1961743819, now seen corresponding path program 1 times [2024-11-08 17:24:46,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:24:46,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004887508] [2024-11-08 17:24:46,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:24:46,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:24:46,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:24:48,499 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 17:24:48,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:24:48,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004887508] [2024-11-08 17:24:48,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004887508] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:24:48,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402067794] [2024-11-08 17:24:48,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:24:48,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:24:48,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4ff59a-263f-48fc-b30b-1f6274e4f3a4/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:24:48,503 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4ff59a-263f-48fc-b30b-1f6274e4f3a4/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:24:48,505 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4ff59a-263f-48fc-b30b-1f6274e4f3a4/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 17:24:48,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:24:48,803 INFO L255 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-08 17:24:48,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:24:48,864 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-08 17:24:48,997 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 17:24:48,998 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 17 treesize of output 21 [2024-11-08 17:24:49,090 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-08 17:24:49,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-08 17:24:49,209 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-08 17:24:49,210 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 34 treesize of output 33 [2024-11-08 17:24:49,386 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-08 17:24:49,387 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2024-11-08 17:24:49,507 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-08 17:24:49,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 50 [2024-11-08 17:24:49,967 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 17:24:49,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 52 [2024-11-08 17:24:50,020 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:24:50,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 42 [2024-11-08 17:24:50,253 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 35 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 17:24:50,253 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:24:50,694 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:24:50,695 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 2 case distinctions, treesize of input 53 treesize of output 46 [2024-11-08 17:24:50,716 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:24:50,716 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 272 treesize of output 264 [2024-11-08 17:24:50,738 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 182 treesize of output 166 [2024-11-08 17:24:51,028 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 82 treesize of output 74 [2024-11-08 17:24:51,588 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 29 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 17:24:51,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402067794] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:24:51,588 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 17:24:51,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 13] total 39 [2024-11-08 17:24:51,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048587669] [2024-11-08 17:24:51,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 17:24:51,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-08 17:24:51,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:24:51,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-08 17:24:51,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1402, Unknown=4, NotChecked=0, Total=1560 [2024-11-08 17:24:51,591 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand has 40 states, 39 states have (on average 2.8974358974358974) internal successors, (113), 40 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:24:52,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:24:52,789 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2024-11-08 17:24:52,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 17:24:52,790 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.8974358974358974) internal successors, (113), 40 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-08 17:24:52,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:24:52,793 INFO L225 Difference]: With dead ends: 90 [2024-11-08 17:24:52,793 INFO L226 Difference]: Without dead ends: 90 [2024-11-08 17:24:52,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=296, Invalid=1956, Unknown=4, NotChecked=0, Total=2256 [2024-11-08 17:24:52,798 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 54 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 17:24:52,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 360 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 17:24:52,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-08 17:24:52,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 82. [2024-11-08 17:24:52,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 81 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:24:52,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2024-11-08 17:24:52,804 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 47 [2024-11-08 17:24:52,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:24:52,804 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2024-11-08 17:24:52,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.8974358974358974) internal successors, (113), 40 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:24:52,805 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2024-11-08 17:24:52,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-08 17:24:52,806 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:24:52,806 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:24:52,830 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4ff59a-263f-48fc-b30b-1f6274e4f3a4/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 17:24:53,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4ff59a-263f-48fc-b30b-1f6274e4f3a4/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-08 17:24:53,007 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-08 17:24:53,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:24:53,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1961743820, now seen corresponding path program 1 times [2024-11-08 17:24:53,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:24:53,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208351738] [2024-11-08 17:24:53,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:24:53,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:24:53,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:24:55,284 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 17:24:55,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:24:55,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208351738] [2024-11-08 17:24:55,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208351738] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:24:55,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007442554] [2024-11-08 17:24:55,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:24:55,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:24:55,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4ff59a-263f-48fc-b30b-1f6274e4f3a4/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:24:55,287 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4ff59a-263f-48fc-b30b-1f6274e4f3a4/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:24:55,289 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4ff59a-263f-48fc-b30b-1f6274e4f3a4/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 17:24:55,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:24:55,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-11-08 17:24:55,589 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:24:55,665 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-08 17:24:55,665 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-08 17:24:55,739 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-08 17:24:55,739 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 12 treesize of output 14 [2024-11-08 17:24:55,881 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-08 17:24:55,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2024-11-08 17:24:55,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-08 17:24:55,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-08 17:24:56,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-08 17:24:56,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-08 17:24:56,058 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:24:56,059 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 65 [2024-11-08 17:24:56,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2024-11-08 17:24:56,185 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 38 treesize of output 31 [2024-11-08 17:24:56,191 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 37 treesize of output 30 [2024-11-08 17:24:56,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 27 [2024-11-08 17:24:56,240 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 48 treesize of output 26 [2024-11-08 17:24:56,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 40 [2024-11-08 17:24:56,479 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 44 treesize of output 26 [2024-11-08 17:24:56,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 25 [2024-11-08 17:24:56,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2024-11-08 17:24:56,630 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 39 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 17:24:56,630 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:24:56,938 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_1578 (Array Int Int)) (v_ArrVal_1577 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1577) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1578) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0)))) (forall ((v_ArrVal_1577 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1577) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0))))) is different from false [2024-11-08 17:24:56,966 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_1578 (Array Int Int)) (v_ArrVal_1577 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1577) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1578) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0)))) (forall ((v_ArrVal_1577 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1577) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) is different from false [2024-11-08 17:24:56,988 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:24:56,988 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 55 treesize of output 59 [2024-11-08 17:24:57,044 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_1578 (Array Int Int)) (v_ArrVal_1576 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1576) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1578) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (forall ((v_ArrVal_1577 (Array Int Int)) (v_ArrVal_1575 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1575) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1577) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) (+ 9 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (forall ((v_prenex_6 (Array Int Int)) (v_prenex_7 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_7) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_6) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) is different from false [2024-11-08 17:24:57,118 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_1578 (Array Int Int)) (v_ArrVal_1574 Int) (v_ArrVal_1576 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1574)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1576) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1578) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (forall ((v_ArrVal_1572 (Array Int Int))) (or (not (= (store .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1572 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_1572)) (forall ((v_prenex_6 (Array Int Int)) (v_prenex_7 (Array Int Int))) (<= 0 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1572) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_7) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_6) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) (forall ((v_ArrVal_1572 (Array Int Int))) (or (not (= (store .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1572 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_1572)) (forall ((v_ArrVal_1577 (Array Int Int)) (v_ArrVal_1575 (Array Int Int))) (< (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1572) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1575) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1577) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) (+ 9 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))))) is different from false [2024-11-08 17:24:57,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:24:57,143 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 2 case distinctions, treesize of input 28 treesize of output 34 [2024-11-08 17:24:57,147 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 140 treesize of output 122 [2024-11-08 17:24:57,155 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 17 treesize of output 13 [2024-11-08 17:24:57,161 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 24 treesize of output 16 [2024-11-08 17:24:57,172 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:24:57,173 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:24:57,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2024-11-08 17:24:57,183 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:24:57,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 1 [2024-11-08 17:24:57,189 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:24:57,190 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:24:57,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2024-11-08 17:24:57,201 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:24:57,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 14 treesize of output 8 [2024-11-08 17:24:57,206 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 18 treesize of output 10 [2024-11-08 17:24:57,692 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-08 17:24:57,692 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 16 treesize of output 15 [2024-11-08 17:24:57,705 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 13 not checked. [2024-11-08 17:24:57,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007442554] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:24:57,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 17:24:57,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 43 [2024-11-08 17:24:57,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747781339] [2024-11-08 17:24:57,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 17:24:57,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-08 17:24:57,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:24:57,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-08 17:24:57,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1430, Unknown=4, NotChecked=316, Total=1892 [2024-11-08 17:24:57,709 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 44 states, 43 states have (on average 2.8372093023255816) internal successors, (122), 44 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:25:00,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:25:00,144 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2024-11-08 17:25:00,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-08 17:25:00,145 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.8372093023255816) internal successors, (122), 44 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-08 17:25:00,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:25:00,145 INFO L225 Difference]: With dead ends: 89 [2024-11-08 17:25:00,145 INFO L226 Difference]: Without dead ends: 89 [2024-11-08 17:25:00,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 69 SyntacticMatches, 6 SemanticMatches, 57 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 781 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=357, Invalid=2625, Unknown=4, NotChecked=436, Total=3422 [2024-11-08 17:25:00,147 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 68 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 1252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 254 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 17:25:00,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 610 Invalid, 1252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 976 Invalid, 0 Unknown, 254 Unchecked, 0.9s Time] [2024-11-08 17:25:00,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-08 17:25:00,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 84. [2024-11-08 17:25:00,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 74 states have (on average 1.2027027027027026) internal successors, (89), 83 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:25:00,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2024-11-08 17:25:00,152 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 47 [2024-11-08 17:25:00,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:25:00,154 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2024-11-08 17:25:00,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.8372093023255816) internal successors, (122), 44 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:25:00,154 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2024-11-08 17:25:00,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-08 17:25:00,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:25:00,159 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:25:00,178 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4ff59a-263f-48fc-b30b-1f6274e4f3a4/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-08 17:25:00,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4ff59a-263f-48fc-b30b-1f6274e4f3a4/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:25:00,360 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-08 17:25:00,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:25:00,361 INFO L85 PathProgramCache]: Analyzing trace with hash -79946715, now seen corresponding path program 1 times [2024-11-08 17:25:00,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:25:00,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398186670] [2024-11-08 17:25:00,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:25:00,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:25:00,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:25:04,174 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:25:04,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:25:04,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398186670] [2024-11-08 17:25:04,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398186670] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:25:04,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495374338] [2024-11-08 17:25:04,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:25:04,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:25:04,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4ff59a-263f-48fc-b30b-1f6274e4f3a4/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:25:04,177 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4ff59a-263f-48fc-b30b-1f6274e4f3a4/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:25:04,180 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4ff59a-263f-48fc-b30b-1f6274e4f3a4/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 17:25:04,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:25:04,452 INFO L255 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 92 conjuncts are in the unsatisfiable core [2024-11-08 17:25:04,458 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:25:04,633 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-08 17:25:04,633 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 12 treesize of output 14 [2024-11-08 17:25:04,838 INFO L349 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2024-11-08 17:25:04,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2024-11-08 17:25:05,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-08 17:25:05,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 17:25:05,416 INFO L349 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2024-11-08 17:25:05,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 25 [2024-11-08 17:25:05,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 17:25:05,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-08 17:25:05,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 17:25:05,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 17:25:05,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-08 17:25:05,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-08 17:25:05,793 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-08 17:25:05,794 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 74 [2024-11-08 17:25:05,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-08 17:25:05,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2024-11-08 17:25:06,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-08 17:25:06,063 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 27 [2024-11-08 17:25:06,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 17:25:06,101 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-08 17:25:06,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2024-11-08 17:25:06,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-08 17:25:06,498 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-08 17:25:06,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 34 [2024-11-08 17:25:06,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-08 17:25:06,558 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:25:06,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 23 [2024-11-08 17:25:06,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2024-11-08 17:25:06,841 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:25:06,842 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:25:07,400 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1844 (Array Int Int)) (v_ArrVal_1837 (Array Int Int)) (v_ArrVal_1836 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1836) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1835) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1844) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1837) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0)) .cse1)) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1844 (Array Int Int)) (v_ArrVal_1837 (Array Int Int)) (v_ArrVal_1836 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1837) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1835) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1844) .cse2) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1836) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse2)))))) is different from false [2024-11-08 17:25:07,440 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1844 (Array Int Int)) (v_ArrVal_1837 (Array Int Int)) (v_ArrVal_1836 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1837) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1835) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1844) .cse0) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1836) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)) |c_ULTIMATE.start_main_~data_init~0#1|) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1844 (Array Int Int)) (v_ArrVal_1837 (Array Int Int)) (v_ArrVal_1836 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1836) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1835) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1844) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1837) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| .cse2)))))) is different from false [2024-11-08 17:25:07,537 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)) (.cse2 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse3 (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_1834 (Array Int Int))) (or (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1833 (Array Int Int)) (v_ArrVal_1844 (Array Int Int)) (v_ArrVal_1832 (Array Int Int)) (v_ArrVal_1837 (Array Int Int)) (v_ArrVal_1836 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1833) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1837) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1834) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1835) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1844) .cse0) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1832) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1836) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse0)))) (not (= v_ArrVal_1834 (store .cse2 .cse3 (select v_ArrVal_1834 .cse3)))))) (forall ((v_ArrVal_1834 (Array Int Int))) (or (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1833 (Array Int Int)) (v_ArrVal_1844 (Array Int Int)) (v_ArrVal_1832 (Array Int Int)) (v_ArrVal_1837 (Array Int Int)) (v_ArrVal_1836 (Array Int Int))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1832) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1836) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| .cse4) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1834) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1835) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1844) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1833) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1837) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)) .cse4) |c_ULTIMATE.start_main_~data_init~0#1|)))) (not (= v_ArrVal_1834 (store .cse2 .cse3 (select v_ArrVal_1834 .cse3)))))))) is different from false [2024-11-08 17:25:07,656 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)) (.cse4 (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_1830 (Array Int Int))) (or (not (= v_ArrVal_1830 (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1830 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_1834 (Array Int Int)) (v_ArrVal_1828 Int) (v_ArrVal_1831 (Array Int Int))) (or (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1833 (Array Int Int)) (v_ArrVal_1844 (Array Int Int)) (v_ArrVal_1832 (Array Int Int)) (v_ArrVal_1837 (Array Int Int)) (v_ArrVal_1836 (Array Int Int))) (let ((.cse1 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1830) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1832) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1836) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3))) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| .cse1) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1834) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1835) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1844) (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1828)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1833) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1837) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3)) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))) (not (= (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1831) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_1834 .cse4)) v_ArrVal_1834)))))) (forall ((v_ArrVal_1830 (Array Int Int))) (or (not (= v_ArrVal_1830 (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1830 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_1834 (Array Int Int)) (v_ArrVal_1828 Int) (v_ArrVal_1831 (Array Int Int))) (or (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1833 (Array Int Int)) (v_ArrVal_1844 (Array Int Int)) (v_ArrVal_1832 (Array Int Int)) (v_ArrVal_1837 (Array Int Int)) (v_ArrVal_1836 (Array Int Int))) (let ((.cse5 (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1828)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1833) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1837) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3))) (or (= .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1834) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1835) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1844) .cse5) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1830) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1832) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1836) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3)) |c_ULTIMATE.start_main_~data_init~0#1|)))) (not (= (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1831) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_1834 .cse4)) v_ArrVal_1834)))))))) is different from false [2024-11-08 17:25:07,700 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:25:07,700 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 85 treesize of output 77 [2024-11-08 17:25:07,711 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 493 treesize of output 463 [2024-11-08 17:25:07,729 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 97 treesize of output 89 [2024-11-08 17:25:07,741 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 113 treesize of output 97 [2024-11-08 17:25:07,755 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 966 treesize of output 964 [2024-11-08 17:25:07,773 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 55 treesize of output 51 [2024-11-08 17:25:07,793 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 54 treesize of output 46 [2024-11-08 17:25:08,279 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 13 treesize of output 1 [2024-11-08 17:25:08,301 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 13 treesize of output 1 [2024-11-08 17:25:08,401 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 13 treesize of output 1 [2024-11-08 17:25:09,196 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:25:09,196 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 56 treesize of output 62 [2024-11-08 17:25:09,210 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 364 treesize of output 346 [2024-11-08 17:25:09,226 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 81 treesize of output 77 [2024-11-08 17:25:09,238 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 84 treesize of output 76 [2024-11-08 17:25:09,250 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 1091 treesize of output 1089 [2024-11-08 17:25:09,269 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 85 treesize of output 77 [2024-11-08 17:25:09,290 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 83 treesize of output 67 [2024-11-08 17:25:09,668 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 13 treesize of output 1 [2024-11-08 17:25:09,793 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 13 treesize of output 1 [2024-11-08 17:25:09,863 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 13 treesize of output 1 [2024-11-08 17:25:11,033 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse15 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse4 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse6 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse3 (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse31 (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1834 (Array Int Int)) (v_ArrVal_1844 (Array Int Int)) (v_arrayElimCell_96 Int) (v_arrayElimCell_99 Int)) (let ((.cse56 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1834) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1835) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1844))) (or (= (select (select .cse56 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_1834 (store .cse6 .cse3 (select v_ArrVal_1834 .cse3)))) (= (select (select .cse56 v_arrayElimCell_96) v_arrayElimCell_99) |c_ULTIMATE.start_main_~data_init~0#1|))))) (.cse27 (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse1 (not .cse4)) (.cse42 (forall ((v_ArrVal_1834 (Array Int Int)) (v_arrayElimCell_105 Int)) (or (not (= v_ArrVal_1834 (store .cse6 .cse3 (select v_ArrVal_1834 .cse3)))) (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1844 (Array Int Int)) (v_arrayElimCell_102 Int)) (let ((.cse55 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1834) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1835) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1844))) (or (= (select (select .cse55 v_arrayElimCell_102) v_arrayElimCell_105) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse55 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (.cse29 (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1834 (Array Int Int)) (v_ArrVal_1844 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1834) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1835) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1844) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_1834 (store .cse6 .cse3 (select v_ArrVal_1834 .cse3))))))) (.cse7 (not .cse15))) (let ((.cse18 (or (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1834 (Array Int Int)) (v_ArrVal_1844 (Array Int Int)) (v_arrayElimCell_103 Int) (v_arrayElimCell_106 Int)) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1834) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1835) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1844) v_arrayElimCell_103) v_arrayElimCell_106)) (not (= v_ArrVal_1834 (store .cse6 .cse3 (select v_ArrVal_1834 .cse3)))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_arrayElimCell_106))) .cse7)) (.cse20 (or (and .cse42 .cse29) .cse15)) (.cse19 (forall ((v_arrayElimCell_106 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_arrayElimCell_106) (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1834 (Array Int Int)) (v_ArrVal_1844 (Array Int Int)) (v_arrayElimCell_103 Int)) (let ((.cse54 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1834) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1835) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1844))) (or (= (select (select .cse54 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse54 v_arrayElimCell_103) v_arrayElimCell_106)) (not (= v_ArrVal_1834 (store .cse6 .cse3 (select v_ArrVal_1834 .cse3)))))))))) (.cse21 (forall ((v_arrayElimCell_106 Int)) (or (forall ((v_ArrVal_1834 (Array Int Int)) (v_arrayElimCell_105 Int)) (or (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1844 (Array Int Int)) (v_arrayElimCell_102 Int) (v_arrayElimCell_103 Int)) (let ((.cse53 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1834) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1835) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1844))) (or (= (select (select .cse53 v_arrayElimCell_102) v_arrayElimCell_105) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse53 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse53 v_arrayElimCell_103) v_arrayElimCell_106))))) (not (= v_ArrVal_1834 (store .cse6 .cse3 (select v_ArrVal_1834 .cse3)))))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_arrayElimCell_106)))) (.cse14 (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1834 (Array Int Int)) (v_arrayElimCell_96 Int) (v_ArrVal_1844 (Array Int Int)) (v_ArrVal_1831 (Array Int Int)) (v_arrayElimCell_99 Int)) (let ((.cse52 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1834) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1835) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1844))) (or (= (select (select .cse52 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse52 v_arrayElimCell_96) v_arrayElimCell_99) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimCell_96) (not (= (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1831) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 (select v_ArrVal_1834 .cse3)) v_ArrVal_1834)))))) (.cse16 (or (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1834 (Array Int Int)) (v_ArrVal_1844 (Array Int Int)) (v_arrayElimCell_103 Int) (v_arrayElimCell_106 Int)) (let ((.cse51 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1834) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1835) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1844))) (or (= (select (select .cse51 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse51 v_arrayElimCell_103) v_arrayElimCell_106)) (not (= v_ArrVal_1834 (store .cse6 .cse3 (select v_ArrVal_1834 .cse3)))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_arrayElimCell_106)))) .cse4)) (.cse22 (or .cse4 .cse29)) (.cse23 (or (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1834 (Array Int Int)) (v_ArrVal_1844 (Array Int Int)) (v_arrayElimCell_102 Int) (v_arrayElimCell_105 Int)) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1834) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1835) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1844) v_arrayElimCell_102) v_arrayElimCell_105) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_arrayElimCell_105))) .cse1)) (.cse24 (forall ((v_arrayElimCell_105 Int)) (or (forall ((v_ArrVal_1834 (Array Int Int)) (v_ArrVal_1831 (Array Int Int))) (or (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1844 (Array Int Int)) (v_arrayElimCell_102 Int)) (let ((.cse50 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1834) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1835) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1844))) (or (= (select (select .cse50 v_arrayElimCell_102) v_arrayElimCell_105) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse50 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|)))) (not (= (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1831) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 (select v_ArrVal_1834 .cse3)) v_ArrVal_1834)))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_arrayElimCell_105)))) (.cse26 (and .cse27 .cse1)) (.cse9 (or .cse15 .cse29)) (.cse10 (forall ((v_arrayElimCell_97 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimCell_97) (forall ((v_ArrVal_1834 (Array Int Int)) (v_arrayElimCell_96 Int)) (or (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1844 (Array Int Int)) (v_arrayElimCell_99 Int)) (let ((.cse49 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1834) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1835) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1844))) (or (= (select (select .cse49 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse49 v_arrayElimCell_96) v_arrayElimCell_99) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_arrayElimCell_100 Int)) (= (select (select .cse49 v_arrayElimCell_97) v_arrayElimCell_100) |c_ULTIMATE.start_main_~data_init~0#1|))))) (not (= v_ArrVal_1834 (store .cse6 .cse3 (select v_ArrVal_1834 .cse3))))))))) (.cse11 (or .cse31 .cse15)) (.cse12 (or (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1834 (Array Int Int)) (v_ArrVal_1844 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_97 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimCell_97) (not (= v_ArrVal_1834 (store .cse6 .cse3 (select v_ArrVal_1834 .cse3)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1834) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1835) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1844) v_arrayElimCell_97) v_arrayElimCell_100) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse7)) (.cse13 (forall ((v_arrayElimCell_97 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimCell_97) (forall ((v_ArrVal_1834 (Array Int Int))) (or (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1844 (Array Int Int))) (let ((.cse48 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1834) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1835) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1844))) (or (= (select (select .cse48 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_arrayElimCell_100 Int)) (= (select (select .cse48 v_arrayElimCell_97) v_arrayElimCell_100) |c_ULTIMATE.start_main_~data_init~0#1|))))) (not (= v_ArrVal_1834 (store .cse6 .cse3 (select v_ArrVal_1834 .cse3)))))))))) (and (or (and (or (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1834 (Array Int Int)) (v_ArrVal_1844 (Array Int Int)) (v_arrayElimCell_96 Int) (v_arrayElimCell_100 Int) (v_arrayElimCell_97 Int) (v_arrayElimCell_99 Int)) (let ((.cse0 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1834) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1835) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1844))) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimCell_97) (= (select (select .cse0 v_arrayElimCell_96) v_arrayElimCell_99) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse0 v_arrayElimCell_97) v_arrayElimCell_100) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse1) (forall ((v_arrayElimCell_97 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimCell_97) (forall ((v_ArrVal_1834 (Array Int Int)) (v_arrayElimCell_96 Int) (v_ArrVal_1831 (Array Int Int))) (or (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1844 (Array Int Int)) (v_arrayElimCell_99 Int)) (let ((.cse2 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1834) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1835) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1844))) (or (= (select (select .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse2 v_arrayElimCell_96) v_arrayElimCell_99) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_arrayElimCell_100 Int)) (= (select (select .cse2 v_arrayElimCell_97) v_arrayElimCell_100) |c_ULTIMATE.start_main_~data_init~0#1|))))) (not (= (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1831) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 (select v_ArrVal_1834 .cse3)) v_ArrVal_1834)))))) (or .cse4 (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1834 (Array Int Int)) (v_ArrVal_1844 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_97 Int)) (let ((.cse5 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1834) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1835) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1844))) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimCell_97) (= (select (select .cse5 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_1834 (store .cse6 .cse3 (select v_ArrVal_1834 .cse3)))) (= (select (select .cse5 v_arrayElimCell_97) v_arrayElimCell_100) |c_ULTIMATE.start_main_~data_init~0#1|))))) (forall ((v_arrayElimCell_97 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimCell_97) (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1834 (Array Int Int)) (v_ArrVal_1844 (Array Int Int)) (v_ArrVal_1831 (Array Int Int)) (v_arrayElimCell_100 Int)) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1834) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1835) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1844) v_arrayElimCell_97) v_arrayElimCell_100) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1831) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 (select v_ArrVal_1834 .cse3)) v_ArrVal_1834))))))) .cse7) (forall ((v_arrayElimCell_97 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimCell_97) (forall ((v_arrayElimCell_96 Int)) (or (forall ((v_ArrVal_1834 (Array Int Int)) (v_ArrVal_1831 (Array Int Int))) (or (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1844 (Array Int Int)) (v_arrayElimCell_99 Int)) (let ((.cse8 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1834) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1835) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1844))) (or (= (select (select .cse8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse8 v_arrayElimCell_96) v_arrayElimCell_99) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_arrayElimCell_100 Int)) (= (select (select .cse8 v_arrayElimCell_97) v_arrayElimCell_100) |c_ULTIMATE.start_main_~data_init~0#1|))))) (not (= (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1831) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 (select v_ArrVal_1834 .cse3)) v_ArrVal_1834)))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimCell_96))))) (or (and .cse9 .cse10 .cse11 .cse12 .cse13) .cse4) (or (and .cse9 .cse13) .cse4) (or .cse14 .cse15) (or (and .cse16 (forall ((v_arrayElimCell_106 Int)) (or (forall ((v_arrayElimCell_105 Int)) (or (forall ((v_ArrVal_1834 (Array Int Int)) (v_ArrVal_1831 (Array Int Int))) (or (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1844 (Array Int Int)) (v_arrayElimCell_102 Int) (v_arrayElimCell_103 Int)) (let ((.cse17 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1834) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1835) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1844))) (or (= (select (select .cse17 v_arrayElimCell_102) v_arrayElimCell_105) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse17 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse17 v_arrayElimCell_103) v_arrayElimCell_106))))) (not (= (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1831) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 (select v_ArrVal_1834 .cse3)) v_ArrVal_1834)))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_arrayElimCell_105))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_arrayElimCell_106))) (or (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1834 (Array Int Int)) (v_ArrVal_1844 (Array Int Int)) (v_ArrVal_1831 (Array Int Int)) (v_arrayElimCell_103 Int) (v_arrayElimCell_106 Int)) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1834) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1835) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1844) v_arrayElimCell_103) v_arrayElimCell_106)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_arrayElimCell_106) (not (= (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1831) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 (select v_ArrVal_1834 .cse3)) v_ArrVal_1834)))) .cse7) (or (and .cse18 .cse19 .cse20 .cse21) .cse4) (or .cse15 (and .cse22 .cse23 .cse24)) (or (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1834 (Array Int Int)) (v_ArrVal_1844 (Array Int Int)) (v_arrayElimCell_102 Int) (v_arrayElimCell_103 Int) (v_arrayElimCell_106 Int) (v_arrayElimCell_105 Int)) (let ((.cse25 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1834) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1835) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1844))) (or (= (select (select .cse25 v_arrayElimCell_102) v_arrayElimCell_105) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse25 v_arrayElimCell_103) v_arrayElimCell_106)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_arrayElimCell_105) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_arrayElimCell_106)))) .cse1)) .cse26) (or (and (or .cse27 (and .cse18 (or .cse15 (and (forall ((v_arrayElimCell_105 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_arrayElimCell_105) (forall ((v_ArrVal_1834 (Array Int Int))) (or (not (= v_ArrVal_1834 (store .cse6 .cse3 (select v_ArrVal_1834 .cse3)))) (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1844 (Array Int Int)) (v_arrayElimCell_102 Int)) (let ((.cse28 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1834) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1835) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1844))) (or (= (select (select .cse28 v_arrayElimCell_102) v_arrayElimCell_105) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse28 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) .cse29)) (forall ((v_arrayElimCell_106 Int)) (or (forall ((v_arrayElimCell_105 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_arrayElimCell_105) (forall ((v_ArrVal_1834 (Array Int Int))) (or (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1844 (Array Int Int)) (v_arrayElimCell_102 Int) (v_arrayElimCell_103 Int)) (let ((.cse30 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1834) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1835) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1844))) (or (= (select (select .cse30 v_arrayElimCell_102) v_arrayElimCell_105) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse30 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse30 v_arrayElimCell_103) v_arrayElimCell_106))))) (not (= v_ArrVal_1834 (store .cse6 .cse3 (select v_ArrVal_1834 .cse3)))))))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_arrayElimCell_106))) .cse19 .cse20 .cse21)) (or (and (forall ((v_arrayElimCell_106 Int)) (or (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1834 (Array Int Int)) (v_ArrVal_1844 (Array Int Int)) (v_arrayElimCell_103 Int)) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1834) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1835) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1844) v_arrayElimCell_103) v_arrayElimCell_106)) (not (= v_ArrVal_1834 (store .cse6 .cse3 (select v_ArrVal_1834 .cse3)))))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_arrayElimCell_106))) .cse19 .cse21) .cse7)) .cse4) (or .cse15 (let ((.cse32 (forall ((v_ArrVal_1834 (Array Int Int)) (v_arrayElimCell_97 Int)) (or (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1844 (Array Int Int))) (let ((.cse36 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1834) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1835) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1844))) (or (= (select (select .cse36 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_arrayElimCell_100 Int)) (= (select (select .cse36 v_arrayElimCell_97) v_arrayElimCell_100) |c_ULTIMATE.start_main_~data_init~0#1|))))) (not (= v_ArrVal_1834 (store .cse6 .cse3 (select v_ArrVal_1834 .cse3)))))))) (and (or .cse4 (and .cse31 .cse32 (forall ((v_ArrVal_1834 (Array Int Int)) (v_arrayElimCell_96 Int) (v_arrayElimCell_97 Int)) (or (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1844 (Array Int Int)) (v_arrayElimCell_99 Int)) (let ((.cse33 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1834) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1835) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1844))) (or (= (select (select .cse33 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse33 v_arrayElimCell_96) v_arrayElimCell_99) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_arrayElimCell_100 Int)) (= (select (select .cse33 v_arrayElimCell_97) v_arrayElimCell_100) |c_ULTIMATE.start_main_~data_init~0#1|))))) (not (= v_ArrVal_1834 (store .cse6 .cse3 (select v_ArrVal_1834 .cse3)))))) .cse29)) .cse14 (forall ((v_arrayElimCell_96 Int) (v_arrayElimCell_97 Int)) (or (forall ((v_ArrVal_1834 (Array Int Int)) (v_ArrVal_1831 (Array Int Int))) (or (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1844 (Array Int Int)) (v_arrayElimCell_99 Int)) (let ((.cse34 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1834) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1835) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1844))) (or (= (select (select .cse34 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse34 v_arrayElimCell_96) v_arrayElimCell_99) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_arrayElimCell_100 Int)) (= (select (select .cse34 v_arrayElimCell_97) v_arrayElimCell_100) |c_ULTIMATE.start_main_~data_init~0#1|))))) (not (= (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1831) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 (select v_ArrVal_1834 .cse3)) v_ArrVal_1834)))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimCell_96))) (or (and (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1834 (Array Int Int)) (v_ArrVal_1844 (Array Int Int)) (v_arrayElimCell_96 Int) (v_arrayElimCell_99 Int)) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1834) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1835) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1844) v_arrayElimCell_96) v_arrayElimCell_99) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimCell_96))) (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1834 (Array Int Int)) (v_ArrVal_1844 (Array Int Int)) (v_arrayElimCell_96 Int) (v_arrayElimCell_100 Int) (v_arrayElimCell_97 Int) (v_arrayElimCell_99 Int)) (let ((.cse35 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1834) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1835) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1844))) (or (= (select (select .cse35 v_arrayElimCell_96) v_arrayElimCell_99) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse35 v_arrayElimCell_97) v_arrayElimCell_100) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimCell_96))))) .cse1) (or (and .cse32 .cse29) .cse4)))) (or (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1834 (Array Int Int)) (v_ArrVal_1844 (Array Int Int)) (v_ArrVal_1831 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_97 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimCell_97) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1834) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1835) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1844) v_arrayElimCell_97) v_arrayElimCell_100) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1831) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 (select v_ArrVal_1834 .cse3)) v_ArrVal_1834)))) .cse7) (or (and (forall ((v_arrayElimCell_97 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimCell_97) (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1834 (Array Int Int)) (v_ArrVal_1844 (Array Int Int)) (v_arrayElimCell_96 Int) (v_arrayElimCell_100 Int) (v_arrayElimCell_99 Int)) (let ((.cse37 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1834) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1835) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1844))) (or (= (select (select .cse37 v_arrayElimCell_96) v_arrayElimCell_99) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse37 v_arrayElimCell_97) v_arrayElimCell_100) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimCell_96)))))) (or (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1834 (Array Int Int)) (v_arrayElimCell_96 Int) (v_ArrVal_1844 (Array Int Int)) (v_arrayElimCell_99 Int)) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1834) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1835) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1844) v_arrayElimCell_96) v_arrayElimCell_99) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimCell_96))) .cse15)) .cse1) (or (and .cse16 (forall ((v_arrayElimCell_106 Int)) (or (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1834 (Array Int Int)) (v_ArrVal_1844 (Array Int Int)) (v_ArrVal_1831 (Array Int Int)) (v_arrayElimCell_103 Int)) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1834) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1835) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1844) v_arrayElimCell_103) v_arrayElimCell_106)) (not (= (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1831) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 (select v_ArrVal_1834 .cse3)) v_ArrVal_1834)))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_arrayElimCell_106))) (or (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1834 (Array Int Int)) (v_ArrVal_1844 (Array Int Int)) (v_arrayElimCell_102 Int) (v_arrayElimCell_103 Int) (v_arrayElimCell_106 Int) (v_arrayElimCell_105 Int)) (let ((.cse38 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1834) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1835) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1844))) (or (= (select (select .cse38 v_arrayElimCell_102) v_arrayElimCell_105) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse38 v_arrayElimCell_103) v_arrayElimCell_106)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_arrayElimCell_106)))) .cse1) (forall ((v_arrayElimCell_106 Int)) (or (forall ((v_ArrVal_1834 (Array Int Int)) (v_ArrVal_1831 (Array Int Int)) (v_arrayElimCell_105 Int)) (or (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1844 (Array Int Int)) (v_arrayElimCell_102 Int) (v_arrayElimCell_103 Int)) (let ((.cse39 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1834) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1835) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1844))) (or (= (select (select .cse39 v_arrayElimCell_102) v_arrayElimCell_105) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse39 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse39 v_arrayElimCell_103) v_arrayElimCell_106))))) (not (= (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1831) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 (select v_ArrVal_1834 .cse3)) v_ArrVal_1834)))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_arrayElimCell_106)))) .cse7) (or (let ((.cse40 (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1834 (Array Int Int)) (v_ArrVal_1844 (Array Int Int)) (v_arrayElimCell_103 Int) (v_arrayElimCell_106 Int)) (let ((.cse45 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1834) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1835) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1844))) (or (= (select (select .cse45 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse45 v_arrayElimCell_103) v_arrayElimCell_106)) (not (= v_ArrVal_1834 (store .cse6 .cse3 (select v_ArrVal_1834 .cse3))))))))) (and .cse22 (or (and .cse40 (forall ((v_ArrVal_1834 (Array Int Int)) (v_arrayElimCell_106 Int) (v_arrayElimCell_105 Int)) (or (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1844 (Array Int Int)) (v_arrayElimCell_102 Int) (v_arrayElimCell_103 Int)) (let ((.cse41 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1834) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1835) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1844))) (or (= (select (select .cse41 v_arrayElimCell_102) v_arrayElimCell_105) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse41 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse41 v_arrayElimCell_103) v_arrayElimCell_106))))) (not (= v_ArrVal_1834 (store .cse6 .cse3 (select v_ArrVal_1834 .cse3)))))) .cse42 .cse29) .cse4) (forall ((v_arrayElimCell_106 Int) (v_arrayElimCell_105 Int)) (or (forall ((v_ArrVal_1834 (Array Int Int)) (v_ArrVal_1831 (Array Int Int))) (or (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1844 (Array Int Int)) (v_arrayElimCell_102 Int) (v_arrayElimCell_103 Int)) (let ((.cse43 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1834) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1835) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1844))) (or (= (select (select .cse43 v_arrayElimCell_102) v_arrayElimCell_105) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse43 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse43 v_arrayElimCell_103) v_arrayElimCell_106))))) (not (= (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1831) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 (select v_ArrVal_1834 .cse3)) v_ArrVal_1834)))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_arrayElimCell_105))) .cse23 (or (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1834 (Array Int Int)) (v_ArrVal_1844 (Array Int Int)) (v_arrayElimCell_102 Int) (v_arrayElimCell_103 Int) (v_arrayElimCell_106 Int) (v_arrayElimCell_105 Int)) (let ((.cse44 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1834) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1835) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1844))) (or (= (select (select .cse44 v_arrayElimCell_102) v_arrayElimCell_105) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse44 v_arrayElimCell_103) v_arrayElimCell_106)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_arrayElimCell_105)))) .cse1) (or .cse40 .cse4) .cse24)) .cse15 .cse26) (or .cse4 (and .cse9 .cse10 (or (forall ((v_arrayElimCell_97 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimCell_97) (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1834 (Array Int Int)) (v_ArrVal_1844 (Array Int Int)) (v_arrayElimCell_100 Int)) (or (not (= v_ArrVal_1834 (store .cse6 .cse3 (select v_ArrVal_1834 .cse3)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1834) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1835) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1844) v_arrayElimCell_97) v_arrayElimCell_100) |c_ULTIMATE.start_main_~data_init~0#1|))))) .cse7) (or .cse15 (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1834 (Array Int Int)) (v_arrayElimCell_96 Int) (v_ArrVal_1844 (Array Int Int)) (v_arrayElimCell_99 Int)) (let ((.cse46 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1834) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1835) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1844))) (or (= (select (select .cse46 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_1834 (store .cse6 .cse3 (select v_ArrVal_1834 .cse3)))) (= (select (select .cse46 v_arrayElimCell_96) v_arrayElimCell_99) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimCell_96))))) .cse11 .cse12 .cse13 (forall ((v_arrayElimCell_97 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimCell_97) (forall ((v_arrayElimCell_96 Int)) (or (forall ((v_ArrVal_1834 (Array Int Int))) (or (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1844 (Array Int Int)) (v_arrayElimCell_99 Int)) (let ((.cse47 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1834) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1835) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1844))) (or (= (select (select .cse47 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse47 v_arrayElimCell_96) v_arrayElimCell_99) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_arrayElimCell_100 Int)) (= (select (select .cse47 v_arrayElimCell_97) v_arrayElimCell_100) |c_ULTIMATE.start_main_~data_init~0#1|))))) (not (= v_ArrVal_1834 (store .cse6 .cse3 (select v_ArrVal_1834 .cse3)))))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimCell_96))))))))))) is different from false [2024-11-08 17:25:50,871 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:25:50,963 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-08 17:25:50,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 3907 treesize of output 3861 [2024-11-08 17:25:51,051 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:25:51,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 335 treesize of output 333 [2024-11-08 17:25:51,085 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:25:51,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 327 treesize of output 327 [2024-11-08 17:25:51,131 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:25:51,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 305 treesize of output 303 [2024-11-08 17:25:51,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 288 treesize of output 272 [2024-11-08 17:25:51,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2024-11-08 17:25:52,127 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:25:52,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 127 [2024-11-08 17:25:52,602 INFO L349 Elim1Store]: treesize reduction 30, result has 65.1 percent of original size [2024-11-08 17:25:52,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 4957 treesize of output 4924 [2024-11-08 17:25:52,769 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:25:52,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 366 treesize of output 372 [2024-11-08 17:25:52,955 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:25:52,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 707 treesize of output 715 [2024-11-08 17:25:53,063 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:25:53,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 681 treesize of output 673 [2024-11-08 17:25:53,203 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:25:53,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 751 treesize of output 761 [2024-11-08 17:25:53,346 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:25:53,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 546 treesize of output 534 [2024-11-08 17:25:53,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 6 treesize of output 4 [2024-11-08 17:26:21,435 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 17:26:21,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 8 treesize of output 4 [2024-11-08 17:26:21,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-08 17:26:21,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2024-11-08 17:26:21,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2024-11-08 17:26:21,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2024-11-08 17:26:21,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2024-11-08 17:26:21,635 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-08 17:26:21,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2024-11-08 17:26:21,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-08 17:26:21,768 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-08 17:26:21,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-08 17:26:21,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-08 17:26:21,904 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-08 17:26:22,113 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-08 17:26:22,269 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:26:22,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 269 treesize of output 247 [2024-11-08 17:26:22,702 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:26:22,777 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-08 17:26:22,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 92 [2024-11-08 17:26:22,818 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:26:22,819 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 1 case distinctions, treesize of input 128 treesize of output 128 [2024-11-08 17:26:22,835 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 122 treesize of output 116 [2024-11-08 17:26:22,972 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-08 17:26:23,066 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:26:23,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 37 treesize of output 41 [2024-11-08 17:26:23,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:26:23,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 345 treesize of output 344 [2024-11-08 17:26:23,159 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:26:23,183 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:26:23,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 220 treesize of output 218 [2024-11-08 17:26:23,212 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:26:23,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 104 [2024-11-08 17:26:23,239 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:26:23,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 148 [2024-11-08 17:26:23,862 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:26:23,870 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:26:24,014 INFO L349 Elim1Store]: treesize reduction 30, result has 65.1 percent of original size [2024-11-08 17:26:24,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1337 treesize of output 1344 [2024-11-08 17:26:24,113 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:26:24,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 492 treesize of output 500 [2024-11-08 17:26:24,167 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:26:24,167 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 464 treesize of output 456 [2024-11-08 17:26:24,244 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:26:24,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 589 treesize of output 599 [2024-11-08 17:26:24,294 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 24 treesize of output 20 [2024-11-08 17:26:24,374 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:26:24,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 388 treesize of output 394 [2024-11-08 17:26:25,146 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 6 treesize of output 4 [2024-11-08 17:26:27,176 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-08 17:26:27,307 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-08 17:26:27,389 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-08 17:26:27,485 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:26:27,485 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 47 treesize of output 51 [2024-11-08 17:26:44,969 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 21 treesize of output 17 [2024-11-08 17:26:44,999 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:26:45,007 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:26:45,156 INFO L349 Elim1Store]: treesize reduction 30, result has 65.1 percent of original size [2024-11-08 17:26:45,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1971 treesize of output 1970 [2024-11-08 17:26:45,222 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:26:45,275 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:26:45,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 347 treesize of output 355 [2024-11-08 17:26:45,366 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:26:45,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 394 treesize of output 404 [2024-11-08 17:26:45,399 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 296 treesize of output 280 [2024-11-08 17:26:45,493 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:26:45,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 291 treesize of output 297 [2024-11-08 17:26:46,256 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-08 17:26:47,090 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-08 17:26:47,192 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:26:47,193 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 60 treesize of output 64 [2024-11-08 17:26:52,089 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:26:52,089 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 215 treesize of output 215 [2024-11-08 17:26:52,604 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:26:52,622 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:26:52,623 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 1 case distinctions, treesize of input 46 treesize of output 46 [2024-11-08 17:26:52,642 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 47 treesize of output 43 [2024-11-08 17:26:52,665 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:26:52,666 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 50 [2024-11-08 17:26:52,684 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:26:52,684 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2024-11-08 17:26:52,705 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 12 treesize of output 8 [2024-11-08 17:26:52,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2024-11-08 17:26:52,761 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 21 treesize of output 17 [2024-11-08 17:26:52,805 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-08 17:26:52,826 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:26:52,835 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:26:52,919 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-08 17:26:52,919 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 1014 treesize of output 1000 [2024-11-08 17:26:52,968 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:26:52,968 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 117 treesize of output 115 [2024-11-08 17:26:52,999 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:26:53,017 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:26:53,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 156 [2024-11-08 17:26:53,050 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:26:53,051 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 199 treesize of output 199 [2024-11-08 17:26:53,210 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-08 17:26:53,799 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 44 treesize of output 38 [2024-11-08 17:26:53,835 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:26:53,846 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:26:53,855 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:26:53,996 INFO L349 Elim1Store]: treesize reduction 30, result has 65.1 percent of original size [2024-11-08 17:26:53,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1244 treesize of output 1251 [2024-11-08 17:26:54,061 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:26:54,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 171 treesize of output 177 [2024-11-08 17:26:54,125 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:26:54,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 99 [2024-11-08 17:26:54,249 INFO L349 Elim1Store]: treesize reduction 32, result has 59.5 percent of original size [2024-11-08 17:26:54,250 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 139 treesize of output 172 [2024-11-08 17:26:54,544 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 6 treesize of output 4 [2024-11-08 17:26:56,895 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-08 17:26:57,271 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-08 17:26:57,351 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:26:57,352 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 105 treesize of output 107 [2024-11-08 17:26:57,678 INFO L349 Elim1Store]: treesize reduction 48, result has 52.5 percent of original size [2024-11-08 17:26:57,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 441 treesize of output 470 [2024-11-08 17:27:01,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2024-11-08 17:27:02,333 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:27:02,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 371 treesize of output 375 [2024-11-08 17:27:06,100 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 22 treesize of output 18 [2024-11-08 17:27:06,135 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:27:06,263 INFO L349 Elim1Store]: treesize reduction 30, result has 65.1 percent of original size [2024-11-08 17:27:06,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 4864 treesize of output 4831 [2024-11-08 17:27:06,355 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:27:06,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 350 treesize of output 356 [2024-11-08 17:27:06,455 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:27:06,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 504 treesize of output 512 [2024-11-08 17:27:06,547 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:27:06,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 498 treesize of output 508 [2024-11-08 17:27:06,600 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:27:06,600 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 402 treesize of output 378 [2024-11-08 17:27:06,825 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 6 treesize of output 4 [2024-11-08 17:27:08,537 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:27:08,538 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 200 treesize of output 204