./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2c_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2c_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 208d04089fa2c50848123d29dd18b6b2021c1b591464bd422fd10955aaeec7fc --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 04:44:34,277 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 04:44:34,373 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-09 04:44:34,381 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 04:44:34,382 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 04:44:34,419 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 04:44:34,420 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 04:44:34,422 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 04:44:34,423 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 04:44:34,424 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 04:44:34,424 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 04:44:34,425 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 04:44:34,426 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 04:44:34,428 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 04:44:34,429 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 04:44:34,429 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 04:44:34,430 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 04:44:34,430 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 04:44:34,430 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 04:44:34,431 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 04:44:34,431 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 04:44:34,436 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 04:44:34,436 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 04:44:34,437 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 04:44:34,437 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 04:44:34,438 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 04:44:34,438 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 04:44:34,438 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 04:44:34,439 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 04:44:34,439 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 04:44:34,440 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 04:44:34,441 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 04:44:34,441 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 04:44:34,441 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 04:44:34,442 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 04:44:34,442 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 04:44:34,443 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 04:44:34,443 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 04:44:34,443 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 04:44:34,443 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 04:44:34,444 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 04:44:34,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 04:44:34,444 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 04:44:34,445 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 04:44:34,445 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 04:44:34,445 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 04:44:34,446 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 04:44:34,446 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 04:44:34,446 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 04:44:34,446 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 208d04089fa2c50848123d29dd18b6b2021c1b591464bd422fd10955aaeec7fc [2024-11-09 04:44:34,767 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 04:44:34,799 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 04:44:34,803 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 04:44:34,805 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 04:44:34,805 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 04:44:34,807 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/list-simple/dll2c_append_equal.i Unable to find full path for "g++" [2024-11-09 04:44:36,879 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 04:44:37,229 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 04:44:37,230 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/sv-benchmarks/c/list-simple/dll2c_append_equal.i [2024-11-09 04:44:37,249 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/data/4ee8129f4/73a972d657714ac29a87507c3aa1eb57/FLAGa70f0a7dc [2024-11-09 04:44:37,473 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/data/4ee8129f4/73a972d657714ac29a87507c3aa1eb57 [2024-11-09 04:44:37,475 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 04:44:37,477 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 04:44:37,478 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 04:44:37,478 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 04:44:37,486 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 04:44:37,487 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:44:37" (1/1) ... [2024-11-09 04:44:37,488 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a592901 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:37, skipping insertion in model container [2024-11-09 04:44:37,489 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:44:37" (1/1) ... [2024-11-09 04:44:37,553 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 04:44:37,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:44:37,962 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 04:44:38,047 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:44:38,085 INFO L204 MainTranslator]: Completed translation [2024-11-09 04:44:38,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:38 WrapperNode [2024-11-09 04:44:38,086 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 04:44:38,087 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 04:44:38,088 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 04:44:38,088 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 04:44:38,096 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:38" (1/1) ... [2024-11-09 04:44:38,110 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:38" (1/1) ... [2024-11-09 04:44:38,142 INFO L138 Inliner]: procedures = 127, calls = 48, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 142 [2024-11-09 04:44:38,143 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 04:44:38,143 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 04:44:38,144 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 04:44:38,144 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 04:44:38,156 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:38" (1/1) ... [2024-11-09 04:44:38,157 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:38" (1/1) ... [2024-11-09 04:44:38,165 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:38" (1/1) ... [2024-11-09 04:44:38,165 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:38" (1/1) ... [2024-11-09 04:44:38,178 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:38" (1/1) ... [2024-11-09 04:44:38,186 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:38" (1/1) ... [2024-11-09 04:44:38,190 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:38" (1/1) ... [2024-11-09 04:44:38,195 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:38" (1/1) ... [2024-11-09 04:44:38,202 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 04:44:38,203 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 04:44:38,203 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 04:44:38,203 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 04:44:38,204 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:38" (1/1) ... [2024-11-09 04:44:38,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 04:44:38,223 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:44:38,237 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 04:44:38,242 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 04:44:38,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 04:44:38,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 04:44:38,284 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-09 04:44:38,284 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-09 04:44:38,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 04:44:38,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 04:44:38,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 04:44:38,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 04:44:38,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 04:44:38,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 04:44:38,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-09 04:44:38,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 04:44:38,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 04:44:38,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 04:44:38,460 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 04:44:38,463 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 04:44:39,056 INFO L? ?]: Removed 151 outVars from TransFormulas that were not future-live. [2024-11-09 04:44:39,056 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 04:44:39,107 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 04:44:39,107 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 04:44:39,108 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:44:39 BoogieIcfgContainer [2024-11-09 04:44:39,108 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 04:44:39,111 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 04:44:39,111 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 04:44:39,115 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 04:44:39,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 04:44:37" (1/3) ... [2024-11-09 04:44:39,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1729c3f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:44:39, skipping insertion in model container [2024-11-09 04:44:39,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:38" (2/3) ... [2024-11-09 04:44:39,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1729c3f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:44:39, skipping insertion in model container [2024-11-09 04:44:39,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:44:39" (3/3) ... [2024-11-09 04:44:39,120 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_append_equal.i [2024-11-09 04:44:39,139 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 04:44:39,140 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 60 error locations. [2024-11-09 04:44:39,200 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 04:44:39,208 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;@fa12fa5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 04:44:39,208 INFO L334 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2024-11-09 04:44:39,214 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 57 states have (on average 2.280701754385965) internal successors, (130), 117 states have internal predecessors, (130), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 04:44:39,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 04:44:39,224 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:44:39,225 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 04:44:39,226 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-09 04:44:39,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:44:39,233 INFO L85 PathProgramCache]: Analyzing trace with hash 234308391, now seen corresponding path program 1 times [2024-11-09 04:44:39,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:44:39,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994131329] [2024-11-09 04:44:39,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:44:39,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:44:39,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:44:39,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:44:39,642 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:44:39,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994131329] [2024-11-09 04:44:39,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994131329] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:44:39,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:44:39,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 04:44:39,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215345521] [2024-11-09 04:44:39,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:44:39,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 04:44:39,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:44:39,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 04:44:39,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:44:39,691 INFO L87 Difference]: Start difference. First operand has 122 states, 57 states have (on average 2.280701754385965) internal successors, (130), 117 states have internal predecessors, (130), 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) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:44:39,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:44:39,946 INFO L93 Difference]: Finished difference Result 118 states and 129 transitions. [2024-11-09 04:44:39,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 04:44:39,950 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-09 04:44:39,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:44:39,961 INFO L225 Difference]: With dead ends: 118 [2024-11-09 04:44:39,962 INFO L226 Difference]: Without dead ends: 116 [2024-11-09 04:44:39,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:44:39,971 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 2 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 04:44:39,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 182 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 04:44:39,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-09 04:44:40,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-09 04:44:40,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 55 states have (on average 2.1818181818181817) internal successors, (120), 111 states have internal predecessors, (120), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 04:44:40,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 126 transitions. [2024-11-09 04:44:40,039 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 126 transitions. Word has length 5 [2024-11-09 04:44:40,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:44:40,040 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 126 transitions. [2024-11-09 04:44:40,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:44:40,041 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 126 transitions. [2024-11-09 04:44:40,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 04:44:40,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:44:40,043 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 04:44:40,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 04:44:40,044 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-09 04:44:40,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:44:40,046 INFO L85 PathProgramCache]: Analyzing trace with hash 234308390, now seen corresponding path program 1 times [2024-11-09 04:44:40,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:44:40,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331733128] [2024-11-09 04:44:40,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:44:40,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:44:40,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:44:40,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:44:40,193 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:44:40,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331733128] [2024-11-09 04:44:40,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331733128] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:44:40,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:44:40,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 04:44:40,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705491354] [2024-11-09 04:44:40,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:44:40,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 04:44:40,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:44:40,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 04:44:40,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:44:40,199 INFO L87 Difference]: Start difference. First operand 116 states and 126 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:44:40,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:44:40,382 INFO L93 Difference]: Finished difference Result 113 states and 123 transitions. [2024-11-09 04:44:40,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 04:44:40,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-09 04:44:40,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:44:40,386 INFO L225 Difference]: With dead ends: 113 [2024-11-09 04:44:40,386 INFO L226 Difference]: Without dead ends: 113 [2024-11-09 04:44:40,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:44:40,389 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 2 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 04:44:40,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 174 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 04:44:40,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-09 04:44:40,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-09 04:44:40,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 55 states have (on average 2.1272727272727274) internal successors, (117), 108 states have internal predecessors, (117), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 04:44:40,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 123 transitions. [2024-11-09 04:44:40,409 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 123 transitions. Word has length 5 [2024-11-09 04:44:40,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:44:40,410 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 123 transitions. [2024-11-09 04:44:40,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:44:40,410 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 123 transitions. [2024-11-09 04:44:40,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 04:44:40,411 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:44:40,411 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:44:40,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 04:44:40,413 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-09 04:44:40,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:44:40,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1252161603, now seen corresponding path program 1 times [2024-11-09 04:44:40,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:44:40,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135107182] [2024-11-09 04:44:40,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:44:40,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:44:40,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:44:40,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:44:40,535 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:44:40,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135107182] [2024-11-09 04:44:40,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135107182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:44:40,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:44:40,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 04:44:40,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046365540] [2024-11-09 04:44:40,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:44:40,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 04:44:40,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:44:40,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 04:44:40,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:44:40,543 INFO L87 Difference]: Start difference. First operand 113 states and 123 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-09 04:44:40,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:44:40,633 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2024-11-09 04:44:40,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 04:44:40,636 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-09 04:44:40,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:44:40,638 INFO L225 Difference]: With dead ends: 114 [2024-11-09 04:44:40,638 INFO L226 Difference]: Without dead ends: 114 [2024-11-09 04:44:40,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:44:40,640 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 11 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:44:40,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 203 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 04:44:40,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-09 04:44:40,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-09 04:44:40,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 56 states have (on average 2.0892857142857144) internal successors, (117), 109 states have internal predecessors, (117), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 04:44:40,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2024-11-09 04:44:40,650 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 11 [2024-11-09 04:44:40,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:44:40,652 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2024-11-09 04:44:40,652 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-09 04:44:40,653 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2024-11-09 04:44:40,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 04:44:40,653 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:44:40,654 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:44:40,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 04:44:40,654 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-09 04:44:40,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:44:40,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1605402792, now seen corresponding path program 1 times [2024-11-09 04:44:40,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:44:40,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59978084] [2024-11-09 04:44:40,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:44:40,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:44:40,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:44:40,900 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 04:44:40,901 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:44:40,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59978084] [2024-11-09 04:44:40,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59978084] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:44:40,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:44:40,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 04:44:40,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271120923] [2024-11-09 04:44:40,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:44:40,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 04:44:40,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:44:40,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 04:44:40,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:44:40,904 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. Second operand has 6 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 04:44:41,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:44:41,246 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2024-11-09 04:44:41,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 04:44:41,247 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2024-11-09 04:44:41,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:44:41,248 INFO L225 Difference]: With dead ends: 113 [2024-11-09 04:44:41,248 INFO L226 Difference]: Without dead ends: 113 [2024-11-09 04:44:41,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:44:41,250 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 7 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 04:44:41,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 330 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 04:44:41,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-09 04:44:41,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-09 04:44:41,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 56 states have (on average 2.0714285714285716) internal successors, (116), 108 states have internal predecessors, (116), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 04:44:41,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2024-11-09 04:44:41,260 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 20 [2024-11-09 04:44:41,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:44:41,261 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2024-11-09 04:44:41,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 04:44:41,261 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2024-11-09 04:44:41,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 04:44:41,262 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:44:41,262 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:44:41,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 04:44:41,263 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-09 04:44:41,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:44:41,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1605402793, now seen corresponding path program 1 times [2024-11-09 04:44:41,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:44:41,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117898557] [2024-11-09 04:44:41,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:44:41,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:44:41,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:44:41,617 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 04:44:41,618 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:44:41,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117898557] [2024-11-09 04:44:41,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117898557] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:44:41,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:44:41,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 04:44:41,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980547499] [2024-11-09 04:44:41,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:44:41,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 04:44:41,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:44:41,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 04:44:41,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:44:41,621 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand has 6 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 04:44:41,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:44:41,947 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2024-11-09 04:44:41,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 04:44:41,948 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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 20 [2024-11-09 04:44:41,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:44:41,950 INFO L225 Difference]: With dead ends: 112 [2024-11-09 04:44:41,950 INFO L226 Difference]: Without dead ends: 112 [2024-11-09 04:44:41,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:44:41,952 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 6 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 04:44:41,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 354 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 04:44:41,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-09 04:44:41,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-09 04:44:41,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 56 states have (on average 2.0535714285714284) internal successors, (115), 107 states have internal predecessors, (115), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 04:44:41,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2024-11-09 04:44:41,960 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 20 [2024-11-09 04:44:41,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:44:41,961 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2024-11-09 04:44:41,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 04:44:41,961 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2024-11-09 04:44:41,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 04:44:41,962 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:44:41,962 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:44:41,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 04:44:41,963 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-09 04:44:41,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:44:41,964 INFO L85 PathProgramCache]: Analyzing trace with hash 898823561, now seen corresponding path program 1 times [2024-11-09 04:44:41,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:44:41,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399012300] [2024-11-09 04:44:41,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:44:41,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:44:42,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:44:42,388 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-09 04:44:42,388 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:44:42,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399012300] [2024-11-09 04:44:42,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399012300] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:44:42,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219910784] [2024-11-09 04:44:42,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:44:42,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:44:42,394 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:44:42,396 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:44:42,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 04:44:42,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:44:42,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 04:44:42,577 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:44:42,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 04:44:42,720 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-09 04:44:42,787 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 04:44:42,788 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-09 04:44:42,820 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-09 04:44:42,820 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:44:43,147 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:44:43,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219910784] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:44:43,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1835341363] [2024-11-09 04:44:43,207 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2024-11-09 04:44:43,207 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:44:43,214 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:44:43,221 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:44:43,223 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:44:44,885 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 155 for LOIs [2024-11-09 04:44:45,910 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 04:45:02,204 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1422#(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_101| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_101| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_101| |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_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|) (= |ULTIMATE.start_main_~data~0#1| 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)) (exists ((|v_#memory_$Pointer$.offset_101| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_101| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_101| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 0)))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |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) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~data#1| 1))' at error location [2024-11-09 04:45:02,205 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 04:45:02,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 04:45:02,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 11 [2024-11-09 04:45:02,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714184512] [2024-11-09 04:45:02,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 04:45:02,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 04:45:02,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:45:02,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 04:45:02,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=470, Unknown=3, NotChecked=44, Total=600 [2024-11-09 04:45:02,209 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand has 12 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 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-09 04:45:03,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:45:03,314 INFO L93 Difference]: Finished difference Result 118 states and 130 transitions. [2024-11-09 04:45:03,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 04:45:03,315 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 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 22 [2024-11-09 04:45:03,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:45:03,317 INFO L225 Difference]: With dead ends: 118 [2024-11-09 04:45:03,318 INFO L226 Difference]: Without dead ends: 118 [2024-11-09 04:45:03,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=89, Invalid=512, Unknown=3, NotChecked=46, Total=650 [2024-11-09 04:45:03,320 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 1 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 125 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 04:45:03,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 422 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 403 Invalid, 0 Unknown, 125 Unchecked, 1.0s Time] [2024-11-09 04:45:03,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-09 04:45:03,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-09 04:45:03,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 61 states have (on average 2.0) internal successors, (122), 112 states have internal predecessors, (122), 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-09 04:45:03,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 130 transitions. [2024-11-09 04:45:03,331 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 130 transitions. Word has length 22 [2024-11-09 04:45:03,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:45:03,332 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 130 transitions. [2024-11-09 04:45:03,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 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-09 04:45:03,332 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 130 transitions. [2024-11-09 04:45:03,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 04:45:03,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:45:03,333 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:45:03,366 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 04:45:03,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:45:03,538 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-09 04:45:03,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:45:03,541 INFO L85 PathProgramCache]: Analyzing trace with hash 898823562, now seen corresponding path program 1 times [2024-11-09 04:45:03,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:45:03,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787578447] [2024-11-09 04:45:03,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:45:03,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:45:03,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:45:04,223 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:45:04,224 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:45:04,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787578447] [2024-11-09 04:45:04,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787578447] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:45:04,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571843098] [2024-11-09 04:45:04,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:45:04,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:45:04,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:45:04,230 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:45:04,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 04:45:04,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:45:04,387 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-09 04:45:04,394 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:45:04,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 04:45:04,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 04:45:04,954 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 04:45:04,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 04:45:04,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 04:45:05,174 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:45:05,175 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:45:05,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571843098] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:45:05,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1386526990] [2024-11-09 04:45:05,580 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2024-11-09 04:45:05,580 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:45:05,581 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:45:05,581 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:45:05,581 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:45:06,607 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 155 for LOIs [2024-11-09 04:45:07,397 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 04:45:26,025 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1772#(and (exists ((|v_#memory_$Pointer$.offset_115| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_115| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_115| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 0)))) (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_int_95| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_95| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_int_95| |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|) (exists ((|v_#memory_$Pointer$.base_115| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_115| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_115| |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))))) (<= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) 7) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 4 (select |#length| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |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) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~data#1| 1))' at error location [2024-11-09 04:45:26,025 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 04:45:26,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 04:45:26,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 17 [2024-11-09 04:45:26,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161505568] [2024-11-09 04:45:26,026 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 04:45:26,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 04:45:26,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:45:26,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 04:45:26,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=947, Unknown=2, NotChecked=0, Total=1056 [2024-11-09 04:45:26,029 INFO L87 Difference]: Start difference. First operand 118 states and 130 transitions. Second operand has 18 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 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-09 04:45:28,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:45:28,588 INFO L93 Difference]: Finished difference Result 118 states and 129 transitions. [2024-11-09 04:45:28,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:45:28,589 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 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 22 [2024-11-09 04:45:28,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:45:28,589 INFO L225 Difference]: With dead ends: 118 [2024-11-09 04:45:28,590 INFO L226 Difference]: Without dead ends: 118 [2024-11-09 04:45:28,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 20.0s TimeCoverageRelationStatistics Valid=143, Invalid=1261, Unknown=2, NotChecked=0, Total=1406 [2024-11-09 04:45:28,591 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 891 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:45:28,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 768 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 891 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-09 04:45:28,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-09 04:45:28,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-09 04:45:28,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 61 states have (on average 1.9836065573770492) internal successors, (121), 112 states have internal predecessors, (121), 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-09 04:45:28,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 129 transitions. [2024-11-09 04:45:28,607 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 129 transitions. Word has length 22 [2024-11-09 04:45:28,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:45:28,607 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 129 transitions. [2024-11-09 04:45:28,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 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-09 04:45:28,612 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 129 transitions. [2024-11-09 04:45:28,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 04:45:28,612 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:45:28,613 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-09 04:45:28,638 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 04:45:28,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-09 04:45:28,814 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-09 04:45:28,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:45:28,815 INFO L85 PathProgramCache]: Analyzing trace with hash 481170348, now seen corresponding path program 1 times [2024-11-09 04:45:28,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:45:28,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062444052] [2024-11-09 04:45:28,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:45:28,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:45:28,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:45:29,011 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-09 04:45:29,011 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:45:29,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062444052] [2024-11-09 04:45:29,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062444052] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:45:29,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868292492] [2024-11-09 04:45:29,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:45:29,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:45:29,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:45:29,014 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:45:29,036 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 04:45:29,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:45:29,169 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 04:45:29,170 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:45:29,226 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-09 04:45:29,226 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:45:29,315 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-09 04:45:29,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868292492] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:45:29,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1744118629] [2024-11-09 04:45:29,319 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2024-11-09 04:45:29,319 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:45:29,319 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:45:29,320 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:45:29,320 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:45:30,519 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 155 for LOIs [2024-11-09 04:45:31,132 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 04:45:51,369 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2175#(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_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~data#1| 1))' at error location [2024-11-09 04:45:51,369 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 04:45:51,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 04:45:51,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2024-11-09 04:45:51,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765443313] [2024-11-09 04:45:51,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 04:45:51,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 04:45:51,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:45:51,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 04:45:51,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=360, Unknown=4, NotChecked=0, Total=420 [2024-11-09 04:45:51,371 INFO L87 Difference]: Start difference. First operand 118 states and 129 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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-09 04:45:51,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:45:51,569 INFO L93 Difference]: Finished difference Result 118 states and 128 transitions. [2024-11-09 04:45:51,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 04:45:51,569 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 24 [2024-11-09 04:45:51,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:45:51,570 INFO L225 Difference]: With dead ends: 118 [2024-11-09 04:45:51,570 INFO L226 Difference]: Without dead ends: 118 [2024-11-09 04:45:51,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 20.3s TimeCoverageRelationStatistics Valid=56, Invalid=360, Unknown=4, NotChecked=0, Total=420 [2024-11-09 04:45:51,571 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 1 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 04:45:51,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 501 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 04:45:51,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-09 04:45:51,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-09 04:45:51,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 61 states have (on average 1.9672131147540983) internal successors, (120), 112 states have internal predecessors, (120), 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-09 04:45:51,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 128 transitions. [2024-11-09 04:45:51,579 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 128 transitions. Word has length 24 [2024-11-09 04:45:51,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:45:51,580 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 128 transitions. [2024-11-09 04:45:51,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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-09 04:45:51,580 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 128 transitions. [2024-11-09 04:45:51,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 04:45:51,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:45:51,581 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-09 04:45:51,601 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 04:45:51,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-09 04:45:51,785 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-09 04:45:51,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:45:51,786 INFO L85 PathProgramCache]: Analyzing trace with hash 2026580567, now seen corresponding path program 1 times [2024-11-09 04:45:51,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:45:51,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910411142] [2024-11-09 04:45:51,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:45:51,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:45:51,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:45:51,930 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-09 04:45:51,930 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:45:51,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910411142] [2024-11-09 04:45:51,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910411142] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:45:51,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019854543] [2024-11-09 04:45:51,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:45:51,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:45:51,932 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:45:51,934 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:45:51,936 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 04:45:52,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:45:52,071 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 04:45:52,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:45:52,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 04:45:52,228 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-09 04:45:52,306 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 04:45:52,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-09 04:45:52,337 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-09 04:45:52,337 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:45:52,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019854543] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:45:52,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1992686093] [2024-11-09 04:45:52,475 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2024-11-09 04:45:52,475 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:45:52,475 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:45:52,475 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:45:52,476 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:45:53,394 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 155 for LOIs [2024-11-09 04:45:53,808 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 04:46:15,948 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2533#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (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_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~data#1| 1))' at error location [2024-11-09 04:46:15,948 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 04:46:15,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 04:46:15,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7] total 9 [2024-11-09 04:46:15,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374003921] [2024-11-09 04:46:15,949 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 04:46:15,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 04:46:15,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:46:15,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 04:46:15,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=570, Unknown=6, NotChecked=48, Total=702 [2024-11-09 04:46:15,951 INFO L87 Difference]: Start difference. First operand 118 states and 128 transitions. Second operand has 10 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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-09 04:46:16,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:46:16,920 INFO L93 Difference]: Finished difference Result 117 states and 127 transitions. [2024-11-09 04:46:16,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 04:46:16,920 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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 25 [2024-11-09 04:46:16,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:46:16,921 INFO L225 Difference]: With dead ends: 117 [2024-11-09 04:46:16,921 INFO L226 Difference]: Without dead ends: 117 [2024-11-09 04:46:16,922 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 22.5s TimeCoverageRelationStatistics Valid=95, Invalid=715, Unknown=6, NotChecked=54, Total=870 [2024-11-09 04:46:16,923 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 9 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 04:46:16,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 508 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 417 Invalid, 0 Unknown, 122 Unchecked, 0.8s Time] [2024-11-09 04:46:16,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-09 04:46:16,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-11-09 04:46:16,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 61 states have (on average 1.9508196721311475) internal successors, (119), 111 states have internal predecessors, (119), 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-09 04:46:16,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 127 transitions. [2024-11-09 04:46:16,930 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 127 transitions. Word has length 25 [2024-11-09 04:46:16,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:46:16,931 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 127 transitions. [2024-11-09 04:46:16,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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-09 04:46:16,931 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 127 transitions. [2024-11-09 04:46:16,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 04:46:16,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:46:16,932 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-09 04:46:16,958 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 04:46:17,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-09 04:46:17,137 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-09 04:46:17,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:46:17,138 INFO L85 PathProgramCache]: Analyzing trace with hash 2026580568, now seen corresponding path program 1 times [2024-11-09 04:46:17,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:46:17,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660892435] [2024-11-09 04:46:17,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:46:17,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:46:17,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:46:17,567 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-09 04:46:17,568 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:46:17,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660892435] [2024-11-09 04:46:17,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660892435] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:46:17,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467544555] [2024-11-09 04:46:17,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:46:17,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:46:17,569 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:46:17,571 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:46:17,573 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 04:46:17,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:46:17,713 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 04:46:17,715 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:46:17,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 04:46:17,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 04:46:18,034 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-09 04:46:18,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:46:18,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 04:46:18,103 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 04:46:18,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 04:46:18,187 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-09 04:46:18,188 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:46:18,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467544555] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:46:18,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [512287333] [2024-11-09 04:46:18,516 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2024-11-09 04:46:18,517 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:46:18,518 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:46:18,518 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:46:18,518 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:46:19,632 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 155 for LOIs [2024-11-09 04:46:20,230 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 04:46:38,211 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2902#(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_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~data#1| 1))' at error location [2024-11-09 04:46:38,211 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 04:46:38,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 04:46:38,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2024-11-09 04:46:38,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082802096] [2024-11-09 04:46:38,212 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 04:46:38,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 04:46:38,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:46:38,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 04:46:38,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=887, Unknown=3, NotChecked=60, Total=1056 [2024-11-09 04:46:38,215 INFO L87 Difference]: Start difference. First operand 117 states and 127 transitions. Second operand has 15 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 04:46:39,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:46:39,615 INFO L93 Difference]: Finished difference Result 136 states and 151 transitions. [2024-11-09 04:46:39,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 04:46:39,616 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 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 25 [2024-11-09 04:46:39,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:46:39,618 INFO L225 Difference]: With dead ends: 136 [2024-11-09 04:46:39,618 INFO L226 Difference]: Without dead ends: 136 [2024-11-09 04:46:39,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 18.7s TimeCoverageRelationStatistics Valid=137, Invalid=1124, Unknown=3, NotChecked=68, Total=1332 [2024-11-09 04:46:39,620 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 26 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 146 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:46:39,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 609 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 458 Invalid, 0 Unknown, 146 Unchecked, 1.1s Time] [2024-11-09 04:46:39,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-09 04:46:39,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 128. [2024-11-09 04:46:39,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 71 states have (on average 1.8873239436619718) internal successors, (134), 121 states have internal predecessors, (134), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 04:46:39,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 144 transitions. [2024-11-09 04:46:39,628 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 144 transitions. Word has length 25 [2024-11-09 04:46:39,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:46:39,629 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 144 transitions. [2024-11-09 04:46:39,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 04:46:39,629 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 144 transitions. [2024-11-09 04:46:39,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 04:46:39,630 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:46:39,630 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] [2024-11-09 04:46:39,657 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 04:46:39,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-09 04:46:39,831 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-09 04:46:39,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:46:39,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1600511858, now seen corresponding path program 1 times [2024-11-09 04:46:39,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:46:39,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788907004] [2024-11-09 04:46:39,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:46:39,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:46:39,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:46:40,101 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-09 04:46:40,101 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:46:40,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788907004] [2024-11-09 04:46:40,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788907004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:46:40,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:46:40,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 04:46:40,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300815555] [2024-11-09 04:46:40,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:46:40,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 04:46:40,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:46:40,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 04:46:40,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 04:46:40,107 INFO L87 Difference]: Start difference. First operand 128 states and 144 transitions. Second operand has 7 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 04:46:40,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:46:40,858 INFO L93 Difference]: Finished difference Result 127 states and 143 transitions. [2024-11-09 04:46:40,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 04:46:40,858 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2024-11-09 04:46:40,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:46:40,859 INFO L225 Difference]: With dead ends: 127 [2024-11-09 04:46:40,859 INFO L226 Difference]: Without dead ends: 127 [2024-11-09 04:46:40,860 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-09 04:46:40,861 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 7 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 04:46:40,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 385 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 04:46:40,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-09 04:46:40,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-11-09 04:46:40,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 71 states have (on average 1.8732394366197183) internal successors, (133), 120 states have internal predecessors, (133), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 04:46:40,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 143 transitions. [2024-11-09 04:46:40,868 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 143 transitions. Word has length 26 [2024-11-09 04:46:40,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:46:40,869 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 143 transitions. [2024-11-09 04:46:40,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 04:46:40,869 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 143 transitions. [2024-11-09 04:46:40,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 04:46:40,870 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:46:40,870 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] [2024-11-09 04:46:40,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 04:46:40,871 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-09 04:46:40,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:46:40,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1600511857, now seen corresponding path program 1 times [2024-11-09 04:46:40,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:46:40,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083886404] [2024-11-09 04:46:40,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:46:40,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:46:40,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:46:41,326 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-09 04:46:41,326 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:46:41,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083886404] [2024-11-09 04:46:41,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083886404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:46:41,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:46:41,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 04:46:41,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261572089] [2024-11-09 04:46:41,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:46:41,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 04:46:41,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:46:41,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 04:46:41,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 04:46:41,330 INFO L87 Difference]: Start difference. First operand 127 states and 143 transitions. Second operand has 7 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 04:46:42,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:46:42,047 INFO L93 Difference]: Finished difference Result 126 states and 142 transitions. [2024-11-09 04:46:42,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 04:46:42,048 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.4) internal successors, (22), 6 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 26 [2024-11-09 04:46:42,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:46:42,049 INFO L225 Difference]: With dead ends: 126 [2024-11-09 04:46:42,049 INFO L226 Difference]: Without dead ends: 126 [2024-11-09 04:46:42,049 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-09 04:46:42,050 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 6 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 04:46:42,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 445 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 04:46:42,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-09 04:46:42,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-09 04:46:42,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 71 states have (on average 1.8591549295774648) internal successors, (132), 119 states have internal predecessors, (132), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 04:46:42,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 142 transitions. [2024-11-09 04:46:42,057 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 142 transitions. Word has length 26 [2024-11-09 04:46:42,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:46:42,057 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 142 transitions. [2024-11-09 04:46:42,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 04:46:42,058 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 142 transitions. [2024-11-09 04:46:42,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 04:46:42,059 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:46:42,059 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:46:42,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 04:46:42,060 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-09 04:46:42,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:46:42,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1209140843, now seen corresponding path program 1 times [2024-11-09 04:46:42,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:46:42,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521487941] [2024-11-09 04:46:42,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:46:42,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:46:42,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:46:43,099 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 04:46:43,099 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:46:43,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521487941] [2024-11-09 04:46:43,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521487941] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:46:43,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20703424] [2024-11-09 04:46:43,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:46:43,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:46:43,100 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:46:43,102 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:46:43,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 04:46:43,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:46:43,294 INFO L255 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 04:46:43,297 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:46:43,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 04:46:43,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 04:46:43,348 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2024-11-09 04:46:43,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:46:43,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 04:46:43,470 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-09 04:46:43,530 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 04:46:43,530 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-09 04:46:43,714 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 04:46:43,715 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-09 04:46:43,778 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 10 not checked. [2024-11-09 04:46:43,779 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:46:44,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20703424] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:46:44,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [346087135] [2024-11-09 04:46:44,653 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2024-11-09 04:46:44,653 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:46:44,654 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:46:44,654 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:46:44,654 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:46:45,737 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-09 04:46:45,766 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 04:46:59,585 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3913#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_append_~data#1| 1) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_22| Int)) (and (or (and (exists ((|v_#length_159| (Array Int Int))) (= (store |v_#length_159| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 12) |#length|)) (exists ((|v_#memory_$Pointer$.offset_207| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_207| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_207| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8))))) (exists ((|v_#memory_int_187| (Array Int (Array Int Int))) (|v_#memory_int_188| (Array Int (Array Int Int))) (|v_#memory_int_189| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_187| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_187| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 (select (select |v_#memory_int_188| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))) |v_#memory_int_188|) (= (store |v_#memory_int_188| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_188| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_189| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4))) |v_#memory_int_189|) (= |#memory_int| (store |v_#memory_int_189| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_189| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8 1))))) (exists ((|v_#valid_191| (Array Int Int))) (and (= (select |v_#valid_191| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (store |v_#valid_191| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 1) |#valid|))) (<= (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_int_193| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_44| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_44| (Array Int Int)) (|v_#memory_$Pointer$.base_213| (Array Int (Array Int Int))) (|v_#length_BEFORE_CALL_76| (Array Int Int)) (|v_#memory_int_BEFORE_CALL_72| (Array Int (Array Int Int))) (|v_#memory_int_194| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_213| (Array Int (Array Int Int)))) (and (= (select |v_old(#valid)_AFTER_CALL_44| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (= (store |v_#memory_int_193| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_int_193| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_#memory_int_194| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0))) |v_#memory_int_194|) (<= 8 (select |v_#length_BEFORE_CALL_76| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= (store |v_#memory_int_194| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_194| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_#memory_int_BEFORE_CALL_72| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) |v_#memory_int_BEFORE_CALL_72|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| (store (store |v_#memory_$Pointer$.base_213| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_213| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.base_213| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_213| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= (select (select (store (store |v_#memory_$Pointer$.offset_213| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_213| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.offset_213| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_213| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_44| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 1) (<= 4 (select |v_#length_BEFORE_CALL_76| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))))) (exists ((|v_#memory_$Pointer$.base_207| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_207| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_207| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8))) |#memory_$Pointer$.base|)) (not (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 0)) (= |v_ULTIMATE.start_dll_circular_append_~head#1.base_22| |ULTIMATE.start_main_~#s~0#1.base|)) (and (exists ((|v_#length_159| (Array Int Int))) (= (store |v_#length_159| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 12) |#length|)) (exists ((|v_#memory_int_193| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_45| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#memory_int_BEFORE_CALL_74| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_45| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_213| (Array Int (Array Int Int))) (|v_#memory_int_194| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_213| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_193| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_int_193| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_#memory_int_194| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0))) |v_#memory_int_194|) (= (select (select (store (store |v_#memory_$Pointer$.offset_213| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_213| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.offset_213| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_213| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (store |v_#memory_int_194| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_194| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_#memory_int_BEFORE_CALL_74| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) |v_#memory_int_BEFORE_CALL_74|) (<= 8 (select |v_old(#length)_AFTER_CALL_45| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= (select |v_old(#valid)_AFTER_CALL_45| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (= (select |v_old(#valid)_AFTER_CALL_45| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 1) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| (store (store |v_#memory_$Pointer$.base_213| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_213| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.base_213| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_213| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (<= 4 (select |v_old(#length)_AFTER_CALL_45| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))))) (exists ((|v_#memory_$Pointer$.offset_207| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_207| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_207| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8))))) (exists ((|v_#memory_int_187| (Array Int (Array Int Int))) (|v_#memory_int_188| (Array Int (Array Int Int))) (|v_#memory_int_189| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_187| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_187| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 (select (select |v_#memory_int_188| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))) |v_#memory_int_188|) (= (store |v_#memory_int_188| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_188| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_189| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4))) |v_#memory_int_189|) (= |#memory_int| (store |v_#memory_int_189| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_189| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8 1))))) (exists ((|v_#valid_191| (Array Int Int))) (and (= (select |v_#valid_191| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (store |v_#valid_191| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 1) |#valid|))) (<= (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_207| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_207| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_207| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8))) |#memory_$Pointer$.base|)) (not (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 0)) (= |v_ULTIMATE.start_dll_circular_append_~head#1.base_22| |ULTIMATE.start_main_~#s~0#1.base|))) (not (= (select |#valid| |v_ULTIMATE.start_dll_circular_append_~head#1.base_22|) 1)))) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_append_~head#1.offset| 0))' at error location [2024-11-09 04:46:59,586 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 04:46:59,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 04:46:59,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 13 [2024-11-09 04:46:59,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544774005] [2024-11-09 04:46:59,586 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 04:46:59,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 04:46:59,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:46:59,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 04:46:59,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1080, Unknown=4, NotChecked=134, Total=1332 [2024-11-09 04:46:59,589 INFO L87 Difference]: Start difference. First operand 126 states and 142 transitions. Second operand has 15 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 13 states have internal predecessors, (42), 3 states have call successors, (4), 1 states have call predecessors, (4), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 04:47:00,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:47:00,941 INFO L93 Difference]: Finished difference Result 136 states and 154 transitions. [2024-11-09 04:47:00,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 04:47:00,942 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 13 states have internal predecessors, (42), 3 states have call successors, (4), 1 states have call predecessors, (4), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 35 [2024-11-09 04:47:00,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:47:00,944 INFO L225 Difference]: With dead ends: 136 [2024-11-09 04:47:00,944 INFO L226 Difference]: Without dead ends: 136 [2024-11-09 04:47:00,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 70 SyntacticMatches, 7 SemanticMatches, 38 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=137, Invalid=1273, Unknown=4, NotChecked=146, Total=1560 [2024-11-09 04:47:00,946 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 191 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 248 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 04:47:00,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 271 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 371 Invalid, 0 Unknown, 248 Unchecked, 1.0s Time] [2024-11-09 04:47:00,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-09 04:47:00,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 118. [2024-11-09 04:47:00,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 71 states have (on average 1.7464788732394365) internal successors, (124), 111 states have internal predecessors, (124), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 04:47:00,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 134 transitions. [2024-11-09 04:47:00,952 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 134 transitions. Word has length 35 [2024-11-09 04:47:00,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:47:00,952 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 134 transitions. [2024-11-09 04:47:00,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 13 states have internal predecessors, (42), 3 states have call successors, (4), 1 states have call predecessors, (4), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 04:47:00,952 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 134 transitions. [2024-11-09 04:47:00,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 04:47:00,953 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:47:00,953 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:47:00,980 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 04:47:01,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-09 04:47:01,155 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-09 04:47:01,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:47:01,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1209140844, now seen corresponding path program 1 times [2024-11-09 04:47:01,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:47:01,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143840896] [2024-11-09 04:47:01,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:47:01,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:47:01,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:47:02,306 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 04:47:02,307 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:47:02,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143840896] [2024-11-09 04:47:02,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143840896] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:47:02,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411801398] [2024-11-09 04:47:02,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:47:02,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:47:02,307 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:47:02,308 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:47:02,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 04:47:02,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:47:02,529 INFO L255 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 04:47:02,533 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:47:02,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 04:47:02,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 04:47:02,639 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2024-11-09 04:47:02,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:47:02,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 04:47:02,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 04:47:02,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:47:02,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 04:47:03,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 04:47:03,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:47:03,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 04:47:03,224 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-09 04:47:03,225 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:47:03,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411801398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:47:03,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 04:47:03,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2024-11-09 04:47:03,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92609304] [2024-11-09 04:47:03,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:47:03,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 04:47:03,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:47:03,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 04:47:03,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=171, Unknown=1, NotChecked=26, Total=240 [2024-11-09 04:47:03,227 INFO L87 Difference]: Start difference. First operand 118 states and 134 transitions. Second operand has 7 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 04:47:03,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:47:03,748 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2024-11-09 04:47:03,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 04:47:03,749 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2024-11-09 04:47:03,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:47:03,750 INFO L225 Difference]: With dead ends: 113 [2024-11-09 04:47:03,751 INFO L226 Difference]: Without dead ends: 113 [2024-11-09 04:47:03,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=196, Unknown=1, NotChecked=28, Total=272 [2024-11-09 04:47:03,752 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 28 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 130 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 04:47:03,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 250 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 191 Invalid, 0 Unknown, 130 Unchecked, 0.5s Time] [2024-11-09 04:47:03,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-09 04:47:03,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-09 04:47:03,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 71 states have (on average 1.676056338028169) internal successors, (119), 106 states have internal predecessors, (119), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 04:47:03,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 129 transitions. [2024-11-09 04:47:03,758 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 129 transitions. Word has length 35 [2024-11-09 04:47:03,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:47:03,758 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 129 transitions. [2024-11-09 04:47:03,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 04:47:03,759 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 129 transitions. [2024-11-09 04:47:03,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 04:47:03,760 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:47:03,760 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:47:03,782 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-09 04:47:03,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-09 04:47:03,961 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-09 04:47:03,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:47:03,961 INFO L85 PathProgramCache]: Analyzing trace with hash 126455471, now seen corresponding path program 1 times [2024-11-09 04:47:03,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:47:03,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351932126] [2024-11-09 04:47:03,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:47:03,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:47:04,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:47:04,224 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 04:47:04,225 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:47:04,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351932126] [2024-11-09 04:47:04,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351932126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:47:04,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:47:04,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 04:47:04,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635351345] [2024-11-09 04:47:04,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:47:04,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 04:47:04,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:47:04,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 04:47:04,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 04:47:04,227 INFO L87 Difference]: Start difference. First operand 113 states and 129 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 04:47:04,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:47:04,337 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2024-11-09 04:47:04,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 04:47:04,338 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), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2024-11-09 04:47:04,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:47:04,339 INFO L225 Difference]: With dead ends: 93 [2024-11-09 04:47:04,339 INFO L226 Difference]: Without dead ends: 93 [2024-11-09 04:47:04,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 04:47:04,340 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 0 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:47:04,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 04:47:04,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-09 04:47:04,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-09 04:47:04,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 56 states have (on average 1.6785714285714286) internal successors, (94), 88 states have internal predecessors, (94), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 04:47:04,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2024-11-09 04:47:04,347 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 36 [2024-11-09 04:47:04,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:47:04,348 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2024-11-09 04:47:04,348 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), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 04:47:04,348 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2024-11-09 04:47:04,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 04:47:04,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:47:04,349 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:47:04,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 04:47:04,350 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-09 04:47:04,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:47:04,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1951786516, now seen corresponding path program 1 times [2024-11-09 04:47:04,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:47:04,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498566449] [2024-11-09 04:47:04,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:47:04,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:47:04,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:47:04,582 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 04:47:04,582 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:47:04,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498566449] [2024-11-09 04:47:04,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498566449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:47:04,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:47:04,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 04:47:04,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51668166] [2024-11-09 04:47:04,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:47:04,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 04:47:04,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:47:04,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 04:47:04,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:47:04,585 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand has 6 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 04:47:05,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:47:05,164 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2024-11-09 04:47:05,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 04:47:05,165 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2024-11-09 04:47:05,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:47:05,166 INFO L225 Difference]: With dead ends: 89 [2024-11-09 04:47:05,166 INFO L226 Difference]: Without dead ends: 89 [2024-11-09 04:47:05,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:47:05,167 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 17 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 04:47:05,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 242 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 04:47:05,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-09 04:47:05,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-09 04:47:05,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 56 states have (on average 1.6071428571428572) internal successors, (90), 84 states have internal predecessors, (90), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 04:47:05,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2024-11-09 04:47:05,172 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 37 [2024-11-09 04:47:05,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:47:05,172 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2024-11-09 04:47:05,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 04:47:05,173 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2024-11-09 04:47:05,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 04:47:05,174 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:47:05,174 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:47:05,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 04:47:05,174 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-09 04:47:05,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:47:05,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1951786515, now seen corresponding path program 1 times [2024-11-09 04:47:05,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:47:05,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275797507] [2024-11-09 04:47:05,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:47:05,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:47:05,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:47:05,588 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 04:47:05,588 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:47:05,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275797507] [2024-11-09 04:47:05,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275797507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:47:05,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:47:05,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 04:47:05,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973273109] [2024-11-09 04:47:05,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:47:05,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 04:47:05,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:47:05,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 04:47:05,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:47:05,591 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand has 6 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 04:47:06,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:47:06,191 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2024-11-09 04:47:06,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 04:47:06,192 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2024-11-09 04:47:06,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:47:06,193 INFO L225 Difference]: With dead ends: 85 [2024-11-09 04:47:06,194 INFO L226 Difference]: Without dead ends: 85 [2024-11-09 04:47:06,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:47:06,195 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 16 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 04:47:06,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 254 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 04:47:06,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-09 04:47:06,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-09 04:47:06,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 56 states have (on average 1.5357142857142858) internal successors, (86), 80 states have internal predecessors, (86), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 04:47:06,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2024-11-09 04:47:06,199 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 37 [2024-11-09 04:47:06,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:47:06,200 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2024-11-09 04:47:06,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 04:47:06,200 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2024-11-09 04:47:06,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 04:47:06,201 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:47:06,201 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:47:06,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 04:47:06,201 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-09 04:47:06,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:47:06,202 INFO L85 PathProgramCache]: Analyzing trace with hash -375828907, now seen corresponding path program 1 times [2024-11-09 04:47:06,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:47:06,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029156295] [2024-11-09 04:47:06,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:47:06,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:47:06,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:47:07,520 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 04:47:07,521 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:47:07,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029156295] [2024-11-09 04:47:07,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029156295] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:47:07,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284295009] [2024-11-09 04:47:07,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:47:07,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:47:07,521 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:47:07,522 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:47:07,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 04:47:08,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:47:08,080 INFO L255 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-09 04:47:08,083 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:47:08,620 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 9 treesize of output 5 [2024-11-09 04:47:08,918 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_79| Int)) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_79| (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_79|))) (<= (+ |v_node_create_~temp~0#1.base_79| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |v_node_create_~temp~0#1.base_79| (select |c_#valid| |v_node_create_~temp~0#1.base_79|))) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_79|) 0))) is different from true [2024-11-09 04:47:08,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:47:08,939 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-09 04:47:08,990 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-11-09 04:47:08,991 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 23 treesize of output 24 [2024-11-09 04:47:09,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 04:47:09,112 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2024-11-09 04:47:09,113 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:47:09,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284295009] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:47:09,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1324980068] [2024-11-09 04:47:09,397 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2024-11-09 04:47:09,397 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:47:09,397 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:47:09,398 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:47:09,398 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:47:10,763 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-09 04:47:10,793 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 04:47:44,659 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5243#(and (= |ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0)) (<= 1 |#StackHeapBarrier|) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0)) 1)) (<= 2 |ULTIMATE.start_dll_circular_append_~head#1.base|) (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_circular_append_~head#1.base|) 1) (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0) 0)) (not (= 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0)))) (= |ULTIMATE.start_dll_circular_append_~data#1| 1) (<= 4 (select |#length| |ULTIMATE.start_dll_circular_append_~head#1.base|)) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (or (and (= |ULTIMATE.start_dll_circular_append_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.offset_225| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_225| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_225| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8))))) (exists ((|v_#memory_$Pointer$.base_230| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_230| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_230| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8))) |#memory_$Pointer$.base|)) (exists ((|v_#length_170| (Array Int Int))) (= |#length| (store |v_#length_170| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 12))) (<= (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 0)) (exists ((|v_#memory_int_206| (Array Int (Array Int Int))) (|v_#memory_int_207| (Array Int (Array Int Int))) (|v_#memory_int_205| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_206| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_206| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_207| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4))) |v_#memory_int_207|) (= |#memory_int| (store |v_#memory_int_207| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_207| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8 1))) (= (store |v_#memory_int_205| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_205| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 (select (select |v_#memory_int_206| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))) |v_#memory_int_206|))) (exists ((|v_old(#length)_AFTER_CALL_59| (Array Int Int)) (|v_#memory_int_BEFORE_CALL_93| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_59| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_59| (Array Int Int)) (|v_#memory_$Pointer$.base_236| (Array Int (Array Int Int))) (|v_#memory_int_211| (Array Int (Array Int Int))) (|v_#memory_int_212| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_231| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_211| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_59| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_59| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_int_211| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_59| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_59| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_#memory_int_212| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_59| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_59| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0))) |v_#memory_int_212|) (= (select (select (store (store |v_#memory_$Pointer$.offset_231| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_59| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_59| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_231| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_59| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_59| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_59| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.offset_231| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_59| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_59| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_231| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_59| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_59| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_59| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_59| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_59| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_59| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 1) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_59| (store (store |v_#memory_$Pointer$.base_236| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_59| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_59| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_236| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_59| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_59| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_59| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_59| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.base_236| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_59| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_59| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_236| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_59| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_59| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_59| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_59| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_59| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_59| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= (select |v_old(#valid)_AFTER_CALL_59| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_59| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (<= 4 (select |v_old(#length)_AFTER_CALL_59| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_59| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_59| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) (<= 8 (select |v_old(#length)_AFTER_CALL_59| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_59| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= (store |v_#memory_int_212| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_59| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_212| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_59| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_#memory_int_BEFORE_CALL_93| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_59| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) |v_#memory_int_BEFORE_CALL_93|))) (exists ((|v_#valid_201| (Array Int Int))) (and (= (store |v_#valid_201| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 1) |#valid|) (= (select |v_#valid_201| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))) (and (= |ULTIMATE.start_dll_circular_append_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.offset_225| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_225| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_225| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8))))) (exists ((|v_#memory_$Pointer$.base_230| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_230| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_230| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8))) |#memory_$Pointer$.base|)) (exists ((|v_#length_170| (Array Int Int))) (= |#length| (store |v_#length_170| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 12))) (<= (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 0)) (exists ((|v_#memory_int_206| (Array Int (Array Int Int))) (|v_#memory_int_207| (Array Int (Array Int Int))) (|v_#memory_int_205| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_206| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_206| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_207| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4))) |v_#memory_int_207|) (= |#memory_int| (store |v_#memory_int_207| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_207| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8 1))) (= (store |v_#memory_int_205| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_205| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 (select (select |v_#memory_int_206| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))) |v_#memory_int_206|))) (exists ((|v_#valid_201| (Array Int Int))) (and (= (store |v_#valid_201| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 1) |#valid|) (= (select |v_#valid_201| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))) (exists ((|v_old(#memory_int)_AFTER_CALL_58| (Array Int (Array Int Int))) (|v_#length_BEFORE_CALL_101| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_58| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_58| (Array Int Int)) (|v_#memory_$Pointer$.base_236| (Array Int (Array Int Int))) (|v_#memory_int_211| (Array Int (Array Int Int))) (|v_#memory_int_212| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_231| (Array Int (Array Int Int)))) (and (= |v_old(#memory_int)_AFTER_CALL_58| (store |v_#memory_int_212| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_58| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_212| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_58| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_int)_AFTER_CALL_58| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_58| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= (select |v_old(#valid)_AFTER_CALL_58| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_58| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_58| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 1) (= (select (select (store (store |v_#memory_$Pointer$.offset_231| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_58| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_58| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_231| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_58| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_58| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_58| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.offset_231| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_58| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_58| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_231| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_58| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_58| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_58| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_58| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_58| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (<= 4 (select |v_#length_BEFORE_CALL_101| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_58| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_58| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) (= (store (store |v_#memory_$Pointer$.base_236| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_58| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_58| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_236| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_58| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_58| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_58| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_58| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.base_236| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_58| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_58| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_236| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_58| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_58| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_58| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_58| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_58| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_58| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_58|) (= |v_#memory_int_212| (store |v_#memory_int_211| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_58| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_58| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_int_211| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_58| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_58| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_#memory_int_212| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_58| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_58| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0)))) (<= 8 (select |v_#length_BEFORE_CALL_101| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_58| |ULTIMATE.start_main_~#s~0#1.base|) 0))))))) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_append_~head#1.offset| 0))' at error location [2024-11-09 04:47:44,659 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 04:47:44,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 04:47:44,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2024-11-09 04:47:44,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628437499] [2024-11-09 04:47:44,660 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 04:47:44,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 04:47:44,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:47:44,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 04:47:44,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2008, Unknown=8, NotChecked=90, Total=2256 [2024-11-09 04:47:44,662 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand has 24 states, 17 states have (on average 3.411764705882353) internal successors, (58), 21 states have internal predecessors, (58), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 04:47:47,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:47:47,843 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2024-11-09 04:47:47,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 04:47:47,844 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 17 states have (on average 3.411764705882353) internal successors, (58), 21 states have internal predecessors, (58), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 38 [2024-11-09 04:47:47,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:47:47,845 INFO L225 Difference]: With dead ends: 84 [2024-11-09 04:47:47,845 INFO L226 Difference]: Without dead ends: 84 [2024-11-09 04:47:47,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 733 ImplicationChecksByTransitivity, 36.2s TimeCoverageRelationStatistics Valid=209, Invalid=2757, Unknown=8, NotChecked=106, Total=3080 [2024-11-09 04:47:47,847 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 75 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:47:47,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 663 Invalid, 958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 860 Invalid, 0 Unknown, 90 Unchecked, 2.1s Time] [2024-11-09 04:47:47,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-09 04:47:47,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-09 04:47:47,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 56 states have (on average 1.5178571428571428) internal successors, (85), 79 states have internal predecessors, (85), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 04:47:47,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2024-11-09 04:47:47,852 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 38 [2024-11-09 04:47:47,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:47:47,853 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2024-11-09 04:47:47,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 17 states have (on average 3.411764705882353) internal successors, (58), 21 states have internal predecessors, (58), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 04:47:47,853 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2024-11-09 04:47:47,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 04:47:47,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:47:47,854 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:47:47,874 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 04:47:48,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:47:48,055 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-09 04:47:48,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:47:48,056 INFO L85 PathProgramCache]: Analyzing trace with hash -375828906, now seen corresponding path program 1 times [2024-11-09 04:47:48,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:47:48,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901270243] [2024-11-09 04:47:48,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:47:48,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:47:48,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:47:50,699 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 04:47:50,699 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:47:50,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901270243] [2024-11-09 04:47:50,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901270243] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:47:50,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708659503] [2024-11-09 04:47:50,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:47:50,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:47:50,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:47:50,701 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:47:50,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 04:47:51,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:47:51,308 INFO L255 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-09 04:47:51,312 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:47:51,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 04:47:52,231 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 9 treesize of output 5 [2024-11-09 04:47:52,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 04:48:04,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:48:04,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 04:48:04,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:48:04,115 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-09 04:48:04,202 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-09 04:48:04,202 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 18 treesize of output 21 [2024-11-09 04:48:06,848 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 48 treesize of output 32 [2024-11-09 04:48:06,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 04:48:06,905 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 04:48:06,905 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:48:50,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708659503] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:48:50,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [612144885] [2024-11-09 04:48:50,925 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2024-11-09 04:48:50,925 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:48:50,926 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:48:50,926 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:48:50,926 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:48:52,351 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-09 04:48:52,404 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 04:50:05,300 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5611#(and (<= 1 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_dll_circular_append_~head#1.base|) (or (< (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0) 4) 0) (< (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0) 8))) (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 0) (or (and (exists ((|v_#memory_int_229| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_70| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_70| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_259| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_254| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_70| (Array Int Int)) (|v_old(#length)_AFTER_CALL_70| (Array Int Int)) (|v_#memory_int_230| (Array Int (Array Int Int)))) (and (= |v_old(#memory_int)_AFTER_CALL_70| (store |v_#memory_int_230| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_70| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_230| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_70| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_int)_AFTER_CALL_70| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_70| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= (select |v_old(#valid)_AFTER_CALL_70| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_70| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (= (select |v_old(#valid)_AFTER_CALL_70| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_70| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_70| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 1) (= (select (select (store (store |v_#memory_$Pointer$.offset_254| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_70| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_70| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_254| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_70| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_70| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_70| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.offset_254| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_70| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_70| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_254| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_70| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_70| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_70| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 8 (select |v_old(#length)_AFTER_CALL_70| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_70| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (<= 4 (select |v_old(#length)_AFTER_CALL_70| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_70| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_70| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) (= |v_#memory_int_230| (store |v_#memory_int_229| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_70| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_70| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_int_229| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_70| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_70| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_#memory_int_230| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_70| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_70| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0)))) (= (store (store |v_#memory_$Pointer$.base_259| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_70| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_70| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_259| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_70| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_70| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_70| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_70| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.base_259| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_70| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_70| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_259| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_70| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_70| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_70| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_70| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_70| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_70| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_70|))) (= |ULTIMATE.start_dll_circular_append_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_int_224| (Array Int (Array Int Int))) (|v_#memory_int_225| (Array Int (Array Int Int))) (|v_#memory_int_223| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_224| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_224| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_225| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4))) |v_#memory_int_225|) (= |#memory_int| (store |v_#memory_int_225| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_225| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8 1))) (= (store |v_#memory_int_223| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_223| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 (select (select |v_#memory_int_224| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))) |v_#memory_int_224|))) (exists ((|v_#length_181| (Array Int Int))) (= (store |v_#length_181| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 12) |#length|)) (exists ((|v_#memory_$Pointer$.base_253| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_253| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_253| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8))) |#memory_$Pointer$.base|)) (exists ((|v_#memory_$Pointer$.offset_248| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_248| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_248| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8))))) (<= (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 0)) (exists ((|v_#valid_208| (Array Int Int))) (and (= (select |v_#valid_208| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= |#valid| (store |v_#valid_208| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 1))))) (and (= |ULTIMATE.start_dll_circular_append_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_int_224| (Array Int (Array Int Int))) (|v_#memory_int_225| (Array Int (Array Int Int))) (|v_#memory_int_223| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_224| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_224| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_225| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4))) |v_#memory_int_225|) (= |#memory_int| (store |v_#memory_int_225| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_225| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8 1))) (= (store |v_#memory_int_223| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_223| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 (select (select |v_#memory_int_224| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))) |v_#memory_int_224|))) (exists ((|v_#length_181| (Array Int Int))) (= (store |v_#length_181| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 12) |#length|)) (exists ((|v_#memory_$Pointer$.base_253| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_253| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_253| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8))) |#memory_$Pointer$.base|)) (exists ((|v_#memory_$Pointer$.offset_248| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_248| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_248| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8))))) (exists ((|v_old(#length)_AFTER_CALL_69| (Array Int Int)) (|v_#memory_int_229| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_69| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_69| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_69| (Array Int Int)) (|v_#memory_$Pointer$.base_259| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_254| (Array Int (Array Int Int))) (|v_#memory_int_230| (Array Int (Array Int Int)))) (and (= (select |v_old(#valid)_AFTER_CALL_69| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_69| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_69| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 1) (= |v_old(#memory_int)_AFTER_CALL_69| (store |v_#memory_int_230| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_69| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_230| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_69| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_int)_AFTER_CALL_69| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_69| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= (store |v_#memory_int_229| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_69| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_69| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_int_229| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_69| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_69| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_#memory_int_230| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_69| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_69| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0))) |v_#memory_int_230|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_69| (store (store |v_#memory_$Pointer$.base_259| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_69| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_69| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_259| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_69| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_69| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_69| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_69| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.base_259| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_69| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_69| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_259| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_69| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_69| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_69| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_69| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_69| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_69| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (<= 8 (select |v_old(#length)_AFTER_CALL_69| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_69| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (<= 4 (select |v_old(#length)_AFTER_CALL_69| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_69| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_69| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) (= (select |v_old(#valid)_AFTER_CALL_69| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_69| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (= (select (select (store (store |v_#memory_$Pointer$.offset_254| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_69| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_69| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_254| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_69| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_69| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_69| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.offset_254| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_69| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_69| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_254| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_69| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_69| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_69| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) (<= (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 0)) (exists ((|v_#valid_208| (Array Int Int))) (and (= (select |v_#valid_208| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= |#valid| (store |v_#valid_208| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 1)))))) (= (select |#valid| |ULTIMATE.start_dll_circular_append_~head#1.base|) 1) (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0) 0)) (not (= 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0)))) (= |ULTIMATE.start_dll_circular_append_~data#1| 1) (<= 4 (select |#length| |ULTIMATE.start_dll_circular_append_~head#1.base|)) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_append_~head#1.offset| 0))' at error location [2024-11-09 04:50:05,300 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 04:50:05,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 04:50:05,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 28 [2024-11-09 04:50:05,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995961918] [2024-11-09 04:50:05,301 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 04:50:05,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-09 04:50:05,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:50:05,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-09 04:50:05,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=2731, Unknown=56, NotChecked=0, Total=2970 [2024-11-09 04:50:05,304 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand has 29 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 25 states have internal predecessors, (58), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 04:50:15,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:50:21,807 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-09 04:50:25,589 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-09 04:50:28,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:50:32,904 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-09 04:50:42,905 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-09 04:50:49,562 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-09 04:50:51,700 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-09 04:50:54,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:50:56,318 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-09 04:51:03,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:51:05,332 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-09 04:51:07,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:51:09,714 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-09 04:51:12,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:51:14,778 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-09 04:51:17,069 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-09 04:51:21,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:51:23,299 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-09 04:51:25,715 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-09 04:51:27,867 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-09 04:51:28,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:51:28,506 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2024-11-09 04:51:28,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 04:51:28,507 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 25 states have internal predecessors, (58), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 38 [2024-11-09 04:51:28,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:51:28,508 INFO L225 Difference]: With dead ends: 83 [2024-11-09 04:51:28,508 INFO L226 Difference]: Without dead ends: 83 [2024-11-09 04:51:28,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 163.3s TimeCoverageRelationStatistics Valid=270, Invalid=3819, Unknown=71, NotChecked=0, Total=4160 [2024-11-09 04:51:28,509 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 77 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 9 mSolverCounterUnsat, 21 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 50.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 21 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 51.6s IncrementalHoareTripleChecker+Time [2024-11-09 04:51:28,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 621 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 875 Invalid, 21 Unknown, 0 Unchecked, 51.6s Time] [2024-11-09 04:51:28,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-09 04:51:28,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-09 04:51:28,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 56 states have (on average 1.5) internal successors, (84), 78 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 04:51:28,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2024-11-09 04:51:28,513 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 38 [2024-11-09 04:51:28,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:51:28,514 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2024-11-09 04:51:28,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 25 states have internal predecessors, (58), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 04:51:28,514 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2024-11-09 04:51:28,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 04:51:28,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:51:28,515 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:51:28,543 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-09 04:51:28,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:51:28,716 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-09 04:51:28,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:51:28,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1234210582, now seen corresponding path program 1 times [2024-11-09 04:51:28,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:51:28,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466622898] [2024-11-09 04:51:28,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:51:28,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:51:28,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:51:35,160 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 04:51:35,160 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:51:35,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466622898] [2024-11-09 04:51:35,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466622898] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:51:35,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767851517] [2024-11-09 04:51:35,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:51:35,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:51:35,161 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:51:35,162 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:51:35,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 04:51:35,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:51:35,796 INFO L255 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-09 04:51:35,799 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:51:36,746 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 39 treesize of output 1 [2024-11-09 04:51:37,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:51:37,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 32 [2024-11-09 04:51:37,240 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 18 treesize of output 14 [2024-11-09 04:51:37,275 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 04:51:37,276 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 7 [2024-11-09 04:51:38,058 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_99| Int)) (and (= (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_99| (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_99|)) |c_#memory_$Pointer$.base|) (= |c_#valid| (store |c_old(#valid)| |v_node_create_~temp~0#1.base_99| (select |c_#valid| |v_node_create_~temp~0#1.base_99|))) (<= (+ |v_node_create_~temp~0#1.base_99| 1) |c_#StackHeapBarrier|) (= (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_99| (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_99|)) |c_#memory_$Pointer$.offset|) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_99|) 0))) is different from true [2024-11-09 04:51:38,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:51:38,180 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-09 04:51:38,180 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 37 treesize of output 36 [2024-11-09 04:51:38,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:51:38,211 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 28 treesize of output 23 [2024-11-09 04:51:38,497 INFO L349 Elim1Store]: treesize reduction 120, result has 31.4 percent of original size [2024-11-09 04:51:38,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 42 treesize of output 64 [2024-11-09 04:51:39,000 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 27 treesize of output 19 [2024-11-09 04:51:39,442 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:51:39,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2024-11-09 04:51:39,683 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 04:51:39,684 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:51:39,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767851517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:51:39,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 04:51:39,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [18] total 25 [2024-11-09 04:51:39,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774019612] [2024-11-09 04:51:39,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:51:39,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 04:51:39,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:51:39,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 04:51:39,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=537, Unknown=1, NotChecked=46, Total=650 [2024-11-09 04:51:39,686 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand has 12 states, 9 states have (on average 3.111111111111111) internal successors, (28), 11 states have internal predecessors, (28), 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-09 04:51:43,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:51:43,162 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2024-11-09 04:51:43,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 04:51:43,162 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 3.111111111111111) internal successors, (28), 11 states have internal predecessors, (28), 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 39 [2024-11-09 04:51:43,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:51:43,163 INFO L225 Difference]: With dead ends: 82 [2024-11-09 04:51:43,163 INFO L226 Difference]: Without dead ends: 82 [2024-11-09 04:51:43,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=80, Invalid=679, Unknown=1, NotChecked=52, Total=812 [2024-11-09 04:51:43,164 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 6 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-09 04:51:43,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 393 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 358 Invalid, 0 Unknown, 115 Unchecked, 2.8s Time] [2024-11-09 04:51:43,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-09 04:51:43,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-09 04:51:43,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 77 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 04:51:43,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2024-11-09 04:51:43,173 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 39 [2024-11-09 04:51:43,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:51:43,173 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2024-11-09 04:51:43,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 3.111111111111111) internal successors, (28), 11 states have internal predecessors, (28), 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-09 04:51:43,173 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2024-11-09 04:51:43,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 04:51:43,174 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:51:43,174 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:51:43,198 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-09 04:51:43,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:51:43,375 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-09 04:51:43,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:51:43,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1234210583, now seen corresponding path program 1 times [2024-11-09 04:51:43,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:51:43,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648007562] [2024-11-09 04:51:43,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:51:43,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:51:43,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:51:53,025 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:51:53,026 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:51:53,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648007562] [2024-11-09 04:51:53,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648007562] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:51:53,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295168570] [2024-11-09 04:51:53,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:51:53,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:51:53,027 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:51:53,028 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:51:53,042 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 04:51:53,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:51:53,695 INFO L255 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 104 conjuncts are in the unsatisfiable core [2024-11-09 04:51:53,700 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:51:54,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 04:51:54,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 04:51:57,606 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 04:51:57,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-09 04:51:57,906 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 04:51:57,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-09 04:52:00,466 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 27 treesize of output 1 [2024-11-09 04:52:00,543 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 19 treesize of output 11 [2024-11-09 04:52:01,170 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:52:01,170 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 30 [2024-11-09 04:52:01,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 04:52:01,252 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:52:01,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 04:52:02,787 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_102| Int)) (and (= (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_102| (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_102|)) |c_#memory_$Pointer$.base|) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_102|) 0) (= (store |c_old(#length)| |v_node_create_~temp~0#1.base_102| (select |c_#length| |v_node_create_~temp~0#1.base_102|)) |c_#length|) (<= (+ |v_node_create_~temp~0#1.base_102| 1) |c_#StackHeapBarrier|) (= (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_102| (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_102|)) |c_#memory_$Pointer$.offset|))) is different from true [2024-11-09 04:52:02,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:52:02,934 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-09 04:52:02,934 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 71 treesize of output 54 [2024-11-09 04:52:03,132 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-09 04:52:03,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-09 04:52:03,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:52:03,184 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 04:52:03,184 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 27 treesize of output 25 [2024-11-09 04:52:03,217 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2024-11-09 04:52:04,638 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:52:04,639 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 23 [2024-11-09 04:52:04,657 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:52:04,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 04:52:04,688 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-09 04:52:04,688 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:52:07,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295168570] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:52:07,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2064006866] [2024-11-09 04:52:07,746 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2024-11-09 04:52:07,746 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:52:07,747 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:52:07,747 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:52:07,747 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:52:09,392 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-09 04:52:09,462 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 04:53:18,753 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6310#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0) 4)) (or (< (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0) 4)) 0) (< (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0) 4))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0) 4)) 4))) (<= 1 |#StackHeapBarrier|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0)) 1) (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_circular_append_~head#1.base|) 1) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0))) (or (and (exists ((|v_#valid_220| (Array Int Int))) (and (= (store |v_#valid_220| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 1) |#valid|) (= (select |v_#valid_220| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))) (= |ULTIMATE.start_dll_circular_append_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_83| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#memory_int_247| (Array Int (Array Int Int))) (|v_#memory_int_248| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_281| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_83| (Array Int Int)) (|v_old(#memory_int)_AFTER_CALL_83| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_287| (Array Int (Array Int Int)))) (and (= (select |v_old(#valid)_AFTER_CALL_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (= (store (store |v_#memory_$Pointer$.base_287| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_287| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.base_287| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_287| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_83|) (= |v_old(#memory_int)_AFTER_CALL_83| (store |v_#memory_int_248| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_248| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_int)_AFTER_CALL_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= (store |v_#memory_int_247| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_int_247| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_#memory_int_248| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0))) |v_#memory_int_248|) (<= 4 (select |v_old(#length)_AFTER_CALL_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) (<= 8 (select |v_old(#length)_AFTER_CALL_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= (select (select (store (store |v_#memory_$Pointer$.offset_281| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_281| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.offset_281| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_281| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 1))) (exists ((|v_#memory_int_242| (Array Int (Array Int Int))) (|v_#memory_int_243| (Array Int (Array Int Int))) (|v_#memory_int_241| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_242| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_242| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_243| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4))) |v_#memory_int_243|) (= (store |v_#memory_int_243| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_243| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8 1)) |#memory_int|) (= (store |v_#memory_int_241| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_241| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 (select (select |v_#memory_int_242| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))) |v_#memory_int_242|))) (exists ((|v_#memory_$Pointer$.base_281| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_281| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_281| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8))) |#memory_$Pointer$.base|)) (exists ((|v_#memory_$Pointer$.offset_275| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_275| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_275| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8))))) (<= (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 0)) (exists ((|v_#length_193| (Array Int Int))) (= |#length| (store |v_#length_193| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 12)))) (and (exists ((|v_#valid_220| (Array Int Int))) (and (= (store |v_#valid_220| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 1) |#valid|) (= (select |v_#valid_220| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))) (= |ULTIMATE.start_dll_circular_append_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_int_242| (Array Int (Array Int Int))) (|v_#memory_int_243| (Array Int (Array Int Int))) (|v_#memory_int_241| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_242| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_242| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_243| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4))) |v_#memory_int_243|) (= (store |v_#memory_int_243| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_243| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8 1)) |#memory_int|) (= (store |v_#memory_int_241| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_241| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 (select (select |v_#memory_int_242| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))) |v_#memory_int_242|))) (exists ((|v_#memory_$Pointer$.base_281| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_281| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_281| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8))) |#memory_$Pointer$.base|)) (exists ((|v_#memory_$Pointer$.offset_275| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_275| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_275| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8))))) (<= (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 0)) (exists ((|v_#length_193| (Array Int Int))) (= |#length| (store |v_#length_193| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 12))) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_84| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_84| (Array Int Int)) (|v_#memory_int_247| (Array Int (Array Int Int))) (|v_#memory_int_248| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_281| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_84| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_84| (Array Int Int)) (|v_#memory_$Pointer$.base_287| (Array Int (Array Int Int)))) (and (= |v_old(#memory_int)_AFTER_CALL_84| (store |v_#memory_int_248| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_248| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_int)_AFTER_CALL_84| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= (select |v_old(#valid)_AFTER_CALL_84| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 1) (= (store |v_#memory_int_247| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_int_247| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_#memory_int_248| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0))) |v_#memory_int_248|) (= (select |v_old(#valid)_AFTER_CALL_84| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (= (select (select (store (store |v_#memory_$Pointer$.offset_281| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_281| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.offset_281| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_281| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (store (store |v_#memory_$Pointer$.base_287| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_287| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.base_287| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_287| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_84|) (<= 4 (select |v_old(#length)_AFTER_CALL_84| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) (<= 8 (select |v_old(#length)_AFTER_CALL_84| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| |ULTIMATE.start_main_~#s~0#1.base|) 0))))))) (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0) 0)) (not (= 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0)))) (= |ULTIMATE.start_dll_circular_append_~data#1| 1) (<= 4 (select |#length| |ULTIMATE.start_dll_circular_append_~head#1.base|)) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_append_~head#1.offset| 0))' at error location [2024-11-09 04:53:18,753 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 04:53:18,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 04:53:18,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20] total 40 [2024-11-09 04:53:18,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139774439] [2024-11-09 04:53:18,754 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 04:53:18,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-09 04:53:18,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:53:18,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-09 04:53:18,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=4345, Unknown=10, NotChecked=132, Total=4692 [2024-11-09 04:53:18,756 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand has 41 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 33 states have internal predecessors, (65), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 04:53:42,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:53:42,867 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2024-11-09 04:53:42,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 04:53:42,867 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 33 states have internal predecessors, (65), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 39 [2024-11-09 04:53:42,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:53:42,868 INFO L225 Difference]: With dead ends: 99 [2024-11-09 04:53:42,868 INFO L226 Difference]: Without dead ends: 99 [2024-11-09 04:53:42,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1494 ImplicationChecksByTransitivity, 92.0s TimeCoverageRelationStatistics Valid=345, Invalid=6291, Unknown=10, NotChecked=160, Total=6806 [2024-11-09 04:53:42,872 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 131 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 1941 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 2062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 107 IncrementalHoareTripleChecker+Unchecked, 15.9s IncrementalHoareTripleChecker+Time [2024-11-09 04:53:42,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 879 Invalid, 2062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1941 Invalid, 0 Unknown, 107 Unchecked, 15.9s Time] [2024-11-09 04:53:42,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-09 04:53:42,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 81. [2024-11-09 04:53:42,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 76 states have internal predecessors, (82), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 04:53:42,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2024-11-09 04:53:42,877 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 39 [2024-11-09 04:53:42,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:53:42,878 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2024-11-09 04:53:42,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 33 states have internal predecessors, (65), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 04:53:42,878 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2024-11-09 04:53:42,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 04:53:42,879 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:53:42,879 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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-09 04:53:42,903 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-09 04:53:43,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:53:43,080 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-09 04:53:43,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:53:43,080 INFO L85 PathProgramCache]: Analyzing trace with hash 335391025, now seen corresponding path program 1 times [2024-11-09 04:53:43,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:53:43,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743320220] [2024-11-09 04:53:43,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:53:43,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:53:43,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:53:43,821 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-09 04:53:43,821 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:53:43,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743320220] [2024-11-09 04:53:43,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743320220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:53:43,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:53:43,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 04:53:43,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175565360] [2024-11-09 04:53:43,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:53:43,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 04:53:43,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:53:43,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 04:53:43,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 04:53:43,824 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand has 7 states, 5 states have (on average 5.0) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 04:53:45,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:53:45,159 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2024-11-09 04:53:45,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 04:53:45,160 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.0) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2024-11-09 04:53:45,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:53:45,161 INFO L225 Difference]: With dead ends: 78 [2024-11-09 04:53:45,161 INFO L226 Difference]: Without dead ends: 78 [2024-11-09 04:53:45,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:53:45,162 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 74 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:53:45,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 209 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 04:53:45,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-09 04:53:45,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-09 04:53:45,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 73 states have internal predecessors, (79), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 04:53:45,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2024-11-09 04:53:45,165 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 41 [2024-11-09 04:53:45,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:53:45,165 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2024-11-09 04:53:45,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.0) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 04:53:45,165 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2024-11-09 04:53:45,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 04:53:45,166 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:53:45,166 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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-09 04:53:45,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 04:53:45,166 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-09 04:53:45,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:53:45,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1807191031, now seen corresponding path program 1 times [2024-11-09 04:53:45,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:53:45,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154169410] [2024-11-09 04:53:45,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:53:45,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:53:45,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:53:46,301 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 04:53:46,301 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:53:46,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154169410] [2024-11-09 04:53:46,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154169410] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:53:46,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:53:46,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 04:53:46,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96746577] [2024-11-09 04:53:46,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:53:46,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 04:53:46,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:53:46,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 04:53:46,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:53:46,303 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand has 9 states, 6 states have (on average 4.833333333333333) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (3), 1 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-09 04:53:48,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:53:48,682 INFO L93 Difference]: Finished difference Result 102 states and 110 transitions. [2024-11-09 04:53:48,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 04:53:48,683 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 4.833333333333333) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (3), 1 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 42 [2024-11-09 04:53:48,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:53:48,684 INFO L225 Difference]: With dead ends: 102 [2024-11-09 04:53:48,684 INFO L226 Difference]: Without dead ends: 102 [2024-11-09 04:53:48,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-09 04:53:48,685 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 40 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-09 04:53:48,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 326 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-09 04:53:48,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-09 04:53:48,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 80. [2024-11-09 04:53:48,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 75 states have internal predecessors, (82), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 04:53:48,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2024-11-09 04:53:48,689 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 42 [2024-11-09 04:53:48,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:53:48,690 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2024-11-09 04:53:48,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 4.833333333333333) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (3), 1 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-09 04:53:48,690 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2024-11-09 04:53:48,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 04:53:48,691 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:53:48,691 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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-09 04:53:48,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 04:53:48,692 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-09 04:53:48,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:53:48,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1807191032, now seen corresponding path program 1 times [2024-11-09 04:53:48,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:53:48,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873039044] [2024-11-09 04:53:48,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:53:48,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:53:48,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:53:50,122 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 04:53:50,122 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:53:50,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873039044] [2024-11-09 04:53:50,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873039044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:53:50,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:53:50,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 04:53:50,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420570367] [2024-11-09 04:53:50,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:53:50,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 04:53:50,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:53:50,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 04:53:50,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:53:50,124 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand has 9 states, 6 states have (on average 5.166666666666667) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (3), 1 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-09 04:53:52,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:53:52,159 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2024-11-09 04:53:52,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:53:52,160 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 5.166666666666667) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (3), 1 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 42 [2024-11-09 04:53:52,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:53:52,160 INFO L225 Difference]: With dead ends: 100 [2024-11-09 04:53:52,161 INFO L226 Difference]: Without dead ends: 100 [2024-11-09 04:53:52,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-09 04:53:52,161 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 36 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-09 04:53:52,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 373 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-09 04:53:52,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-09 04:53:52,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 82. [2024-11-09 04:53:52,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 77 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 04:53:52,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2024-11-09 04:53:52,166 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 42 [2024-11-09 04:53:52,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:53:52,167 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2024-11-09 04:53:52,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 5.166666666666667) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (3), 1 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-09 04:53:52,167 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2024-11-09 04:53:52,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 04:53:52,168 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:53:52,168 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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-09 04:53:52,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 04:53:52,169 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-09 04:53:52,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:53:52,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1564822781, now seen corresponding path program 1 times [2024-11-09 04:53:52,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:53:52,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079491455] [2024-11-09 04:53:52,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:53:52,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:53:52,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:53:57,329 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 04:53:57,329 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:53:57,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079491455] [2024-11-09 04:53:57,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079491455] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:53:57,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368276223] [2024-11-09 04:53:57,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:53:57,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:53:57,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:53:57,331 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:53:57,332 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-09 04:53:57,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:53:57,681 INFO L255 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 04:53:57,683 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:54:00,472 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2024-11-09 04:54:00,472 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 21 treesize of output 28 [2024-11-09 04:54:01,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:54:01,176 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-09 04:54:01,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 40 [2024-11-09 04:54:01,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 04:54:01,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:54:01,756 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-09 04:54:02,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 04:54:02,404 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 04:54:02,405 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:54:02,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368276223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:54:02,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 04:54:02,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [19] total 31 [2024-11-09 04:54:02,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925816269] [2024-11-09 04:54:02,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:54:02,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 04:54:02,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:54:02,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 04:54:02,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=899, Unknown=0, NotChecked=0, Total=992 [2024-11-09 04:54:02,407 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand has 14 states, 11 states have (on average 3.0) internal successors, (33), 13 states have internal predecessors, (33), 2 states have call successors, (3), 1 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-09 04:54:07,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:54:07,618 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2024-11-09 04:54:07,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 04:54:07,619 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 3.0) internal successors, (33), 13 states have internal predecessors, (33), 2 states have call successors, (3), 1 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 44 [2024-11-09 04:54:07,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:54:07,620 INFO L225 Difference]: With dead ends: 81 [2024-11-09 04:54:07,620 INFO L226 Difference]: Without dead ends: 81 [2024-11-09 04:54:07,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=152, Invalid=1408, Unknown=0, NotChecked=0, Total=1560 [2024-11-09 04:54:07,621 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 74 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-09 04:54:07,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 461 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-09 04:54:07,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-09 04:54:07,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-09 04:54:07,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 61 states have (on average 1.360655737704918) internal successors, (83), 76 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 04:54:07,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2024-11-09 04:54:07,626 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 44 [2024-11-09 04:54:07,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:54:07,626 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2024-11-09 04:54:07,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 3.0) internal successors, (33), 13 states have internal predecessors, (33), 2 states have call successors, (3), 1 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-09 04:54:07,627 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2024-11-09 04:54:07,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 04:54:07,628 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:54:07,628 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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-09 04:54:07,649 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-09 04:54:07,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-09 04:54:07,829 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-09 04:54:07,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:54:07,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1564822782, now seen corresponding path program 1 times [2024-11-09 04:54:07,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:54:07,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025841492] [2024-11-09 04:54:07,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:54:07,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:54:07,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:54:18,927 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 04:54:18,927 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:54:18,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025841492] [2024-11-09 04:54:18,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025841492] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:54:18,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608971327] [2024-11-09 04:54:18,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:54:18,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:54:18,928 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:54:18,929 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:54:18,930 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b0a0e83-477f-4b11-827e-b9f3198158ea/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-09 04:54:19,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:54:19,307 INFO L255 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-09 04:54:19,311 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:54:19,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 04:54:19,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 04:54:19,770 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2024-11-09 04:54:19,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:54:19,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 04:54:20,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 04:54:20,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:54:20,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 04:54:21,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 04:54:22,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:54:22,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 04:54:24,771 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2024-11-09 04:54:24,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 30 [2024-11-09 04:54:24,966 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2024-11-09 04:54:24,967 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 32 treesize of output 31 [2024-11-09 04:54:25,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:54:26,109 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-09 04:54:26,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 33 [2024-11-09 04:54:26,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:54:26,287 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-09 04:54:26,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 40 [2024-11-09 04:54:26,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 04:54:26,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 04:54:27,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:54:27,188 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-09 04:54:27,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:54:27,218 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 26 [2024-11-09 04:54:27,825 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 23 treesize of output 15 [2024-11-09 04:54:27,842 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 28 treesize of output 16 [2024-11-09 04:54:28,409 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 10 not checked. [2024-11-09 04:54:28,409 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:54:53,323 INFO L349 Elim1Store]: treesize reduction 30, result has 63.9 percent of original size [2024-11-09 04:54:53,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 105 treesize of output 147 [2024-11-09 04:54:53,706 INFO L349 Elim1Store]: treesize reduction 40, result has 37.5 percent of original size [2024-11-09 04:54:53,707 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 135 treesize of output 138 [2024-11-09 04:54:53,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 90 [2024-11-09 04:54:53,811 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:54:53,811 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 145 treesize of output 145 [2024-11-09 04:54:53,841 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 101 treesize of output 99 [2024-11-09 04:54:54,125 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-09 04:54:54,241 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-09 04:54:55,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 67 [2024-11-09 04:54:56,276 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:54:56,276 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 69 treesize of output 67 [2024-11-09 04:54:57,333 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:54:57,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 110 treesize of output 122 [2024-11-09 04:54:59,752 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 04:54:59,753 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 45 treesize of output 37 [2024-11-09 04:55:00,550 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:55:00,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 790 treesize of output 796 [2024-11-09 04:56:00,381 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:56:00,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 38 [2024-11-09 04:56:00,410 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:56:00,411 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 49 treesize of output 37 [2024-11-09 04:56:00,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-09 04:56:01,001 INFO L349 Elim1Store]: treesize reduction 30, result has 63.9 percent of original size [2024-11-09 04:56:01,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 125 treesize of output 171 [2024-11-09 04:56:01,368 INFO L349 Elim1Store]: treesize reduction 40, result has 37.5 percent of original size [2024-11-09 04:56:01,369 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 153 treesize of output 156 [2024-11-09 04:56:01,456 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:56:01,456 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 167 treesize of output 167 [2024-11-09 04:56:01,482 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 123 treesize of output 121 [2024-11-09 04:56:01,509 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 121 treesize of output 119 [2024-11-09 04:56:01,563 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-09 04:56:01,651 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-09 04:56:03,383 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:56:03,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 122 treesize of output 192 [2024-11-09 04:56:16,623 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 112 treesize of output 108 [2024-11-09 04:56:17,077 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 112 treesize of output 108 [2024-11-09 04:56:17,878 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:56:17,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 145 treesize of output 215 [2024-11-09 04:56:20,620 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:56:20,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 521 treesize of output 535 [2024-11-09 04:56:29,013 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 11 treesize of output 7 [2024-11-09 04:56:29,092 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 9 treesize of output 5 [2024-11-09 04:56:29,172 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:56:29,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 38 [2024-11-09 04:56:29,201 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:56:29,202 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 41 treesize of output 29 [2024-11-09 04:56:29,337 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-09 04:56:29,449 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 11 treesize of output 7 [2024-11-09 04:56:29,536 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 9 treesize of output 5 [2024-11-09 04:56:29,620 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 9 treesize of output 5 [2024-11-09 04:56:29,701 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 9 treesize of output 5 [2024-11-09 04:56:29,747 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 9 treesize of output 5 [2024-11-09 04:56:29,811 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:56:29,812 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 2 case distinctions, treesize of input 60 treesize of output 56 [2024-11-09 04:56:29,846 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 66 treesize of output 58 [2024-11-09 04:56:29,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-09 04:56:30,062 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 11 treesize of output 7 [2024-11-09 04:56:30,158 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:56:30,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 38 [2024-11-09 04:56:30,188 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:56:30,189 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 41 treesize of output 29 [2024-11-09 04:56:30,284 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-09 04:56:30,364 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 11 treesize of output 7 [2024-11-09 04:56:30,444 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 9 treesize of output 5 [2024-11-09 04:56:30,507 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 9 treesize of output 5 [2024-11-09 04:56:30,617 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 9 treesize of output 5 [2024-11-09 04:56:30,665 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 11 treesize of output 7 [2024-11-09 04:56:30,747 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 9 treesize of output 5 [2024-11-09 04:56:30,808 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 9 treesize of output 5 [2024-11-09 04:56:31,042 INFO L349 Elim1Store]: treesize reduction 12, result has 64.7 percent of original size [2024-11-09 04:56:31,043 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 2 case distinctions, treesize of input 34 treesize of output 43 [2024-11-09 04:56:31,113 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:56:31,113 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 51 treesize of output 47 [2024-11-09 04:56:31,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-09 04:56:31,983 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-09 04:56:31,984 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 2 case distinctions, treesize of input 34 treesize of output 48 [2024-11-09 04:56:32,065 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:56:32,065 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 56 treesize of output 55 [2024-11-09 04:56:32,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-09 04:56:33,157 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:56:33,157 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 2 case distinctions, treesize of input 32 treesize of output 28 [2024-11-09 04:56:33,175 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 38 treesize of output 30 [2024-11-09 04:56:33,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-09 04:56:33,320 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 9 treesize of output 5 [2024-11-09 04:56:33,401 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:56:33,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 38 [2024-11-09 04:56:33,433 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:56:33,434 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 41 treesize of output 29 [2024-11-09 04:56:33,525 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-09 04:56:33,815 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-09 04:56:33,815 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 2 case distinctions, treesize of input 34 treesize of output 48 [2024-11-09 04:56:33,893 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:56:33,894 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 56 treesize of output 55 [2024-11-09 04:56:33,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-09 04:56:35,069 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-09 04:56:35,069 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 2 case distinctions, treesize of input 34 treesize of output 48 [2024-11-09 04:56:35,144 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:56:35,144 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 56 treesize of output 55 [2024-11-09 04:56:36,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-09 04:56:36,109 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 11 treesize of output 7 [2024-11-09 04:56:36,232 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 9 treesize of output 5 [2024-11-09 04:56:36,281 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:56:36,281 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 2 case distinctions, treesize of input 72 treesize of output 68 [2024-11-09 04:56:36,299 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 78 treesize of output 70 [2024-11-09 04:56:36,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-09 04:56:48,003 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification. DAG size of input: 527 DAG size of output: 528 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 04:57:00,556 WARN L286 SmtUtils]: Spent 5.19s on a formula simplification that was a NOOP. DAG size: 528 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 04:57:26,698 WARN L286 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 569 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 04:57:26,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608971327] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:57:26,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2091064784] [2024-11-09 04:57:26,717 INFO L159 IcfgInterpreter]: Started Sifa with 32 locations of interest [2024-11-09 04:57:26,717 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:57:26,718 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:57:26,718 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:57:26,718 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:57:29,251 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-09 04:57:29,316 INFO L180 IcfgInterpreter]: Interpretation finished