./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2c_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2c_update_all.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E --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 6bfeee33a1b1d098a34bec7a761d4de16bc595043f21d77f5851cba758b79f34 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 05:35:03,946 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 05:35:04,061 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-14 05:35:04,067 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 05:35:04,068 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 05:35:04,117 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 05:35:04,118 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 05:35:04,118 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 05:35:04,119 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 05:35:04,120 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 05:35:04,121 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 05:35:04,121 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 05:35:04,121 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 05:35:04,121 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 05:35:04,122 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 05:35:04,123 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 05:35:04,123 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 05:35:04,123 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 05:35:04,123 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 05:35:04,123 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 05:35:04,123 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 05:35:04,124 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 05:35:04,124 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 05:35:04,124 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 05:35:04,124 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 05:35:04,124 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 05:35:04,124 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 05:35:04,125 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 05:35:04,125 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 05:35:04,125 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 05:35:04,125 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 05:35:04,125 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-14 05:35:04,125 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 05:35:04,125 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 05:35:04,125 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 05:35:04,125 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 05:35:04,125 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 05:35:04,125 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 05:35:04,126 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 05:35:04,126 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 05:35:04,126 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 05:35:04,126 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:35:04,126 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 05:35:04,126 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 05:35:04,126 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 05:35:04,128 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 05:35:04,128 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 05:35:04,128 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 05:35:04,128 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 05:35:04,129 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E 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 -> 6bfeee33a1b1d098a34bec7a761d4de16bc595043f21d77f5851cba758b79f34 [2024-11-14 05:35:04,557 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 05:35:04,573 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 05:35:04,579 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 05:35:04,580 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 05:35:04,581 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 05:35:04,582 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/list-simple/dll2c_update_all.i Unable to find full path for "g++" [2024-11-14 05:35:06,729 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 05:35:07,138 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 05:35:07,139 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/sv-benchmarks/c/list-simple/dll2c_update_all.i [2024-11-14 05:35:07,165 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/data/7eac8f7bf/cc679ff6689e4cdda3f42a1e85d38cce/FLAGc4a36ba3f [2024-11-14 05:35:07,183 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/data/7eac8f7bf/cc679ff6689e4cdda3f42a1e85d38cce [2024-11-14 05:35:07,187 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 05:35:07,189 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 05:35:07,191 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 05:35:07,191 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 05:35:07,197 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 05:35:07,198 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:35:07" (1/1) ... [2024-11-14 05:35:07,200 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25b3f033 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:07, skipping insertion in model container [2024-11-14 05:35:07,200 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:35:07" (1/1) ... [2024-11-14 05:35:07,235 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 05:35:07,720 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:35:07,740 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 05:35:07,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:35:07,823 INFO L204 MainTranslator]: Completed translation [2024-11-14 05:35:07,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:07 WrapperNode [2024-11-14 05:35:07,824 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 05:35:07,826 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 05:35:07,826 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 05:35:07,826 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 05:35:07,832 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:07" (1/1) ... [2024-11-14 05:35:07,845 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:07" (1/1) ... [2024-11-14 05:35:07,870 INFO L138 Inliner]: procedures = 126, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 138 [2024-11-14 05:35:07,871 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 05:35:07,872 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 05:35:07,872 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 05:35:07,872 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 05:35:07,881 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:07" (1/1) ... [2024-11-14 05:35:07,881 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:07" (1/1) ... [2024-11-14 05:35:07,889 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:07" (1/1) ... [2024-11-14 05:35:07,890 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:07" (1/1) ... [2024-11-14 05:35:07,905 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:07" (1/1) ... [2024-11-14 05:35:07,909 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:07" (1/1) ... [2024-11-14 05:35:07,911 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:07" (1/1) ... [2024-11-14 05:35:07,912 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:07" (1/1) ... [2024-11-14 05:35:07,915 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 05:35:07,916 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 05:35:07,917 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 05:35:07,917 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 05:35:07,918 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:07" (1/1) ... [2024-11-14 05:35:07,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:35:07,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:35:07,965 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 05:35:07,970 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 05:35:08,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 05:35:08,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 05:35:08,006 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-14 05:35:08,007 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-14 05:35:08,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 05:35:08,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 05:35:08,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 05:35:08,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 05:35:08,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 05:35:08,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 05:35:08,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 05:35:08,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 05:35:08,182 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 05:35:08,184 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 05:35:08,626 INFO L? ?]: Removed 105 outVars from TransFormulas that were not future-live. [2024-11-14 05:35:08,626 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 05:35:08,735 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 05:35:08,736 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-14 05:35:08,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:35:08 BoogieIcfgContainer [2024-11-14 05:35:08,736 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 05:35:08,739 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 05:35:08,740 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 05:35:08,746 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 05:35:08,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:35:07" (1/3) ... [2024-11-14 05:35:08,747 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e085c77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:35:08, skipping insertion in model container [2024-11-14 05:35:08,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:07" (2/3) ... [2024-11-14 05:35:08,748 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e085c77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:35:08, skipping insertion in model container [2024-11-14 05:35:08,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:35:08" (3/3) ... [2024-11-14 05:35:08,751 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_update_all.i [2024-11-14 05:35:08,770 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 05:35:08,773 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2c_update_all.i that has 2 procedures, 78 locations, 1 initial locations, 6 loop locations, and 34 error locations. [2024-11-14 05:35:08,833 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 05:35:08,852 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6a06a99d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 05:35:08,853 INFO L334 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2024-11-14 05:35:08,858 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 40 states have (on average 2.125) internal successors, (85), 74 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:35:08,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-14 05:35:08,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:35:08,866 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-14 05:35:08,866 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-14 05:35:08,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:35:08,874 INFO L85 PathProgramCache]: Analyzing trace with hash 214329553, now seen corresponding path program 1 times [2024-11-14 05:35:08,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:35:08,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834050604] [2024-11-14 05:35:08,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:35:08,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:35:09,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:35:09,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:35:09,203 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:35:09,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834050604] [2024-11-14 05:35:09,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834050604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:35:09,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:35:09,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 05:35:09,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377915127] [2024-11-14 05:35:09,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:35:09,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:35:09,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:35:09,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:35:09,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:35:09,256 INFO L87 Difference]: Start difference. First operand has 78 states, 40 states have (on average 2.125) internal successors, (85), 74 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:35:09,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:35:09,493 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2024-11-14 05:35:09,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:35:09,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-14 05:35:09,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:35:09,515 INFO L225 Difference]: With dead ends: 74 [2024-11-14 05:35:09,515 INFO L226 Difference]: Without dead ends: 72 [2024-11-14 05:35:09,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:35:09,527 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 2 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:35:09,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 99 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:35:09,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-14 05:35:09,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-14 05:35:09,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 38 states have (on average 2.0) internal successors, (76), 68 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:35:09,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2024-11-14 05:35:09,622 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 5 [2024-11-14 05:35:09,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:35:09,625 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2024-11-14 05:35:09,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:35:09,626 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2024-11-14 05:35:09,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-14 05:35:09,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:35:09,627 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-14 05:35:09,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 05:35:09,628 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-14 05:35:09,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:35:09,629 INFO L85 PathProgramCache]: Analyzing trace with hash 214329554, now seen corresponding path program 1 times [2024-11-14 05:35:09,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:35:09,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126801825] [2024-11-14 05:35:09,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:35:09,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:35:09,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:35:09,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:35:09,863 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:35:09,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126801825] [2024-11-14 05:35:09,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126801825] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:35:09,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:35:09,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 05:35:09,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454020348] [2024-11-14 05:35:09,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:35:09,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:35:09,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:35:09,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:35:09,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:35:09,866 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:35:09,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:35:09,995 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2024-11-14 05:35:09,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:35:09,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-14 05:35:09,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:35:09,997 INFO L225 Difference]: With dead ends: 69 [2024-11-14 05:35:09,997 INFO L226 Difference]: Without dead ends: 69 [2024-11-14 05:35:09,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:35:09,999 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 2 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:35:09,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 102 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:35:10,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-14 05:35:10,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-14 05:35:10,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 65 states have internal predecessors, (73), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:35:10,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 77 transitions. [2024-11-14 05:35:10,006 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 77 transitions. Word has length 5 [2024-11-14 05:35:10,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:35:10,006 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 77 transitions. [2024-11-14 05:35:10,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:35:10,007 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2024-11-14 05:35:10,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-14 05:35:10,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:35:10,007 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:35:10,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 05:35:10,008 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-14 05:35:10,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:35:10,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1750470105, now seen corresponding path program 1 times [2024-11-14 05:35:10,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:35:10,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297945077] [2024-11-14 05:35:10,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:35:10,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:35:10,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:35:10,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:35:10,136 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:35:10,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297945077] [2024-11-14 05:35:10,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297945077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:35:10,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:35:10,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:35:10,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802569679] [2024-11-14 05:35:10,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:35:10,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:35:10,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:35:10,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:35:10,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:35:10,138 INFO L87 Difference]: Start difference. First operand 69 states and 77 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 05:35:10,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:35:10,198 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2024-11-14 05:35:10,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:35:10,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-14 05:35:10,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:35:10,201 INFO L225 Difference]: With dead ends: 80 [2024-11-14 05:35:10,201 INFO L226 Difference]: Without dead ends: 80 [2024-11-14 05:35:10,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:35:10,202 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 10 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:35:10,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 116 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:35:10,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-14 05:35:10,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 70. [2024-11-14 05:35:10,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 39 states have (on average 1.8974358974358974) internal successors, (74), 66 states have internal predecessors, (74), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:35:10,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2024-11-14 05:35:10,216 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 11 [2024-11-14 05:35:10,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:35:10,216 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2024-11-14 05:35:10,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 05:35:10,216 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2024-11-14 05:35:10,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-14 05:35:10,217 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:35:10,217 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:35:10,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 05:35:10,218 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-14 05:35:10,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:35:10,218 INFO L85 PathProgramCache]: Analyzing trace with hash -317388256, now seen corresponding path program 1 times [2024-11-14 05:35:10,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:35:10,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542111005] [2024-11-14 05:35:10,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:35:10,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:35:10,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:35:10,509 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:35:10,509 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:35:10,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542111005] [2024-11-14 05:35:10,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542111005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:35:10,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:35:10,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 05:35:10,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600722607] [2024-11-14 05:35:10,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:35:10,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:35:10,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:35:10,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:35:10,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:35:10,511 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:35:10,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:35:10,729 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2024-11-14 05:35:10,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:35:10,730 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-11-14 05:35:10,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:35:10,731 INFO L225 Difference]: With dead ends: 69 [2024-11-14 05:35:10,731 INFO L226 Difference]: Without dead ends: 69 [2024-11-14 05:35:10,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:35:10,735 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 7 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:35:10,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 184 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:35:10,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-14 05:35:10,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-14 05:35:10,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 39 states have (on average 1.8717948717948718) internal successors, (73), 65 states have internal predecessors, (73), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:35:10,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 77 transitions. [2024-11-14 05:35:10,747 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 77 transitions. Word has length 19 [2024-11-14 05:35:10,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:35:10,748 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 77 transitions. [2024-11-14 05:35:10,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:35:10,748 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2024-11-14 05:35:10,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-14 05:35:10,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:35:10,749 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:35:10,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 05:35:10,749 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-14 05:35:10,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:35:10,750 INFO L85 PathProgramCache]: Analyzing trace with hash -317388255, now seen corresponding path program 1 times [2024-11-14 05:35:10,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:35:10,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755882834] [2024-11-14 05:35:10,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:35:10,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:35:10,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:35:11,176 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:35:11,177 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:35:11,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755882834] [2024-11-14 05:35:11,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755882834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:35:11,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:35:11,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 05:35:11,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891738293] [2024-11-14 05:35:11,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:35:11,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:35:11,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:35:11,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:35:11,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:35:11,179 INFO L87 Difference]: Start difference. First operand 69 states and 77 transitions. Second operand has 6 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:35:11,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:35:11,376 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2024-11-14 05:35:11,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:35:11,377 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-11-14 05:35:11,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:35:11,378 INFO L225 Difference]: With dead ends: 68 [2024-11-14 05:35:11,378 INFO L226 Difference]: Without dead ends: 68 [2024-11-14 05:35:11,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:35:11,381 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 6 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:35:11,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 204 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:35:11,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-14 05:35:11,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-14 05:35:11,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 39 states have (on average 1.8461538461538463) internal successors, (72), 64 states have internal predecessors, (72), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:35:11,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2024-11-14 05:35:11,395 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 19 [2024-11-14 05:35:11,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:35:11,395 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2024-11-14 05:35:11,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:35:11,396 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2024-11-14 05:35:11,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-14 05:35:11,396 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:35:11,396 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:35:11,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 05:35:11,397 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-14 05:35:11,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:35:11,397 INFO L85 PathProgramCache]: Analyzing trace with hash -67436319, now seen corresponding path program 1 times [2024-11-14 05:35:11,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:35:11,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371527347] [2024-11-14 05:35:11,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:35:11,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:35:11,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:35:11,828 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:35:11,828 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:35:11,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371527347] [2024-11-14 05:35:11,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371527347] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:35:11,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070432239] [2024-11-14 05:35:11,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:35:11,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:35:11,829 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:35:11,837 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:35:11,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 05:35:11,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:35:11,985 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-14 05:35:11,991 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:35:12,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:35:12,091 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2024-11-14 05:35:12,150 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-14 05:35:12,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-14 05:35:12,186 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-14 05:35:12,187 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:35:12,501 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:35:12,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070432239] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:35:12,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [157751987] [2024-11-14 05:35:12,527 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2024-11-14 05:35:12,528 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:35:12,532 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:35:12,538 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:35:12,538 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:35:13,903 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-14 05:35:13,962 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:35:16,635 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '942#(and (not (= 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (exists ((|v_#memory_$Pointer$.base_71| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_71| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_71| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) |#memory_$Pointer$.base|)) (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (<= 4 (select |#length| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) 1)) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_#memory_$Pointer$.offset_71| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_71| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_71| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 0)))) (exists ((|v_#memory_int_67| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_67| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_int_67| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))))) (= |ULTIMATE.start_dll_circular_create_~data#1| 1))' at error location [2024-11-14 05:35:16,635 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:35:16,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:35:16,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 11 [2024-11-14 05:35:16,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886798522] [2024-11-14 05:35:16,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:35:16,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-14 05:35:16,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:35:16,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-14 05:35:16,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=483, Unknown=1, NotChecked=44, Total=600 [2024-11-14 05:35:16,640 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand has 12 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-14 05:35:17,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:35:17,014 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2024-11-14 05:35:17,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:35:17,015 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 21 [2024-11-14 05:35:17,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:35:17,016 INFO L225 Difference]: With dead ends: 73 [2024-11-14 05:35:17,016 INFO L226 Difference]: Without dead ends: 73 [2024-11-14 05:35:17,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=77, Invalid=526, Unknown=1, NotChecked=46, Total=650 [2024-11-14 05:35:17,021 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 1 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 79 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:35:17,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 230 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 279 Invalid, 0 Unknown, 79 Unchecked, 0.3s Time] [2024-11-14 05:35:17,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-14 05:35:17,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-14 05:35:17,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 43 states have (on average 1.813953488372093) internal successors, (78), 68 states have internal predecessors, (78), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:35:17,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 84 transitions. [2024-11-14 05:35:17,033 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 84 transitions. Word has length 21 [2024-11-14 05:35:17,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:35:17,034 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 84 transitions. [2024-11-14 05:35:17,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-14 05:35:17,034 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2024-11-14 05:35:17,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-14 05:35:17,034 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:35:17,034 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:35:17,063 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 05:35:17,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:35:17,235 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-14 05:35:17,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:35:17,236 INFO L85 PathProgramCache]: Analyzing trace with hash -67436318, now seen corresponding path program 1 times [2024-11-14 05:35:17,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:35:17,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168258289] [2024-11-14 05:35:17,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:35:17,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:35:17,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:35:17,907 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:35:17,908 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:35:17,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168258289] [2024-11-14 05:35:17,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168258289] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:35:17,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125460821] [2024-11-14 05:35:17,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:35:17,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:35:17,909 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:35:17,911 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:35:17,914 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 05:35:18,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:35:18,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-14 05:35:18,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:35:18,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 05:35:18,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:35:18,262 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 05:35:18,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 05:35:18,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-14 05:35:18,317 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:35:18,317 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:35:18,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125460821] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:35:18,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [849049203] [2024-11-14 05:35:18,500 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2024-11-14 05:35:18,501 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:35:18,501 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:35:18,501 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:35:18,502 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:35:19,213 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-14 05:35:19,255 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:35:21,569 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1194#(and (not (= 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (<= 1 |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_85| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_85| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_85| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))))) (exists ((|v_#memory_$Pointer$.offset_85| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_85| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_85| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 0)))) (exists ((|v_#memory_int_81| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_81| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_int_81| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))))) (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (<= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) 7) (<= 4 (select |#length| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~data#1| 1))' at error location [2024-11-14 05:35:21,569 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:35:21,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:35:21,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2024-11-14 05:35:21,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707570023] [2024-11-14 05:35:21,570 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 05:35:21,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-14 05:35:21,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:35:21,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-14 05:35:21,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=670, Unknown=1, NotChecked=0, Total=756 [2024-11-14 05:35:21,572 INFO L87 Difference]: Start difference. First operand 73 states and 84 transitions. Second operand has 13 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 05:35:22,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:35:22,130 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2024-11-14 05:35:22,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 05:35:22,131 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2024-11-14 05:35:22,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:35:22,133 INFO L225 Difference]: With dead ends: 73 [2024-11-14 05:35:22,133 INFO L226 Difference]: Without dead ends: 73 [2024-11-14 05:35:22,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=96, Invalid=773, Unknown=1, NotChecked=0, Total=870 [2024-11-14 05:35:22,135 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 05:35:22,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 310 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 05:35:22,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-14 05:35:22,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-14 05:35:22,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 43 states have (on average 1.7906976744186047) internal successors, (77), 68 states have internal predecessors, (77), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:35:22,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2024-11-14 05:35:22,143 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 21 [2024-11-14 05:35:22,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:35:22,143 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2024-11-14 05:35:22,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 05:35:22,144 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2024-11-14 05:35:22,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-14 05:35:22,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:35:22,144 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:35:22,168 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-14 05:35:22,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-14 05:35:22,349 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-14 05:35:22,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:35:22,350 INFO L85 PathProgramCache]: Analyzing trace with hash -381632910, now seen corresponding path program 1 times [2024-11-14 05:35:22,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:35:22,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408974345] [2024-11-14 05:35:22,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:35:22,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:35:22,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:35:22,529 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:35:22,529 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:35:22,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408974345] [2024-11-14 05:35:22,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408974345] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:35:22,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945618334] [2024-11-14 05:35:22,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:35:22,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:35:22,530 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:35:22,532 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:35:22,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 05:35:22,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:35:22,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-14 05:35:22,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:35:22,702 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:35:22,702 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:35:22,744 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:35:22,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945618334] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:35:22,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [420606126] [2024-11-14 05:35:22,747 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2024-11-14 05:35:22,748 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:35:22,748 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:35:22,748 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:35:22,748 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:35:23,486 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 43 for LOIs [2024-11-14 05:35:23,588 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:35:40,392 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1495#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_20| Int)) (not (= (select |#valid| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_20|) 1))) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~data#1| 1))' at error location [2024-11-14 05:35:40,393 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:35:40,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:35:40,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2024-11-14 05:35:40,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903167212] [2024-11-14 05:35:40,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:35:40,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:35:40,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:35:40,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:35:40,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=355, Unknown=7, NotChecked=0, Total=420 [2024-11-14 05:35:40,394 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:35:40,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:35:40,594 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2024-11-14 05:35:40,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:35:40,594 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2024-11-14 05:35:40,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:35:40,595 INFO L225 Difference]: With dead ends: 73 [2024-11-14 05:35:40,595 INFO L226 Difference]: Without dead ends: 73 [2024-11-14 05:35:40,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=58, Invalid=355, Unknown=7, NotChecked=0, Total=420 [2024-11-14 05:35:40,596 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 1 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:35:40,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 251 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:35:40,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-14 05:35:40,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-14 05:35:40,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 43 states have (on average 1.7674418604651163) internal successors, (76), 68 states have internal predecessors, (76), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:35:40,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2024-11-14 05:35:40,607 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 23 [2024-11-14 05:35:40,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:35:40,607 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2024-11-14 05:35:40,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:35:40,607 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2024-11-14 05:35:40,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-14 05:35:40,608 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:35:40,608 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:35:40,636 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-14 05:35:40,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-14 05:35:40,809 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-14 05:35:40,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:35:40,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1049317804, now seen corresponding path program 1 times [2024-11-14 05:35:40,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:35:40,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687694704] [2024-11-14 05:35:40,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:35:40,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:35:40,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:35:40,966 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:35:40,966 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:35:40,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687694704] [2024-11-14 05:35:40,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687694704] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:35:40,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012834668] [2024-11-14 05:35:40,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:35:40,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:35:40,967 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:35:40,969 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:35:40,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-14 05:35:41,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:35:41,119 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-14 05:35:41,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:35:41,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:35:41,265 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-14 05:35:41,355 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-14 05:35:41,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-14 05:35:41,387 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2024-11-14 05:35:41,388 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:35:41,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012834668] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:35:41,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1051075859] [2024-11-14 05:35:41,507 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2024-11-14 05:35:41,507 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:35:41,508 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:35:41,508 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:35:41,508 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:35:42,302 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-14 05:35:42,345 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:35:51,126 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1760#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_21| Int)) (not (= (select |#valid| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_21|) 1))) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~data#1| 1))' at error location [2024-11-14 05:35:51,126 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:35:51,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:35:51,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7] total 9 [2024-11-14 05:35:51,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420229118] [2024-11-14 05:35:51,127 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 05:35:51,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-14 05:35:51,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:35:51,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-14 05:35:51,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=566, Unknown=4, NotChecked=48, Total=702 [2024-11-14 05:35:51,129 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand has 10 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 05:35:51,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:35:51,784 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2024-11-14 05:35:51,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 05:35:51,785 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2024-11-14 05:35:51,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:35:51,786 INFO L225 Difference]: With dead ends: 72 [2024-11-14 05:35:51,786 INFO L226 Difference]: Without dead ends: 72 [2024-11-14 05:35:51,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=97, Invalid=715, Unknown=4, NotChecked=54, Total=870 [2024-11-14 05:35:51,787 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 9 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 05:35:51,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 267 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 300 Invalid, 0 Unknown, 76 Unchecked, 0.5s Time] [2024-11-14 05:35:51,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-14 05:35:51,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-14 05:35:51,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 43 states have (on average 1.744186046511628) internal successors, (75), 67 states have internal predecessors, (75), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:35:51,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2024-11-14 05:35:51,798 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 24 [2024-11-14 05:35:51,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:35:51,799 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2024-11-14 05:35:51,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 05:35:51,799 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2024-11-14 05:35:51,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-14 05:35:51,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:35:51,800 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:35:51,819 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-14 05:35:52,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-14 05:35:52,001 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-14 05:35:52,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:35:52,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1049317805, now seen corresponding path program 1 times [2024-11-14 05:35:52,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:35:52,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637036377] [2024-11-14 05:35:52,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:35:52,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:35:52,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:35:52,437 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:35:52,437 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:35:52,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637036377] [2024-11-14 05:35:52,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637036377] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:35:52,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787034313] [2024-11-14 05:35:52,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:35:52,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:35:52,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:35:52,440 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:35:52,442 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-14 05:35:52,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:35:52,621 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-14 05:35:52,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:35:52,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 05:35:52,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:35:52,898 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-14 05:35:52,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:35:52,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-14 05:35:52,967 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 05:35:52,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 05:35:53,049 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-14 05:35:53,050 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:35:53,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787034313] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:35:53,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [715023136] [2024-11-14 05:35:53,312 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2024-11-14 05:35:53,313 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:35:53,313 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:35:53,313 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:35:53,313 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:35:54,166 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-14 05:35:54,223 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:35:57,143 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2036#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_22| Int)) (<= (select |#length| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_22|) 3)) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_create_~data#1| 1))' at error location [2024-11-14 05:35:57,144 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:35:57,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:35:57,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2024-11-14 05:35:57,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332810540] [2024-11-14 05:35:57,144 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 05:35:57,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-14 05:35:57,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:35:57,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-14 05:35:57,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=882, Unknown=2, NotChecked=60, Total=1056 [2024-11-14 05:35:57,146 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand has 15 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 05:35:57,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:35:57,742 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2024-11-14 05:35:57,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 05:35:57,743 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2024-11-14 05:35:57,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:35:57,745 INFO L225 Difference]: With dead ends: 89 [2024-11-14 05:35:57,745 INFO L226 Difference]: Without dead ends: 89 [2024-11-14 05:35:57,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=139, Invalid=1123, Unknown=2, NotChecked=68, Total=1332 [2024-11-14 05:35:57,747 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 24 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 98 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 05:35:57,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 277 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 242 Invalid, 0 Unknown, 98 Unchecked, 0.4s Time] [2024-11-14 05:35:57,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-14 05:35:57,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 82. [2024-11-14 05:35:57,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 76 states have internal predecessors, (89), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 05:35:57,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 97 transitions. [2024-11-14 05:35:57,753 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 97 transitions. Word has length 24 [2024-11-14 05:35:57,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:35:57,753 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 97 transitions. [2024-11-14 05:35:57,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 05:35:57,754 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 97 transitions. [2024-11-14 05:35:57,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-14 05:35:57,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:35:57,757 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:35:57,776 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-14 05:35:57,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-14 05:35:57,961 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-14 05:35:57,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:35:57,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1830886440, now seen corresponding path program 1 times [2024-11-14 05:35:57,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:35:57,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926674512] [2024-11-14 05:35:57,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:35:57,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:35:57,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:35:58,203 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:35:58,204 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:35:58,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926674512] [2024-11-14 05:35:58,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926674512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:35:58,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:35:58,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 05:35:58,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064694128] [2024-11-14 05:35:58,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:35:58,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 05:35:58,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:35:58,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 05:35:58,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:35:58,207 INFO L87 Difference]: Start difference. First operand 82 states and 97 transitions. Second operand has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:35:58,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:35:58,656 INFO L93 Difference]: Finished difference Result 81 states and 96 transitions. [2024-11-14 05:35:58,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:35:58,657 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-11-14 05:35:58,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:35:58,657 INFO L225 Difference]: With dead ends: 81 [2024-11-14 05:35:58,657 INFO L226 Difference]: Without dead ends: 81 [2024-11-14 05:35:58,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:35:58,658 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 6 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 05:35:58,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 211 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 05:35:58,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-14 05:35:58,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-14 05:35:58,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 52 states have (on average 1.6923076923076923) internal successors, (88), 75 states have internal predecessors, (88), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 05:35:58,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 96 transitions. [2024-11-14 05:35:58,663 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 96 transitions. Word has length 25 [2024-11-14 05:35:58,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:35:58,663 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 96 transitions. [2024-11-14 05:35:58,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:35:58,663 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 96 transitions. [2024-11-14 05:35:58,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-14 05:35:58,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:35:58,664 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:35:58,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-14 05:35:58,664 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-14 05:35:58,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:35:58,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1830886439, now seen corresponding path program 1 times [2024-11-14 05:35:58,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:35:58,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612845456] [2024-11-14 05:35:58,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:35:58,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:35:58,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:35:59,031 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:35:59,032 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:35:59,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612845456] [2024-11-14 05:35:59,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612845456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:35:59,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:35:59,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 05:35:59,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090760566] [2024-11-14 05:35:59,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:35:59,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 05:35:59,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:35:59,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 05:35:59,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:35:59,033 INFO L87 Difference]: Start difference. First operand 81 states and 96 transitions. Second operand has 7 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:35:59,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:35:59,510 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2024-11-14 05:35:59,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:35:59,511 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-11-14 05:35:59,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:35:59,511 INFO L225 Difference]: With dead ends: 80 [2024-11-14 05:35:59,511 INFO L226 Difference]: Without dead ends: 80 [2024-11-14 05:35:59,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:35:59,512 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 5 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 05:35:59,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 231 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 05:35:59,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-14 05:35:59,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-14 05:35:59,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 52 states have (on average 1.6730769230769231) internal successors, (87), 74 states have internal predecessors, (87), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 05:35:59,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 95 transitions. [2024-11-14 05:35:59,521 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 95 transitions. Word has length 25 [2024-11-14 05:35:59,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:35:59,521 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 95 transitions. [2024-11-14 05:35:59,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:35:59,522 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 95 transitions. [2024-11-14 05:35:59,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 05:35:59,522 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:35:59,522 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:35:59,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-14 05:35:59,523 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-14 05:35:59,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:35:59,523 INFO L85 PathProgramCache]: Analyzing trace with hash -2143458438, now seen corresponding path program 1 times [2024-11-14 05:35:59,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:35:59,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002549343] [2024-11-14 05:35:59,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:35:59,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:35:59,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:35:59,653 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 05:35:59,653 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:35:59,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002549343] [2024-11-14 05:35:59,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002549343] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:35:59,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:35:59,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:35:59,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559666815] [2024-11-14 05:35:59,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:35:59,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:35:59,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:35:59,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:35:59,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:35:59,655 INFO L87 Difference]: Start difference. First operand 80 states and 95 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:35:59,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:35:59,811 INFO L93 Difference]: Finished difference Result 97 states and 115 transitions. [2024-11-14 05:35:59,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:35:59,812 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2024-11-14 05:35:59,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:35:59,813 INFO L225 Difference]: With dead ends: 97 [2024-11-14 05:35:59,813 INFO L226 Difference]: Without dead ends: 97 [2024-11-14 05:35:59,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:35:59,814 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 16 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:35:59,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 158 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:35:59,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-14 05:35:59,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 82. [2024-11-14 05:35:59,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 54 states have (on average 1.6666666666666667) internal successors, (90), 76 states have internal predecessors, (90), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 05:35:59,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 98 transitions. [2024-11-14 05:35:59,823 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 98 transitions. Word has length 28 [2024-11-14 05:35:59,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:35:59,824 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 98 transitions. [2024-11-14 05:35:59,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:35:59,824 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 98 transitions. [2024-11-14 05:35:59,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 05:35:59,825 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:35:59,825 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:35:59,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-14 05:35:59,825 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-14 05:35:59,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:35:59,825 INFO L85 PathProgramCache]: Analyzing trace with hash -2143453905, now seen corresponding path program 1 times [2024-11-14 05:35:59,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:35:59,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62556305] [2024-11-14 05:35:59,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:35:59,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:35:59,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:36:00,134 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:36:00,134 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:36:00,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62556305] [2024-11-14 05:36:00,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62556305] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:36:00,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:36:00,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-14 05:36:00,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573403673] [2024-11-14 05:36:00,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:36:00,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 05:36:00,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:36:00,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 05:36:00,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-14 05:36:00,136 INFO L87 Difference]: Start difference. First operand 82 states and 98 transitions. Second operand has 9 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:36:00,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:36:00,634 INFO L93 Difference]: Finished difference Result 85 states and 104 transitions. [2024-11-14 05:36:00,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 05:36:00,635 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2024-11-14 05:36:00,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:36:00,636 INFO L225 Difference]: With dead ends: 85 [2024-11-14 05:36:00,636 INFO L226 Difference]: Without dead ends: 85 [2024-11-14 05:36:00,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-14 05:36:00,637 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 36 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 05:36:00,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 236 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 05:36:00,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-14 05:36:00,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-14 05:36:00,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 57 states have (on average 1.6842105263157894) internal successors, (96), 79 states have internal predecessors, (96), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 05:36:00,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 104 transitions. [2024-11-14 05:36:00,642 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 104 transitions. Word has length 28 [2024-11-14 05:36:00,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:36:00,642 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 104 transitions. [2024-11-14 05:36:00,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:36:00,643 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 104 transitions. [2024-11-14 05:36:00,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 05:36:00,644 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:36:00,644 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:36:00,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-14 05:36:00,644 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-14 05:36:00,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:36:00,645 INFO L85 PathProgramCache]: Analyzing trace with hash -2143453904, now seen corresponding path program 1 times [2024-11-14 05:36:00,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:36:00,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008781121] [2024-11-14 05:36:00,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:36:00,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:36:00,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:36:01,116 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:36:01,116 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:36:01,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008781121] [2024-11-14 05:36:01,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008781121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:36:01,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:36:01,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-14 05:36:01,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462744954] [2024-11-14 05:36:01,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:36:01,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 05:36:01,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:36:01,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 05:36:01,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-14 05:36:01,118 INFO L87 Difference]: Start difference. First operand 85 states and 104 transitions. Second operand has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:36:01,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:36:01,738 INFO L93 Difference]: Finished difference Result 85 states and 102 transitions. [2024-11-14 05:36:01,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 05:36:01,739 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2024-11-14 05:36:01,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:36:01,740 INFO L225 Difference]: With dead ends: 85 [2024-11-14 05:36:01,740 INFO L226 Difference]: Without dead ends: 85 [2024-11-14 05:36:01,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-14 05:36:01,743 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 33 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:36:01,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 282 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-14 05:36:01,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-14 05:36:01,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-14 05:36:01,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 57 states have (on average 1.6491228070175439) internal successors, (94), 79 states have internal predecessors, (94), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 05:36:01,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 102 transitions. [2024-11-14 05:36:01,749 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 102 transitions. Word has length 28 [2024-11-14 05:36:01,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:36:01,749 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 102 transitions. [2024-11-14 05:36:01,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:36:01,750 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 102 transitions. [2024-11-14 05:36:01,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-14 05:36:01,753 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:36:01,754 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:36:01,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-14 05:36:01,754 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-14 05:36:01,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:36:01,754 INFO L85 PathProgramCache]: Analyzing trace with hash -2017851113, now seen corresponding path program 1 times [2024-11-14 05:36:01,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:36:01,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978776657] [2024-11-14 05:36:01,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:36:01,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:36:01,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:36:01,875 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 05:36:01,875 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:36:01,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978776657] [2024-11-14 05:36:01,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978776657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:36:01,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:36:01,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:36:01,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393120966] [2024-11-14 05:36:01,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:36:01,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:36:01,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:36:01,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:36:01,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:36:01,877 INFO L87 Difference]: Start difference. First operand 85 states and 102 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:36:01,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:36:01,992 INFO L93 Difference]: Finished difference Result 98 states and 115 transitions. [2024-11-14 05:36:01,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:36:01,993 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2024-11-14 05:36:01,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:36:01,994 INFO L225 Difference]: With dead ends: 98 [2024-11-14 05:36:01,994 INFO L226 Difference]: Without dead ends: 98 [2024-11-14 05:36:01,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:36:01,995 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 42 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:36:01,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 131 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:36:01,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-14 05:36:01,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 86. [2024-11-14 05:36:01,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 58 states have (on average 1.6206896551724137) internal successors, (94), 80 states have internal predecessors, (94), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 05:36:02,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 102 transitions. [2024-11-14 05:36:02,001 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 102 transitions. Word has length 29 [2024-11-14 05:36:02,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:36:02,002 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 102 transitions. [2024-11-14 05:36:02,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:36:02,003 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 102 transitions. [2024-11-14 05:36:02,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-14 05:36:02,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:36:02,006 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:36:02,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-14 05:36:02,007 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-14 05:36:02,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:36:02,007 INFO L85 PathProgramCache]: Analyzing trace with hash 86599904, now seen corresponding path program 1 times [2024-11-14 05:36:02,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:36:02,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543337885] [2024-11-14 05:36:02,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:36:02,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:36:02,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:36:02,166 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 05:36:02,166 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:36:02,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543337885] [2024-11-14 05:36:02,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543337885] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:36:02,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:36:02,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:36:02,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117248821] [2024-11-14 05:36:02,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:36:02,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 05:36:02,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:36:02,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 05:36:02,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:36:02,169 INFO L87 Difference]: Start difference. First operand 86 states and 102 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:36:02,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:36:02,444 INFO L93 Difference]: Finished difference Result 89 states and 108 transitions. [2024-11-14 05:36:02,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:36:02,445 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2024-11-14 05:36:02,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:36:02,446 INFO L225 Difference]: With dead ends: 89 [2024-11-14 05:36:02,446 INFO L226 Difference]: Without dead ends: 89 [2024-11-14 05:36:02,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:36:02,447 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 33 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:36:02,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 155 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:36:02,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-14 05:36:02,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-14 05:36:02,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 61 states have (on average 1.639344262295082) internal successors, (100), 83 states have internal predecessors, (100), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 05:36:02,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 108 transitions. [2024-11-14 05:36:02,452 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 108 transitions. Word has length 32 [2024-11-14 05:36:02,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:36:02,452 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 108 transitions. [2024-11-14 05:36:02,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:36:02,453 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 108 transitions. [2024-11-14 05:36:02,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-14 05:36:02,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:36:02,453 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:36:02,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-14 05:36:02,454 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-14 05:36:02,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:36:02,456 INFO L85 PathProgramCache]: Analyzing trace with hash 86599905, now seen corresponding path program 1 times [2024-11-14 05:36:02,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:36:02,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792402953] [2024-11-14 05:36:02,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:36:02,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:36:02,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:36:02,631 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 05:36:02,631 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:36:02,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792402953] [2024-11-14 05:36:02,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792402953] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:36:02,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7415122] [2024-11-14 05:36:02,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:36:02,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:36:02,632 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:36:02,636 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:36:02,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-14 05:36:02,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:36:02,852 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 05:36:02,854 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:36:02,965 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 05:36:02,965 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:36:03,078 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 05:36:03,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7415122] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:36:03,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [671638853] [2024-11-14 05:36:03,080 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2024-11-14 05:36:03,081 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:36:03,081 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:36:03,081 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:36:03,081 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:36:03,998 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-14 05:36:04,035 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:36:10,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [671638853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:36:10,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:36:10,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [5, 5, 5] total 29 [2024-11-14 05:36:10,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365491208] [2024-11-14 05:36:10,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:36:10,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-14 05:36:10,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:36:10,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-14 05:36:10,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=673, Unknown=2, NotChecked=0, Total=812 [2024-11-14 05:36:10,868 INFO L87 Difference]: Start difference. First operand 89 states and 108 transitions. Second operand has 21 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 17 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:36:14,653 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] [2024-11-14 05:36:17,427 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] [2024-11-14 05:36:18,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:36:18,918 INFO L93 Difference]: Finished difference Result 114 states and 139 transitions. [2024-11-14 05:36:18,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-14 05:36:18,919 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 17 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2024-11-14 05:36:18,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:36:18,920 INFO L225 Difference]: With dead ends: 114 [2024-11-14 05:36:18,920 INFO L226 Difference]: Without dead ends: 114 [2024-11-14 05:36:18,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=137, Invalid=673, Unknown=2, NotChecked=0, Total=812 [2024-11-14 05:36:18,921 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 3 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 2 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:36:18,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 274 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 767 Invalid, 6 Unknown, 0 Unchecked, 8.0s Time] [2024-11-14 05:36:18,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-14 05:36:18,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2024-11-14 05:36:18,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 82 states have (on average 1.5609756097560976) internal successors, (128), 104 states have internal predecessors, (128), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-14 05:36:18,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 138 transitions. [2024-11-14 05:36:18,927 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 138 transitions. Word has length 32 [2024-11-14 05:36:18,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:36:18,928 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 138 transitions. [2024-11-14 05:36:18,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 17 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:36:18,928 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 138 transitions. [2024-11-14 05:36:18,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 05:36:18,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:36:18,929 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:36:18,955 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-14 05:36:19,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-14 05:36:19,134 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-14 05:36:19,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:36:19,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1992457766, now seen corresponding path program 1 times [2024-11-14 05:36:19,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:36:19,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336226375] [2024-11-14 05:36:19,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:36:19,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:36:19,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:36:19,267 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-14 05:36:19,268 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:36:19,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336226375] [2024-11-14 05:36:19,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336226375] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:36:19,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868949159] [2024-11-14 05:36:19,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:36:19,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:36:19,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:36:19,271 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:36:19,273 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-14 05:36:19,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:36:19,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 05:36:19,496 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:36:19,551 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:36:19,554 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:36:19,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868949159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:36:19,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:36:19,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2024-11-14 05:36:19,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542176166] [2024-11-14 05:36:19,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:36:19,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:36:19,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:36:19,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:36:19,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:36:19,556 INFO L87 Difference]: Start difference. First operand 112 states and 138 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 05:36:19,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:36:19,647 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2024-11-14 05:36:19,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:36:19,648 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2024-11-14 05:36:19,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:36:19,648 INFO L225 Difference]: With dead ends: 74 [2024-11-14 05:36:19,649 INFO L226 Difference]: Without dead ends: 74 [2024-11-14 05:36:19,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:36:19,649 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:36:19,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:36:19,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-14 05:36:19,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-14 05:36:19,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 51 states have (on average 1.588235294117647) internal successors, (81), 70 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:36:19,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2024-11-14 05:36:19,653 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 34 [2024-11-14 05:36:19,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:36:19,654 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2024-11-14 05:36:19,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 05:36:19,654 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2024-11-14 05:36:19,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-14 05:36:19,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:36:19,655 INFO L215 NwaCegarLoop]: trace histogram [2, 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] [2024-11-14 05:36:19,679 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-14 05:36:19,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:36:19,856 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-14 05:36:19,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:36:19,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1757012398, now seen corresponding path program 1 times [2024-11-14 05:36:19,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:36:19,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079275362] [2024-11-14 05:36:19,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:36:19,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:36:19,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:36:20,042 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 05:36:20,042 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:36:20,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079275362] [2024-11-14 05:36:20,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079275362] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:36:20,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892444875] [2024-11-14 05:36:20,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:36:20,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:36:20,043 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:36:20,046 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:36:20,049 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-14 05:36:20,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:36:20,285 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 05:36:20,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:36:20,323 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 05:36:20,323 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:36:20,386 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 05:36:20,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892444875] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:36:20,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1787880736] [2024-11-14 05:36:20,388 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2024-11-14 05:36:20,388 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:36:20,388 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:36:20,389 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:36:20,389 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:36:21,492 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-14 05:36:21,530 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:36:30,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1787880736] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:36:30,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:36:30,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [6, 6, 6] total 26 [2024-11-14 05:36:30,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958865420] [2024-11-14 05:36:30,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:36:30,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-14 05:36:30,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:36:30,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-14 05:36:30,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=569, Unknown=3, NotChecked=0, Total=650 [2024-11-14 05:36:30,967 INFO L87 Difference]: Start difference. First operand 74 states and 85 transitions. Second operand has 21 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:36:35,888 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] [2024-11-14 05:36:49,991 WARN L286 SmtUtils]: Spent 7.13s on a formula simplification. DAG size of input: 227 DAG size of output: 190 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 05:37:10,296 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] [2024-11-14 05:37:11,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:37:11,665 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2024-11-14 05:37:11,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-14 05:37:11,666 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2024-11-14 05:37:11,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:37:11,667 INFO L225 Difference]: With dead ends: 72 [2024-11-14 05:37:11,667 INFO L226 Difference]: Without dead ends: 72 [2024-11-14 05:37:11,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 33.6s TimeCoverageRelationStatistics Valid=96, Invalid=709, Unknown=7, NotChecked=0, Total=812 [2024-11-14 05:37:11,667 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 8 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 4 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:37:11,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 221 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 583 Invalid, 6 Unknown, 0 Unchecked, 16.6s Time] [2024-11-14 05:37:11,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-14 05:37:11,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2024-11-14 05:37:11,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 50 states have (on average 1.56) internal successors, (78), 67 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:37:11,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2024-11-14 05:37:11,671 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 33 [2024-11-14 05:37:11,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:37:11,671 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2024-11-14 05:37:11,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:37:11,672 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2024-11-14 05:37:11,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-14 05:37:11,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:37:11,672 INFO L215 NwaCegarLoop]: trace histogram [2, 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] [2024-11-14 05:37:11,693 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-14 05:37:11,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2024-11-14 05:37:11,877 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-14 05:37:11,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:37:11,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1757007865, now seen corresponding path program 1 times [2024-11-14 05:37:11,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:37:11,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821991347] [2024-11-14 05:37:11,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:37:11,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:37:11,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:37:13,683 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:37:13,683 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:37:13,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821991347] [2024-11-14 05:37:13,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821991347] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:37:13,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678534072] [2024-11-14 05:37:13,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:37:13,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:37:13,683 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:37:13,686 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:37:13,689 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-14 05:37:13,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:37:13,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-14 05:37:13,940 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:37:13,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:37:14,220 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 05:37:14,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 05:37:14,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:37:14,527 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:37:14,527 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 [2024-11-14 05:37:14,862 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-14 05:37:14,863 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 24 treesize of output 17 [2024-11-14 05:37:15,015 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 35 treesize of output 26 [2024-11-14 05:37:15,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:37:15,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:37:15,333 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:37:15,333 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 1 case distinctions, treesize of input 54 treesize of output 29 [2024-11-14 05:37:15,478 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:37:15,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 16 [2024-11-14 05:37:15,486 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:37:15,486 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:37:15,526 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1633 (Array Int Int))) (or (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_1633) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1) (not (= v_ArrVal_1633 (let ((.cse0 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse0 (select v_ArrVal_1633 .cse0))))))) is different from false [2024-11-14 05:37:15,766 INFO L349 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2024-11-14 05:37:15,766 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 19 treesize of output 18 [2024-11-14 05:37:16,253 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:37:16,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2024-11-14 05:37:16,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 110 [2024-11-14 05:37:16,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-11-14 05:37:16,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-14 05:37:16,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678534072] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:37:16,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [500541757] [2024-11-14 05:37:16,649 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2024-11-14 05:37:16,649 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:37:16,650 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:37:16,650 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:37:16,650 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:37:17,824 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-14 05:37:17,864 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:37:34,485 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4735#(and (= 3 |ULTIMATE.start_dll_circular_update_at_~data#1|) (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.base_47| Int)) (and (<= 12 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (not (= (select |#valid| |v_ULTIMATE.start_dll_circular_update_at_~head#1.base_47|) 1)) (= |ULTIMATE.start_main_~i~0#1| 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 0) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 0) |v_ULTIMATE.start_dll_circular_update_at_~head#1.base_47|) (exists ((|v_#memory_$Pointer$.offset_228| (Array Int (Array Int Int))) (|v_#memory_int_224| (Array Int (Array Int Int))) (|v_#memory_int_225| (Array Int (Array Int Int))) (|v_#memory_int_227| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_236| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_233| (Array Int (Array Int Int)))) (and (= (select |#valid| (select (select |v_#memory_$Pointer$.base_236| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_228| (select (select |v_#memory_$Pointer$.base_236| |ULTIMATE.start_main_~s~0#1.base|) 4) (store (select |v_#memory_$Pointer$.offset_228| (select (select |v_#memory_$Pointer$.base_236| |ULTIMATE.start_main_~s~0#1.base|) 4)) 0 0)) |ULTIMATE.start_main_~s~0#1.base| (store (store (select (store |v_#memory_$Pointer$.offset_228| (select (select |v_#memory_$Pointer$.base_236| |ULTIMATE.start_main_~s~0#1.base|) 4) (store (select |v_#memory_$Pointer$.offset_228| (select (select |v_#memory_$Pointer$.base_236| |ULTIMATE.start_main_~s~0#1.base|) 4)) 0 0)) |ULTIMATE.start_main_~s~0#1.base|) 4 0) 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 8)))) (= (store |v_#memory_int_224| (select (select |v_#memory_$Pointer$.base_236| |ULTIMATE.start_main_~s~0#1.base|) 4) (store (select |v_#memory_int_224| (select (select |v_#memory_$Pointer$.base_236| |ULTIMATE.start_main_~s~0#1.base|) 4)) 0 (select (select |v_#memory_int_225| (select (select |v_#memory_$Pointer$.base_236| |ULTIMATE.start_main_~s~0#1.base|) 4)) 0))) |v_#memory_int_225|) (= |#memory_int| (store |v_#memory_int_227| |ULTIMATE.start_main_~s~0#1.base| (store (select |v_#memory_int_227| |ULTIMATE.start_main_~s~0#1.base|) 8 2))) (= (store |v_#memory_$Pointer$.base_236| |ULTIMATE.start_main_~s~0#1.base| (store (select |v_#memory_$Pointer$.base_236| |ULTIMATE.start_main_~s~0#1.base|) 8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 8))) |#memory_$Pointer$.base|) (= (store (store |v_#memory_$Pointer$.base_233| (select (select |v_#memory_$Pointer$.base_236| |ULTIMATE.start_main_~s~0#1.base|) 4) (store (select |v_#memory_$Pointer$.base_233| (select (select |v_#memory_$Pointer$.base_236| |ULTIMATE.start_main_~s~0#1.base|) 4)) 0 |ULTIMATE.start_main_~s~0#1.base|)) |ULTIMATE.start_main_~s~0#1.base| (store (select (store |v_#memory_$Pointer$.base_233| (select (select |v_#memory_$Pointer$.base_236| |ULTIMATE.start_main_~s~0#1.base|) 4) (store (select |v_#memory_$Pointer$.base_233| (select (select |v_#memory_$Pointer$.base_236| |ULTIMATE.start_main_~s~0#1.base|) 4)) 0 |ULTIMATE.start_main_~s~0#1.base|)) |ULTIMATE.start_main_~s~0#1.base|) 4 (select (select |v_#memory_$Pointer$.base_236| |ULTIMATE.start_main_~s~0#1.base|) 4))) |v_#memory_$Pointer$.base_236|) (<= 4 (select |#length| (select (select |v_#memory_$Pointer$.base_236| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (store |v_#memory_int_225| |ULTIMATE.start_main_~s~0#1.base| (store (select |v_#memory_int_225| |ULTIMATE.start_main_~s~0#1.base|) 4 (select (select |v_#memory_int_227| |ULTIMATE.start_main_~s~0#1.base|) 4))) |v_#memory_int_227|))))) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_main_~s~0#1.offset| 0))' at error location [2024-11-14 05:37:34,485 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:37:34,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:37:34,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 30 [2024-11-14 05:37:34,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800804616] [2024-11-14 05:37:34,485 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 05:37:34,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-14 05:37:34,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:37:34,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-14 05:37:34,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=2878, Unknown=35, NotChecked=108, Total=3192 [2024-11-14 05:37:34,488 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand has 31 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 27 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 05:37:36,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:37:36,733 INFO L93 Difference]: Finished difference Result 80 states and 94 transitions. [2024-11-14 05:37:36,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-14 05:37:36,734 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 27 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2024-11-14 05:37:36,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:37:36,735 INFO L225 Difference]: With dead ends: 80 [2024-11-14 05:37:36,735 INFO L226 Difference]: Without dead ends: 80 [2024-11-14 05:37:36,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 791 ImplicationChecksByTransitivity, 20.3s TimeCoverageRelationStatistics Valid=221, Invalid=3653, Unknown=36, NotChecked=122, Total=4032 [2024-11-14 05:37:36,737 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 42 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-14 05:37:36,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 575 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-14 05:37:36,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-14 05:37:36,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2024-11-14 05:37:36,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 53 states have (on average 1.5660377358490567) internal successors, (83), 70 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:37:36,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 87 transitions. [2024-11-14 05:37:36,741 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 87 transitions. Word has length 33 [2024-11-14 05:37:36,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:37:36,741 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 87 transitions. [2024-11-14 05:37:36,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 27 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 05:37:36,742 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 87 transitions. [2024-11-14 05:37:36,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-14 05:37:36,742 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:37:36,742 INFO L215 NwaCegarLoop]: trace histogram [2, 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] [2024-11-14 05:37:36,769 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-14 05:37:36,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:37:36,943 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-14 05:37:36,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:37:36,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1757007864, now seen corresponding path program 1 times [2024-11-14 05:37:36,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:37:36,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929020259] [2024-11-14 05:37:36,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:37:36,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:37:36,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:37:39,624 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:37:39,624 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:37:39,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929020259] [2024-11-14 05:37:39,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929020259] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:37:39,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752359492] [2024-11-14 05:37:39,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:37:39,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:37:39,624 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:37:39,628 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:37:39,633 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-14 05:37:39,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:37:39,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 75 conjuncts are in the unsatisfiable core [2024-11-14 05:37:39,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:37:39,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 05:37:39,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:37:40,621 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 05:37:40,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-14 05:37:40,655 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 05:37:40,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 05:37:40,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:37:40,922 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 15 treesize of output 1 [2024-11-14 05:37:41,107 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:37:41,108 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 [2024-11-14 05:37:41,119 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 [2024-11-14 05:37:41,452 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-14 05:37:41,452 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 33 treesize of output 24 [2024-11-14 05:37:41,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:37:41,478 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 [2024-11-14 05:37:41,638 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 35 treesize of output 26 [2024-11-14 05:37:41,662 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 40 treesize of output 20 [2024-11-14 05:37:42,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:37:42,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:37:42,089 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 50 treesize of output 29 [2024-11-14 05:37:42,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:37:42,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:37:42,107 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:37:42,107 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 1 case distinctions, treesize of input 49 treesize of output 26 [2024-11-14 05:37:42,361 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 37 treesize of output 13 [2024-11-14 05:37:42,369 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:37:42,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 16 [2024-11-14 05:37:42,506 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:37:42,506 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:37:42,998 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (and (forall ((v_ArrVal_1785 (Array Int Int))) (or (not (= v_ArrVal_1785 (store .cse0 .cse1 (select v_ArrVal_1785 .cse1)))) (< 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_1785) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 9)))) (forall ((v_ArrVal_1785 (Array Int Int))) (or (not (= v_ArrVal_1785 (store .cse0 .cse1 (select v_ArrVal_1785 .cse1)))) (forall ((v_ArrVal_1786 (Array Int Int))) (or (< (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_1785) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 11) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_1786) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (not (= v_ArrVal_1786 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse1 (select v_ArrVal_1786 .cse1)))))))))) is different from false [2024-11-14 05:37:44,117 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:37:44,118 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 23 treesize of output 24 [2024-11-14 05:37:44,123 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 138 treesize of output 126 [2024-11-14 05:37:44,132 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 25 [2024-11-14 05:37:44,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-11-14 05:37:44,176 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:37:44,176 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 1 case distinctions, treesize of input 43 treesize of output 44 [2024-11-14 05:37:44,188 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:37:44,189 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 1 case distinctions, treesize of input 35 treesize of output 36 [2024-11-14 05:37:44,193 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:37:44,193 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:37:44,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2024-11-14 05:37:44,201 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:37:44,201 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:37:44,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2024-11-14 05:37:44,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752359492] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:37:44,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1387979692] [2024-11-14 05:37:44,820 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2024-11-14 05:37:44,820 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:37:44,820 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:37:44,821 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:37:44,821 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:37:45,829 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-14 05:37:45,855 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:38:03,928 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5119#(exists ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_56| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.base_61| Int)) (and (or (and (exists ((|v_#memory_int_253| (Array Int (Array Int Int))) (|v_#memory_int_254| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_253| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4) (store (select |v_#memory_int_253| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 0 (select (select |v_#memory_int_254| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 0))) |v_#memory_int_254|) (= |#memory_int| (store |v_#memory_int_254| |ULTIMATE.start_main_~s~0#1.base| (store (select |v_#memory_int_254| |ULTIMATE.start_main_~s~0#1.base|) 4 (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 4)))))) (= |v_ULTIMATE.start_dll_circular_update_at_~head#1.base_61| |ULTIMATE.start_main_~s~0#1.base|) (<= 8 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (exists ((|v_#memory_$Pointer$.offset_262| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_262| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4) (store (select |v_#memory_$Pointer$.offset_262| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 0 0)) |ULTIMATE.start_main_~s~0#1.base| (store (select (store |v_#memory_$Pointer$.offset_262| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4) (store (select |v_#memory_$Pointer$.offset_262| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 0 0)) |ULTIMATE.start_main_~s~0#1.base|) 4 0)))) (exists ((|v_#memory_$Pointer$.base_267| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store (store |v_#memory_$Pointer$.base_267| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4) (store (select |v_#memory_$Pointer$.base_267| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 0 |ULTIMATE.start_main_~s~0#1.base|)) |ULTIMATE.start_main_~s~0#1.base| (store (select (store |v_#memory_$Pointer$.base_267| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4) (store (select |v_#memory_$Pointer$.base_267| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 0 |ULTIMATE.start_main_~s~0#1.base|)) |ULTIMATE.start_main_~s~0#1.base|) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))))) (= 2 |ULTIMATE.start_dll_circular_update_at_~data#1|) (= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)) (and (= 3 |ULTIMATE.start_dll_circular_update_at_~data#1|) (<= 12 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 0) |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_56|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 0) |v_ULTIMATE.start_dll_circular_update_at_~head#1.base_61|) (= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1) (exists ((|v_#memory_$Pointer$.base_270| (Array Int (Array Int Int))) (|v_#memory_int_253| (Array Int (Array Int Int))) (|v_#memory_int_254| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_262| (Array Int (Array Int Int))) (|v_#memory_int_256| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_267| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_262| (select (select |v_#memory_$Pointer$.base_270| |ULTIMATE.start_main_~s~0#1.base|) 4) (store (select |v_#memory_$Pointer$.offset_262| (select (select |v_#memory_$Pointer$.base_270| |ULTIMATE.start_main_~s~0#1.base|) 4)) 0 0)) |ULTIMATE.start_main_~s~0#1.base| (store (store (select (store |v_#memory_$Pointer$.offset_262| (select (select |v_#memory_$Pointer$.base_270| |ULTIMATE.start_main_~s~0#1.base|) 4) (store (select |v_#memory_$Pointer$.offset_262| (select (select |v_#memory_$Pointer$.base_270| |ULTIMATE.start_main_~s~0#1.base|) 4)) 0 0)) |ULTIMATE.start_main_~s~0#1.base|) 4 0) 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 8)))) (= (store |v_#memory_int_253| (select (select |v_#memory_$Pointer$.base_270| |ULTIMATE.start_main_~s~0#1.base|) 4) (store (select |v_#memory_int_253| (select (select |v_#memory_$Pointer$.base_270| |ULTIMATE.start_main_~s~0#1.base|) 4)) 0 (select (select |v_#memory_int_254| (select (select |v_#memory_$Pointer$.base_270| |ULTIMATE.start_main_~s~0#1.base|) 4)) 0))) |v_#memory_int_254|) (= |#memory_int| (store |v_#memory_int_256| |ULTIMATE.start_main_~s~0#1.base| (store (select |v_#memory_int_256| |ULTIMATE.start_main_~s~0#1.base|) 8 2))) (= (store |v_#memory_int_254| |ULTIMATE.start_main_~s~0#1.base| (store (select |v_#memory_int_254| |ULTIMATE.start_main_~s~0#1.base|) 4 (select (select |v_#memory_int_256| |ULTIMATE.start_main_~s~0#1.base|) 4))) |v_#memory_int_256|) (<= 4 (select |#length| (select (select |v_#memory_$Pointer$.base_270| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (select |#valid| (select (select |v_#memory_$Pointer$.base_270| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1) (= (store (store |v_#memory_$Pointer$.base_267| (select (select |v_#memory_$Pointer$.base_270| |ULTIMATE.start_main_~s~0#1.base|) 4) (store (select |v_#memory_$Pointer$.base_267| (select (select |v_#memory_$Pointer$.base_270| |ULTIMATE.start_main_~s~0#1.base|) 4)) 0 |ULTIMATE.start_main_~s~0#1.base|)) |ULTIMATE.start_main_~s~0#1.base| (store (select (store |v_#memory_$Pointer$.base_267| (select (select |v_#memory_$Pointer$.base_270| |ULTIMATE.start_main_~s~0#1.base|) 4) (store (select |v_#memory_$Pointer$.base_267| (select (select |v_#memory_$Pointer$.base_270| |ULTIMATE.start_main_~s~0#1.base|) 4)) 0 |ULTIMATE.start_main_~s~0#1.base|)) |ULTIMATE.start_main_~s~0#1.base|) 4 (select (select |v_#memory_$Pointer$.base_270| |ULTIMATE.start_main_~s~0#1.base|) 4))) |v_#memory_$Pointer$.base_270|) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_270| |ULTIMATE.start_main_~s~0#1.base| (store (select |v_#memory_$Pointer$.base_270| |ULTIMATE.start_main_~s~0#1.base|) 8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 8)))))))) (or (and (= 3 |ULTIMATE.start_dll_circular_update_at_~data#1|) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_main_~s~0#1.offset| 0)) (and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_56| 0) (= 2 |ULTIMATE.start_dll_circular_update_at_~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (< (select |#length| |v_ULTIMATE.start_dll_circular_update_at_~head#1.base_61|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_56| 12)) (< (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_56| 8) 0))))' at error location [2024-11-14 05:38:03,929 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:38:03,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:38:03,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 36 [2024-11-14 05:38:03,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745577891] [2024-11-14 05:38:03,929 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 05:38:03,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-14 05:38:03,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:38:03,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-14 05:38:03,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=4204, Unknown=8, NotChecked=130, Total=4556 [2024-11-14 05:38:03,932 INFO L87 Difference]: Start difference. First operand 74 states and 87 transitions. Second operand has 37 states, 32 states have (on average 1.78125) internal successors, (57), 32 states have internal predecessors, (57), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 05:38:08,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:38:08,375 INFO L93 Difference]: Finished difference Result 102 states and 124 transitions. [2024-11-14 05:38:08,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-14 05:38:08,391 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 32 states have (on average 1.78125) internal successors, (57), 32 states have internal predecessors, (57), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 33 [2024-11-14 05:38:08,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:38:08,392 INFO L225 Difference]: With dead ends: 102 [2024-11-14 05:38:08,392 INFO L226 Difference]: Without dead ends: 102 [2024-11-14 05:38:08,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1167 ImplicationChecksByTransitivity, 24.8s TimeCoverageRelationStatistics Valid=305, Invalid=5853, Unknown=8, NotChecked=154, Total=6320 [2024-11-14 05:38:08,395 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 59 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 1266 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 1272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-14 05:38:08,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 853 Invalid, 1272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1266 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-14 05:38:08,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-14 05:38:08,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 79. [2024-11-14 05:38:08,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 58 states have (on average 1.5689655172413792) internal successors, (91), 75 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:38:08,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 95 transitions. [2024-11-14 05:38:08,403 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 95 transitions. Word has length 33 [2024-11-14 05:38:08,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:38:08,403 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 95 transitions. [2024-11-14 05:38:08,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 32 states have (on average 1.78125) internal successors, (57), 32 states have internal predecessors, (57), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 05:38:08,403 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2024-11-14 05:38:08,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-14 05:38:08,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:38:08,404 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:38:08,430 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-14 05:38:08,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:38:08,605 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-14 05:38:08,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:38:08,606 INFO L85 PathProgramCache]: Analyzing trace with hash -566625354, now seen corresponding path program 2 times [2024-11-14 05:38:08,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:38:08,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735860893] [2024-11-14 05:38:08,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:38:08,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:38:08,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:38:08,783 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 05:38:08,783 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:38:08,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735860893] [2024-11-14 05:38:08,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735860893] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:38:08,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388238461] [2024-11-14 05:38:08,784 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:38:08,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:38:08,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:38:08,786 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:38:08,789 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-14 05:38:09,499 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 05:38:09,499 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:38:09,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 05:38:09,505 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:38:09,549 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 05:38:09,549 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:38:09,644 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 05:38:09,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388238461] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:38:09,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [213567722] [2024-11-14 05:38:09,647 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2024-11-14 05:38:09,647 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:38:09,647 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:38:09,647 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:38:09,648 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:38:10,536 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-14 05:38:10,557 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:38:22,485 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5555#(and (= 3 |ULTIMATE.start_dll_circular_update_at_~data#1|) (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.base_74| Int)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 0) |v_ULTIMATE.start_dll_circular_update_at_~head#1.base_74|) (<= 12 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 0) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1) (not (= (select |#valid| |v_ULTIMATE.start_dll_circular_update_at_~head#1.base_74|) 1)) (exists ((|v_#memory_$Pointer$.offset_292| (Array Int (Array Int Int))) (|v_#memory_int_286| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_300| (Array Int (Array Int Int))) (|v_#memory_int_283| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_297| (Array Int (Array Int Int))) (|v_#memory_int_284| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_286| |ULTIMATE.start_main_~s~0#1.base| (store (select |v_#memory_int_286| |ULTIMATE.start_main_~s~0#1.base|) 8 2)) |#memory_int|) (= (store |v_#memory_int_283| (select (select |v_#memory_$Pointer$.base_300| |ULTIMATE.start_main_~s~0#1.base|) 4) (store (select |v_#memory_int_283| (select (select |v_#memory_$Pointer$.base_300| |ULTIMATE.start_main_~s~0#1.base|) 4)) 0 (select (select |v_#memory_int_284| (select (select |v_#memory_$Pointer$.base_300| |ULTIMATE.start_main_~s~0#1.base|) 4)) 0))) |v_#memory_int_284|) (= (store (store |v_#memory_$Pointer$.offset_292| (select (select |v_#memory_$Pointer$.base_300| |ULTIMATE.start_main_~s~0#1.base|) 4) (store (select |v_#memory_$Pointer$.offset_292| (select (select |v_#memory_$Pointer$.base_300| |ULTIMATE.start_main_~s~0#1.base|) 4)) 0 0)) |ULTIMATE.start_main_~s~0#1.base| (store (store (select (store |v_#memory_$Pointer$.offset_292| (select (select |v_#memory_$Pointer$.base_300| |ULTIMATE.start_main_~s~0#1.base|) 4) (store (select |v_#memory_$Pointer$.offset_292| (select (select |v_#memory_$Pointer$.base_300| |ULTIMATE.start_main_~s~0#1.base|) 4)) 0 0)) |ULTIMATE.start_main_~s~0#1.base|) 4 0) 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 8))) |#memory_$Pointer$.offset|) (= (select |#valid| (select (select |v_#memory_$Pointer$.base_300| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1) (= (store |v_#memory_int_284| |ULTIMATE.start_main_~s~0#1.base| (store (select |v_#memory_int_284| |ULTIMATE.start_main_~s~0#1.base|) 4 (select (select |v_#memory_int_286| |ULTIMATE.start_main_~s~0#1.base|) 4))) |v_#memory_int_286|) (= (store |v_#memory_$Pointer$.base_300| |ULTIMATE.start_main_~s~0#1.base| (store (select |v_#memory_$Pointer$.base_300| |ULTIMATE.start_main_~s~0#1.base|) 8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 8))) |#memory_$Pointer$.base|) (<= 4 (select |#length| (select (select |v_#memory_$Pointer$.base_300| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (store (store |v_#memory_$Pointer$.base_297| (select (select |v_#memory_$Pointer$.base_300| |ULTIMATE.start_main_~s~0#1.base|) 4) (store (select |v_#memory_$Pointer$.base_297| (select (select |v_#memory_$Pointer$.base_300| |ULTIMATE.start_main_~s~0#1.base|) 4)) 0 |ULTIMATE.start_main_~s~0#1.base|)) |ULTIMATE.start_main_~s~0#1.base| (store (select (store |v_#memory_$Pointer$.base_297| (select (select |v_#memory_$Pointer$.base_300| |ULTIMATE.start_main_~s~0#1.base|) 4) (store (select |v_#memory_$Pointer$.base_297| (select (select |v_#memory_$Pointer$.base_300| |ULTIMATE.start_main_~s~0#1.base|) 4)) 0 |ULTIMATE.start_main_~s~0#1.base|)) |ULTIMATE.start_main_~s~0#1.base|) 4 (select (select |v_#memory_$Pointer$.base_300| |ULTIMATE.start_main_~s~0#1.base|) 4))) |v_#memory_$Pointer$.base_300|))))) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_main_~s~0#1.offset| 0))' at error location [2024-11-14 05:38:22,485 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:38:22,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:38:22,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2024-11-14 05:38:22,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915444656] [2024-11-14 05:38:22,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:38:22,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 05:38:22,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:38:22,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 05:38:22,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=618, Unknown=3, NotChecked=0, Total=702 [2024-11-14 05:38:22,487 INFO L87 Difference]: Start difference. First operand 79 states and 95 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:38:22,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:38:22,891 INFO L93 Difference]: Finished difference Result 115 states and 141 transitions. [2024-11-14 05:38:22,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:38:22,892 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2024-11-14 05:38:22,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:38:22,893 INFO L225 Difference]: With dead ends: 115 [2024-11-14 05:38:22,893 INFO L226 Difference]: Without dead ends: 115 [2024-11-14 05:38:22,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 81 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=101, Invalid=766, Unknown=3, NotChecked=0, Total=870 [2024-11-14 05:38:22,894 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 28 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:38:22,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 277 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:38:22,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-14 05:38:22,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 84. [2024-11-14 05:38:22,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 63 states have (on average 1.5396825396825398) internal successors, (97), 80 states have internal predecessors, (97), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:38:22,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 101 transitions. [2024-11-14 05:38:22,899 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 101 transitions. Word has length 35 [2024-11-14 05:38:22,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:38:22,899 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 101 transitions. [2024-11-14 05:38:22,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:38:22,899 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 101 transitions. [2024-11-14 05:38:22,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-14 05:38:22,900 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:38:22,900 INFO L215 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:38:22,922 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-14 05:38:23,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:38:23,101 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-14 05:38:23,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:38:23,101 INFO L85 PathProgramCache]: Analyzing trace with hash 812445625, now seen corresponding path program 1 times [2024-11-14 05:38:23,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:38:23,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363679537] [2024-11-14 05:38:23,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:38:23,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:38:23,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:38:23,585 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 05:38:23,586 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:38:23,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363679537] [2024-11-14 05:38:23,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363679537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:38:23,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:38:23,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-14 05:38:23,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481915691] [2024-11-14 05:38:23,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:38:23,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 05:38:23,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:38:23,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 05:38:23,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-14 05:38:23,588 INFO L87 Difference]: Start difference. First operand 84 states and 101 transitions. Second operand has 9 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:38:24,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:38:24,100 INFO L93 Difference]: Finished difference Result 84 states and 99 transitions. [2024-11-14 05:38:24,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 05:38:24,101 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2024-11-14 05:38:24,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:38:24,101 INFO L225 Difference]: With dead ends: 84 [2024-11-14 05:38:24,101 INFO L226 Difference]: Without dead ends: 84 [2024-11-14 05:38:24,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-14 05:38:24,102 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 20 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 05:38:24,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 248 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 05:38:24,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-14 05:38:24,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-14 05:38:24,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 63 states have (on average 1.507936507936508) internal successors, (95), 80 states have internal predecessors, (95), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:38:24,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 99 transitions. [2024-11-14 05:38:24,107 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 99 transitions. Word has length 37 [2024-11-14 05:38:24,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:38:24,108 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 99 transitions. [2024-11-14 05:38:24,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:38:24,108 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 99 transitions. [2024-11-14 05:38:24,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-14 05:38:24,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:38:24,109 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:38:24,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-14 05:38:24,109 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-14 05:38:24,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:38:24,109 INFO L85 PathProgramCache]: Analyzing trace with hash -730627025, now seen corresponding path program 3 times [2024-11-14 05:38:24,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:38:24,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530861929] [2024-11-14 05:38:24,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:38:24,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:38:24,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:38:24,302 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-14 05:38:24,303 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:38:24,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530861929] [2024-11-14 05:38:24,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530861929] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:38:24,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184647816] [2024-11-14 05:38:24,303 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 05:38:24,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:38:24,303 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:38:24,306 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:38:24,307 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-14 05:38:24,613 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 05:38:24,613 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:38:24,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 05:38:24,618 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:38:24,842 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-14 05:38:24,842 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:38:25,065 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-14 05:38:25,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184647816] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:38:25,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [19876326] [2024-11-14 05:38:25,068 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2024-11-14 05:38:25,069 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:38:25,070 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:38:25,070 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:38:25,070 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:38:25,865 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-14 05:38:25,890 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:38:39,771 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6194#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.base_88| Int)) (and (= 3 |ULTIMATE.start_dll_circular_update_at_~data#1|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 0) |v_ULTIMATE.start_dll_circular_update_at_~head#1.base_88|) (<= 12 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (not (= (select |#valid| |v_ULTIMATE.start_dll_circular_update_at_~head#1.base_88|) 1)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 0) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1) (exists ((|v_#memory_int_319| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_328| (Array Int (Array Int Int))) (|v_#memory_int_320| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_336| (Array Int (Array Int Int))) (|v_#memory_int_322| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_333| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_336| |ULTIMATE.start_main_~s~0#1.base| (store (select |v_#memory_$Pointer$.base_336| |ULTIMATE.start_main_~s~0#1.base|) 8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 8))) |#memory_$Pointer$.base|) (= |v_#memory_$Pointer$.base_336| (store (store |v_#memory_$Pointer$.base_333| (select (select |v_#memory_$Pointer$.base_336| |ULTIMATE.start_main_~s~0#1.base|) 4) (store (select |v_#memory_$Pointer$.base_333| (select (select |v_#memory_$Pointer$.base_336| |ULTIMATE.start_main_~s~0#1.base|) 4)) 0 |ULTIMATE.start_main_~s~0#1.base|)) |ULTIMATE.start_main_~s~0#1.base| (store (select (store |v_#memory_$Pointer$.base_333| (select (select |v_#memory_$Pointer$.base_336| |ULTIMATE.start_main_~s~0#1.base|) 4) (store (select |v_#memory_$Pointer$.base_333| (select (select |v_#memory_$Pointer$.base_336| |ULTIMATE.start_main_~s~0#1.base|) 4)) 0 |ULTIMATE.start_main_~s~0#1.base|)) |ULTIMATE.start_main_~s~0#1.base|) 4 (select (select |v_#memory_$Pointer$.base_336| |ULTIMATE.start_main_~s~0#1.base|) 4)))) (= |#memory_int| (store |v_#memory_int_322| |ULTIMATE.start_main_~s~0#1.base| (store (select |v_#memory_int_322| |ULTIMATE.start_main_~s~0#1.base|) 8 2))) (<= 4 (select |#length| (select (select |v_#memory_$Pointer$.base_336| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= (store |v_#memory_int_319| (select (select |v_#memory_$Pointer$.base_336| |ULTIMATE.start_main_~s~0#1.base|) 4) (store (select |v_#memory_int_319| (select (select |v_#memory_$Pointer$.base_336| |ULTIMATE.start_main_~s~0#1.base|) 4)) 0 (select (select |v_#memory_int_320| (select (select |v_#memory_$Pointer$.base_336| |ULTIMATE.start_main_~s~0#1.base|) 4)) 0))) |v_#memory_int_320|) (= (store |v_#memory_int_320| |ULTIMATE.start_main_~s~0#1.base| (store (select |v_#memory_int_320| |ULTIMATE.start_main_~s~0#1.base|) 4 (select (select |v_#memory_int_322| |ULTIMATE.start_main_~s~0#1.base|) 4))) |v_#memory_int_322|) (= (select |#valid| (select (select |v_#memory_$Pointer$.base_336| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_328| (select (select |v_#memory_$Pointer$.base_336| |ULTIMATE.start_main_~s~0#1.base|) 4) (store (select |v_#memory_$Pointer$.offset_328| (select (select |v_#memory_$Pointer$.base_336| |ULTIMATE.start_main_~s~0#1.base|) 4)) 0 0)) |ULTIMATE.start_main_~s~0#1.base| (store (store (select (store |v_#memory_$Pointer$.offset_328| (select (select |v_#memory_$Pointer$.base_336| |ULTIMATE.start_main_~s~0#1.base|) 4) (store (select |v_#memory_$Pointer$.offset_328| (select (select |v_#memory_$Pointer$.base_336| |ULTIMATE.start_main_~s~0#1.base|) 4)) 0 0)) |ULTIMATE.start_main_~s~0#1.base|) 4 0) 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 8)))))))) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_main_~s~0#1.offset| 0))' at error location [2024-11-14 05:38:39,771 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:38:39,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:38:39,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-14 05:38:39,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834733557] [2024-11-14 05:38:39,772 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:38:39,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-14 05:38:39,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:38:39,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-14 05:38:39,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=899, Unknown=4, NotChecked=0, Total=1056 [2024-11-14 05:38:39,773 INFO L87 Difference]: Start difference. First operand 84 states and 99 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-14 05:38:40,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:38:40,147 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2024-11-14 05:38:40,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 05:38:40,148 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2024-11-14 05:38:40,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:38:40,148 INFO L225 Difference]: With dead ends: 84 [2024-11-14 05:38:40,148 INFO L226 Difference]: Without dead ends: 82 [2024-11-14 05:38:40,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=170, Invalid=1016, Unknown=4, NotChecked=0, Total=1190 [2024-11-14 05:38:40,149 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 50 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:38:40,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 218 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:38:40,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-14 05:38:40,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 75. [2024-11-14 05:38:40,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 71 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:38:40,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 87 transitions. [2024-11-14 05:38:40,153 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 87 transitions. Word has length 38 [2024-11-14 05:38:40,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:38:40,153 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 87 transitions. [2024-11-14 05:38:40,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-14 05:38:40,154 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2024-11-14 05:38:40,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-14 05:38:40,154 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:38:40,154 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:38:40,176 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-14 05:38:40,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-14 05:38:40,355 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-14 05:38:40,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:38:40,355 INFO L85 PathProgramCache]: Analyzing trace with hash -927312963, now seen corresponding path program 1 times [2024-11-14 05:38:40,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:38:40,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592719683] [2024-11-14 05:38:40,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:38:40,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:38:40,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:38:40,482 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-14 05:38:40,482 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:38:40,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592719683] [2024-11-14 05:38:40,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592719683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:38:40,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:38:40,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:38:40,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306566000] [2024-11-14 05:38:40,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:38:40,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:38:40,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:38:40,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:38:40,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:38:40,485 INFO L87 Difference]: Start difference. First operand 75 states and 87 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:38:40,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:38:40,629 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2024-11-14 05:38:40,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:38:40,630 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2024-11-14 05:38:40,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:38:40,630 INFO L225 Difference]: With dead ends: 74 [2024-11-14 05:38:40,631 INFO L226 Difference]: Without dead ends: 74 [2024-11-14 05:38:40,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:38:40,631 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 8 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:38:40,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 134 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:38:40,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-14 05:38:40,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2024-11-14 05:38:40,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 67 states have internal predecessors, (73), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:38:40,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2024-11-14 05:38:40,634 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 39 [2024-11-14 05:38:40,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:38:40,635 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2024-11-14 05:38:40,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:38:40,635 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2024-11-14 05:38:40,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-14 05:38:40,635 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:38:40,635 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:38:40,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-14 05:38:40,636 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-14 05:38:40,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:38:40,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1429955597, now seen corresponding path program 1 times [2024-11-14 05:38:40,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:38:40,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905659901] [2024-11-14 05:38:40,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:38:40,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:38:40,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:38:43,347 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:38:43,348 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:38:43,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905659901] [2024-11-14 05:38:43,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905659901] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:38:43,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058772616] [2024-11-14 05:38:43,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:38:43,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:38:43,348 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:38:43,351 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:38:43,352 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-14 05:38:43,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:38:43,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 85 conjuncts are in the unsatisfiable core [2024-11-14 05:38:43,652 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:38:43,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:38:44,310 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 05:38:44,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 05:38:44,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:38:44,833 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:38:44,833 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 [2024-11-14 05:38:45,112 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-14 05:38:45,112 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 24 treesize of output 17 [2024-11-14 05:38:45,130 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 26 treesize of output 21 [2024-11-14 05:38:45,446 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 [2024-11-14 05:38:45,457 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 43 treesize of output 24 [2024-11-14 05:38:45,815 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 31 treesize of output 11 [2024-11-14 05:38:45,970 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 18 treesize of output 13 [2024-11-14 05:38:46,476 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:38:46,477 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:38:46,819 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2394 (Array Int Int))) (= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_2394) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8)))) is different from false [2024-11-14 05:38:47,037 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2394 (Array Int Int))) (= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_2394) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8)))) is different from false [2024-11-14 05:38:47,051 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:38:47,051 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 29 treesize of output 30 [2024-11-14 05:38:47,075 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:38:47,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 49 [2024-11-14 05:38:47,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2024-11-14 05:38:47,839 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2389 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2389) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2024-11-14 05:38:47,851 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2389 (Array Int Int)) (v_ArrVal_2388 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2388) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2389) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2024-11-14 05:38:47,867 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:38:47,867 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 22 treesize of output 23 [2024-11-14 05:38:47,873 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 65 treesize of output 57 [2024-11-14 05:38:47,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-14 05:38:47,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-14 05:38:47,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-14 05:38:49,221 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-14 05:38:49,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058772616] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:38:49,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [240875275] [2024-11-14 05:38:49,224 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2024-11-14 05:38:49,224 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:38:49,224 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:38:49,224 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:38:49,225 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:38:50,109 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-14 05:38:50,143 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:39:08,130 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6827#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 0 (+ 2147483648 (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 8)))) (not (= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 8)))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 8)) 2147483647) (<= 0 (+ |ULTIMATE.start_main_~s~0#1.offset| 8)) (<= 1 |ULTIMATE.start_main_~len~0#1|) (= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1) (<= (+ |ULTIMATE.start_main_~s~0#1.offset| 12) (select |#length| |ULTIMATE.start_main_~s~0#1.base|)))' at error location [2024-11-14 05:39:08,130 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:39:08,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:39:08,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 65 [2024-11-14 05:39:08,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295092073] [2024-11-14 05:39:08,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:39:08,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2024-11-14 05:39:08,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:39:08,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2024-11-14 05:39:08,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=324, Invalid=6805, Unknown=27, NotChecked=676, Total=7832 [2024-11-14 05:39:08,134 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand has 65 states, 59 states have (on average 1.6610169491525424) internal successors, (98), 57 states have internal predecessors, (98), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-14 05:39:13,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:39:13,698 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2024-11-14 05:39:13,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-14 05:39:13,699 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 59 states have (on average 1.6610169491525424) internal successors, (98), 57 states have internal predecessors, (98), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 40 [2024-11-14 05:39:13,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:39:13,699 INFO L225 Difference]: With dead ends: 71 [2024-11-14 05:39:13,699 INFO L226 Difference]: Without dead ends: 71 [2024-11-14 05:39:13,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 104 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2494 ImplicationChecksByTransitivity, 26.6s TimeCoverageRelationStatistics Valid=502, Invalid=9789, Unknown=27, NotChecked=812, Total=11130 [2024-11-14 05:39:13,701 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 69 mSDsluCounter, 1127 mSDsCounter, 0 mSdLazyCounter, 1311 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 1506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 184 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:39:13,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 1160 Invalid, 1506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1311 Invalid, 0 Unknown, 184 Unchecked, 2.6s Time] [2024-11-14 05:39:13,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-14 05:39:13,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-14 05:39:13,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 67 states have internal predecessors, (72), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:39:13,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2024-11-14 05:39:13,705 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 40 [2024-11-14 05:39:13,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:39:13,705 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2024-11-14 05:39:13,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 59 states have (on average 1.6610169491525424) internal successors, (98), 57 states have internal predecessors, (98), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-14 05:39:13,706 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2024-11-14 05:39:13,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-14 05:39:13,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:39:13,707 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:39:13,730 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-14 05:39:13,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-14 05:39:13,907 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-14 05:39:13,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:39:13,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1376255645, now seen corresponding path program 1 times [2024-11-14 05:39:13,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:39:13,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636158211] [2024-11-14 05:39:13,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:39:13,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:39:13,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:39:14,073 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-14 05:39:14,074 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:39:14,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636158211] [2024-11-14 05:39:14,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636158211] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:39:14,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109340937] [2024-11-14 05:39:14,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:39:14,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:39:14,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:39:14,077 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:39:14,079 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-14 05:39:14,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:39:14,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 05:39:14,406 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:39:14,663 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-14 05:39:14,663 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:39:14,831 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-14 05:39:14,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109340937] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:39:14,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2056184971] [2024-11-14 05:39:14,833 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2024-11-14 05:39:14,833 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:39:14,834 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:39:14,834 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:39:14,834 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:39:15,739 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-14 05:39:15,763 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:39:53,809 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7278#(exists ((|v_ULTIMATE.start_dll_circular_destroy_~head#1.base_20| Int)) (and (or (not (= |v_ULTIMATE.start_dll_circular_destroy_~head#1.base_20| 0)) (not (= |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0))) (not (= (select |#valid| |v_ULTIMATE.start_dll_circular_destroy_~head#1.base_20|) 1))))' at error location [2024-11-14 05:39:53,810 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:39:53,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:39:53,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2024-11-14 05:39:53,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848320431] [2024-11-14 05:39:53,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:39:53,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-14 05:39:53,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:39:53,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-14 05:39:53,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1047, Unknown=16, NotChecked=0, Total=1190 [2024-11-14 05:39:53,812 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-14 05:39:54,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:39:54,471 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2024-11-14 05:39:54,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 05:39:54,471 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2024-11-14 05:39:54,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:39:54,472 INFO L225 Difference]: With dead ends: 84 [2024-11-14 05:39:54,472 INFO L226 Difference]: Without dead ends: 84 [2024-11-14 05:39:54,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 38.5s TimeCoverageRelationStatistics Valid=176, Invalid=1368, Unknown=16, NotChecked=0, Total=1560 [2024-11-14 05:39:54,473 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 45 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 05:39:54,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 180 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 05:39:54,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-14 05:39:54,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 74. [2024-11-14 05:39:54,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 56 states have (on average 1.375) internal successors, (77), 70 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:39:54,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2024-11-14 05:39:54,477 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 41 [2024-11-14 05:39:54,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:39:54,477 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2024-11-14 05:39:54,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-14 05:39:54,477 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2024-11-14 05:39:54,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-14 05:39:54,477 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:39:54,478 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:39:54,494 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-14 05:39:54,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-14 05:39:54,678 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-14 05:39:54,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:39:54,679 INFO L85 PathProgramCache]: Analyzing trace with hash -383436044, now seen corresponding path program 1 times [2024-11-14 05:39:54,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:39:54,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824105744] [2024-11-14 05:39:54,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:39:54,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:39:54,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:39:56,580 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:39:56,580 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:39:56,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824105744] [2024-11-14 05:39:56,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824105744] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:39:56,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251845908] [2024-11-14 05:39:56,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:39:56,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:39:56,581 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:39:56,583 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:39:56,584 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-14 05:39:56,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:39:56,922 INFO L255 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 71 conjuncts are in the unsatisfiable core [2024-11-14 05:39:56,926 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:39:56,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:39:57,160 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 05:39:57,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 05:39:57,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:39:57,455 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:39:57,456 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 [2024-11-14 05:39:57,658 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-14 05:39:57,658 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 24 treesize of output 17 [2024-11-14 05:39:57,754 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 35 treesize of output 26 [2024-11-14 05:39:58,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:39:58,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:39:58,017 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:39:58,018 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 1 case distinctions, treesize of input 54 treesize of output 29 [2024-11-14 05:39:58,411 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:39:58,412 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 51 treesize of output 46 [2024-11-14 05:39:58,630 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:39:58,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 16 [2024-11-14 05:39:58,638 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-14 05:39:58,638 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:39:58,692 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2706 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_2706) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2024-11-14 05:39:59,012 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2706 (Array Int Int)) (v_ArrVal_2705 (Array Int Int))) (or (not (= v_ArrVal_2705 (let ((.cse0 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse0 (select v_ArrVal_2705 .cse0))))) (= (select |c_#valid| (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_2705))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_2706)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1))) is different from false [2024-11-14 05:39:59,045 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_108| Int) (v_ArrVal_2706 (Array Int Int)) (v_ArrVal_2705 (Array Int Int))) (or (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2705) (select v_ArrVal_2705 |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_2706) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_108| |c_ULTIMATE.start_main_~s~0#1.offset|) (not (= (let ((.cse0 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_108|))) (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 (select v_ArrVal_2705 .cse0))) v_ArrVal_2705)))) is different from false [2024-11-14 05:39:59,068 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_108| Int) (v_ArrVal_2706 (Array Int Int)) (v_ArrVal_2705 (Array Int Int))) (or (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2705) (select v_ArrVal_2705 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_2706) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) 1) (not (= v_ArrVal_2705 (let ((.cse0 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_108|))) (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 (select v_ArrVal_2705 .cse0))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_108| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) is different from false [2024-11-14 05:39:59,094 INFO L349 Elim1Store]: treesize reduction 5, result has 78.3 percent of original size [2024-11-14 05:39:59,094 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 27 treesize of output 26 [2024-11-14 05:39:59,118 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2703 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_108| Int) (v_ArrVal_2706 (Array Int Int)) (v_ArrVal_2705 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2703))) (or (not (= v_ArrVal_2705 (let ((.cse1 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_108|))) (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 (select v_ArrVal_2705 .cse1))))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2705) (select v_ArrVal_2705 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_2706) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_108| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) is different from false [2024-11-14 05:39:59,183 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2703 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_108| Int) (v_ArrVal_2706 (Array Int Int)) (v_ArrVal_2705 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2703))) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2705) (select v_ArrVal_2705 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_2706) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_108| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= (let ((.cse1 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_108|))) (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 (select v_ArrVal_2705 .cse1))) v_ArrVal_2705))))) is different from false [2024-11-14 05:39:59,219 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2703 (Array Int Int)) (v_ArrVal_2702 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_108| Int) (v_ArrVal_2706 (Array Int Int)) (v_ArrVal_2705 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2702) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2703))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_108| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2705) (select v_ArrVal_2705 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_2706) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (not (= (let ((.cse1 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_108|))) (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 (select v_ArrVal_2705 .cse1))) v_ArrVal_2705))))) is different from false [2024-11-14 05:39:59,267 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:39:59,267 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 58 treesize of output 58 [2024-11-14 05:39:59,281 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 113 treesize of output 109 [2024-11-14 05:39:59,289 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:39:59,291 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:39:59,314 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:39:59,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 109 treesize of output 119 [2024-11-14 05:39:59,327 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:39:59,344 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:39:59,344 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 81 [2024-11-14 05:39:59,355 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:39:59,371 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:39:59,371 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 67 [2024-11-14 05:39:59,388 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 11 treesize of output 9 [2024-11-14 05:39:59,558 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:39:59,560 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:39:59,560 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 145 treesize of output 119 [2024-11-14 05:39:59,675 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:39:59,677 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:39:59,678 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 73 treesize of output 53 [2024-11-14 05:39:59,719 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 8 treesize of output 4 [2024-11-14 05:39:59,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251845908] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:39:59,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1391030096] [2024-11-14 05:39:59,947 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2024-11-14 05:39:59,947 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:39:59,947 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:39:59,947 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:39:59,948 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:40:01,283 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-14 05:40:01,328 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:40:41,911 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7725#(exists ((|v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_49| Int)) (not (= (select |#valid| |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_49|) 1)))' at error location [2024-11-14 05:40:41,911 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:40:41,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:40:41,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 35 [2024-11-14 05:40:41,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944237484] [2024-11-14 05:40:41,911 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 05:40:41,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-14 05:40:41,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:40:41,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-14 05:40:41,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=3534, Unknown=51, NotChecked=882, Total=4692 [2024-11-14 05:40:41,914 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand has 36 states, 32 states have (on average 2.21875) internal successors, (71), 32 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 05:40:44,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:40:44,118 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2024-11-14 05:40:44,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-14 05:40:44,119 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 32 states have (on average 2.21875) internal successors, (71), 32 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2024-11-14 05:40:44,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:40:44,120 INFO L225 Difference]: With dead ends: 77 [2024-11-14 05:40:44,120 INFO L226 Difference]: Without dead ends: 77 [2024-11-14 05:40:44,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1169 ImplicationChecksByTransitivity, 43.9s TimeCoverageRelationStatistics Valid=284, Invalid=4385, Unknown=51, NotChecked=980, Total=5700 [2024-11-14 05:40:44,122 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 77 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-14 05:40:44,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 501 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 860 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-14 05:40:44,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-14 05:40:44,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-14 05:40:44,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 73 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:40:44,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2024-11-14 05:40:44,126 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 43 [2024-11-14 05:40:44,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:40:44,127 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2024-11-14 05:40:44,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 32 states have (on average 2.21875) internal successors, (71), 32 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 05:40:44,127 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2024-11-14 05:40:44,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-14 05:40:44,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:40:44,128 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:40:44,146 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-14 05:40:44,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-14 05:40:44,329 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-14 05:40:44,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:40:44,329 INFO L85 PathProgramCache]: Analyzing trace with hash -383436043, now seen corresponding path program 1 times [2024-11-14 05:40:44,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:40:44,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883979130] [2024-11-14 05:40:44,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:40:44,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:40:44,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:40:47,263 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:40:47,263 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:40:47,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883979130] [2024-11-14 05:40:47,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883979130] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:40:47,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580638900] [2024-11-14 05:40:47,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:40:47,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:40:47,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:40:47,266 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:40:47,268 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-14 05:40:47,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:40:47,596 INFO L255 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 87 conjuncts are in the unsatisfiable core [2024-11-14 05:40:47,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:40:47,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:40:47,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 05:40:48,431 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 05:40:48,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 05:40:48,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-14 05:40:48,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:40:48,696 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 15 treesize of output 1 [2024-11-14 05:40:48,873 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:40:48,873 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 [2024-11-14 05:40:48,884 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 24 treesize of output 11 [2024-11-14 05:40:49,216 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 05:40:49,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 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-14 05:40:49,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-14 05:40:49,280 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-14 05:40:49,280 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 33 treesize of output 24 [2024-11-14 05:40:49,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-14 05:40:49,422 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 35 treesize of output 26 [2024-11-14 05:40:49,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:40:49,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:40:49,819 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 54 treesize of output 29 [2024-11-14 05:40:49,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:40:49,827 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 27 treesize of output 11 [2024-11-14 05:40:50,491 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:40:50,492 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 67 treesize of output 58 [2024-11-14 05:40:50,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:40:50,508 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 33 treesize of output 18 [2024-11-14 05:40:50,984 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 24 treesize of output 12 [2024-11-14 05:40:50,997 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:40:50,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 16 [2024-11-14 05:40:51,129 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:40:51,129 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:40:52,253 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (.cse2 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (and (forall ((v_ArrVal_2870 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_2870))) (or (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8) 0) (forall ((v_ArrVal_2871 (Array Int Int))) (or (not (= (store .cse1 .cse2 (select v_ArrVal_2871 .cse2)) v_ArrVal_2871)) (forall ((v_ArrVal_2873 (Array Int Int))) (<= 0 (+ (select (select (store .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_2871) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_2873) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8))))) (not (= v_ArrVal_2870 (store .cse3 .cse2 (select v_ArrVal_2870 .cse2))))))) (forall ((v_ArrVal_2870 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_2870))) (or (< (+ (select (select .cse4 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8) 0) (forall ((v_ArrVal_2871 (Array Int Int))) (or (forall ((v_ArrVal_2873 (Array Int Int)) (v_ArrVal_2872 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_2871))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (<= (+ (select (select (store .cse4 .cse5 v_ArrVal_2873) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 12) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_2872) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) (not (= (store .cse1 .cse2 (select v_ArrVal_2871 .cse2)) v_ArrVal_2871)))) (not (= v_ArrVal_2870 (store .cse3 .cse2 (select v_ArrVal_2870 .cse2))))))))) is different from false [2024-11-14 05:40:52,396 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|))) (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_122| Int)) (or (forall ((v_ArrVal_2870 (Array Int Int))) (let ((.cse1 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_122|))) (or (< (+ 8 (select v_ArrVal_2870 |c_ULTIMATE.start_main_~s~0#1.offset|)) 0) (forall ((v_ArrVal_2871 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_2871 .cse1)) v_ArrVal_2871)) (forall ((v_ArrVal_2873 (Array Int Int)) (v_ArrVal_2872 (Array Int Int))) (let ((.cse2 (select v_ArrVal_2871 |c_ULTIMATE.start_main_~s~0#1.offset|))) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2870) .cse2 v_ArrVal_2873) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2871) .cse2 v_ArrVal_2872) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))))) (not (= v_ArrVal_2870 (store .cse3 .cse1 (select v_ArrVal_2870 .cse1))))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_122| |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((v_ArrVal_2873 (Array Int Int)) (v_ArrVal_2870 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_122| Int)) (or (< (+ 8 (select v_ArrVal_2870 |c_ULTIMATE.start_main_~s~0#1.offset|)) 0) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_122| |c_ULTIMATE.start_main_~s~0#1.offset|) (< 0 (+ 9 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2870) (select .cse0 |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_2873) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (not (= v_ArrVal_2870 (let ((.cse4 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_122|))) (store .cse3 .cse4 (select v_ArrVal_2870 .cse4))))))))) is different from false [2024-11-14 05:40:52,475 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse1 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_2873 (Array Int Int)) (v_ArrVal_2870 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_122| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_122| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (< (+ 8 (select v_ArrVal_2870 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) 0) (not (= v_ArrVal_2870 (let ((.cse2 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_122|))) (store (store .cse0 .cse1 (select v_ArrVal_2870 .cse1)) .cse2 (select v_ArrVal_2870 .cse2))))) (< 0 (+ 9 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2870) (select .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_2873) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) (forall ((v_ArrVal_2873 (Array Int Int)) (v_ArrVal_2872 (Array Int Int)) (v_ArrVal_2871 (Array Int Int)) (v_ArrVal_2870 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_122| Int)) (let ((.cse5 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_122|))) (or (let ((.cse4 (select v_ArrVal_2871 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (< (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2870) .cse4 v_ArrVal_2873) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 11) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2871) .cse4 v_ArrVal_2872) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_122| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (< (+ 8 (select v_ArrVal_2870 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) 0) (not (= v_ArrVal_2870 (store (store .cse0 .cse1 (select v_ArrVal_2870 .cse1)) .cse5 (select v_ArrVal_2870 .cse5)))) (not (= (store (store .cse3 .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 (select v_ArrVal_2871 .cse5)) v_ArrVal_2871))))))) is different from false [2024-11-14 05:40:52,560 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_2867 (Array Int Int)) (v_ArrVal_2866 (Array Int Int)) (v_ArrVal_2873 (Array Int Int)) (v_ArrVal_2870 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_122| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2867))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_122| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (< (+ 8 (select v_ArrVal_2870 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) 0) (not (= (let ((.cse2 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_122|))) (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 (select v_ArrVal_2870 .cse1)) .cse2 (select v_ArrVal_2870 .cse2))) v_ArrVal_2870)) (< 0 (+ 9 (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2870) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2866) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_2873) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))) (forall ((v_ArrVal_2867 (Array Int Int)) (v_ArrVal_2866 (Array Int Int)) (v_ArrVal_2873 (Array Int Int)) (v_ArrVal_2872 (Array Int Int)) (v_ArrVal_2871 (Array Int Int)) (v_ArrVal_2870 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_122| Int)) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2867)) (.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2866)) (.cse6 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_122|))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_122| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (< (+ 8 (select v_ArrVal_2870 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) 0) (let ((.cse4 (select v_ArrVal_2871 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (< (+ (select (select (store (store .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2870) .cse4 v_ArrVal_2873) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 11) (select |c_#length| (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2871) .cse4 v_ArrVal_2872) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (not (= (store (store (select .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 (select v_ArrVal_2870 .cse1)) .cse6 (select v_ArrVal_2870 .cse6)) v_ArrVal_2870)) (not (= v_ArrVal_2871 (store (store (select .cse5 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse6 (select v_ArrVal_2871 .cse6))))))))) is different from false [2024-11-14 05:40:52,763 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_2867 (Array Int Int)) (v_ArrVal_2866 (Array Int Int)) (v_ArrVal_2873 (Array Int Int)) (v_ArrVal_2872 (Array Int Int)) (v_ArrVal_2871 (Array Int Int)) (v_ArrVal_2870 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_122| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2867)) (.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2866)) (.cse2 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_122|))) (or (not (= v_ArrVal_2870 (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 (select v_ArrVal_2870 .cse1)) .cse2 (select v_ArrVal_2870 .cse2)))) (let ((.cse3 (select v_ArrVal_2871 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (< (+ (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2870) .cse3 v_ArrVal_2873) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 11) (select |c_#length| (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2871) .cse3 v_ArrVal_2872) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (< (+ (select v_ArrVal_2870 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 8) 0) (not (= (store (store (select .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 (select v_ArrVal_2871 .cse2)) v_ArrVal_2871)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_122| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_2867 (Array Int Int)) (v_ArrVal_2866 (Array Int Int)) (v_ArrVal_2873 (Array Int Int)) (v_ArrVal_2870 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_122| Int)) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2867))) (or (< 0 (+ 9 (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2870) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2866) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_2873) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (not (= v_ArrVal_2870 (let ((.cse6 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_122|))) (store (store (select .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 (select v_ArrVal_2870 .cse1)) .cse6 (select v_ArrVal_2870 .cse6))))) (< (+ (select v_ArrVal_2870 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 8) 0) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_122| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))))) is different from false [2024-11-14 05:40:52,882 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_2867 (Array Int Int)) (v_ArrVal_2866 (Array Int Int)) (v_ArrVal_2865 (Array Int Int)) (v_ArrVal_2864 (Array Int Int)) (v_ArrVal_2873 (Array Int Int)) (v_ArrVal_2872 (Array Int Int)) (v_ArrVal_2871 (Array Int Int)) (v_ArrVal_2870 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_122| Int)) (let ((.cse2 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_122|)) (.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2864) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2867)) (.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2865) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2866))) (or (not (= v_ArrVal_2870 (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 (select v_ArrVal_2870 .cse1)) .cse2 (select v_ArrVal_2870 .cse2)))) (not (= v_ArrVal_2871 (store (store (select .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 (select v_ArrVal_2871 .cse2)))) (let ((.cse4 (select v_ArrVal_2871 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (< (+ (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2870) .cse4 v_ArrVal_2873) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 11) (select |c_#length| (select (select (store (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2871) .cse4 v_ArrVal_2872) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (< (+ (select v_ArrVal_2870 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 8) 0) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_122| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_2867 (Array Int Int)) (v_ArrVal_2866 (Array Int Int)) (v_ArrVal_2865 (Array Int Int)) (v_ArrVal_2864 (Array Int Int)) (v_ArrVal_2873 (Array Int Int)) (v_ArrVal_2870 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_122| Int)) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2864) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2867))) (or (not (= v_ArrVal_2870 (let ((.cse6 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_122|))) (store (store (select .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 (select v_ArrVal_2870 .cse1)) .cse6 (select v_ArrVal_2870 .cse6))))) (< 0 (+ 9 (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2870) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2865) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2866) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_2873) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (< (+ (select v_ArrVal_2870 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 8) 0) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_122| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))))) is different from false [2024-11-14 05:40:53,040 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:40:53,040 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 106 treesize of output 106 [2024-11-14 05:40:53,076 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:40:53,076 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 120 treesize of output 120 [2024-11-14 05:40:53,101 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 113 treesize of output 109 [2024-11-14 05:40:53,124 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:40:53,150 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:40:53,150 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 109 [2024-11-14 05:40:53,169 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:40:53,192 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:40:53,193 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 81 [2024-11-14 05:40:53,210 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:40:53,211 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:40:53,234 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:40:53,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 67 treesize of output 77 [2024-11-14 05:40:53,259 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 259 treesize of output 253 [2024-11-14 05:40:53,294 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:40:53,296 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:40:53,320 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:40:53,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 125 treesize of output 135 [2024-11-14 05:40:53,341 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:40:53,359 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:40:53,359 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 107 [2024-11-14 05:40:53,382 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:40:53,399 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:40:53,400 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 71 [2024-11-14 05:40:53,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2024-11-14 05:40:53,445 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 15 treesize of output 13 [2024-11-14 05:40:53,504 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:40:53,505 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 25 treesize of output 17 [2024-11-14 05:40:53,540 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:40:53,540 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 25 treesize of output 17 [2024-11-14 05:40:53,583 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:40:53,584 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 25 treesize of output 17 [2024-11-14 05:40:53,632 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:40:53,633 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:40:53,634 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 50 treesize of output 38 [2024-11-14 05:40:53,655 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:40:53,656 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:40:53,657 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 50 treesize of output 38 [2024-11-14 05:40:53,789 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 115 treesize of output 109 [2024-11-14 05:40:53,865 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:40:53,866 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 107 treesize of output 87 [2024-11-14 05:40:53,911 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:40:53,912 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:40:53,913 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 77 treesize of output 57 [2024-11-14 05:40:53,939 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 8 treesize of output 4 [2024-11-14 05:40:53,961 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:40:53,961 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:40:53,969 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 05:40:53,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 1 case distinctions, treesize of input 98 treesize of output 1 [2024-11-14 05:40:54,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580638900] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:40:54,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1628070225] [2024-11-14 05:40:54,671 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2024-11-14 05:40:54,672 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:40:54,672 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:40:54,672 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:40:54,672 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:40:56,015 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-14 05:40:56,050 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:41:12,752 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7917#true' at error location [2024-11-14 05:41:12,752 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:41:12,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:41:12,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20] total 41 [2024-11-14 05:41:12,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133007008] [2024-11-14 05:41:12,753 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 05:41:12,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-14 05:41:12,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:41:12,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-14 05:41:12,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=5016, Unknown=9, NotChecked=882, Total=6162 [2024-11-14 05:41:12,756 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand has 42 states, 37 states have (on average 2.081081081081081) internal successors, (77), 37 states have internal predecessors, (77), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 05:41:16,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:41:16,814 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2024-11-14 05:41:16,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-14 05:41:16,814 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 37 states have (on average 2.081081081081081) internal successors, (77), 37 states have internal predecessors, (77), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 43 [2024-11-14 05:41:16,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:41:16,815 INFO L225 Difference]: With dead ends: 77 [2024-11-14 05:41:16,815 INFO L226 Difference]: Without dead ends: 77 [2024-11-14 05:41:16,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1492 ImplicationChecksByTransitivity, 23.7s TimeCoverageRelationStatistics Valid=356, Invalid=6631, Unknown=9, NotChecked=1014, Total=8010 [2024-11-14 05:41:16,818 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 80 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 1217 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 1226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:41:16,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 759 Invalid, 1226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1217 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-14 05:41:16,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-14 05:41:16,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2024-11-14 05:41:16,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 58 states have (on average 1.3793103448275863) internal successors, (80), 72 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:41:16,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2024-11-14 05:41:16,823 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 43 [2024-11-14 05:41:16,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:41:16,823 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2024-11-14 05:41:16,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 37 states have (on average 2.081081081081081) internal successors, (77), 37 states have internal predecessors, (77), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 05:41:16,823 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2024-11-14 05:41:16,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-14 05:41:16,824 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:41:16,824 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1] [2024-11-14 05:41:16,849 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-14 05:41:17,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:41:17,025 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-14 05:41:17,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:41:17,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1110270902, now seen corresponding path program 1 times [2024-11-14 05:41:17,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:41:17,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817130626] [2024-11-14 05:41:17,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:41:17,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:41:17,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:41:17,194 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-14 05:41:17,195 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:41:17,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817130626] [2024-11-14 05:41:17,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817130626] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:41:17,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625218952] [2024-11-14 05:41:17,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:41:17,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:41:17,196 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:41:17,198 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:41:17,201 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-14 05:41:17,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:41:17,543 INFO L255 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 05:41:17,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:41:17,581 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-14 05:41:17,581 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:41:17,651 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-14 05:41:17,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625218952] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:41:17,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [369485911] [2024-11-14 05:41:17,654 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2024-11-14 05:41:17,654 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:41:17,654 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:41:17,654 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:41:17,654 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:41:18,371 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-14 05:41:18,395 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:41:28,885 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '8642#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 0 (+ 2147483648 (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 8)))) (not (= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 8)))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 8)) 2147483647) (<= 0 (+ |ULTIMATE.start_main_~s~0#1.offset| 8)) (<= 1 |ULTIMATE.start_main_~len~0#1|) (= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1) (<= (+ |ULTIMATE.start_main_~s~0#1.offset| 12) (select |#length| |ULTIMATE.start_main_~s~0#1.base|)))' at error location [2024-11-14 05:41:28,885 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:41:28,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:41:28,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2024-11-14 05:41:28,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097712391] [2024-11-14 05:41:28,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:41:28,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:41:28,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:41:28,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:41:28,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=767, Unknown=3, NotChecked=0, Total=870 [2024-11-14 05:41:28,887 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:41:29,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:41:29,092 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2024-11-14 05:41:29,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:41:29,092 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2024-11-14 05:41:29,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:41:29,093 INFO L225 Difference]: With dead ends: 76 [2024-11-14 05:41:29,093 INFO L226 Difference]: Without dead ends: 76 [2024-11-14 05:41:29,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 104 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=105, Invalid=822, Unknown=3, NotChecked=0, Total=930 [2024-11-14 05:41:29,094 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 38 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:41:29,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 127 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:41:29,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-14 05:41:29,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-14 05:41:29,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 58 states have (on average 1.3620689655172413) internal successors, (79), 72 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:41:29,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2024-11-14 05:41:29,097 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 44 [2024-11-14 05:41:29,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:41:29,097 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2024-11-14 05:41:29,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:41:29,098 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2024-11-14 05:41:29,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-14 05:41:29,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:41:29,099 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1] [2024-11-14 05:41:29,119 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-14 05:41:29,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:41:29,299 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-14 05:41:29,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:41:29,300 INFO L85 PathProgramCache]: Analyzing trace with hash 881639417, now seen corresponding path program 2 times [2024-11-14 05:41:29,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:41:29,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408682265] [2024-11-14 05:41:29,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:41:29,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:41:29,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:41:29,481 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-14 05:41:29,482 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:41:29,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408682265] [2024-11-14 05:41:29,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408682265] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:41:29,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182238819] [2024-11-14 05:41:29,482 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:41:29,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:41:29,483 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:41:29,485 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:41:29,489 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-14 05:41:30,584 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 05:41:30,584 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:41:30,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 05:41:30,588 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:41:30,638 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-14 05:41:30,638 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:41:30,737 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-14 05:41:30,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182238819] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:41:30,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [429927657] [2024-11-14 05:41:30,740 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2024-11-14 05:41:30,740 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:41:30,740 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:41:30,740 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:41:30,740 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:41:32,013 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-14 05:41:32,035 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:42:08,902 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '9091#(exists ((|v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_93| Int)) (not (= (select |#valid| |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_93|) 1)))' at error location [2024-11-14 05:42:08,903 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:42:08,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:42:08,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2024-11-14 05:42:08,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88999902] [2024-11-14 05:42:08,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:42:08,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 05:42:08,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:42:08,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 05:42:08,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=760, Unknown=16, NotChecked=0, Total=870 [2024-11-14 05:42:08,904 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:42:09,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:42:09,235 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2024-11-14 05:42:09,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:42:09,236 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2024-11-14 05:42:09,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:42:09,236 INFO L225 Difference]: With dead ends: 68 [2024-11-14 05:42:09,236 INFO L226 Difference]: Without dead ends: 68 [2024-11-14 05:42:09,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 108 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 37.1s TimeCoverageRelationStatistics Valid=114, Invalid=926, Unknown=16, NotChecked=0, Total=1056 [2024-11-14 05:42:09,237 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 14 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:42:09,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 195 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:42:09,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-14 05:42:09,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-14 05:42:09,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 54 states have (on average 1.2777777777777777) internal successors, (69), 64 states have internal predecessors, (69), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:42:09,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2024-11-14 05:42:09,244 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 45 [2024-11-14 05:42:09,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:42:09,244 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2024-11-14 05:42:09,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:42:09,244 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2024-11-14 05:42:09,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-14 05:42:09,245 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:42:09,245 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2024-11-14 05:42:09,263 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-14 05:42:09,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:42:09,446 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-14 05:42:09,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:42:09,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1672904529, now seen corresponding path program 1 times [2024-11-14 05:42:09,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:42:09,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314166839] [2024-11-14 05:42:09,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:42:09,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:42:09,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:42:12,528 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:42:12,528 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:42:12,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314166839] [2024-11-14 05:42:12,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314166839] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:42:12,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772103505] [2024-11-14 05:42:12,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:42:12,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:42:12,528 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:42:12,530 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:42:12,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-14 05:42:12,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:42:12,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 94 conjuncts are in the unsatisfiable core [2024-11-14 05:42:12,891 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:42:12,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:42:13,669 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 05:42:13,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 05:42:14,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:42:14,250 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:42:14,251 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 [2024-11-14 05:42:14,612 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-14 05:42:14,613 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 24 treesize of output 17 [2024-11-14 05:42:14,641 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 26 treesize of output 21 [2024-11-14 05:42:15,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:42:15,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:42:15,195 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:42:15,196 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 1 case distinctions, treesize of input 43 treesize of output 24 [2024-11-14 05:42:15,954 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:42:15,954 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 81 treesize of output 70 [2024-11-14 05:42:15,961 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 25 treesize of output 17 [2024-11-14 05:42:15,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:42:15,969 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 34 treesize of output 21 [2024-11-14 05:42:16,807 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 48 treesize of output 24 [2024-11-14 05:42:16,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-11-14 05:42:17,096 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:42:17,096 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:42:17,854 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 76 treesize of output 56 [2024-11-14 05:42:17,882 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3340 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3340) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (forall ((v_ArrVal_3341 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3341) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (= |c_ULTIMATE.start_dll_circular_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| 1))) is different from false [2024-11-14 05:42:17,920 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:42:17,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2024-11-14 05:42:17,927 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 11 [2024-11-14 05:42:18,307 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3338 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3338) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (not (= v_ArrVal_3338 (let ((.cse0 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse0 (select v_ArrVal_3338 .cse0))))))) (= |c_ULTIMATE.start_main_~i~0#1| 0)) is different from false [2024-11-14 05:42:19,467 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:42:19,467 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 22 treesize of output 23 [2024-11-14 05:42:19,474 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 65 treesize of output 57 [2024-11-14 05:42:19,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-14 05:42:19,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-14 05:42:19,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-14 05:42:20,948 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-14 05:42:20,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1772103505] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:42:20,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1362640162] [2024-11-14 05:42:20,950 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2024-11-14 05:42:20,950 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:42:20,950 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:42:20,950 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:42:20,950 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:42:21,792 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-14 05:42:21,817 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:42:43,230 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '9597#(exists ((|v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_107| Int) (|v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_112| Int)) (and (<= 0 (+ (select (select |#memory_int| |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_112|) (+ |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_107| 8)) 2147483648)) (<= 0 (+ |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_107| 8)) (<= (+ |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_107| 12) (select |#length| |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_112|)) (= (select |#valid| |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_112|) 1) (<= (select (select |#memory_int| |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_112|) (+ |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_107| 8)) 2147483647)))' at error location [2024-11-14 05:42:43,231 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:42:43,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:42:43,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 71 [2024-11-14 05:42:43,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129954529] [2024-11-14 05:42:43,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:42:43,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2024-11-14 05:42:43,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:42:43,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2024-11-14 05:42:43,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=7972, Unknown=54, NotChecked=362, Total=8742 [2024-11-14 05:42:43,234 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand has 71 states, 65 states have (on average 1.7846153846153847) internal successors, (116), 63 states have internal predecessors, (116), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-14 05:42:50,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:42:50,874 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2024-11-14 05:42:50,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-14 05:42:50,875 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 65 states have (on average 1.7846153846153847) internal successors, (116), 63 states have internal predecessors, (116), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 46 [2024-11-14 05:42:50,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:42:50,875 INFO L225 Difference]: With dead ends: 65 [2024-11-14 05:42:50,876 INFO L226 Difference]: Without dead ends: 65 [2024-11-14 05:42:50,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 112 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2884 ImplicationChecksByTransitivity, 33.8s TimeCoverageRelationStatistics Valid=563, Invalid=11823, Unknown=54, NotChecked=442, Total=12882 [2024-11-14 05:42:50,878 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 41 mSDsluCounter, 1045 mSDsCounter, 0 mSdLazyCounter, 1576 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 1071 SdHoareTripleChecker+Invalid, 1660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:42:50,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 1071 Invalid, 1660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1576 Invalid, 0 Unknown, 77 Unchecked, 3.2s Time] [2024-11-14 05:42:50,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-14 05:42:50,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-14 05:42:50,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 61 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:42:50,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2024-11-14 05:42:50,882 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 46 [2024-11-14 05:42:50,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:42:50,882 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2024-11-14 05:42:50,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 65 states have (on average 1.7846153846153847) internal successors, (116), 63 states have internal predecessors, (116), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-14 05:42:50,882 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2024-11-14 05:42:50,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-14 05:42:50,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:42:50,883 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2024-11-14 05:42:50,908 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-14 05:42:51,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:42:51,084 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-14 05:42:51,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:42:51,084 INFO L85 PathProgramCache]: Analyzing trace with hash 317737946, now seen corresponding path program 1 times [2024-11-14 05:42:51,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:42:51,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189206841] [2024-11-14 05:42:51,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:42:51,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:42:51,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:42:51,577 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-14 05:42:51,578 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:42:51,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189206841] [2024-11-14 05:42:51,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189206841] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:42:51,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:42:51,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-14 05:42:51,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110415390] [2024-11-14 05:42:51,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:42:51,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 05:42:51,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:42:51,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 05:42:51,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-14 05:42:51,580 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand has 9 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:42:52,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:42:52,119 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2024-11-14 05:42:52,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 05:42:52,120 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 47 [2024-11-14 05:42:52,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:42:52,121 INFO L225 Difference]: With dead ends: 63 [2024-11-14 05:42:52,121 INFO L226 Difference]: Without dead ends: 63 [2024-11-14 05:42:52,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-14 05:42:52,122 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 12 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 05:42:52,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 153 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 05:42:52,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-14 05:42:52,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-14 05:42:52,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 59 states have internal predecessors, (63), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:42:52,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2024-11-14 05:42:52,125 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 47 [2024-11-14 05:42:52,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:42:52,126 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2024-11-14 05:42:52,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:42:52,126 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2024-11-14 05:42:52,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-14 05:42:52,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:42:52,127 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2024-11-14 05:42:52,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-14 05:42:52,127 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-14 05:42:52,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:42:52,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1259974599, now seen corresponding path program 1 times [2024-11-14 05:42:52,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:42:52,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603432315] [2024-11-14 05:42:52,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:42:52,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:42:52,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:42:52,436 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-14 05:42:52,436 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:42:52,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603432315] [2024-11-14 05:42:52,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603432315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:42:52,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:42:52,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-14 05:42:52,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604551748] [2024-11-14 05:42:52,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:42:52,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 05:42:52,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:42:52,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 05:42:52,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-14 05:42:52,437 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:42:52,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:42:52,943 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2024-11-14 05:42:52,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 05:42:52,943 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2024-11-14 05:42:52,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:42:52,944 INFO L225 Difference]: With dead ends: 63 [2024-11-14 05:42:52,944 INFO L226 Difference]: Without dead ends: 63 [2024-11-14 05:42:52,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-14 05:42:52,945 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 15 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 05:42:52,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 158 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 05:42:52,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-14 05:42:52,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-14 05:42:52,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 59 states have internal predecessors, (62), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:42:52,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2024-11-14 05:42:52,948 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 48 [2024-11-14 05:42:52,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:42:52,948 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2024-11-14 05:42:52,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:42:52,949 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2024-11-14 05:42:52,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-14 05:42:52,949 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:42:52,949 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2024-11-14 05:42:52,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-14 05:42:52,950 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-14 05:42:52,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:42:52,950 INFO L85 PathProgramCache]: Analyzing trace with hash 403569901, now seen corresponding path program 1 times [2024-11-14 05:42:52,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:42:52,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56955496] [2024-11-14 05:42:52,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:42:52,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:42:52,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:42:53,192 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-14 05:42:53,192 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:42:53,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56955496] [2024-11-14 05:42:53,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56955496] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:42:53,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143958496] [2024-11-14 05:42:53,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:42:53,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:42:53,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:42:53,195 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:42:53,197 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-14 05:42:53,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:42:53,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-11-14 05:42:53,581 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:42:53,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:42:53,877 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 05:42:53,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 05:42:53,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:42:54,097 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:42:54,097 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 [2024-11-14 05:42:54,268 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-14 05:42:54,269 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 24 treesize of output 17 [2024-11-14 05:42:54,353 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 35 treesize of output 26 [2024-11-14 05:42:54,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:42:54,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:42:54,585 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:42:54,585 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 1 case distinctions, treesize of input 50 treesize of output 29 [2024-11-14 05:42:54,871 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:42:54,872 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 47 treesize of output 42 [2024-11-14 05:42:55,131 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:42:55,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 16 [2024-11-14 05:42:55,140 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-14 05:42:55,140 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:42:55,208 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3655 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3655) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2024-11-14 05:42:55,222 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3655 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_3655) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2024-11-14 05:42:55,240 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3655 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3655) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2024-11-14 05:42:55,257 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3654 (Array Int Int)) (v_ArrVal_3655 (Array Int Int))) (or (not (= (let ((.cse0 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse0 (select v_ArrVal_3654 .cse0))) v_ArrVal_3654)) (= (select |c_#valid| (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3654))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3655)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1))) is different from false [2024-11-14 05:42:55,303 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_164| Int) (v_ArrVal_3654 (Array Int Int)) (v_ArrVal_3655 (Array Int Int))) (or (not (= v_ArrVal_3654 (let ((.cse0 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_164|))) (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 (select v_ArrVal_3654 .cse0))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_164| |c_ULTIMATE.start_main_~s~0#1.offset|) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3654) (select v_ArrVal_3654 |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3655) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1))) is different from false [2024-11-14 05:42:55,328 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_164| Int) (v_ArrVal_3654 (Array Int Int)) (v_ArrVal_3655 (Array Int Int))) (or (not (= (let ((.cse0 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_164|))) (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 (select v_ArrVal_3654 .cse0))) v_ArrVal_3654)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_164| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3654) (select v_ArrVal_3654 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_3655) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) 1))) is different from false [2024-11-14 05:42:55,355 INFO L349 Elim1Store]: treesize reduction 5, result has 78.3 percent of original size [2024-11-14 05:42:55,356 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 27 treesize of output 26 [2024-11-14 05:42:55,380 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_164| Int) (v_ArrVal_3651 (Array Int Int)) (v_ArrVal_3654 (Array Int Int)) (v_ArrVal_3655 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3651))) (or (not (= v_ArrVal_3654 (let ((.cse1 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_164|))) (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 (select v_ArrVal_3654 .cse1))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_164| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3654) (select v_ArrVal_3654 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_3655) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) is different from false [2024-11-14 05:42:55,436 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_164| Int) (v_ArrVal_3651 (Array Int Int)) (v_ArrVal_3654 (Array Int Int)) (v_ArrVal_3655 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3651))) (or (not (= (let ((.cse1 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_164|))) (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 (select v_ArrVal_3654 .cse1))) v_ArrVal_3654)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3654) (select v_ArrVal_3654 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_3655) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_164| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) is different from false [2024-11-14 05:42:55,462 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_164| Int) (v_ArrVal_3650 (Array Int Int)) (v_ArrVal_3651 (Array Int Int)) (v_ArrVal_3654 (Array Int Int)) (v_ArrVal_3655 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3650) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3651))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_164| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= (let ((.cse1 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_164|))) (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 (select v_ArrVal_3654 .cse1))) v_ArrVal_3654)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3654) (select v_ArrVal_3654 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_3655) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) is different from false [2024-11-14 05:42:55,497 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:42:55,498 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 58 treesize of output 58 [2024-11-14 05:42:55,508 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 113 treesize of output 109 [2024-11-14 05:42:55,516 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:42:55,517 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:42:55,541 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:42:55,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 109 treesize of output 119 [2024-11-14 05:42:55,552 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:42:55,568 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:42:55,569 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 95 [2024-11-14 05:42:55,579 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:42:55,595 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:42:55,596 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 67 [2024-11-14 05:42:55,608 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 11 treesize of output 9 [2024-11-14 05:42:55,740 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:42:55,741 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:42:55,742 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 151 treesize of output 123 [2024-11-14 05:42:55,810 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:42:55,811 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 92 treesize of output 72 [2024-11-14 05:42:55,848 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 37 treesize of output 31 [2024-11-14 05:42:56,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143958496] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:42:56,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1467528904] [2024-11-14 05:42:56,006 INFO L159 IcfgInterpreter]: Started Sifa with 32 locations of interest [2024-11-14 05:42:56,006 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:42:56,006 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:42:56,006 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:42:56,006 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:42:56,923 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-14 05:42:56,952 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:43:10,864 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '10338#(and (<= 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_destroy_~head#1.base|) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)) 1)) (= 1 (select |#valid| |ULTIMATE.start_dll_circular_destroy_~head#1.base|)) (<= (+ |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 4) (select |#length| |ULTIMATE.start_dll_circular_destroy_~head#1.base|)) (= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_destroy_~head#1.base|) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)) (or (not (= |ULTIMATE.start_dll_circular_destroy_~head#1.base| 0)) (not (= |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0))))' at error location [2024-11-14 05:43:10,864 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:43:10,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:43:10,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 20] total 24 [2024-11-14 05:43:10,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769707890] [2024-11-14 05:43:10,864 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 05:43:10,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-14 05:43:10,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:43:10,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-14 05:43:10,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=2505, Unknown=11, NotChecked=972, Total=3660 [2024-11-14 05:43:10,866 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand has 25 states, 22 states have (on average 3.409090909090909) internal successors, (75), 22 states have internal predecessors, (75), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-14 05:43:12,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:43:12,684 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2024-11-14 05:43:12,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-14 05:43:12,685 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 3.409090909090909) internal successors, (75), 22 states have internal predecessors, (75), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 49 [2024-11-14 05:43:12,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:43:12,685 INFO L225 Difference]: With dead ends: 69 [2024-11-14 05:43:12,686 INFO L226 Difference]: Without dead ends: 69 [2024-11-14 05:43:12,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=195, Invalid=3022, Unknown=11, NotChecked=1062, Total=4290 [2024-11-14 05:43:12,687 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 27 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-14 05:43:12,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 230 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-14 05:43:12,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-14 05:43:12,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2024-11-14 05:43:12,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 53 states have (on average 1.1886792452830188) internal successors, (63), 59 states have internal predecessors, (63), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:43:12,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2024-11-14 05:43:12,690 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 49 [2024-11-14 05:43:12,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:43:12,690 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2024-11-14 05:43:12,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 3.409090909090909) internal successors, (75), 22 states have internal predecessors, (75), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-14 05:43:12,691 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2024-11-14 05:43:12,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-14 05:43:12,691 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:43:12,691 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2024-11-14 05:43:12,721 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-11-14 05:43:12,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-11-14 05:43:12,892 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-14 05:43:12,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:43:12,893 INFO L85 PathProgramCache]: Analyzing trace with hash 403569902, now seen corresponding path program 1 times [2024-11-14 05:43:12,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:43:12,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989822250] [2024-11-14 05:43:12,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:43:12,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:43:12,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:43:15,241 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:43:15,242 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:43:15,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989822250] [2024-11-14 05:43:15,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989822250] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:43:15,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111962191] [2024-11-14 05:43:15,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:43:15,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:43:15,242 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:43:15,244 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:43:15,245 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-14 05:43:15,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:43:15,611 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 102 conjuncts are in the unsatisfiable core [2024-11-14 05:43:15,616 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:43:15,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:43:15,893 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 05:43:15,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 05:43:16,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:43:16,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:43:16,377 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:43:16,377 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 [2024-11-14 05:43:16,393 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 24 treesize of output 11 [2024-11-14 05:43:16,747 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 05:43:16,747 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 16 treesize of output 15 [2024-11-14 05:43:16,791 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-14 05:43:16,791 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 33 treesize of output 24 [2024-11-14 05:43:16,941 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 [2024-11-14 05:43:16,955 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 33 treesize of output 24 [2024-11-14 05:43:17,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:43:17,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:43:17,349 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 48 treesize of output 27 [2024-11-14 05:43:17,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:43:17,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:43:17,376 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 34 treesize of output 21 [2024-11-14 05:43:17,875 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:43:17,875 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 61 treesize of output 52 [2024-11-14 05:43:17,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:43:17,898 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 [2024-11-14 05:43:18,445 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 36 treesize of output 16 [2024-11-14 05:43:18,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-14 05:43:18,567 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-14 05:43:18,567 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:43:22,369 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:43:22,369 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 169 treesize of output 173 [2024-11-14 05:43:23,152 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:43:23,152 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 49 treesize of output 50 [2024-11-14 05:43:23,169 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 346 treesize of output 340 [2024-11-14 05:43:23,186 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:43:23,186 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 256 treesize of output 256 [2024-11-14 05:43:23,194 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:43:23,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 92 [2024-11-14 05:43:23,222 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 113 treesize of output 109 [2024-11-14 05:43:23,234 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:43:23,236 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:43:23,261 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:43:23,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 109 treesize of output 119 [2024-11-14 05:43:23,274 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:43:23,280 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 50 treesize of output 46 [2024-11-14 05:43:23,294 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:43:23,315 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:43:23,315 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 81 [2024-11-14 05:43:23,325 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:43:23,331 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 70 treesize of output 62 [2024-11-14 05:43:23,347 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:43:23,365 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:43:23,365 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 67 [2024-11-14 05:43:23,384 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 109 treesize of output 103 [2024-11-14 05:43:23,591 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:43:23,592 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 95 treesize of output 75 [2024-11-14 05:43:23,601 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:43:23,602 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:43:23,603 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 85 treesize of output 67 [2024-11-14 05:43:23,611 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:43:23,612 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 67 treesize of output 43 [2024-11-14 05:43:23,634 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:43:23,635 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:43:23,646 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:43:23,646 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 1 case distinctions, treesize of input 94 treesize of output 94 [2024-11-14 05:43:23,651 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:43:23,652 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:43:23,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2024-11-14 05:43:23,671 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:43:23,671 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 1 case distinctions, treesize of input 56 treesize of output 48 [2024-11-14 05:43:23,677 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:43:23,677 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:43:23,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-11-14 05:43:23,690 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:43:23,691 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:43:23,697 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:43:23,720 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:43:23,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 25 treesize of output 19 [2024-11-14 05:43:23,728 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 22 treesize of output 14 [2024-11-14 05:43:23,737 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:43:23,738 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:43:23,749 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 05:43:23,749 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 1 case distinctions, treesize of input 58 treesize of output 1 [2024-11-14 05:43:24,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111962191] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:43:24,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1188628397] [2024-11-14 05:43:24,394 INFO L159 IcfgInterpreter]: Started Sifa with 32 locations of interest [2024-11-14 05:43:24,394 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:43:24,394 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:43:24,395 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:43:24,395 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:43:25,272 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-14 05:43:25,297 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:43:44,216 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '10806#(and (<= 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) (= 1 (select |#valid| |ULTIMATE.start_dll_circular_destroy_~head#1.base|)) (<= (+ |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 4) (select |#length| |ULTIMATE.start_dll_circular_destroy_~head#1.base|)) (or (< (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_destroy_~head#1.base|) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_destroy_~head#1.base|) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) 4)) (< (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_destroy_~head#1.base|) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) 0)) (or (not (= |ULTIMATE.start_dll_circular_destroy_~head#1.base| 0)) (not (= |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0))))' at error location [2024-11-14 05:43:44,217 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:43:44,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:43:44,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 20] total 39 [2024-11-14 05:43:44,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154218219] [2024-11-14 05:43:44,217 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 05:43:44,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-14 05:43:44,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:43:44,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-14 05:43:44,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=6165, Unknown=23, NotChecked=0, Total=6480 [2024-11-14 05:43:44,219 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand has 40 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 states have internal predecessors, (78), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:43:46,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:43:46,695 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2024-11-14 05:43:46,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-14 05:43:46,696 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 states have internal predecessors, (78), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 49 [2024-11-14 05:43:46,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:43:46,696 INFO L225 Difference]: With dead ends: 64 [2024-11-14 05:43:46,696 INFO L226 Difference]: Without dead ends: 64 [2024-11-14 05:43:46,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2025 ImplicationChecksByTransitivity, 26.4s TimeCoverageRelationStatistics Valid=331, Invalid=6956, Unknown=23, NotChecked=0, Total=7310 [2024-11-14 05:43:46,698 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 33 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-14 05:43:46,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 364 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 923 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-14 05:43:46,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-14 05:43:46,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-14 05:43:46,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 54 states have (on average 1.1666666666666667) internal successors, (63), 60 states have internal predecessors, (63), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:43:46,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2024-11-14 05:43:46,702 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 49 [2024-11-14 05:43:46,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:43:46,702 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2024-11-14 05:43:46,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 states have internal predecessors, (78), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:43:46,703 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2024-11-14 05:43:46,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-14 05:43:46,703 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:43:46,703 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:43:46,733 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-11-14 05:43:46,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-11-14 05:43:46,904 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-14 05:43:46,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:43:46,905 INFO L85 PathProgramCache]: Analyzing trace with hash -374155612, now seen corresponding path program 1 times [2024-11-14 05:43:46,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:43:46,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929437056] [2024-11-14 05:43:46,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:43:46,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:43:46,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:43:47,304 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-14 05:43:47,304 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:43:47,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929437056] [2024-11-14 05:43:47,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929437056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:43:47,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:43:47,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-14 05:43:47,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082405971] [2024-11-14 05:43:47,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:43:47,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 05:43:47,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:43:47,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 05:43:47,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-14 05:43:47,306 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand has 9 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:43:47,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:43:47,773 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2024-11-14 05:43:47,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 05:43:47,774 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 50 [2024-11-14 05:43:47,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:43:47,774 INFO L225 Difference]: With dead ends: 63 [2024-11-14 05:43:47,774 INFO L226 Difference]: Without dead ends: 63 [2024-11-14 05:43:47,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-14 05:43:47,775 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 10 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 05:43:47,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 118 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 05:43:47,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-14 05:43:47,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-14 05:43:47,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 59 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:43:47,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2024-11-14 05:43:47,778 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 50 [2024-11-14 05:43:47,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:43:47,779 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2024-11-14 05:43:47,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:43:47,779 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2024-11-14 05:43:47,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-14 05:43:47,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:43:47,779 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:43:47,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-14 05:43:47,780 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-14 05:43:47,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:43:47,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1283681003, now seen corresponding path program 1 times [2024-11-14 05:43:47,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:43:47,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058340854] [2024-11-14 05:43:47,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:43:47,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:43:47,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:43:49,850 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:43:49,850 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:43:49,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058340854] [2024-11-14 05:43:49,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058340854] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:43:49,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377112981] [2024-11-14 05:43:49,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:43:49,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:43:49,851 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:43:49,853 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:43:49,854 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-14 05:43:50,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:43:50,298 INFO L255 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-11-14 05:43:50,302 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:43:50,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:43:50,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 5 treesize of output 3 [2024-11-14 05:43:50,623 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 05:43:50,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 05:43:50,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:43:51,040 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:43:51,041 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 41 treesize of output 38 [2024-11-14 05:43:51,364 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-14 05:43:51,364 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 33 treesize of output 24 [2024-11-14 05:43:51,386 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 35 treesize of output 26 [2024-11-14 05:43:51,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:43:51,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:43:51,741 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:43:51,741 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 1 case distinctions, treesize of input 54 treesize of output 29 [2024-11-14 05:43:52,172 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:43:52,172 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 51 treesize of output 46 [2024-11-14 05:43:52,588 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:43:52,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 16 [2024-11-14 05:43:52,725 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-14 05:43:52,725 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:43:55,363 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:43:55,364 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 58 treesize of output 58 [2024-11-14 05:43:55,375 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 227 treesize of output 221 [2024-11-14 05:43:55,390 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:43:55,392 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:43:55,423 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:43:55,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 109 treesize of output 119 [2024-11-14 05:43:55,440 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:43:55,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:43:55,464 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 95 [2024-11-14 05:43:55,483 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:43:55,509 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:43:55,509 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 67 [2024-11-14 05:43:55,528 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 11 [2024-11-14 05:43:55,701 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:43:55,703 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:43:55,703 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 184 treesize of output 156 [2024-11-14 05:43:55,795 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:43:55,796 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:43:55,797 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 96 treesize of output 76 [2024-11-14 05:43:55,845 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 43 treesize of output 35 [2024-11-14 05:43:56,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377112981] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:43:56,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [441373953] [2024-11-14 05:43:56,490 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2024-11-14 05:43:56,490 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:43:56,491 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:43:56,491 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:43:56,491 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:43:57,427 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-14 05:43:57,455 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:44:17,374 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '11413#(and (= |ULTIMATE.start_dll_circular_destroy_~q~0#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_destroy_~head#1.base|) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)) 0)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_destroy_~head#1.base|) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)) 0) |ULTIMATE.start_dll_circular_destroy_~q~0#1.base|) (<= 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) (= 1 (select |#valid| |ULTIMATE.start_dll_circular_destroy_~head#1.base|)) (<= (+ |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 4) (select |#length| |ULTIMATE.start_dll_circular_destroy_~head#1.base|)) (or (not (= |ULTIMATE.start_dll_circular_destroy_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_destroy_~head#1.base|) 0))) (not (= |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_destroy_~head#1.base|) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)) 1) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_destroy_~head#1.base|) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|))) (<= |#StackHeapBarrier| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_destroy_~head#1.base|) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_destroy_~head#1.base|) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) 0) (or (not (= |ULTIMATE.start_dll_circular_destroy_~head#1.base| 0)) (not (= |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0))))' at error location [2024-11-14 05:44:17,374 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:44:17,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:44:17,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 20] total 37 [2024-11-14 05:44:17,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074896502] [2024-11-14 05:44:17,374 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 05:44:17,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-14 05:44:17,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:44:17,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-14 05:44:17,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=6164, Unknown=20, NotChecked=0, Total=6480 [2024-11-14 05:44:17,376 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand has 38 states, 34 states have (on average 2.3529411764705883) internal successors, (80), 34 states have internal predecessors, (80), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 05:44:21,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:44:21,841 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2024-11-14 05:44:21,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-14 05:44:21,842 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 34 states have (on average 2.3529411764705883) internal successors, (80), 34 states have internal predecessors, (80), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2024-11-14 05:44:21,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:44:21,843 INFO L225 Difference]: With dead ends: 64 [2024-11-14 05:44:21,843 INFO L226 Difference]: Without dead ends: 64 [2024-11-14 05:44:21,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2054 ImplicationChecksByTransitivity, 27.5s TimeCoverageRelationStatistics Valid=403, Invalid=8133, Unknown=20, NotChecked=0, Total=8556 [2024-11-14 05:44:21,844 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 51 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 1012 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:44:21,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 274 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1012 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-14 05:44:21,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-14 05:44:21,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-14 05:44:21,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 60 states have internal predecessors, (62), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:44:21,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2024-11-14 05:44:21,848 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 51 [2024-11-14 05:44:21,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:44:21,849 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2024-11-14 05:44:21,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 34 states have (on average 2.3529411764705883) internal successors, (80), 34 states have internal predecessors, (80), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 05:44:21,850 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2024-11-14 05:44:21,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-14 05:44:21,850 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:44:21,850 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:44:21,871 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2024-11-14 05:44:22,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-11-14 05:44:22,051 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-14 05:44:22,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:44:22,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1029532041, now seen corresponding path program 1 times [2024-11-14 05:44:22,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:44:22,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10829296] [2024-11-14 05:44:22,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:44:22,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:44:22,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:44:23,702 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 05:44:23,703 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:44:23,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10829296] [2024-11-14 05:44:23,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10829296] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:44:23,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892382834] [2024-11-14 05:44:23,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:44:23,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:44:23,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:44:23,705 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:44:23,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-11-14 05:44:24,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:44:24,135 INFO L255 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-11-14 05:44:24,139 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:44:24,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:44:24,236 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 05:44:24,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 05:44:24,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:44:24,465 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:44:24,466 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 [2024-11-14 05:44:24,679 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-14 05:44:24,679 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 24 treesize of output 17 [2024-11-14 05:44:24,698 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 24 treesize of output 19 [2024-11-14 05:44:24,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:44:24,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:44:24,947 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:44:24,947 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 1 case distinctions, treesize of input 39 treesize of output 22 [2024-11-14 05:44:25,255 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:44:25,256 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 36 treesize of output 33 [2024-11-14 05:44:25,618 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:44:25,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 27 [2024-11-14 05:44:25,875 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-14 05:44:25,875 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:44:26,335 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4218 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_4218) |c_ULTIMATE.start_main_~s~0#1.base|) 0) |c_ULTIMATE.start_main_~s~0#1.base|))) is different from false [2024-11-14 05:44:26,349 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4218 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_4218) |c_ULTIMATE.start_main_~s~0#1.base|) 0) |c_ULTIMATE.start_main_~s~0#1.base|))) is different from false [2024-11-14 05:44:26,532 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4217 (Array Int Int)) (v_ArrVal_4218 (Array Int Int))) (or (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_4217))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_4218)) |c_ULTIMATE.start_main_~s~0#1.base|) 0) |c_ULTIMATE.start_main_~s~0#1.base|)) (not (= (let ((.cse1 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse1 (select v_ArrVal_4217 .cse1))) v_ArrVal_4217)))) is different from false [2024-11-14 05:44:26,564 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4217 (Array Int Int)) (v_ArrVal_4218 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_200| Int)) (or (not (= v_ArrVal_4217 (let ((.cse0 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_200|))) (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 (select v_ArrVal_4217 .cse0))))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_4217) (select v_ArrVal_4217 |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_4218) |c_ULTIMATE.start_main_~s~0#1.base|) 0) |c_ULTIMATE.start_main_~s~0#1.base|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_200| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2024-11-14 05:44:26,588 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4217 (Array Int Int)) (v_ArrVal_4218 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_200| Int)) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4217) (select v_ArrVal_4217 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_4218) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= v_ArrVal_4217 (let ((.cse0 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_200|))) (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 (select v_ArrVal_4217 .cse0))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_200| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) is different from false [2024-11-14 05:44:26,615 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4215 (Array Int Int)) (v_ArrVal_4217 (Array Int Int)) (v_ArrVal_4218 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_200| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4215))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_200| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (= (let ((.cse1 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_200|))) (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 (select v_ArrVal_4217 .cse1))) v_ArrVal_4217)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4217) (select v_ArrVal_4217 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_4218) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0)))))) is different from false [2024-11-14 05:44:26,661 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4215 (Array Int Int)) (v_ArrVal_4217 (Array Int Int)) (v_ArrVal_4218 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_200| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4215))) (or (not (= (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_4217) (select v_ArrVal_4217 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_4218) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_200| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= v_ArrVal_4217 (let ((.cse1 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_200|))) (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 (select v_ArrVal_4217 .cse1)))))))) is different from false [2024-11-14 05:44:26,687 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4214 (Array Int Int)) (v_ArrVal_4215 (Array Int Int)) (v_ArrVal_4217 (Array Int Int)) (v_ArrVal_4218 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_200| Int)) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4214) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4215))) (or (not (= (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_4217) (select v_ArrVal_4217 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_4218) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (= v_ArrVal_4217 (let ((.cse1 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_200|))) (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 (select v_ArrVal_4217 .cse1))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_200| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) is different from false [2024-11-14 05:44:26,720 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:44:26,720 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 61 treesize of output 61 [2024-11-14 05:44:26,726 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 113 treesize of output 109 [2024-11-14 05:44:26,733 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:44:26,735 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:44:26,753 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:44:26,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 109 treesize of output 119 [2024-11-14 05:44:26,763 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:44:26,779 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:44:26,779 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 81 [2024-11-14 05:44:26,790 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:44:26,806 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:44:26,807 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 67 [2024-11-14 05:44:26,818 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 26 treesize of output 24 [2024-11-14 05:44:26,989 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:44:26,993 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:44:27,040 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:44:27,040 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 186 treesize of output 186 [2024-11-14 05:44:27,366 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:44:27,370 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:44:27,416 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:44:27,416 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 146 treesize of output 146 [2024-11-14 05:44:27,921 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:44:27,925 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:44:27,967 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:44:27,968 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 89 treesize of output 101 [2024-11-14 05:44:29,708 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 7 not checked. [2024-11-14 05:44:29,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892382834] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:44:29,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2125879318] [2024-11-14 05:44:29,710 INFO L159 IcfgInterpreter]: Started Sifa with 36 locations of interest [2024-11-14 05:44:29,710 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:44:29,710 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:44:29,710 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:44:29,710 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:44:30,704 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-14 05:44:30,739 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:44:56,737 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '11962#(and (exists ((|v_ULTIMATE.start_main_old_#valid#1_10| (Array Int Int))) (not (= |v_ULTIMATE.start_main_old_#valid#1_10| |#valid|))) (exists ((|v_#valid_297| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_destroy_~head#1.base_26| Int)) (and (= (store |v_#valid_297| |v_ULTIMATE.start_dll_circular_destroy_~head#1.base_26| 0) |#valid|) (= |v_ULTIMATE.start_dll_circular_destroy_~head#1.base_26| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_destroy_~head#1.base_26|) 0)) (<= 4 (select |#length| |v_ULTIMATE.start_dll_circular_destroy_~head#1.base_26|)) (<= (+ |v_ULTIMATE.start_dll_circular_destroy_~head#1.base_26| 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_destroy_~head#1.base_26|) 0) 0) (not (= |v_ULTIMATE.start_dll_circular_destroy_~head#1.base_26| 0)) (= (select |v_#valid_297| |v_ULTIMATE.start_dll_circular_destroy_~head#1.base_26|) 1))) (= |ULTIMATE.start_main_#res#1| 0))' at error location [2024-11-14 05:44:56,737 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:44:56,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:44:56,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 24] total 57 [2024-11-14 05:44:56,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752151495] [2024-11-14 05:44:56,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:44:56,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-11-14 05:44:56,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:44:56,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-11-14 05:44:56,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=5738, Unknown=25, NotChecked=1272, Total=7310 [2024-11-14 05:44:56,739 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand has 57 states, 53 states have (on average 2.207547169811321) internal successors, (117), 51 states have internal predecessors, (117), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 05:45:01,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:45:01,675 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2024-11-14 05:45:01,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-14 05:45:01,675 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 53 states have (on average 2.207547169811321) internal successors, (117), 51 states have internal predecessors, (117), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 53 [2024-11-14 05:45:01,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:45:01,676 INFO L225 Difference]: With dead ends: 62 [2024-11-14 05:45:01,676 INFO L226 Difference]: Without dead ends: 62 [2024-11-14 05:45:01,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 97 SyntacticMatches, 7 SemanticMatches, 94 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 2132 ImplicationChecksByTransitivity, 32.1s TimeCoverageRelationStatistics Valid=356, Invalid=7307, Unknown=25, NotChecked=1432, Total=9120 [2024-11-14 05:45:01,677 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 69 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 1414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 427 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-14 05:45:01,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 342 Invalid, 1414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 983 Invalid, 0 Unknown, 427 Unchecked, 2.5s Time] [2024-11-14 05:45:01,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-14 05:45:01,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2024-11-14 05:45:01,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 57 states have internal predecessors, (58), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:45:01,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2024-11-14 05:45:01,681 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 53 [2024-11-14 05:45:01,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:45:01,682 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2024-11-14 05:45:01,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 53 states have (on average 2.207547169811321) internal successors, (117), 51 states have internal predecessors, (117), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 05:45:01,682 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2024-11-14 05:45:01,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-14 05:45:01,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:45:01,683 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:45:01,701 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2024-11-14 05:45:01,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-11-14 05:45:01,883 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-14 05:45:01,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:45:01,884 INFO L85 PathProgramCache]: Analyzing trace with hash -247880676, now seen corresponding path program 1 times [2024-11-14 05:45:01,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:45:01,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025153151] [2024-11-14 05:45:01,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:45:01,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:45:01,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:45:05,259 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:45:05,259 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:45:05,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025153151] [2024-11-14 05:45:05,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025153151] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:45:05,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29895708] [2024-11-14 05:45:05,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:45:05,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:45:05,260 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:45:05,262 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:45:05,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c445e2-d24d-461f-a614-736fcdcb85d9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-11-14 05:45:05,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:45:05,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 112 conjuncts are in the unsatisfiable core [2024-11-14 05:45:05,766 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:45:05,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:45:06,192 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 05:45:06,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 05:45:06,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:45:06,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 11 treesize of output 7 [2024-11-14 05:45:06,802 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:45:06,803 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 48 treesize of output 43 [2024-11-14 05:45:06,815 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 24 treesize of output 11 [2024-11-14 05:45:07,231 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-14 05:45:07,231 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 27 treesize of output 22 [2024-11-14 05:45:07,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:45:07,271 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 [2024-11-14 05:45:07,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:45:07,489 INFO L349 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2024-11-14 05:45:07,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 57 [2024-11-14 05:45:07,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2024-11-14 05:45:08,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:45:08,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:45:08,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:45:08,162 INFO L349 Elim1Store]: treesize reduction 61, result has 10.3 percent of original size [2024-11-14 05:45:08,162 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 4 case distinctions, treesize of input 83 treesize of output 56 [2024-11-14 05:45:08,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:45:08,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:45:08,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 53 [2024-11-14 05:45:09,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:45:09,276 INFO L349 Elim1Store]: treesize reduction 184, result has 14.4 percent of original size [2024-11-14 05:45:09,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 126 treesize of output 100 [2024-11-14 05:45:09,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:45:09,290 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:45:09,318 INFO L349 Elim1Store]: treesize reduction 31, result has 18.4 percent of original size [2024-11-14 05:45:09,319 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 44 [2024-11-14 05:45:11,074 INFO L349 Elim1Store]: treesize reduction 66, result has 9.6 percent of original size [2024-11-14 05:45:11,074 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 7 new quantified variables, introduced 10 case distinctions, treesize of input 82 treesize of output 50 [2024-11-14 05:45:11,082 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 29 treesize of output 13 [2024-11-14 05:45:11,498 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-14 05:45:11,498 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:46:25,384 INFO L349 Elim1Store]: treesize reduction 17, result has 67.3 percent of original size [2024-11-14 05:46:25,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 312 treesize of output 310 [2024-11-14 05:46:25,885 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:46:25,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 523 treesize of output 533 [2024-11-14 05:46:26,063 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:46:26,204 INFO L224 Elim1Store]: Index analysis took 266 ms [2024-11-14 05:46:27,171 INFO L349 Elim1Store]: treesize reduction 50, result has 66.0 percent of original size [2024-11-14 05:46:27,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 493 treesize of output 678 [2024-11-14 05:46:28,233 INFO L349 Elim1Store]: treesize reduction 46, result has 56.6 percent of original size [2024-11-14 05:46:28,234 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 4 new quantified variables, introduced 7 case distinctions, treesize of input 13666 treesize of output 13285 [2024-11-14 05:46:31,603 INFO L349 Elim1Store]: treesize reduction 111, result has 67.6 percent of original size [2024-11-14 05:46:31,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 23255 treesize of output 22563 [2024-11-14 05:46:32,556 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:46:32,599 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:46:32,603 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:46:32,687 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:46:32,745 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:46:32,751 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:46:32,872 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:46:33,001 INFO L224 Elim1Store]: Index analysis took 368 ms [2024-11-14 05:46:36,014 INFO L349 Elim1Store]: treesize reduction 435, result has 27.1 percent of original size [2024-11-14 05:46:36,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 20792 treesize of output 19987 [2024-11-14 05:47:04,991 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:47:05,372 INFO L224 Elim1Store]: Index analysis took 478 ms [2024-11-14 05:47:05,504 INFO L349 Elim1Store]: treesize reduction 156, result has 0.6 percent of original size [2024-11-14 05:47:05,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 98 treesize of output 117 [2024-11-14 05:47:06,077 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:47:06,543 INFO L224 Elim1Store]: Index analysis took 602 ms [2024-11-14 05:47:06,686 INFO L349 Elim1Store]: treesize reduction 156, result has 0.6 percent of original size [2024-11-14 05:47:06,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 98 treesize of output 117 [2024-11-14 05:47:07,597 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:47:08,013 INFO L224 Elim1Store]: Index analysis took 513 ms [2024-11-14 05:47:08,162 INFO L349 Elim1Store]: treesize reduction 156, result has 0.6 percent of original size [2024-11-14 05:47:08,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 98 treesize of output 117 [2024-11-14 05:47:12,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-11-14 05:47:22,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-14 05:47:24,428 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 05:47:38,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-11-14 05:47:44,246 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 05:47:45,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-11-14 05:47:46,632 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:47:47,322 INFO L224 Elim1Store]: Index analysis took 781 ms [2024-11-14 05:47:47,950 INFO L349 Elim1Store]: treesize reduction 130, result has 13.9 percent of original size [2024-11-14 05:47:47,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 103 treesize of output 86 [2024-11-14 05:47:48,368 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:47:48,781 INFO L224 Elim1Store]: Index analysis took 467 ms [2024-11-14 05:47:49,223 INFO L349 Elim1Store]: treesize reduction 130, result has 13.9 percent of original size [2024-11-14 05:47:49,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 103 treesize of output 86 [2024-11-14 05:47:55,524 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:47:55,788 INFO L224 Elim1Store]: Index analysis took 267 ms [2024-11-14 05:47:55,894 INFO L349 Elim1Store]: treesize reduction 92, result has 1.1 percent of original size [2024-11-14 05:47:55,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 57 treesize of output 13 [2024-11-14 05:47:56,826 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:47:56,830 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:47:56,833 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:47:56,837 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:47:56,857 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:47:56,952 INFO L224 Elim1Store]: Index analysis took 129 ms [2024-11-14 05:47:56,987 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-11-14 05:47:56,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 13 [2024-11-14 05:47:57,590 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:47:57,594 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:47:57,739 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:47:57,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 485 treesize of output 507 [2024-11-14 05:48:01,205 INFO L349 Elim1Store]: treesize reduction 17, result has 43.3 percent of original size [2024-11-14 05:48:01,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2024-11-14 05:48:02,998 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:48:02,999 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:48:03,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 27 treesize of output 17 [2024-11-14 05:48:03,355 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:48:03,389 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:48:03,643 INFO L224 Elim1Store]: Index analysis took 291 ms [2024-11-14 05:48:06,781 INFO L349 Elim1Store]: treesize reduction 540, result has 34.5 percent of original size [2024-11-14 05:48:06,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 28 case distinctions, treesize of input 265 treesize of output 632 [2024-11-14 05:48:07,153 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:48:07,158 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:48:07,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:48:07,168 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:48:07,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:48:07,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:48:07,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:48:07,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:48:07,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:48:07,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:48:07,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:48:07,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:48:07,539 INFO L224 Elim1Store]: Index analysis took 461 ms [2024-11-14 05:48:07,959 INFO L349 Elim1Store]: treesize reduction 116, result has 14.1 percent of original size [2024-11-14 05:48:07,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 17 case distinctions, treesize of input 170 treesize of output 185 [2024-11-14 05:48:08,662 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:48:08,668 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:48:08,672 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:48:08,695 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:48:08,701 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:48:09,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:48:09,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:48:09,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:48:09,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:48:09,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:48:09,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:48:09,368 INFO L224 Elim1Store]: Index analysis took 748 ms [2024-11-14 05:48:10,102 INFO L349 Elim1Store]: treesize reduction 150, result has 16.2 percent of original size [2024-11-14 05:48:10,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 15 case distinctions, treesize of input 169 treesize of output 194 [2024-11-14 05:48:10,619 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:48:10,641 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:48:11,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:48:11,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:48:11,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:48:11,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:48:11,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:48:11,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:48:11,343 INFO L224 Elim1Store]: Index analysis took 821 ms [2024-11-14 05:48:12,408 INFO L349 Elim1Store]: treesize reduction 352, result has 10.0 percent of original size [2024-11-14 05:48:12,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 25 case distinctions, treesize of input 176 treesize of output 211 [2024-11-14 05:48:13,039 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:48:13,046 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:48:13,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:48:13,075 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:48:13,106 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:48:13,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:48:13,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:48:13,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:48:13,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:48:13,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:48:13,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:48:13,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:48:13,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:48:13,576 INFO L224 Elim1Store]: Index analysis took 545 ms [2024-11-14 05:48:13,944 INFO L349 Elim1Store]: treesize reduction 81, result has 11.0 percent of original size [2024-11-14 05:48:13,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 153 treesize of output 164 [2024-11-14 05:48:14,489 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:48:14,512 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:48:14,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:48:14,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:48:14,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:48:14,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:48:14,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:48:15,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:48:15,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:48:15,066 INFO L224 Elim1Store]: Index analysis took 677 ms [2024-11-14 05:48:16,122 INFO L349 Elim1Store]: treesize reduction 352, result has 10.0 percent of original size [2024-11-14 05:48:16,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 25 case distinctions, treesize of input 176 treesize of output 211 [2024-11-14 05:48:16,885 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:48:16,915 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:48:17,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:48:17,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:48:17,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:48:17,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:48:17,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:48:17,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:48:17,894 INFO L224 Elim1Store]: Index analysis took 1155 ms [2024-11-14 05:48:19,731 INFO L349 Elim1Store]: treesize reduction 352, result has 10.0 percent of original size [2024-11-14 05:48:19,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 25 case distinctions, treesize of input 176 treesize of output 211