./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_remove_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_remove_all.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b594cdd667b896d6ce097f6fd96950290806f015d929f3b2b06ffea35d861f89 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 18:40:20,973 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 18:40:21,036 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-12-02 18:40:21,042 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 18:40:21,043 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 18:40:21,066 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 18:40:21,066 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 18:40:21,067 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 18:40:21,068 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 18:40:21,068 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 18:40:21,069 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 18:40:21,069 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 18:40:21,070 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 18:40:21,070 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 18:40:21,071 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 18:40:21,071 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 18:40:21,072 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 18:40:21,072 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 18:40:21,072 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 18:40:21,073 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 18:40:21,073 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 18:40:21,074 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 18:40:21,075 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 18:40:21,075 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 18:40:21,075 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 18:40:21,076 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 18:40:21,076 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 18:40:21,076 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 18:40:21,077 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 18:40:21,077 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 18:40:21,077 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 18:40:21,078 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 18:40:21,078 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 18:40:21,078 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 18:40:21,079 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 18:40:21,079 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 18:40:21,079 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 18:40:21,079 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 18:40:21,079 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 18:40:21,080 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 18:40:21,080 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 18:40:21,080 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 18:40:21,080 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 18:40:21,080 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 18:40:21,081 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 18:40:21,081 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 18:40:21,081 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 18:40:21,081 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 18:40:21,081 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/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_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b594cdd667b896d6ce097f6fd96950290806f015d929f3b2b06ffea35d861f89 [2023-12-02 18:40:21,300 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 18:40:21,327 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 18:40:21,330 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 18:40:21,331 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 18:40:21,331 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 18:40:21,332 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/list-simple/dll2n_remove_all.i [2023-12-02 18:40:24,007 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 18:40:24,226 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 18:40:24,227 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/sv-benchmarks/c/list-simple/dll2n_remove_all.i [2023-12-02 18:40:24,241 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/data/05158bae1/d48cf675766d438bb5e5659ff3fd6cb2/FLAG548318139 [2023-12-02 18:40:24,252 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/data/05158bae1/d48cf675766d438bb5e5659ff3fd6cb2 [2023-12-02 18:40:24,255 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 18:40:24,256 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 18:40:24,258 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 18:40:24,258 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 18:40:24,262 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 18:40:24,263 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:40:24" (1/1) ... [2023-12-02 18:40:24,264 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74c58280 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:40:24, skipping insertion in model container [2023-12-02 18:40:24,264 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:40:24" (1/1) ... [2023-12-02 18:40:24,307 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 18:40:24,584 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 18:40:24,593 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 18:40:24,632 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 18:40:24,663 INFO L206 MainTranslator]: Completed translation [2023-12-02 18:40:24,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:40:24 WrapperNode [2023-12-02 18:40:24,664 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 18:40:24,665 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 18:40:24,665 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 18:40:24,665 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 18:40:24,672 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:40:24" (1/1) ... [2023-12-02 18:40:24,686 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:40:24" (1/1) ... [2023-12-02 18:40:24,707 INFO L138 Inliner]: procedures = 126, calls = 32, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 84 [2023-12-02 18:40:24,708 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 18:40:24,709 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 18:40:24,709 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 18:40:24,709 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 18:40:24,718 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:40:24" (1/1) ... [2023-12-02 18:40:24,718 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:40:24" (1/1) ... [2023-12-02 18:40:24,722 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:40:24" (1/1) ... [2023-12-02 18:40:24,722 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:40:24" (1/1) ... [2023-12-02 18:40:24,730 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:40:24" (1/1) ... [2023-12-02 18:40:24,733 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:40:24" (1/1) ... [2023-12-02 18:40:24,735 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:40:24" (1/1) ... [2023-12-02 18:40:24,737 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:40:24" (1/1) ... [2023-12-02 18:40:24,740 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 18:40:24,740 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 18:40:24,741 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 18:40:24,741 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 18:40:24,742 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:40:24" (1/1) ... [2023-12-02 18:40:24,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 18:40:24,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:40:24,770 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 18:40:24,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 18:40:24,801 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-12-02 18:40:24,801 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-12-02 18:40:24,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 18:40:24,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 18:40:24,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 18:40:24,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 18:40:24,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 18:40:24,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 18:40:24,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 18:40:24,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-12-02 18:40:24,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 18:40:24,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 18:40:24,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 18:40:24,897 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 18:40:24,899 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 18:40:24,931 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-12-02 18:40:25,118 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 18:40:25,152 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 18:40:25,153 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-02 18:40:25,154 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:40:25 BoogieIcfgContainer [2023-12-02 18:40:25,154 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 18:40:25,156 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 18:40:25,157 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 18:40:25,159 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 18:40:25,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 06:40:24" (1/3) ... [2023-12-02 18:40:25,160 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@110095db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:40:25, skipping insertion in model container [2023-12-02 18:40:25,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:40:24" (2/3) ... [2023-12-02 18:40:25,160 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@110095db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:40:25, skipping insertion in model container [2023-12-02 18:40:25,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:40:25" (3/3) ... [2023-12-02 18:40:25,162 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_remove_all.i [2023-12-02 18:40:25,175 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 18:40:25,175 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2023-12-02 18:40:25,212 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 18:40:25,217 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2290dfa5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 18:40:25,217 INFO L358 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2023-12-02 18:40:25,220 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 27 states have (on average 2.185185185185185) internal successors, (59), 52 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:25,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-02 18:40:25,225 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:40:25,226 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-02 18:40:25,226 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-12-02 18:40:25,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:40:25,230 INFO L85 PathProgramCache]: Analyzing trace with hash 4514524, now seen corresponding path program 1 times [2023-12-02 18:40:25,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:40:25,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379194456] [2023-12-02 18:40:25,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:40:25,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:40:25,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:40:25,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:40:25,440 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:40:25,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379194456] [2023-12-02 18:40:25,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379194456] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:40:25,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:40:25,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 18:40:25,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142837447] [2023-12-02 18:40:25,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:40:25,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 18:40:25,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:40:25,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 18:40:25,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:40:25,480 INFO L87 Difference]: Start difference. First operand has 54 states, 27 states have (on average 2.185185185185185) internal successors, (59), 52 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:25,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:40:25,557 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2023-12-02 18:40:25,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 18:40:25,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-12-02 18:40:25,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:40:25,568 INFO L225 Difference]: With dead ends: 50 [2023-12-02 18:40:25,568 INFO L226 Difference]: Without dead ends: 46 [2023-12-02 18:40:25,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:40:25,573 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 12 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:40:25,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 53 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 18:40:25,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-02 18:40:25,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2023-12-02 18:40:25,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 45 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:25,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2023-12-02 18:40:25,605 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 4 [2023-12-02 18:40:25,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:40:25,605 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2023-12-02 18:40:25,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:25,606 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2023-12-02 18:40:25,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-02 18:40:25,606 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:40:25,606 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-02 18:40:25,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 18:40:25,607 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-12-02 18:40:25,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:40:25,607 INFO L85 PathProgramCache]: Analyzing trace with hash 4514525, now seen corresponding path program 1 times [2023-12-02 18:40:25,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:40:25,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517904556] [2023-12-02 18:40:25,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:40:25,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:40:25,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:40:25,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:40:25,713 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:40:25,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517904556] [2023-12-02 18:40:25,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517904556] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:40:25,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:40:25,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 18:40:25,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402008338] [2023-12-02 18:40:25,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:40:25,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 18:40:25,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:40:25,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 18:40:25,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:40:25,717 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:25,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:40:25,766 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2023-12-02 18:40:25,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 18:40:25,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-12-02 18:40:25,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:40:25,768 INFO L225 Difference]: With dead ends: 43 [2023-12-02 18:40:25,768 INFO L226 Difference]: Without dead ends: 43 [2023-12-02 18:40:25,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:40:25,770 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 8 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 18:40:25,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 52 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 18:40:25,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-12-02 18:40:25,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2023-12-02 18:40:25,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 42 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:25,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2023-12-02 18:40:25,777 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 4 [2023-12-02 18:40:25,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:40:25,777 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2023-12-02 18:40:25,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:25,778 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2023-12-02 18:40:25,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-02 18:40:25,778 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:40:25,778 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-02 18:40:25,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 18:40:25,779 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-12-02 18:40:25,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:40:25,779 INFO L85 PathProgramCache]: Analyzing trace with hash 4621321, now seen corresponding path program 1 times [2023-12-02 18:40:25,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:40:25,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407814651] [2023-12-02 18:40:25,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:40:25,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:40:25,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:40:25,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:40:25,835 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:40:25,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407814651] [2023-12-02 18:40:25,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407814651] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:40:25,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:40:25,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 18:40:25,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940635746] [2023-12-02 18:40:25,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:40:25,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 18:40:25,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:40:25,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 18:40:25,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:40:25,838 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:25,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:40:25,861 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2023-12-02 18:40:25,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 18:40:25,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-12-02 18:40:25,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:40:25,863 INFO L225 Difference]: With dead ends: 53 [2023-12-02 18:40:25,863 INFO L226 Difference]: Without dead ends: 53 [2023-12-02 18:40:25,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:40:25,865 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 10 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 18:40:25,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 76 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 18:40:25,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-12-02 18:40:25,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2023-12-02 18:40:25,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 25 states have (on average 1.88) internal successors, (47), 43 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:25,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2023-12-02 18:40:25,873 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 4 [2023-12-02 18:40:25,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:40:25,874 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2023-12-02 18:40:25,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:25,874 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2023-12-02 18:40:25,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 18:40:25,875 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:40:25,875 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:40:25,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 18:40:25,876 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-12-02 18:40:25,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:40:25,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1155614624, now seen corresponding path program 1 times [2023-12-02 18:40:25,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:40:25,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589656877] [2023-12-02 18:40:25,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:40:25,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:40:25,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:40:25,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:40:25,967 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:40:25,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589656877] [2023-12-02 18:40:25,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589656877] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:40:25,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:40:25,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 18:40:25,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346236514] [2023-12-02 18:40:25,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:40:25,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 18:40:25,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:40:25,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 18:40:25,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:40:25,970 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:25,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:40:25,999 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2023-12-02 18:40:25,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 18:40:25,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2023-12-02 18:40:25,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:40:26,000 INFO L225 Difference]: With dead ends: 50 [2023-12-02 18:40:26,000 INFO L226 Difference]: Without dead ends: 50 [2023-12-02 18:40:26,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:40:26,002 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 18:40:26,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 71 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 18:40:26,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-12-02 18:40:26,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2023-12-02 18:40:26,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 48 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:26,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2023-12-02 18:40:26,009 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 8 [2023-12-02 18:40:26,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:40:26,009 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2023-12-02 18:40:26,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:26,009 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2023-12-02 18:40:26,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 18:40:26,010 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:40:26,010 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:40:26,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 18:40:26,011 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-12-02 18:40:26,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:40:26,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1547470592, now seen corresponding path program 1 times [2023-12-02 18:40:26,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:40:26,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062582577] [2023-12-02 18:40:26,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:40:26,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:40:26,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:40:26,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:40:26,112 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:40:26,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062582577] [2023-12-02 18:40:26,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062582577] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:40:26,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147401086] [2023-12-02 18:40:26,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:40:26,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:40:26,113 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:40:26,114 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:40:26,121 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 18:40:26,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:40:26,221 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 18:40:26,225 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:40:26,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:40:26,275 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:40:26,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:40:26,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147401086] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:40:26,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1076208373] [2023-12-02 18:40:26,322 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2023-12-02 18:40:26,322 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 18:40:26,326 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 18:40:26,332 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 18:40:26,332 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 18:40:28,097 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 18:40:39,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1076208373] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:40:39,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:40:39,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [3, 3, 3] total 10 [2023-12-02 18:40:39,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087852032] [2023-12-02 18:40:39,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:40:39,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 18:40:39,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:40:39,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 18:40:39,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=68, Unknown=6, NotChecked=0, Total=110 [2023-12-02 18:40:39,505 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:41,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 18:40:44,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 18:40:46,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 18:40:49,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 18:40:52,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 18:40:53,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 18:40:55,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 18:40:58,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:40:58,096 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2023-12-02 18:40:58,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 18:40:58,097 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-12-02 18:40:58,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:40:58,098 INFO L225 Difference]: With dead ends: 60 [2023-12-02 18:40:58,098 INFO L226 Difference]: Without dead ends: 60 [2023-12-02 18:40:58,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=36, Invalid=68, Unknown=6, NotChecked=0, Total=110 [2023-12-02 18:40:58,099 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 4 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 4 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.6s IncrementalHoareTripleChecker+Time [2023-12-02 18:40:58,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 75 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 204 Invalid, 13 Unknown, 0 Unchecked, 18.6s Time] [2023-12-02 18:40:58,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-12-02 18:40:58,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2023-12-02 18:40:58,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.6216216216216217) internal successors, (60), 55 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:58,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2023-12-02 18:40:58,103 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 11 [2023-12-02 18:40:58,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:40:58,104 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2023-12-02 18:40:58,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:58,104 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2023-12-02 18:40:58,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-02 18:40:58,104 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:40:58,105 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-12-02 18:40:58,111 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 18:40:58,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:40:58,305 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-12-02 18:40:58,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:40:58,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1440507863, now seen corresponding path program 1 times [2023-12-02 18:40:58,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:40:58,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823898960] [2023-12-02 18:40:58,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:40:58,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:40:58,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:40:58,522 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:40:58,522 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:40:58,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823898960] [2023-12-02 18:40:58,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823898960] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:40:58,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834885132] [2023-12-02 18:40:58,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:40:58,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:40:58,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:40:58,527 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:40:58,529 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 18:40:58,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:40:58,617 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-02 18:40:58,621 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:40:58,647 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 [2023-12-02 18:40:58,735 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-12-02 18:40:58,735 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 [2023-12-02 18:40:58,767 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:40:58,768 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:40:58,937 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:40:58,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834885132] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:40:58,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1089438879] [2023-12-02 18:40:58,940 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2023-12-02 18:40:58,940 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 18:40:58,940 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 18:40:58,941 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 18:40:58,941 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 18:40:59,874 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 18:41:16,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1089438879] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:41:16,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:41:16,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4, 3, 4] total 13 [2023-12-02 18:41:16,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401389537] [2023-12-02 18:41:16,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:41:16,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 18:41:16,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:41:16,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 18:41:16,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=125, Unknown=9, NotChecked=0, Total=182 [2023-12-02 18:41:16,143 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 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) [2023-12-02 18:41:18,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 18:41:20,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 18:41:22,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 18:41:24,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 18:41:26,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 18:41:56,269 WARN L293 SmtUtils]: Spent 22.26s on a formula simplification. DAG size of input: 221 DAG size of output: 180 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 18:41:58,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 18:42:00,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 18:42:02,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 18:42:04,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 18:42:04,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:42:04,831 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2023-12-02 18:42:04,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 18:42:04,832 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 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 15 [2023-12-02 18:42:04,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:42:04,832 INFO L225 Difference]: With dead ends: 58 [2023-12-02 18:42:04,832 INFO L226 Difference]: Without dead ends: 58 [2023-12-02 18:42:04,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 45.5s TimeCoverageRelationStatistics Valid=58, Invalid=140, Unknown=12, NotChecked=0, Total=210 [2023-12-02 18:42:04,833 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.6s IncrementalHoareTripleChecker+Time [2023-12-02 18:42:04,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 66 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 11 Unknown, 0 Unchecked, 19.6s Time] [2023-12-02 18:42:04,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-12-02 18:42:04,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2023-12-02 18:42:04,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 38 states have (on average 1.605263157894737) internal successors, (61), 56 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:42:04,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2023-12-02 18:42:04,837 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 15 [2023-12-02 18:42:04,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:42:04,837 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2023-12-02 18:42:04,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 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) [2023-12-02 18:42:04,837 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2023-12-02 18:42:04,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-02 18:42:04,838 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:42:04,838 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:42:04,843 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 18:42:05,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:42:05,039 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-12-02 18:42:05,039 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:42:05,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1087536020, now seen corresponding path program 1 times [2023-12-02 18:42:05,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:42:05,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731679585] [2023-12-02 18:42:05,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:42:05,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:42:05,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:42:05,404 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 18:42:05,404 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:42:05,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731679585] [2023-12-02 18:42:05,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731679585] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:42:05,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401765051] [2023-12-02 18:42:05,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:42:05,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:42:05,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:42:05,406 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:42:05,412 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 18:42:05,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:42:05,511 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-02 18:42:05,514 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:42:05,526 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 [2023-12-02 18:42:05,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:42:05,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-12-02 18:42:05,624 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-12-02 18:42:05,624 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 [2023-12-02 18:42:05,680 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-02 18:42:05,680 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:42:05,819 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-02 18:42:05,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401765051] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:42:05,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1242724399] [2023-12-02 18:42:05,822 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2023-12-02 18:42:05,822 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 18:42:05,822 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 18:42:05,823 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 18:42:05,823 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 18:42:07,480 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 18:42:18,848 WARN L293 SmtUtils]: Spent 11.04s on a formula simplification. DAG size of input: 246 DAG size of output: 235 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 18:43:01,059 WARN L293 SmtUtils]: Spent 6.48s on a formula simplification. DAG size of input: 231 DAG size of output: 222 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 18:43:16,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1242724399] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:43:16,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:43:16,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [5, 3, 3] total 16 [2023-12-02 18:43:16,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036916687] [2023-12-02 18:43:16,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:43:16,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-02 18:43:16,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:43:16,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-02 18:43:16,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=184, Unknown=19, NotChecked=0, Total=306 [2023-12-02 18:43:16,293 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 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) [2023-12-02 18:43:21,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 18:43:23,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 18:43:25,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 18:43:28,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 18:43:30,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 18:43:32,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 18:43:34,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 18:43:37,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 18:43:39,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 18:44:15,187 WARN L293 SmtUtils]: Spent 13.88s on a formula simplification. DAG size of input: 299 DAG size of output: 147 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 18:44:17,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 18:44:19,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 18:44:55,355 WARN L293 SmtUtils]: Spent 21.96s on a formula simplification. DAG size of input: 221 DAG size of output: 180 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 18:44:57,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 18:45:00,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 18:45:02,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 18:45:04,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 18:45:06,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 18:45:13,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 18:45:16,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 18:45:21,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 18:45:24,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 18:45:24,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:45:24,788 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2023-12-02 18:45:24,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 18:45:24,789 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 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 19 [2023-12-02 18:45:24,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:45:24,789 INFO L225 Difference]: With dead ends: 72 [2023-12-02 18:45:24,790 INFO L226 Difference]: Without dead ends: 72 [2023-12-02 18:45:24,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 138.2s TimeCoverageRelationStatistics Valid=124, Invalid=223, Unknown=33, NotChecked=0, Total=380 [2023-12-02 18:45:24,791 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 16 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 7 mSolverCounterUnsat, 25 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 58.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 25 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 59.3s IncrementalHoareTripleChecker+Time [2023-12-02 18:45:24,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 71 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 334 Invalid, 25 Unknown, 0 Unchecked, 59.3s Time] [2023-12-02 18:45:24,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-12-02 18:45:24,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 59. [2023-12-02 18:45:24,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 42 states have (on average 1.5714285714285714) internal successors, (66), 58 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:45:24,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2023-12-02 18:45:24,797 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 19 [2023-12-02 18:45:24,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:45:24,797 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2023-12-02 18:45:24,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 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) [2023-12-02 18:45:24,797 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2023-12-02 18:45:24,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-02 18:45:24,798 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:45:24,798 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:45:24,802 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 18:45:24,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-12-02 18:45:24,999 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-12-02 18:45:24,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:45:24,999 INFO L85 PathProgramCache]: Analyzing trace with hash 646121778, now seen corresponding path program 1 times [2023-12-02 18:45:24,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:45:25,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985069651] [2023-12-02 18:45:25,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:45:25,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:45:25,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:45:25,188 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 18:45:25,188 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:45:25,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985069651] [2023-12-02 18:45:25,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985069651] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:45:25,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:45:25,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 18:45:25,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427822712] [2023-12-02 18:45:25,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:45:25,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 18:45:25,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:45:25,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 18:45:25,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-02 18:45:25,190 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:45:25,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:45:25,605 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2023-12-02 18:45:25,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 18:45:25,606 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 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 [2023-12-02 18:45:25,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:45:25,606 INFO L225 Difference]: With dead ends: 70 [2023-12-02 18:45:25,606 INFO L226 Difference]: Without dead ends: 70 [2023-12-02 18:45:25,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-12-02 18:45:25,607 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 37 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 18:45:25,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 89 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 18:45:25,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-12-02 18:45:25,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 59. [2023-12-02 18:45:25,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 42 states have (on average 1.5476190476190477) internal successors, (65), 58 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:45:25,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2023-12-02 18:45:25,614 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 20 [2023-12-02 18:45:25,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:45:25,614 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2023-12-02 18:45:25,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:45:25,615 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2023-12-02 18:45:25,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-02 18:45:25,615 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:45:25,615 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:45:25,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-02 18:45:25,616 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-12-02 18:45:25,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:45:25,616 INFO L85 PathProgramCache]: Analyzing trace with hash 646121779, now seen corresponding path program 1 times [2023-12-02 18:45:25,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:45:25,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434154353] [2023-12-02 18:45:25,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:45:25,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:45:25,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:45:25,937 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 18:45:25,937 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:45:25,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434154353] [2023-12-02 18:45:25,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434154353] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:45:25,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:45:25,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 18:45:25,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095396339] [2023-12-02 18:45:25,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:45:25,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 18:45:25,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:45:25,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 18:45:25,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-02 18:45:25,940 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:45:26,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:45:26,384 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2023-12-02 18:45:26,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 18:45:26,384 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 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 [2023-12-02 18:45:26,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:45:26,385 INFO L225 Difference]: With dead ends: 72 [2023-12-02 18:45:26,385 INFO L226 Difference]: Without dead ends: 72 [2023-12-02 18:45:26,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-12-02 18:45:26,386 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 39 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 18:45:26,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 108 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 18:45:26,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-12-02 18:45:26,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 59. [2023-12-02 18:45:26,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 58 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:45:26,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2023-12-02 18:45:26,392 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 20 [2023-12-02 18:45:26,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:45:26,393 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2023-12-02 18:45:26,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:45:26,393 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2023-12-02 18:45:26,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 18:45:26,394 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:45:26,394 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:45:26,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-02 18:45:26,395 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-12-02 18:45:26,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:45:26,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1847169488, now seen corresponding path program 1 times [2023-12-02 18:45:26,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:45:26,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55860002] [2023-12-02 18:45:26,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:45:26,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:45:26,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:45:27,140 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:45:27,140 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:45:27,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55860002] [2023-12-02 18:45:27,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55860002] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:45:27,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916813211] [2023-12-02 18:45:27,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:45:27,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:45:27,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:45:27,142 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:45:27,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 18:45:27,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:45:27,247 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 61 conjunts are in the unsatisfiable core [2023-12-02 18:45:27,250 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:45:27,306 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 [2023-12-02 18:45:27,487 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 18:45:27,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 18:45:27,576 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 13 treesize of output 9 [2023-12-02 18:45:27,589 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 13 treesize of output 9 [2023-12-02 18:45:27,672 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 22 [2023-12-02 18:45:27,691 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 22 [2023-12-02 18:45:27,849 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:45:27,849 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 71 treesize of output 64 [2023-12-02 18:45:27,866 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 39 treesize of output 20 [2023-12-02 18:45:28,544 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2023-12-02 18:45:28,544 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 110 treesize of output 45 [2023-12-02 18:45:28,618 INFO L349 Elim1Store]: treesize reduction 14, result has 57.6 percent of original size [2023-12-02 18:45:28,618 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 35 [2023-12-02 18:45:28,788 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:45:28,788 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:45:29,687 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:45:29,687 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 162 treesize of output 226 [2023-12-02 18:45:30,247 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_461 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_463 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_463))) (let ((.cse0 (select (select .cse3 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_461))) (let ((.cse4 (select (select .cse6 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ .cse0 4))) (let ((.cse1 (select (select .cse6 .cse4) .cse5))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse0)) (forall ((v_prenex_2 Int) (v_prenex_1 (Array Int Int)) (v_prenex_3 (Array Int Int))) (= .cse1 (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1))) (select .cse2 (select (select .cse2 v_prenex_2) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_2) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (= (select (select .cse3 .cse4) .cse5) 0) (not (= .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|))))))) (forall ((v_prenex_2 Int) (v_ArrVal_461 (Array Int Int)) (v_prenex_1 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_463 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1))) (let ((.cse8 (select (select .cse11 v_prenex_2) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_2) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse7 (select (select .cse11 .cse8) (+ .cse9 4)))) (or (= .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= .cse7 0) (not (= .cse8 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= .cse9 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= (select (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_461))) (select .cse10 (select (select .cse10 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_463) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) .cse7)))))) (or (forall ((v_prenex_2 Int) (v_prenex_1 (Array Int Int)) (v_prenex_3 (Array Int Int))) (= (select (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1))) (select .cse12 (select (select .cse12 v_prenex_2) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_2) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_463 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse14 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_463))) (let ((.cse13 (select (select .cse14 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse17 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_461))) (let ((.cse15 (select (select .cse17 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse16 (+ .cse13 4))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse13)) (= (select (select .cse14 .cse15) .cse16) 0) (not (= .cse15 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select (select .cse17 .cse15) .cse16) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))))) (forall ((v_ArrVal_461 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_463 (Array Int Int))) (let ((.cse21 (select (let ((.cse23 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_461))) (select .cse23 (select (select .cse23 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_463) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (or (forall ((v_prenex_2 Int) (v_prenex_1 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse22 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1))) (let ((.cse19 (select (select .cse22 v_prenex_2) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse20 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_2) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse18 (select (select .cse22 .cse19) (+ .cse20 4)))) (or (= .cse18 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= .cse18 0) (not (= .cse19 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= .cse20 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse21 .cse18)))))) (= .cse21 |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (or (forall ((v_prenex_2 Int) (v_prenex_1 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse27 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1))) (let ((.cse25 (select (select .cse27 v_prenex_2) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse26 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_2) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse24 (select (select .cse27 .cse25) (+ .cse26 4)))) (or (= .cse24 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= .cse24 0) (not (= .cse25 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= .cse26 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))) (forall ((v_ArrVal_461 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_463 (Array Int Int))) (= (select (let ((.cse28 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_461))) (select .cse28 (select (select .cse28 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_463) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) is different from false [2023-12-02 18:45:30,688 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse31 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse31 0))) (.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse31 0)))) (and (forall ((v_ArrVal_461 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_463 (Array Int Int))) (let ((.cse0 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_463))) (let ((.cse3 (select (select .cse0 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_461))) (let ((.cse1 (select (select .cse8 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ .cse3 4))) (let ((.cse4 (select (select .cse8 .cse1) .cse2))) (or (= (select (select .cse0 .cse1) .cse2) 0) (not (= .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1)) (= .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_prenex_2 Int) (v_prenex_1 (Array Int Int)) (v_prenex_3 (Array Int Int))) (= (select (let ((.cse5 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1))) (select .cse5 (select (select .cse5 v_prenex_2) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_2) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) .cse4)))))))) (or (forall ((v_prenex_2 Int) (v_prenex_1 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse12 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1))) (let ((.cse10 (select (select .cse12 v_prenex_2) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse11 (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_2) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (select (select .cse12 .cse10) (+ .cse11 4)))) (or (= .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse10 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= .cse11 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse9 0)))))) (forall ((v_ArrVal_461 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_463 (Array Int Int))) (= (select (let ((.cse13 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_461))) (select .cse13 (select (select .cse13 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_463) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (forall ((v_prenex_2 Int) (v_ArrVal_461 (Array Int Int)) (v_prenex_1 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_463 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse18 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1))) (let ((.cse15 (select (select .cse18 v_prenex_2) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse16 (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_2) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse14 (select (select .cse18 .cse15) (+ .cse16 4)))) (or (= .cse14 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse15 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= .cse16 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse14 (select (let ((.cse17 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_461))) (select .cse17 (select (select .cse17 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_463) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (= .cse14 0)))))) (or (forall ((v_prenex_2 Int) (v_prenex_1 (Array Int Int)) (v_prenex_3 (Array Int Int))) (= (select (let ((.cse19 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1))) (select .cse19 (select (select .cse19 v_prenex_2) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_2) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_463 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse20 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_463))) (let ((.cse23 (select (select .cse20 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse24 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_461))) (let ((.cse21 (select (select .cse24 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse22 (+ .cse23 4))) (or (= (select (select .cse20 .cse21) .cse22) 0) (not (= .cse23 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse21)) (= (select (select .cse24 .cse21) .cse22) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))))) (forall ((v_ArrVal_461 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_463 (Array Int Int))) (let ((.cse25 (select (let ((.cse30 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_461))) (select .cse30 (select (select .cse30 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_463) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (or (= .cse25 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_prenex_2 Int) (v_prenex_1 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse29 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1))) (let ((.cse27 (select (select .cse29 v_prenex_2) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse28 (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_2) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse26 (select (select .cse29 .cse27) (+ .cse28 4)))) (or (= .cse26 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse27 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= .cse28 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse26 .cse25) (= .cse26 0)))))))))))) is different from false [2023-12-02 18:45:30,746 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:45:30,747 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 308 treesize of output 253 [2023-12-02 18:45:31,485 INFO L349 Elim1Store]: treesize reduction 23, result has 86.4 percent of original size [2023-12-02 18:45:31,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 950 treesize of output 943 [2023-12-02 18:45:31,560 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:45:31,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 716 treesize of output 351 [2023-12-02 18:45:32,177 INFO L349 Elim1Store]: treesize reduction 210, result has 39.5 percent of original size [2023-12-02 18:45:32,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 27 case distinctions, treesize of input 1127 treesize of output 1080 [2023-12-02 18:45:32,288 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 396 treesize of output 354 [2023-12-02 18:45:32,330 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 278 treesize of output 268 [2023-12-02 18:45:33,320 INFO L349 Elim1Store]: treesize reduction 126, result has 64.3 percent of original size [2023-12-02 18:45:33,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 11 new quantified variables, introduced 36 case distinctions, treesize of input 1002 treesize of output 1042 [2023-12-02 18:45:33,548 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:45:33,549 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 601 treesize of output 557 [2023-12-02 18:45:33,681 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:45:33,682 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 425 treesize of output 387 [2023-12-02 18:45:38,211 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 18:45:39,064 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 17 treesize of output 9 [2023-12-02 18:45:41,927 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 18:45:42,066 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 18:45:42,860 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 18:45:43,012 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 18:45:44,194 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 18:45:44,673 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 18:45:45,302 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 18:45:45,657 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 18:45:46,345 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 18:45:46,959 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 18:46:12,170 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 18:46:12,539 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 18:46:12,752 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 18:46:13,762 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 18:46:14,245 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 18:46:14,516 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 18:46:15,446 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 42 treesize of output 34 [2023-12-02 18:46:15,700 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 42 treesize of output 34 [2023-12-02 18:46:15,844 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 42 treesize of output 34 [2023-12-02 18:46:16,008 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 42 treesize of output 34 [2023-12-02 18:46:16,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 0 case distinctions, treesize of input 42 treesize of output 34 [2023-12-02 18:46:16,402 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 42 treesize of output 34 [2023-12-02 18:46:18,769 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 42 treesize of output 34 [2023-12-02 18:46:18,925 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 42 treesize of output 34 [2023-12-02 18:46:19,142 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 42 treesize of output 34 [2023-12-02 18:46:19,409 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 42 treesize of output 34 [2023-12-02 18:46:19,677 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 42 treesize of output 34 [2023-12-02 18:46:19,782 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 42 treesize of output 34 [2023-12-02 18:46:19,973 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 42 treesize of output 34 [2023-12-02 18:46:23,206 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 18:46:23,356 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 18:46:23,821 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 18:46:24,046 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 18:46:24,468 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 18:46:24,706 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 18:46:26,795 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 18:46:27,376 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 15 treesize of output 9 [2023-12-02 18:46:27,457 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 15 treesize of output 9 [2023-12-02 18:46:27,632 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 15 treesize of output 9 [2023-12-02 18:46:27,716 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 15 treesize of output 9 [2023-12-02 18:46:28,976 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 [2023-12-02 18:46:29,061 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 18:46:29,311 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 42 treesize of output 34 [2023-12-02 18:46:29,487 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 42 treesize of output 34 [2023-12-02 18:46:29,628 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 42 treesize of output 34 [2023-12-02 18:46:29,792 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 42 treesize of output 34 [2023-12-02 18:46:29,970 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 42 treesize of output 34 [2023-12-02 18:46:30,104 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 42 treesize of output 34 [2023-12-02 18:46:30,487 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 18:46:30,759 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 18:46:31,020 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 18:46:31,308 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 18:46:31,565 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 18:46:31,762 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 18:47:02,544 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:47:02,544 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 2 case distinctions, treesize of input 75 treesize of output 81 [2023-12-02 18:47:03,987 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 17 treesize of output 9 [2023-12-02 18:47:07,707 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 18:47:24,092 INFO L349 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2023-12-02 18:47:24,092 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 31 treesize of output 35 [2023-12-02 18:47:25,835 INFO L349 Elim1Store]: treesize reduction 20, result has 73.3 percent of original size [2023-12-02 18:47:25,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 84 treesize of output 120 [2023-12-02 18:47:27,078 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 7 treesize of output 3 [2023-12-02 18:47:27,561 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 18:47:28,454 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 18:47:29,207 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:47:29,207 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 49 treesize of output 45 [2023-12-02 18:47:29,719 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:47:29,719 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 49 treesize of output 45 [2023-12-02 18:47:30,157 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 52 treesize of output 44 [2023-12-02 18:47:30,259 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 52 treesize of output 44 [2023-12-02 18:47:30,685 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 52 treesize of output 44 [2023-12-02 18:47:30,960 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 52 treesize of output 44 [2023-12-02 18:47:31,826 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 7 treesize of output 3 [2023-12-02 18:47:33,846 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 18:47:34,885 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 18:47:34,982 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 18:47:36,325 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 67 treesize of output 59 [2023-12-02 18:47:36,655 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 67 treesize of output 59 [2023-12-02 18:47:37,003 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 67 treesize of output 59 [2023-12-02 18:47:37,324 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 15 [2023-12-02 18:47:37,703 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 15 [2023-12-02 18:47:38,195 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 15 [2023-12-02 18:47:38,633 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 15 treesize of output 9 [2023-12-02 18:48:07,158 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 17 treesize of output 9 [2023-12-02 18:48:07,243 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 17 treesize of output 9 [2023-12-02 18:48:07,754 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 17 treesize of output 9 [2023-12-02 18:48:07,835 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 17 treesize of output 9 [2023-12-02 18:48:09,398 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 7 treesize of output 3 [2023-12-02 18:48:09,434 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 17 treesize of output 9 [2023-12-02 18:48:09,585 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 18:48:09,726 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 18:48:10,064 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 7 treesize of output 3 [2023-12-02 18:48:11,278 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 17 treesize of output 9 [2023-12-02 18:48:11,491 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 18:48:11,503 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 18:48:12,867 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 17 treesize of output 9 [2023-12-02 18:48:12,901 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 17 treesize of output 9 [2023-12-02 18:48:12,952 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 18:48:12,993 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 15 treesize of output 9 [2023-12-02 18:48:13,146 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:48:13,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 57 treesize of output 111 [2023-12-02 18:48:13,869 INFO L349 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2023-12-02 18:48:13,870 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 31 treesize of output 35 [2023-12-02 18:48:13,948 INFO L349 Elim1Store]: treesize reduction 14, result has 26.3 percent of original size [2023-12-02 18:48:13,948 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 2 case distinctions, treesize of input 27 treesize of output 22 [2023-12-02 18:48:13,984 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 15 treesize of output 9 [2023-12-02 18:48:14,005 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 15 treesize of output 9 [2023-12-02 18:48:14,014 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 13 treesize of output 9 [2023-12-02 18:48:14,054 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-12-02 18:48:14,055 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 50 treesize of output 1 [2023-12-02 18:48:14,102 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-12-02 18:48:14,102 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 379 treesize of output 1 [2023-12-02 18:48:14,113 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-12-02 18:48:14,113 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 240 treesize of output 1 [2023-12-02 18:48:14,124 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-12-02 18:48:14,124 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 240 treesize of output 1 [2023-12-02 18:48:14,135 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-12-02 18:48:14,136 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 308 treesize of output 1 [2023-12-02 18:48:14,463 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-02 18:48:14,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916813211] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:48:14,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1112148692] [2023-12-02 18:48:14,465 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2023-12-02 18:48:14,465 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 18:48:14,466 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 18:48:14,466 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 18:48:14,466 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 18:48:19,205 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 18:48:37,216 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1560#(and (<= 1 |#StackHeapBarrier|) (not (= (select |#valid| |ULTIMATE.start_dll_remove_first_~temp~1#1.base|) 1)) (= |ULTIMATE.start_dll_remove_first_~head#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_first_~head#1.base|) 0)) 1) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_dll_remove_first_#in~head#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_first_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_first_~head#1.base|) 0) 4)) |ULTIMATE.start_dll_remove_first_~temp~1#1.offset|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 4 (select |#length| |ULTIMATE.start_dll_remove_first_~head#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_dll_remove_first_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_create_#res#1.offset| 0) (or (not (= 0 |ULTIMATE.start_dll_remove_first_~temp~1#1.offset|)) (not (= |ULTIMATE.start_dll_remove_first_~temp~1#1.base| 0))) (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= |ULTIMATE.start_dll_remove_first_~head#1.base| |ULTIMATE.start_dll_remove_first_#in~head#1.base|) (= (select |#valid| |ULTIMATE.start_dll_remove_first_~head#1.base|) 1) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_first_~head#1.base|) 0) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_first_~head#1.base|) 0))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_first_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_first_~head#1.base|) 0) 4)) |ULTIMATE.start_dll_remove_first_~temp~1#1.base|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-12-02 18:48:37,216 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 18:48:37,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:48:37,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 35 [2023-12-02 18:48:37,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816164537] [2023-12-02 18:48:37,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:48:37,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-12-02 18:48:37,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:48:37,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-12-02 18:48:37,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1978, Unknown=8, NotChecked=182, Total=2352 [2023-12-02 18:48:37,219 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 36 states, 35 states have (on average 1.8285714285714285) internal successors, (64), 36 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:48:40,243 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse16 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse39 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) (.cse20 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse40 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (.cse18 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse19 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse17 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) (.cse10 (select .cse18 4)) (.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse18 .cse40 0))) (.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse20 .cse40 0))) (.cse21 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse9 (select .cse16 .cse39))) (and (forall ((v_ArrVal_461 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_463 (Array Int Int))) (let ((.cse0 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_463))) (let ((.cse3 (select (select .cse0 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_461))) (let ((.cse1 (select (select .cse8 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ .cse3 4))) (let ((.cse4 (select (select .cse8 .cse1) .cse2))) (or (= (select (select .cse0 .cse1) .cse2) 0) (not (= .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1)) (= .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_prenex_2 Int) (v_prenex_1 (Array Int Int)) (v_prenex_3 (Array Int Int))) (= (select (let ((.cse5 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1))) (select .cse5 (select (select .cse5 v_prenex_2) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_2) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) .cse4)))))))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (not (= .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |c_#valid| .cse10) 1) (or (forall ((v_prenex_2 Int) (v_prenex_1 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse14 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1))) (let ((.cse12 (select (select .cse14 v_prenex_2) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse13 (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_2) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse11 (select (select .cse14 .cse12) (+ .cse13 4)))) (or (= .cse11 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse12 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= .cse13 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse11 0)))))) (forall ((v_ArrVal_461 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_463 (Array Int Int))) (= (select (let ((.cse15 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_461))) (select .cse15 (select (select .cse15 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_463) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select .cse16 .cse17) 0) (= (select .cse18 .cse19) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select .cse20 .cse19) 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select .cse21 .cse17) 0) (= .cse10 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_prenex_2 Int) (v_ArrVal_461 (Array Int Int)) (v_prenex_1 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_463 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse26 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1))) (let ((.cse23 (select (select .cse26 v_prenex_2) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse24 (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_2) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse22 (select (select .cse26 .cse23) (+ .cse24 4)))) (or (= .cse22 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse23 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= .cse24 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse22 (select (let ((.cse25 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_461))) (select .cse25 (select (select .cse25 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_463) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (= .cse22 0)))))) (= (select |c_#valid| (select .cse16 4)) 1) (or (forall ((v_prenex_2 Int) (v_prenex_1 (Array Int Int)) (v_prenex_3 (Array Int Int))) (= (select (let ((.cse27 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1))) (select .cse27 (select (select .cse27 v_prenex_2) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_2) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_463 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse28 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_463))) (let ((.cse31 (select (select .cse28 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse32 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_461))) (let ((.cse29 (select (select .cse32 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse30 (+ .cse31 4))) (or (= (select (select .cse28 .cse29) .cse30) 0) (not (= .cse31 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse29)) (= (select (select .cse32 .cse29) .cse30) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))))) (forall ((v_ArrVal_461 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_463 (Array Int Int))) (let ((.cse33 (select (let ((.cse38 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_461))) (select .cse38 (select (select .cse38 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_463) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (or (= .cse33 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_prenex_2 Int) (v_prenex_1 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse37 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1))) (let ((.cse35 (select (select .cse37 v_prenex_2) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse36 (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_2) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse34 (select (select .cse37 .cse35) (+ .cse36 4)))) (or (= .cse34 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse35 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= .cse36 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse34 .cse33) (= .cse34 0))))))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select .cse21 .cse39) 0) (= (select |c_#valid| .cse9) 1)))) is different from false [2023-12-02 18:48:43,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:48:43,886 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2023-12-02 18:48:43,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-02 18:48:43,887 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.8285714285714285) internal successors, (64), 36 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-12-02 18:48:43,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:48:43,889 INFO L225 Difference]: With dead ends: 118 [2023-12-02 18:48:43,889 INFO L226 Difference]: Without dead ends: 118 [2023-12-02 18:48:43,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 975 ImplicationChecksByTransitivity, 24.7s TimeCoverageRelationStatistics Valid=459, Invalid=4191, Unknown=54, NotChecked=408, Total=5112 [2023-12-02 18:48:43,893 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 228 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 242 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:48:43,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 282 Invalid, 1164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 895 Invalid, 0 Unknown, 242 Unchecked, 2.1s Time] [2023-12-02 18:48:43,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-12-02 18:48:43,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 60. [2023-12-02 18:48:43,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 59 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:48:43,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2023-12-02 18:48:43,900 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 22 [2023-12-02 18:48:43,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:48:43,900 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2023-12-02 18:48:43,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.8285714285714285) internal successors, (64), 36 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:48:43,901 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2023-12-02 18:48:43,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 18:48:43,902 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:48:43,902 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:48:43,913 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 18:48:44,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-02 18:48:44,113 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-12-02 18:48:44,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:48:44,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1847169487, now seen corresponding path program 1 times [2023-12-02 18:48:44,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:48:44,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912785974] [2023-12-02 18:48:44,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:48:44,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:48:44,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:48:45,201 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:48:45,201 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:48:45,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912785974] [2023-12-02 18:48:45,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912785974] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:48:45,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52368613] [2023-12-02 18:48:45,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:48:45,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:48:45,202 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:48:45,203 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:48:45,205 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 18:48:45,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:48:45,300 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 60 conjunts are in the unsatisfiable core [2023-12-02 18:48:45,303 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:48:45,367 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 [2023-12-02 18:48:45,618 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 18:48:45,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 18:48:45,753 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 [2023-12-02 18:48:45,770 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 [2023-12-02 18:48:45,889 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 19 treesize of output 18 [2023-12-02 18:48:45,911 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 19 treesize of output 18 [2023-12-02 18:48:46,119 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 18:48:46,120 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 57 treesize of output 50 [2023-12-02 18:48:46,131 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 31 treesize of output 16 [2023-12-02 18:48:46,925 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:48:46,926 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 33 [2023-12-02 18:48:46,935 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:48:46,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 10 [2023-12-02 18:48:47,036 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:48:47,036 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:48:48,482 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:48:48,483 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 341 treesize of output 405 [2023-12-02 18:48:51,234 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 1))) (and (forall ((v_prenex_64 (Array Int Int)) (v_prenex_66 Int)) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_64))) (let ((.cse0 (select (select .cse6 v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (forall ((v_prenex_65 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_65))) (let ((.cse1 (select (select .cse3 v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (+ .cse1 4))) (let ((.cse2 (select (select .cse6 .cse0) .cse4))) (or (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (< (select (select .cse3 .cse0) .cse4) .cse5) (= .cse2 0))))))))))) (or (forall ((v_prenex_65 (Array Int Int)) (v_prenex_64 (Array Int Int)) (v_prenex_66 Int)) (= (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_64))) (select .cse7 (select (select .cse7 v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_65) v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (and (forall ((v_ArrVal_567 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse10 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_567))) (let ((.cse11 (select (select .cse10 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_568 (Array Int Int))) (let ((.cse8 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_568) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (select (select .cse10 .cse8) (+ .cse11 4)))) (or (not (= .cse8 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= .cse9 0) (< .cse9 .cse5))))) (not (= .cse11 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) (forall ((v_ArrVal_567 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse13 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_567))) (let ((.cse16 (select (select .cse13 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_568 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_568))) (let ((.cse12 (select (select .cse15 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse14 (+ .cse16 4))) (or (not (= .cse12 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select (select .cse13 .cse12) .cse14) 0) (= (select (select .cse15 .cse12) .cse14) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))) (not (= .cse16 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) (or (forall ((v_ArrVal_568 (Array Int Int)) (v_ArrVal_567 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (= (select (let ((.cse17 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_568))) (select .cse17 (select (select .cse17 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_567) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_prenex_65 (Array Int Int)) (v_prenex_64 (Array Int Int)) (v_prenex_66 Int)) (let ((.cse21 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_64))) (let ((.cse20 (select (select .cse21 v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse18 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_65) v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse19 (select (select .cse21 .cse20) (+ .cse18 4)))) (or (not (= .cse18 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse19 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= .cse19 0) (not (= .cse20 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))))) (forall ((v_prenex_65 (Array Int Int)) (v_prenex_64 (Array Int Int)) (v_prenex_66 Int)) (let ((.cse23 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_65))) (let ((.cse26 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_64)) (.cse22 (select (select .cse23 v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse25 (+ .cse22 4)) (.cse24 (select (select .cse26 v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse22 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (< (select (select .cse23 .cse24) .cse25) .cse5) (= (select (select .cse26 .cse24) .cse25) 0) (not (= .cse24 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))) (forall ((v_ArrVal_568 (Array Int Int)) (v_ArrVal_567 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse30 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_567))) (let ((.cse27 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_568) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse28 (select (select .cse30 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse29 (select (select .cse30 .cse27) (+ .cse28 4)))) (or (not (= .cse27 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= .cse28 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse29 0) (< .cse29 .cse5)))))) (forall ((v_ArrVal_568 (Array Int Int)) (v_ArrVal_567 (Array Int Int)) (v_prenex_65 (Array Int Int)) (v_prenex_64 (Array Int Int)) (v_prenex_66 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse34 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_65))) (let ((.cse31 (select (select .cse34 v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse37 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_64))) (let ((.cse35 (select (select .cse37 v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse36 (+ .cse31 4))) (let ((.cse32 (select (let ((.cse38 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_568))) (select .cse38 (select (select .cse38 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_567) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (.cse33 (select (select .cse37 .cse35) .cse36))) (or (not (= .cse31 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse32 .cse33) (< (select (select .cse34 .cse35) .cse36) .cse5) (= .cse32 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= .cse33 0) (not (= .cse35 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))))) (forall ((v_ArrVal_568 (Array Int Int)) (v_ArrVal_567 (Array Int Int)) (v_prenex_65 (Array Int Int)) (v_prenex_64 (Array Int Int)) (v_prenex_66 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse43 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_567))) (let ((.cse42 (select (select .cse43 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse45 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_568))) (let ((.cse39 (select (select .cse45 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse44 (+ .cse42 4))) (let ((.cse40 (select (select .cse45 .cse39) .cse44))) (or (not (= .cse39 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= .cse40 (select (let ((.cse41 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_64))) (select .cse41 (select (select .cse41 v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_65) v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= .cse42 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= (select (select .cse43 .cse39) .cse44) 0) (= .cse40 |c_ULTIMATE.start_dll_create_~head~0#1.base|))))))) (forall ((v_prenex_58 (Array Int Int)) (v_prenex_59 (Array Int Int)) (v_prenex_60 Int)) (let ((.cse46 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_59))) (let ((.cse49 (select (select .cse46 v_prenex_60) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse50 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_58))) (let ((.cse47 (select (select .cse50 v_prenex_60) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse48 (+ .cse49 4))) (or (< 0 (+ 9 (select (select .cse46 .cse47) .cse48))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse47)) (not (= .cse49 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= (select (select .cse50 .cse47) .cse48) 0)))))) (forall ((v_ArrVal_568 (Array Int Int)) (v_ArrVal_567 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse56 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_567))) (let ((.cse52 (select (select .cse56 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse54 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_568))) (let ((.cse51 (select (select .cse54 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse55 (+ .cse52 4))) (let ((.cse53 (select (select .cse56 .cse51) .cse55))) (or (not (= .cse51 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= .cse52 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse53 0) (= (select (select .cse54 .cse51) .cse55) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (< .cse53 .cse5))))))) (forall ((v_prenex_61 (Array Int Int)) (v_prenex_62 (Array Int Int)) (v_prenex_63 Int)) (let ((.cse59 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_62))) (let ((.cse58 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_61) v_prenex_63) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse57 (select (select .cse59 v_prenex_63) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse57)) (not (= .cse58 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< 0 (+ (select (select .cse59 .cse58) (+ 4 .cse57)) 9)))))) (forall ((v_ArrVal_568 (Array Int Int)) (v_ArrVal_567 (Array Int Int)) (v_prenex_65 (Array Int Int)) (v_prenex_64 (Array Int Int)) (v_prenex_66 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse63 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_65))) (let ((.cse60 (select (select .cse63 v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse66 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_64))) (let ((.cse64 (select (select .cse66 v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse65 (+ .cse60 4))) (let ((.cse62 (select (select .cse66 .cse64) .cse65))) (or (not (= .cse60 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= (select (let ((.cse61 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_568))) (select .cse61 (select (select .cse61 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_567) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) .cse62) (< (select (select .cse63 .cse64) .cse65) .cse5) (= .cse62 0) (not (= .cse64 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))))) (forall ((v_ArrVal_568 (Array Int Int)) (v_ArrVal_567 (Array Int Int)) (v_prenex_65 (Array Int Int)) (v_prenex_64 (Array Int Int)) (v_prenex_66 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse71 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_64))) (let ((.cse70 (select (select .cse71 v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse67 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_65) v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse69 (select (select .cse71 .cse70) (+ .cse67 4)))) (or (not (= .cse67 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= (select (let ((.cse68 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_568))) (select .cse68 (select (select .cse68 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_567) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) .cse69) (= .cse69 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= .cse69 0) (not (= .cse70 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))))) is different from false [2023-12-02 18:48:52,334 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse74 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse4 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 1)) (.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse74 0))) (.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse74 0)))) (and (forall ((v_prenex_65 (Array Int Int)) (v_prenex_64 (Array Int Int)) (v_prenex_66 Int)) (let ((.cse2 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_65))) (let ((.cse1 (select (select .cse2 v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_64))) (let ((.cse0 (select (select .cse5 v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ .cse1 4))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0)) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (< (select (select .cse2 .cse0) .cse3) .cse4) (= (select (select .cse5 .cse0) .cse3) 0)))))) (or (forall ((v_prenex_65 (Array Int Int)) (v_prenex_64 (Array Int Int)) (v_prenex_66 Int)) (= (select (let ((.cse8 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_64))) (select .cse8 (select (select .cse8 v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_65) v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (and (forall ((v_ArrVal_567 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse11 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_567))) (let ((.cse9 (select (select .cse11 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse9)) (forall ((v_ArrVal_568 (Array Int Int))) (let ((.cse13 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_568))) (let ((.cse10 (select (select .cse13 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse12 (+ .cse9 4))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse10)) (= (select (select .cse11 .cse10) .cse12) 0) (= (select (select .cse13 .cse10) .cse12) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))))))) (forall ((v_ArrVal_567 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse17 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_567))) (let ((.cse14 (select (select .cse17 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse14)) (forall ((v_ArrVal_568 (Array Int Int))) (let ((.cse16 (select (select (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_568) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse15 (select (select .cse17 .cse16) (+ .cse14 4)))) (or (< .cse15 .cse4) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse16)) (= .cse15 0))))))))))) (forall ((v_ArrVal_568 (Array Int Int)) (v_ArrVal_567 (Array Int Int)) (v_prenex_65 (Array Int Int)) (v_prenex_64 (Array Int Int)) (v_prenex_66 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse22 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_567))) (let ((.cse21 (select (select .cse22 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse24 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_568))) (let ((.cse20 (select (select .cse24 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse23 (+ .cse21 4))) (let ((.cse19 (select (select .cse24 .cse20) .cse23))) (or (= (select (let ((.cse18 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_64))) (select .cse18 (select (select .cse18 v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_65) v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) .cse19) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse20)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse21)) (= (select (select .cse22 .cse20) .cse23) 0) (= .cse19 |c_ULTIMATE.start_dll_create_~head~0#1.base|))))))) (forall ((v_ArrVal_568 (Array Int Int)) (v_ArrVal_567 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse28 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_567))) (let ((.cse26 (select (select (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_568) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse27 (select (select .cse28 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse25 (select (select .cse28 .cse26) (+ .cse27 4)))) (or (< .cse25 .cse4) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse26)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse27)) (= .cse25 0)))))) (forall ((v_ArrVal_568 (Array Int Int)) (v_ArrVal_567 (Array Int Int)) (v_prenex_65 (Array Int Int)) (v_prenex_64 (Array Int Int)) (v_prenex_66 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse33 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_65))) (let ((.cse32 (select (select .cse33 v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse35 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_64))) (let ((.cse31 (select (select .cse35 v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse34 (+ .cse32 4))) (let ((.cse30 (select (let ((.cse36 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_568))) (select .cse36 (select (select .cse36 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_567) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (.cse29 (select (select .cse35 .cse31) .cse34))) (or (= .cse29 .cse30) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse31)) (not (= .cse32 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse30 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (< (select (select .cse33 .cse31) .cse34) .cse4) (= .cse29 0))))))) (forall ((v_prenex_58 (Array Int Int)) (v_prenex_59 (Array Int Int)) (v_prenex_60 Int)) (let ((.cse38 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_59))) (let ((.cse37 (select (select .cse38 v_prenex_60) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse41 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_58))) (let ((.cse39 (select (select .cse41 v_prenex_60) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse40 (+ .cse37 4))) (or (not (= .cse37 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (< 0 (+ (select (select .cse38 .cse39) .cse40) 9)) (not (= .cse39 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select (select .cse41 .cse39) .cse40) 0)))))) (forall ((v_prenex_61 (Array Int Int)) (v_prenex_62 (Array Int Int)) (v_prenex_63 Int)) (let ((.cse42 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_62))) (let ((.cse44 (select (select .cse42 v_prenex_63) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse43 (select (select (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_61) v_prenex_63) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< 0 (+ (select (select .cse42 .cse43) (+ .cse44 4)) 9)) (not (= .cse44 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse43)))))) (forall ((v_ArrVal_568 (Array Int Int)) (v_ArrVal_567 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse50 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_567))) (let ((.cse47 (select (select .cse50 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse48 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_568))) (let ((.cse46 (select (select .cse48 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse49 (+ .cse47 4))) (let ((.cse45 (select (select .cse50 .cse46) .cse49))) (or (< .cse45 .cse4) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse46)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse47)) (= .cse45 0) (= (select (select .cse48 .cse46) .cse49) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))))) (forall ((v_ArrVal_568 (Array Int Int)) (v_ArrVal_567 (Array Int Int)) (v_prenex_65 (Array Int Int)) (v_prenex_64 (Array Int Int)) (v_prenex_66 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse55 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_65))) (let ((.cse54 (select (select .cse55 v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse57 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_64))) (let ((.cse53 (select (select .cse57 v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse56 (+ .cse54 4))) (let ((.cse51 (select (select .cse57 .cse53) .cse56))) (or (= .cse51 (select (let ((.cse52 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_568))) (select .cse52 (select (select .cse52 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_567) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse53)) (not (= .cse54 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (< (select (select .cse55 .cse53) .cse56) .cse4) (= .cse51 0))))))) (forall ((v_prenex_64 (Array Int Int)) (v_prenex_66 Int)) (let ((.cse63 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_64))) (let ((.cse58 (select (select .cse63 v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse58)) (forall ((v_prenex_65 (Array Int Int))) (let ((.cse60 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_65))) (let ((.cse59 (select (select .cse60 v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse61 (+ .cse59 4))) (let ((.cse62 (select (select .cse63 .cse58) .cse61))) (or (not (= .cse59 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (< (select (select .cse60 .cse58) .cse61) .cse4) (= .cse62 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= .cse62 0))))))))))) (or (forall ((v_prenex_65 (Array Int Int)) (v_prenex_64 (Array Int Int)) (v_prenex_66 Int)) (let ((.cse67 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_64))) (let ((.cse64 (select (select .cse67 v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse65 (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_65) v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse66 (select (select .cse67 .cse64) (+ .cse65 4)))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse64)) (not (= .cse65 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse66 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= .cse66 0)))))) (forall ((v_ArrVal_568 (Array Int Int)) (v_ArrVal_567 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (= (select (let ((.cse68 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_568))) (select .cse68 (select (select .cse68 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_567) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (forall ((v_ArrVal_568 (Array Int Int)) (v_ArrVal_567 (Array Int Int)) (v_prenex_65 (Array Int Int)) (v_prenex_64 (Array Int Int)) (v_prenex_66 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse73 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_64))) (let ((.cse71 (select (select .cse73 v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse72 (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_65) v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse69 (select (select .cse73 .cse71) (+ .cse72 4)))) (or (= .cse69 (select (let ((.cse70 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_568))) (select .cse70 (select (select .cse70 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_567) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse71)) (not (= .cse72 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse69 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= .cse69 0))))))))) is different from false [2023-12-02 18:48:52,438 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:48:52,438 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 171 treesize of output 131 [2023-12-02 18:48:52,458 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:48:52,459 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 126 treesize of output 86 [2023-12-02 18:48:52,475 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:48:52,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:48:52,657 INFO L349 Elim1Store]: treesize reduction 43, result has 55.7 percent of original size [2023-12-02 18:48:52,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 209 treesize of output 206 [2023-12-02 18:48:53,301 INFO L349 Elim1Store]: treesize reduction 139, result has 49.8 percent of original size [2023-12-02 18:48:53,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 20 case distinctions, treesize of input 349 treesize of output 416 [2023-12-02 18:48:53,405 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:48:53,405 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 206 treesize of output 212 [2023-12-02 18:48:53,499 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:48:53,500 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 195 treesize of output 191 [2023-12-02 18:48:55,701 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-12-02 18:48:55,702 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 240 treesize of output 1 [2023-12-02 18:48:55,729 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:48:55,730 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 90 [2023-12-02 18:48:55,754 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:48:55,755 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 60 [2023-12-02 18:48:55,872 INFO L349 Elim1Store]: treesize reduction 4, result has 85.2 percent of original size [2023-12-02 18:48:55,872 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 2 case distinctions, treesize of input 102 treesize of output 104 [2023-12-02 18:48:56,568 INFO L349 Elim1Store]: treesize reduction 113, result has 59.2 percent of original size [2023-12-02 18:48:56,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 2 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 20 case distinctions, treesize of input 230 treesize of output 335 [2023-12-02 18:48:56,604 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 106 [2023-12-02 18:48:56,676 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:48:56,676 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 155 treesize of output 165 [2023-12-02 18:48:57,927 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-12-02 18:48:57,927 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 171 treesize of output 1 [2023-12-02 18:48:57,940 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-12-02 18:48:57,941 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 310 treesize of output 1 [2023-12-02 18:48:57,954 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-12-02 18:48:57,954 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 308 treesize of output 1 [2023-12-02 18:48:57,968 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-12-02 18:48:57,968 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 242 treesize of output 1 [2023-12-02 18:48:57,984 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-12-02 18:48:57,984 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 465 treesize of output 1 [2023-12-02 18:48:58,000 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-12-02 18:48:58,000 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 381 treesize of output 1 [2023-12-02 18:48:58,014 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-12-02 18:48:58,015 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 242 treesize of output 1 [2023-12-02 18:48:58,029 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-12-02 18:48:58,030 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 308 treesize of output 1 [2023-12-02 18:48:58,043 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-12-02 18:48:58,044 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 171 treesize of output 1 [2023-12-02 18:48:58,474 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-02 18:48:58,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52368613] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:48:58,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1418609990] [2023-12-02 18:48:58,476 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2023-12-02 18:48:58,476 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 18:48:58,476 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 18:48:58,476 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 18:48:58,477 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 18:49:03,266 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 18:49:22,202 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1964#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_remove_first_~head#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_first_~head#1.base|) 0)) 1) (or (< (select |#length| |ULTIMATE.start_dll_remove_first_~temp~1#1.base|) (+ 12 |ULTIMATE.start_dll_remove_first_~temp~1#1.offset|)) (< (+ 8 |ULTIMATE.start_dll_remove_first_~temp~1#1.offset|) 0)) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_dll_remove_first_#in~head#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_first_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_first_~head#1.base|) 0) 4)) |ULTIMATE.start_dll_remove_first_~temp~1#1.offset|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 4 (select |#length| |ULTIMATE.start_dll_remove_first_~head#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_dll_remove_first_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_create_#res#1.offset| 0) (or (not (= 0 |ULTIMATE.start_dll_remove_first_~temp~1#1.offset|)) (not (= |ULTIMATE.start_dll_remove_first_~temp~1#1.base| 0))) (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= |ULTIMATE.start_dll_remove_first_~head#1.base| |ULTIMATE.start_dll_remove_first_#in~head#1.base|) (= (select |#valid| |ULTIMATE.start_dll_remove_first_~head#1.base|) 1) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_first_~head#1.base|) 0) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_first_~head#1.base|) 0))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_first_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_first_~head#1.base|) 0) 4)) |ULTIMATE.start_dll_remove_first_~temp~1#1.base|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-12-02 18:49:22,202 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 18:49:22,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:49:22,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 36 [2023-12-02 18:49:22,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600169240] [2023-12-02 18:49:22,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:49:22,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-12-02 18:49:22,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:49:22,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-12-02 18:49:22,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=2058, Unknown=8, NotChecked=186, Total=2450 [2023-12-02 18:49:22,205 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand has 37 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 37 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:49:23,062 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse64 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse65 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse76 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse4 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 1)) (.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse65 .cse76 0))) (.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse64 .cse76 0)))) (and (forall ((v_prenex_65 (Array Int Int)) (v_prenex_64 (Array Int Int)) (v_prenex_66 Int)) (let ((.cse2 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_65))) (let ((.cse1 (select (select .cse2 v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_64))) (let ((.cse0 (select (select .cse5 v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ .cse1 4))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0)) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (< (select (select .cse2 .cse0) .cse3) .cse4) (= (select (select .cse5 .cse0) .cse3) 0)))))) (or (forall ((v_prenex_65 (Array Int Int)) (v_prenex_64 (Array Int Int)) (v_prenex_66 Int)) (= (select (let ((.cse8 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_64))) (select .cse8 (select (select .cse8 v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_65) v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (and (forall ((v_ArrVal_567 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse11 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_567))) (let ((.cse9 (select (select .cse11 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse9)) (forall ((v_ArrVal_568 (Array Int Int))) (let ((.cse13 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_568))) (let ((.cse10 (select (select .cse13 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse12 (+ .cse9 4))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse10)) (= (select (select .cse11 .cse10) .cse12) 0) (= (select (select .cse13 .cse10) .cse12) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))))))) (forall ((v_ArrVal_567 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse17 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_567))) (let ((.cse14 (select (select .cse17 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse14)) (forall ((v_ArrVal_568 (Array Int Int))) (let ((.cse16 (select (select (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_568) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse15 (select (select .cse17 .cse16) (+ .cse14 4)))) (or (< .cse15 .cse4) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse16)) (= .cse15 0))))))))))) (forall ((v_ArrVal_568 (Array Int Int)) (v_ArrVal_567 (Array Int Int)) (v_prenex_65 (Array Int Int)) (v_prenex_64 (Array Int Int)) (v_prenex_66 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse22 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_567))) (let ((.cse21 (select (select .cse22 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse24 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_568))) (let ((.cse20 (select (select .cse24 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse23 (+ .cse21 4))) (let ((.cse19 (select (select .cse24 .cse20) .cse23))) (or (= (select (let ((.cse18 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_64))) (select .cse18 (select (select .cse18 v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_65) v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) .cse19) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse20)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse21)) (= (select (select .cse22 .cse20) .cse23) 0) (= .cse19 |c_ULTIMATE.start_dll_create_~head~0#1.base|))))))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (forall ((v_ArrVal_568 (Array Int Int)) (v_ArrVal_567 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse28 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_567))) (let ((.cse26 (select (select (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_568) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse27 (select (select .cse28 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse25 (select (select .cse28 .cse26) (+ .cse27 4)))) (or (< .cse25 .cse4) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse26)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse27)) (= .cse25 0)))))) (forall ((v_ArrVal_568 (Array Int Int)) (v_ArrVal_567 (Array Int Int)) (v_prenex_65 (Array Int Int)) (v_prenex_64 (Array Int Int)) (v_prenex_66 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse33 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_65))) (let ((.cse32 (select (select .cse33 v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse35 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_64))) (let ((.cse31 (select (select .cse35 v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse34 (+ .cse32 4))) (let ((.cse30 (select (let ((.cse36 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_568))) (select .cse36 (select (select .cse36 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_567) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (.cse29 (select (select .cse35 .cse31) .cse34))) (or (= .cse29 .cse30) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse31)) (not (= .cse32 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse30 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (< (select (select .cse33 .cse31) .cse34) .cse4) (= .cse29 0))))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (forall ((v_prenex_58 (Array Int Int)) (v_prenex_59 (Array Int Int)) (v_prenex_60 Int)) (let ((.cse38 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_59))) (let ((.cse37 (select (select .cse38 v_prenex_60) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse41 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_58))) (let ((.cse39 (select (select .cse41 v_prenex_60) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse40 (+ .cse37 4))) (or (not (= .cse37 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (< 0 (+ (select (select .cse38 .cse39) .cse40) 9)) (not (= .cse39 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select (select .cse41 .cse39) .cse40) 0)))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (<= 12 (select |c_#length| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (forall ((v_prenex_61 (Array Int Int)) (v_prenex_62 (Array Int Int)) (v_prenex_63 Int)) (let ((.cse42 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_62))) (let ((.cse44 (select (select .cse42 v_prenex_63) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse43 (select (select (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_61) v_prenex_63) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< 0 (+ (select (select .cse42 .cse43) (+ .cse44 4)) 9)) (not (= .cse44 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse43)))))) (forall ((v_ArrVal_568 (Array Int Int)) (v_ArrVal_567 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse50 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_567))) (let ((.cse47 (select (select .cse50 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse48 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_568))) (let ((.cse46 (select (select .cse48 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse49 (+ .cse47 4))) (let ((.cse45 (select (select .cse50 .cse46) .cse49))) (or (< .cse45 .cse4) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse46)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse47)) (= .cse45 0) (= (select (select .cse48 .cse46) .cse49) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))))) (forall ((v_ArrVal_568 (Array Int Int)) (v_ArrVal_567 (Array Int Int)) (v_prenex_65 (Array Int Int)) (v_prenex_64 (Array Int Int)) (v_prenex_66 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse55 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_65))) (let ((.cse54 (select (select .cse55 v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse57 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_64))) (let ((.cse53 (select (select .cse57 v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse56 (+ .cse54 4))) (let ((.cse51 (select (select .cse57 .cse53) .cse56))) (or (= .cse51 (select (let ((.cse52 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_568))) (select .cse52 (select (select .cse52 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_567) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse53)) (not (= .cse54 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (< (select (select .cse55 .cse53) .cse56) .cse4) (= .cse51 0))))))) (forall ((v_prenex_64 (Array Int Int)) (v_prenex_66 Int)) (let ((.cse63 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_64))) (let ((.cse58 (select (select .cse63 v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse58)) (forall ((v_prenex_65 (Array Int Int))) (let ((.cse60 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_65))) (let ((.cse59 (select (select .cse60 v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse61 (+ .cse59 4))) (let ((.cse62 (select (select .cse63 .cse58) .cse61))) (or (not (= .cse59 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (< (select (select .cse60 .cse58) .cse61) .cse4) (= .cse62 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= .cse62 0))))))))))) (= (select .cse64 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select .cse65 4) 0) (<= 12 (select |c_#length| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (or (forall ((v_prenex_65 (Array Int Int)) (v_prenex_64 (Array Int Int)) (v_prenex_66 Int)) (let ((.cse69 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_64))) (let ((.cse66 (select (select .cse69 v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse67 (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_65) v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse68 (select (select .cse69 .cse66) (+ .cse67 4)))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse66)) (not (= .cse67 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse68 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= .cse68 0)))))) (forall ((v_ArrVal_568 (Array Int Int)) (v_ArrVal_567 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (= (select (let ((.cse70 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_568))) (select .cse70 (select (select .cse70 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_567) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (forall ((v_ArrVal_568 (Array Int Int)) (v_ArrVal_567 (Array Int Int)) (v_prenex_65 (Array Int Int)) (v_prenex_64 (Array Int Int)) (v_prenex_66 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse75 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_64))) (let ((.cse73 (select (select .cse75 v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse74 (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_65) v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse71 (select (select .cse75 .cse73) (+ .cse74 4)))) (or (= .cse71 (select (let ((.cse72 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_568))) (select .cse72 (select (select .cse72 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_567) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse73)) (not (= .cse74 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse71 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= .cse71 0))))))))) is different from false [2023-12-02 18:49:23,096 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse23 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse17 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 1))) (and (forall ((v_prenex_64 (Array Int Int)) (v_prenex_66 Int)) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_64))) (let ((.cse0 (select (select .cse6 v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (forall ((v_prenex_65 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_65))) (let ((.cse1 (select (select .cse3 v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (+ .cse1 4))) (let ((.cse2 (select (select .cse6 .cse0) .cse4))) (or (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (< (select (select .cse3 .cse0) .cse4) .cse5) (= .cse2 0))))))))))) (or (forall ((v_prenex_65 (Array Int Int)) (v_prenex_64 (Array Int Int)) (v_prenex_66 Int)) (= (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_64))) (select .cse7 (select (select .cse7 v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_65) v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (and (forall ((v_ArrVal_567 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse10 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_567))) (let ((.cse11 (select (select .cse10 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_568 (Array Int Int))) (let ((.cse8 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_568) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (select (select .cse10 .cse8) (+ .cse11 4)))) (or (not (= .cse8 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= .cse9 0) (< .cse9 .cse5))))) (not (= .cse11 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) (forall ((v_ArrVal_567 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse13 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_567))) (let ((.cse16 (select (select .cse13 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_568 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_568))) (let ((.cse12 (select (select .cse15 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse14 (+ .cse16 4))) (or (not (= .cse12 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select (select .cse13 .cse12) .cse14) 0) (= (select (select .cse15 .cse12) .cse14) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))) (not (= .cse16 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select .cse17 8) 0) (or (forall ((v_ArrVal_568 (Array Int Int)) (v_ArrVal_567 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (= (select (let ((.cse18 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_568))) (select .cse18 (select (select .cse18 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_567) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_prenex_65 (Array Int Int)) (v_prenex_64 (Array Int Int)) (v_prenex_66 Int)) (let ((.cse22 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_64))) (let ((.cse21 (select (select .cse22 v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse19 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_65) v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse20 (select (select .cse22 .cse21) (+ .cse19 4)))) (or (not (= .cse19 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse20 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= .cse20 0) (not (= .cse21 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (<= 12 (select |c_#length| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select .cse23 8) 0) (forall ((v_prenex_65 (Array Int Int)) (v_prenex_64 (Array Int Int)) (v_prenex_66 Int)) (let ((.cse25 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_65))) (let ((.cse28 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_64)) (.cse24 (select (select .cse25 v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse27 (+ .cse24 4)) (.cse26 (select (select .cse28 v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse24 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (< (select (select .cse25 .cse26) .cse27) .cse5) (= (select (select .cse28 .cse26) .cse27) 0) (not (= .cse26 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))) (forall ((v_ArrVal_568 (Array Int Int)) (v_ArrVal_567 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse32 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_567))) (let ((.cse29 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_568) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse30 (select (select .cse32 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse31 (select (select .cse32 .cse29) (+ .cse30 4)))) (or (not (= .cse29 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= .cse30 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse31 0) (< .cse31 .cse5)))))) (forall ((v_ArrVal_568 (Array Int Int)) (v_ArrVal_567 (Array Int Int)) (v_prenex_65 (Array Int Int)) (v_prenex_64 (Array Int Int)) (v_prenex_66 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse36 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_65))) (let ((.cse33 (select (select .cse36 v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse39 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_64))) (let ((.cse37 (select (select .cse39 v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse38 (+ .cse33 4))) (let ((.cse34 (select (let ((.cse40 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_568))) (select .cse40 (select (select .cse40 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_567) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (.cse35 (select (select .cse39 .cse37) .cse38))) (or (not (= .cse33 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse34 .cse35) (< (select (select .cse36 .cse37) .cse38) .cse5) (= .cse34 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= .cse35 0) (not (= .cse37 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))))) (forall ((v_ArrVal_568 (Array Int Int)) (v_ArrVal_567 (Array Int Int)) (v_prenex_65 (Array Int Int)) (v_prenex_64 (Array Int Int)) (v_prenex_66 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse45 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_567))) (let ((.cse44 (select (select .cse45 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse47 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_568))) (let ((.cse41 (select (select .cse47 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse46 (+ .cse44 4))) (let ((.cse42 (select (select .cse47 .cse41) .cse46))) (or (not (= .cse41 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= .cse42 (select (let ((.cse43 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_64))) (select .cse43 (select (select .cse43 v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_65) v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= .cse44 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= (select (select .cse45 .cse41) .cse46) 0) (= .cse42 |c_ULTIMATE.start_dll_create_~head~0#1.base|))))))) (forall ((v_prenex_58 (Array Int Int)) (v_prenex_59 (Array Int Int)) (v_prenex_60 Int)) (let ((.cse48 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_59))) (let ((.cse51 (select (select .cse48 v_prenex_60) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse52 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_58))) (let ((.cse49 (select (select .cse52 v_prenex_60) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse50 (+ .cse51 4))) (or (< 0 (+ 9 (select (select .cse48 .cse49) .cse50))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse49)) (not (= .cse51 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= (select (select .cse52 .cse49) .cse50) 0)))))) (forall ((v_ArrVal_568 (Array Int Int)) (v_ArrVal_567 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse58 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_567))) (let ((.cse54 (select (select .cse58 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse56 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_568))) (let ((.cse53 (select (select .cse56 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse57 (+ .cse54 4))) (let ((.cse55 (select (select .cse58 .cse53) .cse57))) (or (not (= .cse53 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= .cse54 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse55 0) (= (select (select .cse56 .cse53) .cse57) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (< .cse55 .cse5))))))) (= (select .cse23 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_prenex_61 (Array Int Int)) (v_prenex_62 (Array Int Int)) (v_prenex_63 Int)) (let ((.cse61 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_62))) (let ((.cse60 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_61) v_prenex_63) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse59 (select (select .cse61 v_prenex_63) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse59)) (not (= .cse60 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< 0 (+ (select (select .cse61 .cse60) (+ 4 .cse59)) 9)))))) (= (select .cse17 4) 0) (<= 12 (select |c_#length| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_ArrVal_568 (Array Int Int)) (v_ArrVal_567 (Array Int Int)) (v_prenex_65 (Array Int Int)) (v_prenex_64 (Array Int Int)) (v_prenex_66 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse65 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_65))) (let ((.cse62 (select (select .cse65 v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse68 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_64))) (let ((.cse66 (select (select .cse68 v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse67 (+ .cse62 4))) (let ((.cse64 (select (select .cse68 .cse66) .cse67))) (or (not (= .cse62 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= (select (let ((.cse63 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_568))) (select .cse63 (select (select .cse63 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_567) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) .cse64) (< (select (select .cse65 .cse66) .cse67) .cse5) (= .cse64 0) (not (= .cse66 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))))) (forall ((v_ArrVal_568 (Array Int Int)) (v_ArrVal_567 (Array Int Int)) (v_prenex_65 (Array Int Int)) (v_prenex_64 (Array Int Int)) (v_prenex_66 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse73 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_64))) (let ((.cse72 (select (select .cse73 v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse69 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_65) v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse71 (select (select .cse73 .cse72) (+ .cse69 4)))) (or (not (= .cse69 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= (select (let ((.cse70 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_568))) (select .cse70 (select (select .cse70 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_567) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) .cse71) (= .cse71 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= .cse71 0) (not (= .cse72 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))))) is different from false [2023-12-02 18:49:23,130 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse23 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse17 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 1))) (and (forall ((v_prenex_64 (Array Int Int)) (v_prenex_66 Int)) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_64))) (let ((.cse0 (select (select .cse6 v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (forall ((v_prenex_65 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_65))) (let ((.cse1 (select (select .cse3 v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (+ .cse1 4))) (let ((.cse2 (select (select .cse6 .cse0) .cse4))) (or (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (< (select (select .cse3 .cse0) .cse4) .cse5) (= .cse2 0))))))))))) (or (forall ((v_prenex_65 (Array Int Int)) (v_prenex_64 (Array Int Int)) (v_prenex_66 Int)) (= (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_64))) (select .cse7 (select (select .cse7 v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_65) v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (and (forall ((v_ArrVal_567 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse10 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_567))) (let ((.cse11 (select (select .cse10 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_568 (Array Int Int))) (let ((.cse8 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_568) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (select (select .cse10 .cse8) (+ .cse11 4)))) (or (not (= .cse8 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= .cse9 0) (< .cse9 .cse5))))) (not (= .cse11 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) (forall ((v_ArrVal_567 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse13 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_567))) (let ((.cse16 (select (select .cse13 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_568 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_568))) (let ((.cse12 (select (select .cse15 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse14 (+ .cse16 4))) (or (not (= .cse12 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select (select .cse13 .cse12) .cse14) 0) (= (select (select .cse15 .cse12) .cse14) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))) (not (= .cse16 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select .cse17 8) 0) (or (forall ((v_ArrVal_568 (Array Int Int)) (v_ArrVal_567 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (= (select (let ((.cse18 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_568))) (select .cse18 (select (select .cse18 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_567) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_prenex_65 (Array Int Int)) (v_prenex_64 (Array Int Int)) (v_prenex_66 Int)) (let ((.cse22 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_64))) (let ((.cse21 (select (select .cse22 v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse19 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_65) v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse20 (select (select .cse22 .cse21) (+ .cse19 4)))) (or (not (= .cse19 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse20 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= .cse20 0) (not (= .cse21 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select .cse23 8) 0) (forall ((v_prenex_65 (Array Int Int)) (v_prenex_64 (Array Int Int)) (v_prenex_66 Int)) (let ((.cse25 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_65))) (let ((.cse28 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_64)) (.cse24 (select (select .cse25 v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse27 (+ .cse24 4)) (.cse26 (select (select .cse28 v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse24 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (< (select (select .cse25 .cse26) .cse27) .cse5) (= (select (select .cse28 .cse26) .cse27) 0) (not (= .cse26 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))) (forall ((v_ArrVal_568 (Array Int Int)) (v_ArrVal_567 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse32 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_567))) (let ((.cse29 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_568) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse30 (select (select .cse32 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse31 (select (select .cse32 .cse29) (+ .cse30 4)))) (or (not (= .cse29 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= .cse30 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse31 0) (< .cse31 .cse5)))))) (forall ((v_ArrVal_568 (Array Int Int)) (v_ArrVal_567 (Array Int Int)) (v_prenex_65 (Array Int Int)) (v_prenex_64 (Array Int Int)) (v_prenex_66 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse36 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_65))) (let ((.cse33 (select (select .cse36 v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse39 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_64))) (let ((.cse37 (select (select .cse39 v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse38 (+ .cse33 4))) (let ((.cse34 (select (let ((.cse40 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_568))) (select .cse40 (select (select .cse40 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_567) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (.cse35 (select (select .cse39 .cse37) .cse38))) (or (not (= .cse33 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse34 .cse35) (< (select (select .cse36 .cse37) .cse38) .cse5) (= .cse34 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= .cse35 0) (not (= .cse37 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))))) (forall ((v_ArrVal_568 (Array Int Int)) (v_ArrVal_567 (Array Int Int)) (v_prenex_65 (Array Int Int)) (v_prenex_64 (Array Int Int)) (v_prenex_66 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse45 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_567))) (let ((.cse44 (select (select .cse45 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse47 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_568))) (let ((.cse41 (select (select .cse47 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse46 (+ .cse44 4))) (let ((.cse42 (select (select .cse47 .cse41) .cse46))) (or (not (= .cse41 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= .cse42 (select (let ((.cse43 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_64))) (select .cse43 (select (select .cse43 v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_65) v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= .cse44 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= (select (select .cse45 .cse41) .cse46) 0) (= .cse42 |c_ULTIMATE.start_dll_create_~head~0#1.base|))))))) (forall ((v_prenex_58 (Array Int Int)) (v_prenex_59 (Array Int Int)) (v_prenex_60 Int)) (let ((.cse48 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_59))) (let ((.cse51 (select (select .cse48 v_prenex_60) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse52 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_58))) (let ((.cse49 (select (select .cse52 v_prenex_60) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse50 (+ .cse51 4))) (or (< 0 (+ 9 (select (select .cse48 .cse49) .cse50))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse49)) (not (= .cse51 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= (select (select .cse52 .cse49) .cse50) 0)))))) (forall ((v_ArrVal_568 (Array Int Int)) (v_ArrVal_567 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse58 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_567))) (let ((.cse54 (select (select .cse58 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse56 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_568))) (let ((.cse53 (select (select .cse56 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse57 (+ .cse54 4))) (let ((.cse55 (select (select .cse58 .cse53) .cse57))) (or (not (= .cse53 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= .cse54 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse55 0) (= (select (select .cse56 .cse53) .cse57) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (< .cse55 .cse5))))))) (= (select .cse23 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_prenex_61 (Array Int Int)) (v_prenex_62 (Array Int Int)) (v_prenex_63 Int)) (let ((.cse61 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_62))) (let ((.cse60 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_61) v_prenex_63) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse59 (select (select .cse61 v_prenex_63) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse59)) (not (= .cse60 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< 0 (+ (select (select .cse61 .cse60) (+ 4 .cse59)) 9)))))) (= (select .cse17 4) 0) (<= 12 (select |c_#length| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_ArrVal_568 (Array Int Int)) (v_ArrVal_567 (Array Int Int)) (v_prenex_65 (Array Int Int)) (v_prenex_64 (Array Int Int)) (v_prenex_66 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse65 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_65))) (let ((.cse62 (select (select .cse65 v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse68 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_64))) (let ((.cse66 (select (select .cse68 v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse67 (+ .cse62 4))) (let ((.cse64 (select (select .cse68 .cse66) .cse67))) (or (not (= .cse62 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= (select (let ((.cse63 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_568))) (select .cse63 (select (select .cse63 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_567) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) .cse64) (< (select (select .cse65 .cse66) .cse67) .cse5) (= .cse64 0) (not (= .cse66 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))))) (forall ((v_ArrVal_568 (Array Int Int)) (v_ArrVal_567 (Array Int Int)) (v_prenex_65 (Array Int Int)) (v_prenex_64 (Array Int Int)) (v_prenex_66 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse73 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_64))) (let ((.cse72 (select (select .cse73 v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse69 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_65) v_prenex_66) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse71 (select (select .cse73 .cse72) (+ .cse69 4)))) (or (not (= .cse69 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= (select (let ((.cse70 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_568))) (select .cse70 (select (select .cse70 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_567) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) .cse71) (= .cse71 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= .cse71 0) (not (= .cse72 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))))) is different from false [2023-12-02 18:49:26,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:49:26,347 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2023-12-02 18:49:26,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-02 18:49:26,348 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 37 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-12-02 18:49:26,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:49:26,349 INFO L225 Difference]: With dead ends: 109 [2023-12-02 18:49:26,349 INFO L226 Difference]: Without dead ends: 109 [2023-12-02 18:49:26,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 24.0s TimeCoverageRelationStatistics Valid=338, Invalid=3211, Unknown=11, NotChecked=600, Total=4160 [2023-12-02 18:49:26,352 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 195 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 1261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 322 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-12-02 18:49:26,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 430 Invalid, 1261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 919 Invalid, 0 Unknown, 322 Unchecked, 2.5s Time] [2023-12-02 18:49:26,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-12-02 18:49:26,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 73. [2023-12-02 18:49:26,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 72 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:49:26,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2023-12-02 18:49:26,357 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 22 [2023-12-02 18:49:26,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:49:26,357 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2023-12-02 18:49:26,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 37 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:49:26,358 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2023-12-02 18:49:26,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 18:49:26,359 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:49:26,359 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:49:26,365 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 18:49:26,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-12-02 18:49:26,560 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-12-02 18:49:26,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:49:26,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1427679237, now seen corresponding path program 1 times [2023-12-02 18:49:26,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:49:26,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724018443] [2023-12-02 18:49:26,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:49:26,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:49:26,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:49:26,606 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-02 18:49:26,606 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:49:26,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724018443] [2023-12-02 18:49:26,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724018443] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:49:26,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:49:26,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 18:49:26,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3095797] [2023-12-02 18:49:26,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:49:26,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 18:49:26,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:49:26,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 18:49:26,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:49:26,608 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 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) [2023-12-02 18:49:26,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:49:26,709 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2023-12-02 18:49:26,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 18:49:26,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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 23 [2023-12-02 18:49:26,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:49:26,711 INFO L225 Difference]: With dead ends: 72 [2023-12-02 18:49:26,711 INFO L226 Difference]: Without dead ends: 72 [2023-12-02 18:49:26,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:49:26,712 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 12 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:49:26,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 37 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 18:49:26,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-12-02 18:49:26,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2023-12-02 18:49:26,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 56 states have (on average 1.4464285714285714) internal successors, (81), 71 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:49:26,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2023-12-02 18:49:26,717 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 23 [2023-12-02 18:49:26,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:49:26,718 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2023-12-02 18:49:26,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 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) [2023-12-02 18:49:26,718 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2023-12-02 18:49:26,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 18:49:26,719 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:49:26,720 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:49:26,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-02 18:49:26,720 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-12-02 18:49:26,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:49:26,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1427679236, now seen corresponding path program 1 times [2023-12-02 18:49:26,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:49:26,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499502074] [2023-12-02 18:49:26,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:49:26,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:49:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:49:26,845 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-02 18:49:26,845 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:49:26,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499502074] [2023-12-02 18:49:26,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499502074] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:49:26,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:49:26,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 18:49:26,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996101643] [2023-12-02 18:49:26,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:49:26,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 18:49:26,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:49:26,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 18:49:26,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-02 18:49:26,848 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand has 5 states, 4 states have (on average 4.25) 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) [2023-12-02 18:49:26,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:49:26,967 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2023-12-02 18:49:26,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 18:49:26,968 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) 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 23 [2023-12-02 18:49:26,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:49:26,969 INFO L225 Difference]: With dead ends: 70 [2023-12-02 18:49:26,969 INFO L226 Difference]: Without dead ends: 70 [2023-12-02 18:49:26,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-02 18:49:26,970 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 56 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:49:26,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 40 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 18:49:26,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-12-02 18:49:26,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2023-12-02 18:49:26,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 68 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:49:26,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2023-12-02 18:49:26,973 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 78 transitions. Word has length 23 [2023-12-02 18:49:26,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:49:26,973 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 78 transitions. [2023-12-02 18:49:26,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) 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) [2023-12-02 18:49:26,974 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2023-12-02 18:49:26,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 18:49:26,975 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:49:26,975 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:49:26,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-02 18:49:26,975 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-12-02 18:49:26,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:49:26,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1427674244, now seen corresponding path program 1 times [2023-12-02 18:49:26,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:49:26,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19338950] [2023-12-02 18:49:26,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:49:26,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:49:27,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:49:27,164 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 18:49:27,165 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:49:27,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19338950] [2023-12-02 18:49:27,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19338950] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:49:27,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:49:27,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 18:49:27,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596527939] [2023-12-02 18:49:27,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:49:27,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 18:49:27,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:49:27,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 18:49:27,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-02 18:49:27,167 INFO L87 Difference]: Start difference. First operand 69 states and 78 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:49:27,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:49:27,517 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2023-12-02 18:49:27,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 18:49:27,517 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 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 23 [2023-12-02 18:49:27,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:49:27,518 INFO L225 Difference]: With dead ends: 78 [2023-12-02 18:49:27,518 INFO L226 Difference]: Without dead ends: 78 [2023-12-02 18:49:27,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-12-02 18:49:27,519 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 38 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 18:49:27,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 115 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 18:49:27,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-12-02 18:49:27,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 71. [2023-12-02 18:49:27,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 70 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:49:27,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2023-12-02 18:49:27,524 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 23 [2023-12-02 18:49:27,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:49:27,524 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2023-12-02 18:49:27,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:49:27,525 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2023-12-02 18:49:27,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-02 18:49:27,526 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:49:27,526 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:49:27,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-02 18:49:27,527 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-12-02 18:49:27,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:49:27,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1308228495, now seen corresponding path program 1 times [2023-12-02 18:49:27,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:49:27,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348214121] [2023-12-02 18:49:27,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:49:27,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:49:27,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:49:27,743 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 18:49:27,743 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:49:27,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348214121] [2023-12-02 18:49:27,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348214121] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:49:27,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:49:27,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 18:49:27,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732946072] [2023-12-02 18:49:27,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:49:27,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 18:49:27,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:49:27,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 18:49:27,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-02 18:49:27,745 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 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) [2023-12-02 18:49:28,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:49:28,156 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2023-12-02 18:49:28,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 18:49:28,157 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 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 24 [2023-12-02 18:49:28,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:49:28,158 INFO L225 Difference]: With dead ends: 79 [2023-12-02 18:49:28,158 INFO L226 Difference]: Without dead ends: 79 [2023-12-02 18:49:28,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-12-02 18:49:28,159 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 32 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 18:49:28,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 97 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 18:49:28,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-12-02 18:49:28,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 74. [2023-12-02 18:49:28,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 60 states have (on average 1.3833333333333333) internal successors, (83), 73 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:49:28,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2023-12-02 18:49:28,163 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 24 [2023-12-02 18:49:28,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:49:28,163 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2023-12-02 18:49:28,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 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) [2023-12-02 18:49:28,163 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2023-12-02 18:49:28,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 18:49:28,164 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:49:28,164 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:49:28,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-02 18:49:28,164 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-12-02 18:49:28,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:49:28,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1905177829, now seen corresponding path program 1 times [2023-12-02 18:49:28,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:49:28,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012549517] [2023-12-02 18:49:28,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:49:28,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:49:28,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:49:28,770 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 18:49:28,770 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:49:28,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012549517] [2023-12-02 18:49:28,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012549517] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:49:28,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:49:28,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-02 18:49:28,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429855819] [2023-12-02 18:49:28,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:49:28,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-02 18:49:28,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:49:28,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-02 18:49:28,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-12-02 18:49:28,772 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:49:29,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:49:29,452 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2023-12-02 18:49:29,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 18:49:29,453 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 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 25 [2023-12-02 18:49:29,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:49:29,454 INFO L225 Difference]: With dead ends: 80 [2023-12-02 18:49:29,454 INFO L226 Difference]: Without dead ends: 80 [2023-12-02 18:49:29,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2023-12-02 18:49:29,455 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 63 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 18:49:29,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 107 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 18:49:29,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-12-02 18:49:29,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 72. [2023-12-02 18:49:29,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 58 states have (on average 1.396551724137931) internal successors, (81), 71 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:49:29,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2023-12-02 18:49:29,458 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 25 [2023-12-02 18:49:29,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:49:29,459 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2023-12-02 18:49:29,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:49:29,459 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2023-12-02 18:49:29,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 18:49:29,460 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:49:29,460 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:49:29,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-02 18:49:29,460 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-12-02 18:49:29,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:49:29,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1900377570, now seen corresponding path program 1 times [2023-12-02 18:49:29,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:49:29,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291215122] [2023-12-02 18:49:29,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:49:29,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:49:29,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:49:29,608 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-02 18:49:29,608 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:49:29,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291215122] [2023-12-02 18:49:29,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291215122] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:49:29,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:49:29,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 18:49:29,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669913082] [2023-12-02 18:49:29,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:49:29,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 18:49:29,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:49:29,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 18:49:29,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 18:49:29,610 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:49:29,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:49:29,917 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2023-12-02 18:49:29,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 18:49:29,917 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-12-02 18:49:29,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:49:29,918 INFO L225 Difference]: With dead ends: 81 [2023-12-02 18:49:29,918 INFO L226 Difference]: Without dead ends: 81 [2023-12-02 18:49:29,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 18:49:29,919 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 12 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 18:49:29,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 68 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 18:49:29,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-12-02 18:49:29,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2023-12-02 18:49:29,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 78 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:49:29,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 90 transitions. [2023-12-02 18:49:29,923 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 90 transitions. Word has length 25 [2023-12-02 18:49:29,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:49:29,923 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 90 transitions. [2023-12-02 18:49:29,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:49:29,923 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions. [2023-12-02 18:49:29,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 18:49:29,924 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:49:29,924 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:49:29,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-02 18:49:29,925 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-12-02 18:49:29,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:49:29,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1069029556, now seen corresponding path program 1 times [2023-12-02 18:49:29,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:49:29,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765114886] [2023-12-02 18:49:29,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:49:29,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:49:29,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:49:30,467 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 18:49:30,467 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:49:30,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765114886] [2023-12-02 18:49:30,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765114886] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:49:30,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:49:30,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-02 18:49:30,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878388795] [2023-12-02 18:49:30,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:49:30,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 18:49:30,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:49:30,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 18:49:30,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-02 18:49:30,470 INFO L87 Difference]: Start difference. First operand 79 states and 90 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 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) [2023-12-02 18:49:31,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:49:31,203 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2023-12-02 18:49:31,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 18:49:31,204 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 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 26 [2023-12-02 18:49:31,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:49:31,204 INFO L225 Difference]: With dead ends: 83 [2023-12-02 18:49:31,204 INFO L226 Difference]: Without dead ends: 83 [2023-12-02 18:49:31,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2023-12-02 18:49:31,205 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 43 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 18:49:31,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 88 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 18:49:31,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-12-02 18:49:31,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 76. [2023-12-02 18:49:31,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 62 states have (on average 1.403225806451613) internal successors, (87), 75 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) [2023-12-02 18:49:31,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2023-12-02 18:49:31,208 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 26 [2023-12-02 18:49:31,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:49:31,208 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2023-12-02 18:49:31,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 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) [2023-12-02 18:49:31,209 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2023-12-02 18:49:31,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 18:49:31,209 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:49:31,209 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:49:31,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-02 18:49:31,210 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-12-02 18:49:31,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:49:31,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1217837588, now seen corresponding path program 1 times [2023-12-02 18:49:31,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:49:31,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011217827] [2023-12-02 18:49:31,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:49:31,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:49:31,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:49:31,554 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 18:49:31,554 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:49:31,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011217827] [2023-12-02 18:49:31,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011217827] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:49:31,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050029992] [2023-12-02 18:49:31,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:49:31,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:49:31,555 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:49:31,556 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:49:31,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 18:49:31,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:49:31,720 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 18:49:31,722 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:49:32,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:49:32,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-12-02 18:49:32,041 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-02 18:49:32,041 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:49:32,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050029992] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:49:32,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 18:49:32,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2023-12-02 18:49:32,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358652697] [2023-12-02 18:49:32,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:49:32,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 18:49:32,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:49:32,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 18:49:32,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2023-12-02 18:49:32,043 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:49:32,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:49:32,341 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2023-12-02 18:49:32,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 18:49:32,341 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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 26 [2023-12-02 18:49:32,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:49:32,342 INFO L225 Difference]: With dead ends: 75 [2023-12-02 18:49:32,342 INFO L226 Difference]: Without dead ends: 75 [2023-12-02 18:49:32,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2023-12-02 18:49:32,343 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 51 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 18:49:32,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 47 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 18:49:32,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-12-02 18:49:32,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2023-12-02 18:49:32,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 62 states have (on average 1.3870967741935485) internal successors, (86), 74 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) [2023-12-02 18:49:32,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 86 transitions. [2023-12-02 18:49:32,346 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 86 transitions. Word has length 26 [2023-12-02 18:49:32,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:49:32,346 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 86 transitions. [2023-12-02 18:49:32,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:49:32,346 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 86 transitions. [2023-12-02 18:49:32,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-02 18:49:32,347 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:49:32,347 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:49:32,353 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 18:49:32,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:49:32,548 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-12-02 18:49:32,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:49:32,548 INFO L85 PathProgramCache]: Analyzing trace with hash 2110853946, now seen corresponding path program 1 times [2023-12-02 18:49:32,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:49:32,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523300379] [2023-12-02 18:49:32,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:49:32,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:49:32,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:49:32,682 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-02 18:49:32,683 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:49:32,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523300379] [2023-12-02 18:49:32,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523300379] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:49:32,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041867850] [2023-12-02 18:49:32,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:49:32,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:49:32,684 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:49:32,685 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:49:32,688 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 18:49:32,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:49:32,840 INFO L262 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-02 18:49:32,842 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:49:32,893 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-02 18:49:32,893 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:49:32,927 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-12-02 18:49:32,928 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 12 treesize of output 11 [2023-12-02 18:49:32,970 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-02 18:49:32,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041867850] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:49:32,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1136858741] [2023-12-02 18:49:32,972 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-12-02 18:49:32,973 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 18:49:32,973 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 18:49:32,973 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 18:49:32,973 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 18:49:34,705 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 18:50:09,451 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3742#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_remove_first_~head#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 1) (<= 2 |ULTIMATE.start_dll_remove_first_#in~head#1.base|) (= |ULTIMATE.start_dll_remove_first_#in~head#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_dll_remove_first_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= (select |#valid| |ULTIMATE.start_dll_remove_first_~head#1.base|) 1)) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_create_#res#1.offset| 0) (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= |ULTIMATE.start_dll_remove_first_~head#1.base| |ULTIMATE.start_dll_remove_first_#in~head#1.base|))' at error location [2023-12-02 18:50:09,451 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 18:50:09,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:50:09,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2023-12-02 18:50:09,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702865996] [2023-12-02 18:50:09,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:50:09,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 18:50:09,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:50:09,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 18:50:09,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=318, Unknown=12, NotChecked=0, Total=420 [2023-12-02 18:50:09,452 INFO L87 Difference]: Start difference. First operand 75 states and 86 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:50:09,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:50:09,641 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2023-12-02 18:50:09,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 18:50:09,641 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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 28 [2023-12-02 18:50:09,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:50:09,642 INFO L225 Difference]: With dead ends: 73 [2023-12-02 18:50:09,642 INFO L226 Difference]: Without dead ends: 73 [2023-12-02 18:50:09,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 34.8s TimeCoverageRelationStatistics Valid=100, Invalid=350, Unknown=12, NotChecked=0, Total=462 [2023-12-02 18:50:09,643 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 58 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:50:09,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 28 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 18:50:09,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-12-02 18:50:09,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2023-12-02 18:50:09,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 62 states have (on average 1.3548387096774193) internal successors, (84), 72 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) [2023-12-02 18:50:09,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 84 transitions. [2023-12-02 18:50:09,646 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 84 transitions. Word has length 28 [2023-12-02 18:50:09,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:50:09,647 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 84 transitions. [2023-12-02 18:50:09,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:50:09,647 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2023-12-02 18:50:09,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-02 18:50:09,647 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:50:09,648 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:50:09,654 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-02 18:50:09,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:50:09,848 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-12-02 18:50:09,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:50:09,849 INFO L85 PathProgramCache]: Analyzing trace with hash 2110853947, now seen corresponding path program 1 times [2023-12-02 18:50:09,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:50:09,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821543802] [2023-12-02 18:50:09,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:50:09,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:50:09,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:50:10,129 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-02 18:50:10,129 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:50:10,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821543802] [2023-12-02 18:50:10,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821543802] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:50:10,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375810701] [2023-12-02 18:50:10,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:50:10,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:50:10,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:50:10,131 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:50:10,144 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-02 18:50:10,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:50:10,303 INFO L262 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-02 18:50:10,305 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:50:10,509 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-02 18:50:10,509 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:50:10,670 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:50:10,670 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 17 treesize of output 21 [2023-12-02 18:50:10,773 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-02 18:50:10,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375810701] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:50:10,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1390458286] [2023-12-02 18:50:10,775 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-12-02 18:50:10,775 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 18:50:10,776 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 18:50:10,776 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 18:50:10,776 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 18:50:12,468 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 18:50:47,467 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4078#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_remove_first_~head#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_dll_remove_first_#in~head#1.offset| 0) (<= 2 |ULTIMATE.start_dll_remove_first_~head#1.base|) (<= (select |#length| |ULTIMATE.start_dll_remove_first_~head#1.base|) 3) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_dll_remove_first_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_create_#res#1.offset| 0) (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= |ULTIMATE.start_dll_remove_first_~head#1.base| |ULTIMATE.start_dll_remove_first_#in~head#1.base|))' at error location [2023-12-02 18:50:47,467 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 18:50:47,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:50:47,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2023-12-02 18:50:47,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59471965] [2023-12-02 18:50:47,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:50:47,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-02 18:50:47,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:50:47,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-02 18:50:47,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=480, Unknown=12, NotChecked=0, Total=650 [2023-12-02 18:50:47,469 INFO L87 Difference]: Start difference. First operand 73 states and 84 transitions. Second operand has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:50:47,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:50:47,621 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2023-12-02 18:50:47,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 18:50:47,622 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 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 28 [2023-12-02 18:50:47,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:50:47,623 INFO L225 Difference]: With dead ends: 71 [2023-12-02 18:50:47,623 INFO L226 Difference]: Without dead ends: 71 [2023-12-02 18:50:47,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 35.2s TimeCoverageRelationStatistics Valid=158, Invalid=480, Unknown=12, NotChecked=0, Total=650 [2023-12-02 18:50:47,624 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 51 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:50:47,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 41 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 18:50:47,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-12-02 18:50:47,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2023-12-02 18:50:47,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 70 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:50:47,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2023-12-02 18:50:47,626 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 28 [2023-12-02 18:50:47,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:50:47,626 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2023-12-02 18:50:47,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:50:47,626 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2023-12-02 18:50:47,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-02 18:50:47,627 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:50:47,627 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:50:47,632 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-02 18:50:47,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:50:47,828 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-12-02 18:50:47,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:50:47,828 INFO L85 PathProgramCache]: Analyzing trace with hash -969174080, now seen corresponding path program 2 times [2023-12-02 18:50:47,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:50:47,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602234253] [2023-12-02 18:50:47,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:50:47,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:50:47,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:50:47,912 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 18:50:47,912 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:50:47,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602234253] [2023-12-02 18:50:47,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602234253] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:50:47,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619584753] [2023-12-02 18:50:47,913 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 18:50:47,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:50:47,913 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:50:47,914 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:50:47,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-02 18:50:48,051 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 18:50:48,051 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:50:48,053 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 47 conjunts are in the unsatisfiable core [2023-12-02 18:50:48,055 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:50:48,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-02 18:50:48,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-02 18:50:48,216 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 23 treesize of output 22 [2023-12-02 18:50:48,234 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 22 [2023-12-02 18:50:48,874 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-02 18:50:48,874 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:50:48,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619584753] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:50:48,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 18:50:48,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 13 [2023-12-02 18:50:48,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143113326] [2023-12-02 18:50:48,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:50:48,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-02 18:50:48,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:50:48,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-02 18:50:48,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2023-12-02 18:50:48,876 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:50:49,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:50:49,907 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2023-12-02 18:50:49,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 18:50:49,908 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 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 29 [2023-12-02 18:50:49,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:50:49,908 INFO L225 Difference]: With dead ends: 91 [2023-12-02 18:50:49,908 INFO L226 Difference]: Without dead ends: 91 [2023-12-02 18:50:49,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2023-12-02 18:50:49,909 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 56 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-02 18:50:49,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 180 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-02 18:50:49,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-12-02 18:50:49,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 77. [2023-12-02 18:50:49,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 76 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) [2023-12-02 18:50:49,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 89 transitions. [2023-12-02 18:50:49,912 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 89 transitions. Word has length 29 [2023-12-02 18:50:49,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:50:49,912 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 89 transitions. [2023-12-02 18:50:49,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:50:49,912 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 89 transitions. [2023-12-02 18:50:49,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-02 18:50:49,913 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:50:49,913 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:50:49,917 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-12-02 18:50:50,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:50:50,113 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-12-02 18:50:50,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:50:50,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1011962916, now seen corresponding path program 1 times [2023-12-02 18:50:50,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:50:50,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130270399] [2023-12-02 18:50:50,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:50:50,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:50:50,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:50:52,234 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:50:52,234 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:50:52,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130270399] [2023-12-02 18:50:52,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130270399] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:50:52,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752789408] [2023-12-02 18:50:52,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:50:52,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:50:52,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:50:52,236 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:50:52,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-02 18:50:52,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:50:52,368 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 51 conjunts are in the unsatisfiable core [2023-12-02 18:50:52,371 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:50:52,468 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 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 18:50:52,783 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 18:50:52,784 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 11 treesize of output 11 [2023-12-02 18:50:52,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 11 treesize of output 7 [2023-12-02 18:50:53,083 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 19 treesize of output 18 [2023-12-02 18:50:53,270 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 18:50:53,271 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 40 treesize of output 37 [2023-12-02 18:50:54,102 INFO L349 Elim1Store]: treesize reduction 8, result has 84.3 percent of original size [2023-12-02 18:50:54,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 57 treesize of output 63 [2023-12-02 18:50:54,432 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 16 treesize of output 8 [2023-12-02 18:50:54,536 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:50:54,536 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:50:54,909 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 8 treesize of output 4 [2023-12-02 18:50:55,482 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1504 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1504))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0)) (not (= (select (select .cse1 .cse0) 4) 0)))))) is different from false [2023-12-02 18:50:55,711 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:50:55,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 50 [2023-12-02 18:50:55,916 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:50:55,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 131 treesize of output 209 [2023-12-02 18:50:55,958 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:50:55,958 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 136 treesize of output 128 [2023-12-02 18:51:00,386 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-12-02 18:51:00,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752789408] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:51:00,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [516151339] [2023-12-02 18:51:00,389 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-12-02 18:51:00,389 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 18:51:00,389 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 18:51:00,389 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 18:51:00,389 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 18:51:02,031 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 18:51:43,815 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4727#(and (<= 1 |#StackHeapBarrier|) (or (and (= |ULTIMATE.start_dll_remove_first_#t~mem6#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_first_~head#1.base|) 0)) (exists ((|v_#memory_int_172| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_172| |ULTIMATE.start_main_~#s~0#1.base| (store (select |v_#memory_int_172| |ULTIMATE.start_main_~#s~0#1.base|) 0 (select (select |#memory_int| |ULTIMATE.start_main_~#s~0#1.base|) 0))))) (= |ULTIMATE.start_main_~i~0#1| 0) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#memory_$Pointer$.base_191| (Array Int (Array Int Int))) (|v_#valid_115| (Array Int Int)) (|v_#memory_$Pointer$.offset_188| (Array Int (Array Int Int)))) (and (<= (+ (select (select |v_#memory_$Pointer$.base_191| |ULTIMATE.start_main_~#s~0#1.base|) 0) 1) |#StackHeapBarrier|) (= (store |v_#memory_$Pointer$.base_191| |ULTIMATE.start_main_~#s~0#1.base| (store (select |v_#memory_$Pointer$.base_191| |ULTIMATE.start_main_~#s~0#1.base|) 0 0)) |#memory_$Pointer$.base|) (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |v_#memory_$Pointer$.base_191| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_188| |ULTIMATE.start_main_~#s~0#1.base| (store (select |v_#memory_$Pointer$.offset_188| |ULTIMATE.start_main_~#s~0#1.base|) 0 0))) (= (select (select |v_#memory_$Pointer$.offset_188| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 8 (select |#length| (select (select |v_#memory_$Pointer$.base_191| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= (store |v_#valid_115| (select (select |v_#memory_$Pointer$.base_191| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) |#valid|) (= (select |v_#valid_115| (select (select |v_#memory_$Pointer$.base_191| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (= (select (select |v_#memory_$Pointer$.offset_188| (select (select |v_#memory_$Pointer$.base_191| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) 0) (= (select (select |v_#memory_$Pointer$.base_191| (select (select |v_#memory_$Pointer$.base_191| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) 0))) (<= 4 (select |#length| |ULTIMATE.start_dll_remove_first_~head#1.base|)) (= |ULTIMATE.start_dll_remove_first_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_first_~head#1.base|) 0) |ULTIMATE.start_dll_remove_first_#t~mem6#1.offset|) (= |ULTIMATE.start_dll_remove_first_~head#1.base| |ULTIMATE.start_dll_remove_first_#in~head#1.base|)) (and (= |ULTIMATE.start_dll_remove_first_#t~mem6#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_first_~head#1.base|) 0)) (= |ULTIMATE.start_main_~i~0#1| 1) (<= 4 (select |#length| |ULTIMATE.start_dll_remove_first_~head#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |ULTIMATE.start_dll_remove_first_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_first_~head#1.base|) 0) |ULTIMATE.start_dll_remove_first_#t~mem6#1.offset|) (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= |ULTIMATE.start_dll_remove_first_~head#1.base| |ULTIMATE.start_dll_remove_first_#in~head#1.base|) (= (select |#valid| |ULTIMATE.start_dll_remove_first_~head#1.base|) 1))) (not (= (select |#valid| |ULTIMATE.start_dll_remove_first_#t~mem6#1.base|) 1)) (= |ULTIMATE.start_dll_remove_first_~head#1.offset| 0) (= |ULTIMATE.start_dll_remove_first_#in~head#1.offset| 0) (<= 2 |ULTIMATE.start_dll_remove_first_~head#1.base|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_create_#res#1.offset| 0))' at error location [2023-12-02 18:51:43,815 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 18:51:43,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:51:43,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15, 15] total 48 [2023-12-02 18:51:43,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680905429] [2023-12-02 18:51:43,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:51:43,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-12-02 18:51:43,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:51:43,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-12-02 18:51:43,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=3642, Unknown=17, NotChecked=122, Total=4032 [2023-12-02 18:51:43,819 INFO L87 Difference]: Start difference. First operand 77 states and 89 transitions. Second operand has 48 states, 48 states have (on average 1.6666666666666667) internal successors, (80), 48 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:51:48,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:51:48,476 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2023-12-02 18:51:48,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-02 18:51:48,477 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.6666666666666667) internal successors, (80), 48 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-12-02 18:51:48,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:51:48,478 INFO L225 Difference]: With dead ends: 81 [2023-12-02 18:51:48,478 INFO L226 Difference]: Without dead ends: 79 [2023-12-02 18:51:48,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1887 ImplicationChecksByTransitivity, 48.7s TimeCoverageRelationStatistics Valid=610, Invalid=6349, Unknown=17, NotChecked=164, Total=7140 [2023-12-02 18:51:48,481 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 175 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 65 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-02 18:51:48,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 221 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 829 Invalid, 0 Unknown, 65 Unchecked, 1.8s Time] [2023-12-02 18:51:48,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-12-02 18:51:48,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 66. [2023-12-02 18:51:48,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 57 states have (on average 1.263157894736842) internal successors, (72), 65 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:51:48,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2023-12-02 18:51:48,483 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 29 [2023-12-02 18:51:48,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:51:48,483 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2023-12-02 18:51:48,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.6666666666666667) internal successors, (80), 48 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:51:48,484 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2023-12-02 18:51:48,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-02 18:51:48,484 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:51:48,484 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:51:48,491 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-12-02 18:51:48,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:51:48,685 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-12-02 18:51:48,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:51:48,685 INFO L85 PathProgramCache]: Analyzing trace with hash -933817019, now seen corresponding path program 3 times [2023-12-02 18:51:48,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:51:48,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047467872] [2023-12-02 18:51:48,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:51:48,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:51:48,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:51:48,808 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:51:48,808 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:51:48,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047467872] [2023-12-02 18:51:48,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047467872] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:51:48,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007241234] [2023-12-02 18:51:48,809 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 18:51:48,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:51:48,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:51:48,810 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:51:48,811 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-02 18:51:48,970 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 18:51:48,970 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:51:48,972 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 18:51:48,973 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:51:49,046 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:51:49,046 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:51:49,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007241234] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:51:49,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 18:51:49,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-12-02 18:51:49,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337450988] [2023-12-02 18:51:49,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:51:49,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 18:51:49,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:51:49,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 18:51:49,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-02 18:51:49,047 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 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) [2023-12-02 18:51:49,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:51:49,117 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2023-12-02 18:51:49,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 18:51:49,118 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 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 30 [2023-12-02 18:51:49,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:51:49,118 INFO L225 Difference]: With dead ends: 53 [2023-12-02 18:51:49,118 INFO L226 Difference]: Without dead ends: 53 [2023-12-02 18:51:49,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-02 18:51:49,119 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:51:49,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 18:51:49,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-12-02 18:51:49,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2023-12-02 18:51:49,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 52 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:51:49,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2023-12-02 18:51:49,121 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 30 [2023-12-02 18:51:49,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:51:49,121 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2023-12-02 18:51:49,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 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) [2023-12-02 18:51:49,122 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2023-12-02 18:51:49,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-02 18:51:49,122 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:51:49,122 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:51:49,127 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-12-02 18:51:49,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-12-02 18:51:49,323 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-12-02 18:51:49,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:51:49,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1681338, now seen corresponding path program 1 times [2023-12-02 18:51:49,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:51:49,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996655075] [2023-12-02 18:51:49,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:51:49,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:51:49,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:51:50,781 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:51:50,781 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:51:50,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996655075] [2023-12-02 18:51:50,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996655075] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:51:50,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623151720] [2023-12-02 18:51:50,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:51:50,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:51:50,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:51:50,783 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:51:50,784 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-02 18:51:50,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:51:50,942 INFO L262 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 68 conjunts are in the unsatisfiable core [2023-12-02 18:51:50,945 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:51:51,019 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 [2023-12-02 18:51:51,255 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 18:51:51,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 18:51:51,378 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 [2023-12-02 18:51:51,505 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 19 treesize of output 18 [2023-12-02 18:51:51,674 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 18:51:51,674 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 32 treesize of output 31 [2023-12-02 18:51:52,722 INFO L349 Elim1Store]: treesize reduction 58, result has 34.1 percent of original size [2023-12-02 18:51:52,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 53 treesize of output 64 [2023-12-02 18:51:52,771 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 18:51:52,772 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 20 treesize of output 19 [2023-12-02 18:51:52,792 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 9 treesize of output 7 [2023-12-02 18:51:52,846 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 28 treesize of output 20 [2023-12-02 18:51:53,041 INFO L349 Elim1Store]: treesize reduction 4, result has 92.5 percent of original size [2023-12-02 18:51:53,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 39 treesize of output 71 [2023-12-02 18:51:53,305 INFO L349 Elim1Store]: treesize reduction 18, result has 53.8 percent of original size [2023-12-02 18:51:53,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2023-12-02 18:51:53,456 INFO L349 Elim1Store]: treesize reduction 14, result has 48.1 percent of original size [2023-12-02 18:51:53,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 26 [2023-12-02 18:51:53,779 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 85 treesize of output 69 [2023-12-02 18:51:54,375 INFO L349 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2023-12-02 18:51:54,375 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 16 treesize of output 26 [2023-12-02 18:51:54,591 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:51:54,592 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 3 case distinctions, treesize of input 97 treesize of output 63 [2023-12-02 18:51:55,111 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:51:55,112 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 74 treesize of output 42 [2023-12-02 18:51:55,299 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:51:55,299 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:51:56,251 INFO L349 Elim1Store]: treesize reduction 13, result has 78.7 percent of original size [2023-12-02 18:51:56,252 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 76 treesize of output 99 [2023-12-02 18:51:56,985 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 329 treesize of output 265 [2023-12-02 18:51:56,996 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 38 treesize of output 36 [2023-12-02 18:51:58,062 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1780 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1780) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0)) (= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse1 .cse2))))))) is different from false [2023-12-02 18:51:58,091 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1779 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1780 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1779))) (let ((.cse2 (select (select .cse3 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select .cse3 .cse2) 4))) (let ((.cse0 (select (select (store .cse3 .cse1 v_ArrVal_1780) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 .cse1)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2)) (= .cse0 |ULTIMATE.start_main_~#s~0#1.base|))))))) is different from false [2023-12-02 18:51:58,379 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:51:58,379 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 216 treesize of output 101 [2023-12-02 18:51:58,730 INFO L349 Elim1Store]: treesize reduction 29, result has 74.3 percent of original size [2023-12-02 18:51:58,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 1370 treesize of output 1013 [2023-12-02 18:51:58,780 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 363 treesize of output 349 [2023-12-02 18:51:58,818 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:51:58,818 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 420 treesize of output 360 [2023-12-02 18:52:01,100 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-02 18:52:01,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623151720] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:52:01,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1512301387] [2023-12-02 18:52:01,102 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-12-02 18:52:01,102 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 18:52:01,103 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 18:52:01,103 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 18:52:01,103 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 18:52:02,387 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 18:52:48,751 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5361#(and (<= 1 |#StackHeapBarrier|) (not (= (select |#valid| |ULTIMATE.start_dll_remove_first_#t~mem6#1.base|) 1)) (= |ULTIMATE.start_dll_remove_first_~head#1.offset| 0) (= |ULTIMATE.start_dll_remove_first_#in~head#1.offset| 0) (or (and (= |ULTIMATE.start_dll_remove_first_#t~mem6#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_first_~head#1.base|) 0)) (= |ULTIMATE.start_main_~i~0#1| 0) (exists ((|v_ULTIMATE.start_dll_remove_first_~head#1.base_44| Int) (|v_#valid_130| (Array Int Int)) (|v_#memory_int_202| (Array Int (Array Int Int))) (|v_#memory_int_203| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_219| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_226| (Array Int (Array Int Int)))) (and (<= (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_remove_first_~head#1.base_44|) 0) 12) (select |#length| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_remove_first_~head#1.base_44|) 0))) (= (store |v_#memory_int_202| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_remove_first_~head#1.base_44|) 0) (store (select |v_#memory_int_202| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_remove_first_~head#1.base_44|) 0)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_remove_first_~head#1.base_44|) 0) 8) (select (select |v_#memory_int_203| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_remove_first_~head#1.base_44|) 0)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_remove_first_~head#1.base_44|) 0) 8)))) |v_#memory_int_203|) (= (select |v_#valid_130| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_remove_first_~head#1.base_44|) 0)) 1) (<= 0 (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_remove_first_~head#1.base_44|) 0) 8)) (= (select |#valid| |v_ULTIMATE.start_dll_remove_first_~head#1.base_44|) 1) (or (= (select (select (store |v_#memory_$Pointer$.base_226| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_remove_first_~head#1.base_44|) 0) (store (select |v_#memory_$Pointer$.base_226| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_remove_first_~head#1.base_44|) 0)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_remove_first_~head#1.base_44|) 0) 8) 0)) |v_ULTIMATE.start_dll_remove_first_~head#1.base_44|) 0) 0) (= (select |v_#valid_130| (select (select (store |v_#memory_$Pointer$.base_226| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_remove_first_~head#1.base_44|) 0) (store (select |v_#memory_$Pointer$.base_226| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_remove_first_~head#1.base_44|) 0)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_remove_first_~head#1.base_44|) 0) 8) 0)) |v_ULTIMATE.start_dll_remove_first_~head#1.base_44|) 0)) 1)) (= (store (store |v_#memory_$Pointer$.offset_219| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_remove_first_~head#1.base_44|) 0) (store (select |v_#memory_$Pointer$.offset_219| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_remove_first_~head#1.base_44|) 0)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_remove_first_~head#1.base_44|) 0) 8) 0)) |v_ULTIMATE.start_dll_remove_first_~head#1.base_44| (store (select (store |v_#memory_$Pointer$.offset_219| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_remove_first_~head#1.base_44|) 0) (store (select |v_#memory_$Pointer$.offset_219| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_remove_first_~head#1.base_44|) 0)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_remove_first_~head#1.base_44|) 0) 8) 0)) |v_ULTIMATE.start_dll_remove_first_~head#1.base_44|) 0 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_remove_first_~head#1.base_44|) 0))) |#memory_$Pointer$.offset|) (<= 4 (select |#length| |v_ULTIMATE.start_dll_remove_first_~head#1.base_44|)) (= |#memory_int| (store |v_#memory_int_203| |v_ULTIMATE.start_dll_remove_first_~head#1.base_44| (store (select |v_#memory_int_203| |v_ULTIMATE.start_dll_remove_first_~head#1.base_44|) 0 (select (select |#memory_int| |v_ULTIMATE.start_dll_remove_first_~head#1.base_44|) 0)))) (= (select (select (store |v_#memory_$Pointer$.offset_219| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_remove_first_~head#1.base_44|) 0) (store (select |v_#memory_$Pointer$.offset_219| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_remove_first_~head#1.base_44|) 0)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_remove_first_~head#1.base_44|) 0) 8) 0)) |v_ULTIMATE.start_dll_remove_first_~head#1.base_44|) 0) 0) (= (store |v_#valid_130| (select (select (store |v_#memory_$Pointer$.base_226| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_remove_first_~head#1.base_44|) 0) (store (select |v_#memory_$Pointer$.base_226| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_remove_first_~head#1.base_44|) 0)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_remove_first_~head#1.base_44|) 0) 8) 0)) |v_ULTIMATE.start_dll_remove_first_~head#1.base_44|) 0) 0) |#valid|) (= (store (store |v_#memory_$Pointer$.base_226| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_remove_first_~head#1.base_44|) 0) (store (select |v_#memory_$Pointer$.base_226| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_remove_first_~head#1.base_44|) 0)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_remove_first_~head#1.base_44|) 0) 8) 0)) |v_ULTIMATE.start_dll_remove_first_~head#1.base_44| (store (select (store |v_#memory_$Pointer$.base_226| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_remove_first_~head#1.base_44|) 0) (store (select |v_#memory_$Pointer$.base_226| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_remove_first_~head#1.base_44|) 0)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_remove_first_~head#1.base_44|) 0) 8) 0)) |v_ULTIMATE.start_dll_remove_first_~head#1.base_44|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_remove_first_~head#1.base_44|) 0))) |#memory_$Pointer$.base|) (<= (+ (select (select (store |v_#memory_$Pointer$.base_226| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_remove_first_~head#1.base_44|) 0) (store (select |v_#memory_$Pointer$.base_226| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_remove_first_~head#1.base_44|) 0)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_remove_first_~head#1.base_44|) 0) 8) 0)) |v_ULTIMATE.start_dll_remove_first_~head#1.base_44|) 0) 1) |#StackHeapBarrier|) (<= 2 |v_ULTIMATE.start_dll_remove_first_~head#1.base_44|))) (<= 4 (select |#length| |ULTIMATE.start_dll_remove_first_~head#1.base|)) (= |ULTIMATE.start_dll_remove_first_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_first_~head#1.base|) 0) |ULTIMATE.start_dll_remove_first_#t~mem6#1.offset|) (= |ULTIMATE.start_dll_remove_first_~head#1.base| |ULTIMATE.start_dll_remove_first_#in~head#1.base|) (= (select |#valid| |ULTIMATE.start_dll_remove_first_~head#1.base|) 1)) (and (= |ULTIMATE.start_dll_remove_first_#t~mem6#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_first_~head#1.base|) 0)) (= |ULTIMATE.start_main_~i~0#1| 1) (<= 4 (select |#length| |ULTIMATE.start_dll_remove_first_~head#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |ULTIMATE.start_dll_remove_first_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_first_~head#1.base|) 0) |ULTIMATE.start_dll_remove_first_#t~mem6#1.offset|) (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= |ULTIMATE.start_dll_remove_first_~head#1.base| |ULTIMATE.start_dll_remove_first_#in~head#1.base|) (= (select |#valid| |ULTIMATE.start_dll_remove_first_~head#1.base|) 1))) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_create_#res#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-12-02 18:52:48,751 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 18:52:48,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:52:48,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 19] total 53 [2023-12-02 18:52:48,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118231217] [2023-12-02 18:52:48,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:52:48,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-12-02 18:52:48,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:52:48,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-12-02 18:52:48,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=4491, Unknown=21, NotChecked=274, Total=5112 [2023-12-02 18:52:48,754 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand has 54 states, 53 states have (on average 1.6603773584905661) internal successors, (88), 54 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:52:54,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:52:54,213 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2023-12-02 18:52:54,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-02 18:52:54,214 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 1.6603773584905661) internal successors, (88), 54 states have internal predecessors, (88), 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 30 [2023-12-02 18:52:54,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:52:54,214 INFO L225 Difference]: With dead ends: 74 [2023-12-02 18:52:54,215 INFO L226 Difference]: Without dead ends: 74 [2023-12-02 18:52:54,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1913 ImplicationChecksByTransitivity, 55.3s TimeCoverageRelationStatistics Valid=532, Invalid=6765, Unknown=21, NotChecked=338, Total=7656 [2023-12-02 18:52:54,218 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 141 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 1029 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 141 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-12-02 18:52:54,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 327 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1029 Invalid, 0 Unknown, 141 Unchecked, 2.6s Time] [2023-12-02 18:52:54,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-12-02 18:52:54,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 58. [2023-12-02 18:52:54,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 57 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:52:54,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2023-12-02 18:52:54,220 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 30 [2023-12-02 18:52:54,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:52:54,220 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2023-12-02 18:52:54,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 1.6603773584905661) internal successors, (88), 54 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:52:54,221 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2023-12-02 18:52:54,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-02 18:52:54,221 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:52:54,221 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:52:54,227 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-12-02 18:52:54,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-12-02 18:52:54,422 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-12-02 18:52:54,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:52:54,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1681339, now seen corresponding path program 1 times [2023-12-02 18:52:54,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:52:54,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057260410] [2023-12-02 18:52:54,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:52:54,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:52:54,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:52:55,588 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:52:55,588 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:52:55,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057260410] [2023-12-02 18:52:55,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057260410] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:52:55,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159202898] [2023-12-02 18:52:55,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:52:55,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:52:55,589 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:52:55,590 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:52:55,591 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-02 18:52:55,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:52:55,728 INFO L262 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 83 conjunts are in the unsatisfiable core [2023-12-02 18:52:55,731 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:52:55,817 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 [2023-12-02 18:52:56,131 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 18:52:56,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 18:52:56,310 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 [2023-12-02 18:52:56,438 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 [2023-12-02 18:52:56,455 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 19 treesize of output 18 [2023-12-02 18:52:56,641 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 [2023-12-02 18:52:56,653 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 16 [2023-12-02 18:52:57,867 INFO L349 Elim1Store]: treesize reduction 58, result has 34.1 percent of original size [2023-12-02 18:52:57,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 76 treesize of output 89 [2023-12-02 18:52:57,986 INFO L349 Elim1Store]: treesize reduction 28, result has 54.1 percent of original size [2023-12-02 18:52:57,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 60 treesize of output 66 [2023-12-02 18:52:58,086 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 11 treesize of output 7 [2023-12-02 18:52:58,169 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 0 case distinctions, treesize of input 23 treesize of output 17 [2023-12-02 18:52:58,305 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 [2023-12-02 18:52:58,318 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 0 case distinctions, treesize of input 16 treesize of output 10 [2023-12-02 18:52:59,458 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:52:59,459 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 3 case distinctions, treesize of input 99 treesize of output 69 [2023-12-02 18:52:59,469 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:52:59,469 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 76 [2023-12-02 18:52:59,767 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 17 treesize of output 9 [2023-12-02 18:52:59,883 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:52:59,883 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:53:00,790 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:53:00,791 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 75 treesize of output 79 [2023-12-02 18:53:02,590 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1912 (Array Int Int)) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1913 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1913))) (let ((.cse3 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1912))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ .cse3 4))) (or (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< 0 (+ 5 (select (select .cse1 .cse0) .cse2))) (not (= .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= (select (select (store .cse1 (select (select .cse4 .cse0) .cse2) v_ArrVal_1915) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))))) is different from false [2023-12-02 18:53:02,643 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:53:02,644 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 157 treesize of output 127 [2023-12-02 18:53:02,659 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:53:02,758 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:53:02,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 335 treesize of output 350 [2023-12-02 18:53:02,800 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:53:02,800 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 253 treesize of output 247 [2023-12-02 18:53:19,450 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:53:19,450 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 158 treesize of output 88 [2023-12-02 18:53:19,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:53:19,457 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:53:19,530 INFO L349 Elim1Store]: treesize reduction 46, result has 22.0 percent of original size [2023-12-02 18:53:19,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 95 treesize of output 79 [2023-12-02 18:53:19,553 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:53:19,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 48 [2023-12-02 18:53:19,583 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 [2023-12-02 18:53:19,636 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:53:19,637 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 88 [2023-12-02 18:53:19,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:53:19,649 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:53:19,676 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2023-12-02 18:53:19,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 71 [2023-12-02 18:53:19,688 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 20 [2023-12-02 18:53:19,712 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:53:19,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 46 [2023-12-02 18:53:19,808 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:53:19,808 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 88 [2023-12-02 18:53:19,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:53:19,820 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:53:19,848 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2023-12-02 18:53:19,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 71 [2023-12-02 18:53:19,860 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 22 treesize of output 20 [2023-12-02 18:53:19,884 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:53:19,885 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 46 [2023-12-02 18:53:19,941 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-12-02 18:53:19,941 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 1 [2023-12-02 18:53:19,970 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-12-02 18:53:19,970 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 1 [2023-12-02 18:53:19,987 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-12-02 18:53:19,987 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 1 [2023-12-02 18:53:20,006 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-12-02 18:53:20,006 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2023-12-02 18:53:20,024 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-12-02 18:53:20,024 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2023-12-02 18:53:20,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:53:20,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:53:20,062 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:53:20,062 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 135 treesize of output 80 [2023-12-02 18:53:20,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:53:20,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:53:20,114 INFO L349 Elim1Store]: treesize reduction 21, result has 27.6 percent of original size [2023-12-02 18:53:20,114 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 2 case distinctions, treesize of input 71 treesize of output 59 [2023-12-02 18:53:20,137 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:53:20,138 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2023-12-02 18:53:20,163 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 [2023-12-02 18:53:20,190 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-12-02 18:53:20,190 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 1 [2023-12-02 18:53:20,215 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-12-02 18:53:20,215 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 185 treesize of output 1 [2023-12-02 18:53:20,235 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-12-02 18:53:20,235 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 1 [2023-12-02 18:53:20,254 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-12-02 18:53:20,254 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 1 [2023-12-02 18:53:20,271 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-12-02 18:53:20,271 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 1 [2023-12-02 18:53:20,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:53:20,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:53:20,294 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-12-02 18:53:20,295 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 162 treesize of output 1 [2023-12-02 18:53:20,312 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-12-02 18:53:20,312 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 1 [2023-12-02 18:53:20,344 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:53:20,345 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 88 [2023-12-02 18:53:20,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:53:20,354 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:53:20,354 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:53:20,420 INFO L349 Elim1Store]: treesize reduction 50, result has 15.3 percent of original size [2023-12-02 18:53:20,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 5 case distinctions, treesize of input 75 treesize of output 55 [2023-12-02 18:53:20,439 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 20 [2023-12-02 18:53:20,449 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 27 treesize of output 23 [2023-12-02 18:53:20,476 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-12-02 18:53:20,477 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 1 [2023-12-02 18:53:20,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:53:20,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:53:20,523 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:53:20,523 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 111 treesize of output 71 [2023-12-02 18:53:20,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:53:20,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:53:20,538 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 45 treesize of output 33 [2023-12-02 18:53:20,554 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 18:53:20,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2023-12-02 18:53:20,569 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 [2023-12-02 18:53:20,591 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-12-02 18:53:20,591 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 1 [2023-12-02 18:53:20,608 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-12-02 18:53:20,609 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 1 [2023-12-02 18:53:20,625 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-12-02 18:53:20,626 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 1 [2023-12-02 18:53:20,642 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-12-02 18:53:20,643 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2023-12-02 18:53:20,659 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-12-02 18:53:20,660 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 1 [2023-12-02 18:53:20,677 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-12-02 18:53:20,677 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2023-12-02 18:53:20,693 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-12-02 18:53:20,694 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 1 [2023-12-02 18:53:20,710 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-12-02 18:53:20,710 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 1 [2023-12-02 18:53:20,727 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-12-02 18:53:20,727 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 1 [2023-12-02 18:53:20,751 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-12-02 18:53:20,751 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 1 [2023-12-02 18:53:20,767 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-12-02 18:53:20,767 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 1 [2023-12-02 18:53:20,785 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-12-02 18:53:20,785 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 1 [2023-12-02 18:53:20,804 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-12-02 18:53:20,805 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 1 [2023-12-02 18:53:20,826 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-12-02 18:53:20,827 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 134 treesize of output 1 [2023-12-02 18:53:20,844 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-12-02 18:53:20,844 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 1 [2023-12-02 18:53:20,867 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-12-02 18:53:20,867 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 1 [2023-12-02 18:53:20,884 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-12-02 18:53:20,884 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 1 [2023-12-02 18:53:20,905 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-12-02 18:53:20,906 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 185 treesize of output 1 [2023-12-02 18:53:20,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:53:20,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:53:20,933 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-12-02 18:53:20,933 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 162 treesize of output 1 [2023-12-02 18:53:20,962 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-12-02 18:53:20,963 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2023-12-02 18:53:20,984 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-12-02 18:53:20,984 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2023-12-02 18:53:21,010 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-12-02 18:53:21,010 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 1 [2023-12-02 18:53:21,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:53:21,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:53:21,040 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-12-02 18:53:21,040 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 135 treesize of output 1 [2023-12-02 18:53:21,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:53:21,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:53:21,071 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-12-02 18:53:21,071 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 84 treesize of output 1 [2023-12-02 18:53:21,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:53:21,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:53:21,093 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-12-02 18:53:21,094 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 111 treesize of output 1 [2023-12-02 18:53:21,158 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:53:21,158 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 185 treesize of output 100 [2023-12-02 18:53:21,164 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:53:21,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:53:21,212 INFO L349 Elim1Store]: treesize reduction 30, result has 21.1 percent of original size [2023-12-02 18:53:21,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 84 [2023-12-02 18:53:21,227 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 9 treesize of output 5 [2023-12-02 18:53:21,241 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 [2023-12-02 18:53:21,284 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:53:21,284 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 158 treesize of output 88 [2023-12-02 18:53:21,289 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:53:21,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:53:21,368 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-12-02 18:53:21,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 87 [2023-12-02 18:53:21,381 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 9 treesize of output 5 [2023-12-02 18:53:21,390 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 18 [2023-12-02 18:53:21,513 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:53:21,513 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 79 [2023-12-02 18:53:21,518 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:53:21,519 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:53:21,607 INFO L349 Elim1Store]: treesize reduction 40, result has 31.0 percent of original size [2023-12-02 18:53:21,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 77 treesize of output 66 [2023-12-02 18:53:21,649 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 [2023-12-02 18:53:21,690 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:53:21,690 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 107 treesize of output 67 [2023-12-02 18:53:21,696 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:53:21,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:53:21,704 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 0 case distinctions, treesize of input 66 treesize of output 42 [2023-12-02 18:53:21,716 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 9 treesize of output 5 [2023-12-02 18:53:21,725 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 [2023-12-02 18:53:21,731 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:53:21,867 INFO L349 Elim1Store]: treesize reduction 63, result has 35.1 percent of original size [2023-12-02 18:53:21,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 153 treesize of output 107 [2023-12-02 18:53:21,874 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:53:21,874 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:53:21,972 INFO L349 Elim1Store]: treesize reduction 40, result has 31.0 percent of original size [2023-12-02 18:53:21,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 94 treesize of output 73 [2023-12-02 18:53:21,990 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 13 treesize of output 9 [2023-12-02 18:53:22,006 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 20 treesize of output 18 [2023-12-02 18:53:22,072 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-12-02 18:53:22,072 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2023-12-02 18:53:22,078 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:53:22,117 INFO L349 Elim1Store]: treesize reduction 96, result has 1.0 percent of original size [2023-12-02 18:53:22,118 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 3 case distinctions, treesize of input 153 treesize of output 1 [2023-12-02 18:53:22,124 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:53:22,177 INFO L349 Elim1Store]: treesize reduction 96, result has 1.0 percent of original size [2023-12-02 18:53:22,177 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 3 case distinctions, treesize of input 102 treesize of output 1 [2023-12-02 18:53:22,183 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:53:22,236 INFO L349 Elim1Store]: treesize reduction 96, result has 1.0 percent of original size [2023-12-02 18:53:22,236 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 3 case distinctions, treesize of input 129 treesize of output 1 [2023-12-02 18:53:22,270 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:53:22,270 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 88 [2023-12-02 18:53:22,276 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:53:22,280 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:53:22,355 INFO L349 Elim1Store]: treesize reduction 42, result has 23.6 percent of original size [2023-12-02 18:53:22,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 105 treesize of output 79 [2023-12-02 18:53:22,371 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 13 treesize of output 9 [2023-12-02 18:53:22,391 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 [2023-12-02 18:53:22,416 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-12-02 18:53:22,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 1 [2023-12-02 18:53:22,428 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:53:22,429 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:53:22,442 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-12-02 18:53:22,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 1 [2023-12-02 18:53:22,460 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-12-02 18:53:22,460 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 1 [2023-12-02 18:53:22,479 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-12-02 18:53:22,479 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 1 [2023-12-02 18:53:26,437 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-12-02 18:53:26,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1159202898] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:53:26,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1132912307] [2023-12-02 18:53:26,439 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-12-02 18:53:26,439 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 18:53:26,439 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 18:53:26,439 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 18:53:26,439 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 18:53:27,795 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 18:54:20,210 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5771#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_remove_first_~head#1.offset| 0) (or (and (= |ULTIMATE.start_dll_remove_first_#t~mem6#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_first_~head#1.base|) 0)) (= |ULTIMATE.start_main_~i~0#1| 0) (exists ((|v_#valid_142| (Array Int Int)) (|v_ULTIMATE.start_dll_remove_first_~head#1.base_50| Int) (|v_#memory_$Pointer$.base_259| (Array Int (Array Int Int))) (|v_#memory_int_231| (Array Int (Array Int Int))) (|v_#memory_int_232| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_253| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_231| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_remove_first_~head#1.base_50|) 0) (store (select |v_#memory_int_231| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_remove_first_~head#1.base_50|) 0)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_remove_first_~head#1.base_50|) 0) 8) (select (select |v_#memory_int_232| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_remove_first_~head#1.base_50|) 0)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_remove_first_~head#1.base_50|) 0) 8)))) |v_#memory_int_232|) (<= 0 (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_remove_first_~head#1.base_50|) 0) 8)) (= (select |#valid| |v_ULTIMATE.start_dll_remove_first_~head#1.base_50|) 1) (<= (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_remove_first_~head#1.base_50|) 0) 12) (select |#length| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_remove_first_~head#1.base_50|) 0))) (= (store |v_#valid_142| (select (select (store |v_#memory_$Pointer$.base_259| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_remove_first_~head#1.base_50|) 0) (store (select |v_#memory_$Pointer$.base_259| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_remove_first_~head#1.base_50|) 0)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_remove_first_~head#1.base_50|) 0) 8) 0)) |v_ULTIMATE.start_dll_remove_first_~head#1.base_50|) 0) 0) |#valid|) (<= (+ (select (select (store |v_#memory_$Pointer$.base_259| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_remove_first_~head#1.base_50|) 0) (store (select |v_#memory_$Pointer$.base_259| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_remove_first_~head#1.base_50|) 0)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_remove_first_~head#1.base_50|) 0) 8) 0)) |v_ULTIMATE.start_dll_remove_first_~head#1.base_50|) 0) 1) |#StackHeapBarrier|) (= (store |v_#memory_int_232| |v_ULTIMATE.start_dll_remove_first_~head#1.base_50| (store (select |v_#memory_int_232| |v_ULTIMATE.start_dll_remove_first_~head#1.base_50|) 0 (select (select |#memory_int| |v_ULTIMATE.start_dll_remove_first_~head#1.base_50|) 0))) |#memory_int|) (= (store (store |v_#memory_$Pointer$.base_259| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_remove_first_~head#1.base_50|) 0) (store (select |v_#memory_$Pointer$.base_259| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_remove_first_~head#1.base_50|) 0)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_remove_first_~head#1.base_50|) 0) 8) 0)) |v_ULTIMATE.start_dll_remove_first_~head#1.base_50| (store (select (store |v_#memory_$Pointer$.base_259| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_remove_first_~head#1.base_50|) 0) (store (select |v_#memory_$Pointer$.base_259| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_remove_first_~head#1.base_50|) 0)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_remove_first_~head#1.base_50|) 0) 8) 0)) |v_ULTIMATE.start_dll_remove_first_~head#1.base_50|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_remove_first_~head#1.base_50|) 0))) |#memory_$Pointer$.base|) (= (select |v_#valid_142| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_remove_first_~head#1.base_50|) 0)) 1) (<= 4 (select |#length| |v_ULTIMATE.start_dll_remove_first_~head#1.base_50|)) (or (= (select (select (store |v_#memory_$Pointer$.base_259| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_remove_first_~head#1.base_50|) 0) (store (select |v_#memory_$Pointer$.base_259| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_remove_first_~head#1.base_50|) 0)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_remove_first_~head#1.base_50|) 0) 8) 0)) |v_ULTIMATE.start_dll_remove_first_~head#1.base_50|) 0) 0) (= (select |v_#valid_142| (select (select (store |v_#memory_$Pointer$.base_259| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_remove_first_~head#1.base_50|) 0) (store (select |v_#memory_$Pointer$.base_259| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_remove_first_~head#1.base_50|) 0)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_remove_first_~head#1.base_50|) 0) 8) 0)) |v_ULTIMATE.start_dll_remove_first_~head#1.base_50|) 0)) 1)) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_253| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_remove_first_~head#1.base_50|) 0) (store (select |v_#memory_$Pointer$.offset_253| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_remove_first_~head#1.base_50|) 0)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_remove_first_~head#1.base_50|) 0) 8) 0)) |v_ULTIMATE.start_dll_remove_first_~head#1.base_50| (store (select (store |v_#memory_$Pointer$.offset_253| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_remove_first_~head#1.base_50|) 0) (store (select |v_#memory_$Pointer$.offset_253| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_remove_first_~head#1.base_50|) 0)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_remove_first_~head#1.base_50|) 0) 8) 0)) |v_ULTIMATE.start_dll_remove_first_~head#1.base_50|) 0 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_remove_first_~head#1.base_50|) 0)))) (= (select (select (store |v_#memory_$Pointer$.offset_253| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_remove_first_~head#1.base_50|) 0) (store (select |v_#memory_$Pointer$.offset_253| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_remove_first_~head#1.base_50|) 0)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_remove_first_~head#1.base_50|) 0) 8) 0)) |v_ULTIMATE.start_dll_remove_first_~head#1.base_50|) 0) 0) (<= 2 |v_ULTIMATE.start_dll_remove_first_~head#1.base_50|))) (<= 4 (select |#length| |ULTIMATE.start_dll_remove_first_~head#1.base|)) (= |ULTIMATE.start_dll_remove_first_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_first_~head#1.base|) 0) |ULTIMATE.start_dll_remove_first_#t~mem6#1.offset|) (= |ULTIMATE.start_dll_remove_first_~head#1.base| |ULTIMATE.start_dll_remove_first_#in~head#1.base|) (= (select |#valid| |ULTIMATE.start_dll_remove_first_~head#1.base|) 1)) (and (= |ULTIMATE.start_dll_remove_first_#t~mem6#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_first_~head#1.base|) 0)) (= |ULTIMATE.start_main_~i~0#1| 1) (<= 4 (select |#length| |ULTIMATE.start_dll_remove_first_~head#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |ULTIMATE.start_dll_remove_first_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_first_~head#1.base|) 0) |ULTIMATE.start_dll_remove_first_#t~mem6#1.offset|) (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= |ULTIMATE.start_dll_remove_first_~head#1.base| |ULTIMATE.start_dll_remove_first_#in~head#1.base|) (= (select |#valid| |ULTIMATE.start_dll_remove_first_~head#1.base|) 1))) (<= 2 |ULTIMATE.start_dll_remove_first_#in~head#1.base|) (= |ULTIMATE.start_dll_remove_first_#in~head#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (or (< (select |#length| |ULTIMATE.start_dll_remove_first_#t~mem6#1.base|) (+ |ULTIMATE.start_dll_remove_first_#t~mem6#1.offset| 8)) (< (+ |ULTIMATE.start_dll_remove_first_#t~mem6#1.offset| 4) 0)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_create_#res#1.offset| 0))' at error location [2023-12-02 18:54:20,210 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 18:54:20,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:54:20,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 18] total 51 [2023-12-02 18:54:20,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184298893] [2023-12-02 18:54:20,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:54:20,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-12-02 18:54:20,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:54:20,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-12-02 18:54:20,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=4299, Unknown=23, NotChecked=134, Total=4830 [2023-12-02 18:54:20,213 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 52 states, 51 states have (on average 1.7450980392156863) internal successors, (89), 52 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) [2023-12-02 18:54:27,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 18:54:30,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 18:54:30,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:54:30,699 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2023-12-02 18:54:30,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-02 18:54:30,699 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 1.7450980392156863) internal successors, (89), 52 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) Word has length 30 [2023-12-02 18:54:30,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:54:30,700 INFO L225 Difference]: With dead ends: 74 [2023-12-02 18:54:30,700 INFO L226 Difference]: Without dead ends: 74 [2023-12-02 18:54:30,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2068 ImplicationChecksByTransitivity, 68.3s TimeCoverageRelationStatistics Valid=544, Invalid=5757, Unknown=23, NotChecked=156, Total=6480 [2023-12-02 18:54:30,704 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 138 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 14 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2023-12-02 18:54:30,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 363 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 812 Invalid, 1 Unknown, 70 Unchecked, 7.7s Time] [2023-12-02 18:54:30,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-12-02 18:54:30,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 58. [2023-12-02 18:54:30,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 57 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:54:30,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2023-12-02 18:54:30,707 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 30 [2023-12-02 18:54:30,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:54:30,707 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2023-12-02 18:54:30,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 1.7450980392156863) internal successors, (89), 52 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) [2023-12-02 18:54:30,707 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2023-12-02 18:54:30,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 18:54:30,707 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:54:30,707 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:54:30,712 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-12-02 18:54:30,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-12-02 18:54:30,908 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-12-02 18:54:30,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:54:30,908 INFO L85 PathProgramCache]: Analyzing trace with hash 54182191, now seen corresponding path program 1 times [2023-12-02 18:54:30,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:54:30,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736213398] [2023-12-02 18:54:30,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:54:30,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:54:30,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:54:31,203 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-02 18:54:31,204 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:54:31,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736213398] [2023-12-02 18:54:31,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736213398] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:54:31,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:54:31,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 18:54:31,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513737022] [2023-12-02 18:54:31,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:54:31,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 18:54:31,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:54:31,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 18:54:31,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 18:54:31,205 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:54:31,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:54:31,491 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2023-12-02 18:54:31,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 18:54:31,491 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-12-02 18:54:31,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:54:31,492 INFO L225 Difference]: With dead ends: 82 [2023-12-02 18:54:31,492 INFO L226 Difference]: Without dead ends: 82 [2023-12-02 18:54:31,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-12-02 18:54:31,493 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 49 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 18:54:31,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 102 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 18:54:31,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-12-02 18:54:31,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 62. [2023-12-02 18:54:31,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 61 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:54:31,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2023-12-02 18:54:31,494 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 31 [2023-12-02 18:54:31,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:54:31,495 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2023-12-02 18:54:31,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:54:31,495 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2023-12-02 18:54:31,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-02 18:54:31,495 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:54:31,495 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:54:31,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-12-02 18:54:31,495 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-12-02 18:54:31,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:54:31,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1615825592, now seen corresponding path program 1 times [2023-12-02 18:54:31,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:54:31,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218783127] [2023-12-02 18:54:31,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:54:31,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:54:31,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:54:36,849 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:54:36,849 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:54:36,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218783127] [2023-12-02 18:54:36,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218783127] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:54:36,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501516081] [2023-12-02 18:54:36,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:54:36,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:54:36,850 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:54:36,850 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:54:36,852 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfc81616-ea5d-459a-aa4b-144c893891e0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-12-02 18:54:37,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:54:37,017 INFO L262 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 113 conjunts are in the unsatisfiable core [2023-12-02 18:54:37,021 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:54:37,033 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 [2023-12-02 18:54:37,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 18:54:37,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:54:37,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-12-02 18:54:37,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:54:37,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-12-02 18:54:37,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 18:54:37,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 18:54:37,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-12-02 18:54:37,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-12-02 18:54:38,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:54:38,367 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-12-02 18:54:38,367 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 2 case distinctions, treesize of input 16 treesize of output 18 [2023-12-02 18:54:38,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2023-12-02 18:54:38,737 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 16 [2023-12-02 18:54:38,772 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 16 [2023-12-02 18:54:38,817 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 26 treesize of output 28 [2023-12-02 18:54:38,850 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 26 treesize of output 28 [2023-12-02 18:54:39,157 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-12-02 18:54:39,196 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-12-02 18:54:39,606 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-12-02 18:54:39,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 115 treesize of output 79 [2023-12-02 18:54:39,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 38 [2023-12-02 18:54:42,233 INFO L349 Elim1Store]: treesize reduction 218, result has 32.1 percent of original size [2023-12-02 18:54:42,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 3 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 27 case distinctions, treesize of input 167 treesize of output 180 [2023-12-02 18:54:42,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:54:42,531 INFO L349 Elim1Store]: treesize reduction 124, result has 34.0 percent of original size [2023-12-02 18:54:42,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 87 treesize of output 117 [2023-12-02 18:54:44,138 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:54:44,138 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 13 treesize of output 17 [2023-12-02 18:54:50,514 INFO L349 Elim1Store]: treesize reduction 1158, result has 8.9 percent of original size [2023-12-02 18:54:50,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 17 select indices, 17 select index equivalence classes, 3 disjoint index pairs (out of 136 index pairs), introduced 21 new quantified variables, introduced 140 case distinctions, treesize of input 538 treesize of output 487 [2023-12-02 18:54:50,688 INFO L224 Elim1Store]: Index analysis took 131 ms [2023-12-02 18:54:51,499 INFO L349 Elim1Store]: treesize reduction 982, result has 11.9 percent of original size [2023-12-02 18:54:51,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 14 select indices, 14 select index equivalence classes, 3 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 92 case distinctions, treesize of input 441 treesize of output 533