./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_update_all_reverse.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_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/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_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/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_597fc877-7b78-43ae-b0d9-d0b295334ca6/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 cab0e4c46b209be0775136f8613c1e239028ef0244464c17ac04057ecb0a0b33 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 01:18:24,453 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:18:24,557 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-09 01:18:24,565 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:18:24,566 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:18:24,598 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:18:24,599 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:18:24,600 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:18:24,600 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:18:24,601 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:18:24,602 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 01:18:24,602 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 01:18:24,602 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 01:18:24,603 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 01:18:24,603 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 01:18:24,604 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 01:18:24,604 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 01:18:24,605 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 01:18:24,605 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 01:18:24,605 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 01:18:24,606 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 01:18:24,607 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 01:18:24,607 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:18:24,608 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:18:24,608 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:18:24,609 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:18:24,609 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:18:24,610 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:18:24,610 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:18:24,611 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 01:18:24,611 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 01:18:24,611 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 01:18:24,612 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:18:24,612 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 01:18:24,613 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:18:24,613 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 01:18:24,614 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:18:24,614 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:18:24,614 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:18:24,615 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:18:24,615 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:18:24,618 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 01:18:24,619 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:18:24,619 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:18:24,620 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 01:18:24,620 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:18:24,620 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:18:24,620 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 01:18:24,621 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:18:24,621 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_597fc877-7b78-43ae-b0d9-d0b295334ca6/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_597fc877-7b78-43ae-b0d9-d0b295334ca6/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 -> cab0e4c46b209be0775136f8613c1e239028ef0244464c17ac04057ecb0a0b33 [2024-11-09 01:18:24,896 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:18:24,925 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:18:24,928 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:18:24,930 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:18:24,930 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:18:24,932 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i Unable to find full path for "g++" [2024-11-09 01:18:27,125 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:18:27,449 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:18:27,450 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i [2024-11-09 01:18:27,464 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/data/468348c89/2527c47b5bdb401faba27f8aca125665/FLAGdfa220b41 [2024-11-09 01:18:27,483 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/data/468348c89/2527c47b5bdb401faba27f8aca125665 [2024-11-09 01:18:27,486 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:18:27,488 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:18:27,490 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:18:27,490 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:18:27,498 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:18:27,499 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:18:27" (1/1) ... [2024-11-09 01:18:27,503 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5735132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:27, skipping insertion in model container [2024-11-09 01:18:27,503 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:18:27" (1/1) ... [2024-11-09 01:18:27,561 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:18:28,033 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:18:28,044 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:18:28,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:18:28,148 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:18:28,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:28 WrapperNode [2024-11-09 01:18:28,149 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:18:28,150 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:18:28,151 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:18:28,151 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:18:28,161 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:28" (1/1) ... [2024-11-09 01:18:28,184 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:28" (1/1) ... [2024-11-09 01:18:28,223 INFO L138 Inliner]: procedures = 126, calls = 28, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 114 [2024-11-09 01:18:28,224 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:18:28,225 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:18:28,225 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:18:28,226 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:18:28,238 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:28" (1/1) ... [2024-11-09 01:18:28,238 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:28" (1/1) ... [2024-11-09 01:18:28,242 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:28" (1/1) ... [2024-11-09 01:18:28,243 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:28" (1/1) ... [2024-11-09 01:18:28,251 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:28" (1/1) ... [2024-11-09 01:18:28,255 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:28" (1/1) ... [2024-11-09 01:18:28,257 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:28" (1/1) ... [2024-11-09 01:18:28,259 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:28" (1/1) ... [2024-11-09 01:18:28,262 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:18:28,264 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:18:28,264 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:18:28,264 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:18:28,265 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:28" (1/1) ... [2024-11-09 01:18:28,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 01:18:28,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:18:28,305 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 01:18:28,308 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 01:18:28,344 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-09 01:18:28,344 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-09 01:18:28,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 01:18:28,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 01:18:28,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 01:18:28,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:18:28,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 01:18:28,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 01:18:28,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 01:18:28,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 01:18:28,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:18:28,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:18:28,493 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:18:28,496 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:18:28,530 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-09 01:18:28,920 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-09 01:18:28,921 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:18:28,981 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:18:28,982 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 01:18:28,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:18:28 BoogieIcfgContainer [2024-11-09 01:18:28,983 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:18:28,986 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:18:28,986 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:18:28,990 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:18:28,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:18:27" (1/3) ... [2024-11-09 01:18:28,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c332349 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:18:28, skipping insertion in model container [2024-11-09 01:18:28,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:28" (2/3) ... [2024-11-09 01:18:28,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c332349 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:18:28, skipping insertion in model container [2024-11-09 01:18:28,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:18:28" (3/3) ... [2024-11-09 01:18:28,995 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_update_all_reverse.i [2024-11-09 01:18:29,019 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:18:29,019 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2024-11-09 01:18:29,080 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:18:29,089 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;@11ac61a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:18:29,089 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2024-11-09 01:18:29,096 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 39 states have (on average 2.0) internal successors, (78), 62 states have internal predecessors, (78), 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 01:18:29,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 01:18:29,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:18:29,107 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 01:18:29,108 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 01:18:29,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:18:29,116 INFO L85 PathProgramCache]: Analyzing trace with hash 184124463, now seen corresponding path program 1 times [2024-11-09 01:18:29,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:18:29,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452324546] [2024-11-09 01:18:29,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:18:29,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:18:29,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:18:29,550 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 01:18:29,550 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:18:29,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452324546] [2024-11-09 01:18:29,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452324546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:18:29,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:18:29,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:18:29,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539171091] [2024-11-09 01:18:29,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:18:29,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:18:29,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:18:29,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:18:29,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:18:29,615 INFO L87 Difference]: Start difference. First operand has 64 states, 39 states have (on average 2.0) internal successors, (78), 62 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:18:29,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:18:29,752 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2024-11-09 01:18:29,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:18:29,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-09 01:18:29,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:18:29,763 INFO L225 Difference]: With dead ends: 60 [2024-11-09 01:18:29,763 INFO L226 Difference]: Without dead ends: 56 [2024-11-09 01:18:29,765 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 01:18:29,769 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 9 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:18:29,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 93 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:18:29,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-09 01:18:29,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-09 01:18:29,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 36 states have (on average 1.8888888888888888) internal successors, (68), 55 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:18:29,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2024-11-09 01:18:29,818 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 5 [2024-11-09 01:18:29,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:18:29,819 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2024-11-09 01:18:29,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:18:29,821 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2024-11-09 01:18:29,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 01:18:29,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:18:29,822 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 01:18:29,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:18:29,824 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 01:18:29,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:18:29,826 INFO L85 PathProgramCache]: Analyzing trace with hash 184124464, now seen corresponding path program 1 times [2024-11-09 01:18:29,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:18:29,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043203781] [2024-11-09 01:18:29,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:18:29,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:18:29,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:18:30,005 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 01:18:30,006 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:18:30,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043203781] [2024-11-09 01:18:30,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043203781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:18:30,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:18:30,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:18:30,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337486451] [2024-11-09 01:18:30,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:18:30,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:18:30,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:18:30,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:18:30,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:18:30,012 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:18:30,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:18:30,112 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2024-11-09 01:18:30,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:18:30,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-09 01:18:30,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:18:30,115 INFO L225 Difference]: With dead ends: 53 [2024-11-09 01:18:30,115 INFO L226 Difference]: Without dead ends: 53 [2024-11-09 01:18:30,116 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 01:18:30,117 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 8 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:18:30,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 91 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:18:30,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-09 01:18:30,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-09 01:18:30,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 52 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:18:30,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2024-11-09 01:18:30,126 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 5 [2024-11-09 01:18:30,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:18:30,127 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2024-11-09 01:18:30,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:18:30,127 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2024-11-09 01:18:30,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 01:18:30,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:18:30,128 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:18:30,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 01:18:30,129 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 01:18:30,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:18:30,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1939707855, now seen corresponding path program 1 times [2024-11-09 01:18:30,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:18:30,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140571228] [2024-11-09 01:18:30,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:18:30,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:18:30,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:18:30,215 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 01:18:30,215 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:18:30,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140571228] [2024-11-09 01:18:30,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140571228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:18:30,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:18:30,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:18:30,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441029761] [2024-11-09 01:18:30,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:18:30,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:18:30,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:18:30,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:18:30,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:18:30,223 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:18:30,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:18:30,285 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2024-11-09 01:18:30,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:18:30,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-09 01:18:30,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:18:30,288 INFO L225 Difference]: With dead ends: 64 [2024-11-09 01:18:30,288 INFO L226 Difference]: Without dead ends: 64 [2024-11-09 01:18:30,288 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 01:18:30,293 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 11 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:18:30,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 106 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:18:30,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-09 01:18:30,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2024-11-09 01:18:30,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 38 states have (on average 1.763157894736842) internal successors, (67), 54 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:18:30,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 67 transitions. [2024-11-09 01:18:30,308 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 67 transitions. Word has length 7 [2024-11-09 01:18:30,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:18:30,309 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 67 transitions. [2024-11-09 01:18:30,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:18:30,309 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2024-11-09 01:18:30,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 01:18:30,310 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:18:30,310 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:18:30,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 01:18:30,311 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 01:18:30,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:18:30,315 INFO L85 PathProgramCache]: Analyzing trace with hash 757889075, now seen corresponding path program 1 times [2024-11-09 01:18:30,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:18:30,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447038781] [2024-11-09 01:18:30,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:18:30,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:18:30,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:18:30,469 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 01:18:30,470 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:18:30,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447038781] [2024-11-09 01:18:30,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447038781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:18:30,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:18:30,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:18:30,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471635707] [2024-11-09 01:18:30,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:18:30,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:18:30,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:18:30,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:18:30,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:18:30,473 INFO L87 Difference]: Start difference. First operand 55 states and 67 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:18:30,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:18:30,529 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2024-11-09 01:18:30,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:18:30,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 01:18:30,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:18:30,531 INFO L225 Difference]: With dead ends: 60 [2024-11-09 01:18:30,531 INFO L226 Difference]: Without dead ends: 60 [2024-11-09 01:18:30,531 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 01:18:30,533 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:18:30,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:18:30,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-09 01:18:30,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-11-09 01:18:30,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 43 states have (on average 1.6744186046511629) internal successors, (72), 59 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:18:30,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2024-11-09 01:18:30,539 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 9 [2024-11-09 01:18:30,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:18:30,540 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2024-11-09 01:18:30,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:18:30,540 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2024-11-09 01:18:30,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 01:18:30,541 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:18:30,541 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:18:30,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 01:18:30,541 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 01:18:30,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:18:30,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1985664731, now seen corresponding path program 1 times [2024-11-09 01:18:30,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:18:30,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226738468] [2024-11-09 01:18:30,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:18:30,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:18:30,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:18:30,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:18:30,692 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:18:30,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226738468] [2024-11-09 01:18:30,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226738468] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:18:30,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360607377] [2024-11-09 01:18:30,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:18:30,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:18:30,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:18:30,697 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:18:30,701 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 01:18:30,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:18:30,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 01:18:30,854 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:18:30,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:18:30,935 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:18:30,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:18:30,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1360607377] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:18:30,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1787422202] [2024-11-09 01:18:31,015 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2024-11-09 01:18:31,016 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:18:31,021 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:18:31,028 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:18:31,029 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:18:32,445 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:18:36,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1787422202] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:18:36,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:18:36,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [3, 3, 3] total 10 [2024-11-09 01:18:36,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348966534] [2024-11-09 01:18:36,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:18:36,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:18:36,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:18:36,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:18:36,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:18:36,172 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:18:38,489 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 01:18:39,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:18:39,366 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2024-11-09 01:18:39,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:18:39,367 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-09 01:18:39,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:18:39,368 INFO L225 Difference]: With dead ends: 69 [2024-11-09 01:18:39,368 INFO L226 Difference]: Without dead ends: 69 [2024-11-09 01:18:39,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:18:39,370 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 2 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:18:39,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 184 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 206 Invalid, 4 Unknown, 0 Unchecked, 3.2s Time] [2024-11-09 01:18:39,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-09 01:18:39,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2024-11-09 01:18:39,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 51 states have (on average 1.588235294117647) internal successors, (81), 67 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:18:39,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 81 transitions. [2024-11-09 01:18:39,377 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 81 transitions. Word has length 15 [2024-11-09 01:18:39,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:18:39,378 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 81 transitions. [2024-11-09 01:18:39,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:18:39,378 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 81 transitions. [2024-11-09 01:18:39,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 01:18:39,379 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:18:39,379 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-11-09 01:18:39,406 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 01:18:39,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:18:39,584 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 01:18:39,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:18:39,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1972773951, now seen corresponding path program 1 times [2024-11-09 01:18:39,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:18:39,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090037451] [2024-11-09 01:18:39,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:18:39,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:18:39,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:18:39,912 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:18:39,912 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:18:39,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090037451] [2024-11-09 01:18:39,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090037451] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:18:39,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314752939] [2024-11-09 01:18:39,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:18:39,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:18:39,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:18:39,919 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:18:39,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 01:18:40,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:18:40,044 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 01:18:40,046 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:18:40,083 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 01:18:40,140 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 01:18:40,141 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 01:18:40,173 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:18:40,173 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:18:40,248 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:18:40,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314752939] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:18:40,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [573761029] [2024-11-09 01:18:40,252 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2024-11-09 01:18:40,254 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:18:40,254 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:18:40,255 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:18:40,255 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:18:41,259 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:19:00,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [573761029] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:19:00,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:19:00,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4, 3, 3] total 11 [2024-11-09 01:19:00,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134199661] [2024-11-09 01:19:00,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:19:00,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 01:19:00,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:19:00,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 01:19:00,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=92, Unknown=7, NotChecked=0, Total=132 [2024-11-09 01:19:00,895 INFO L87 Difference]: Start difference. First operand 68 states and 81 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:19:03,194 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 01:19:05,213 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 01:19:07,328 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 01:19:09,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:19:12,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:19:15,957 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 01:19:49,441 WARN L286 SmtUtils]: Spent 25.06s on a formula simplification. DAG size of input: 206 DAG size of output: 165 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:19:52,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:19:52,527 INFO L93 Difference]: Finished difference Result 69 states and 82 transitions. [2024-11-09 01:19:52,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 01:19:52,529 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-09 01:19:52,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:19:52,530 INFO L225 Difference]: With dead ends: 69 [2024-11-09 01:19:52,530 INFO L226 Difference]: Without dead ends: 69 [2024-11-09 01:19:52,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 52.3s TimeCoverageRelationStatistics Valid=41, Invalid=105, Unknown=10, NotChecked=0, Total=156 [2024-11-09 01:19:52,532 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 1 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 1 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:19:52,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 236 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 283 Invalid, 10 Unknown, 0 Unchecked, 19.0s Time] [2024-11-09 01:19:52,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-09 01:19:52,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-09 01:19:52,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 52 states have (on average 1.5769230769230769) internal successors, (82), 68 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:19:52,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2024-11-09 01:19:52,538 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 82 transitions. Word has length 17 [2024-11-09 01:19:52,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:19:52,539 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 82 transitions. [2024-11-09 01:19:52,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:19:52,539 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 82 transitions. [2024-11-09 01:19:52,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 01:19:52,540 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:19:52,540 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:19:52,559 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 01:19:52,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-09 01:19:52,745 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 01:19:52,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:19:52,746 INFO L85 PathProgramCache]: Analyzing trace with hash 183335668, now seen corresponding path program 1 times [2024-11-09 01:19:52,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:19:52,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931328127] [2024-11-09 01:19:52,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:19:52,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:19:52,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:53,106 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 01:19:53,106 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:19:53,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931328127] [2024-11-09 01:19:53,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931328127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:19:53,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:19:53,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:19:53,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006238715] [2024-11-09 01:19:53,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:19:53,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:19:53,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:19:53,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:19:53,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:19:53,112 INFO L87 Difference]: Start difference. First operand 69 states and 82 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:19:53,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:19:53,703 INFO L93 Difference]: Finished difference Result 72 states and 89 transitions. [2024-11-09 01:19:53,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:19:53,704 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-09 01:19:53,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:19:53,704 INFO L225 Difference]: With dead ends: 72 [2024-11-09 01:19:53,705 INFO L226 Difference]: Without dead ends: 72 [2024-11-09 01:19:53,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:19:53,706 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 53 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:19:53,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 155 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 01:19:53,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-09 01:19:53,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-09 01:19:53,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 56 states have (on average 1.5892857142857142) internal successors, (89), 71 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:19:53,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 89 transitions. [2024-11-09 01:19:53,714 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 89 transitions. Word has length 24 [2024-11-09 01:19:53,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:19:53,714 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 89 transitions. [2024-11-09 01:19:53,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:19:53,715 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 89 transitions. [2024-11-09 01:19:53,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 01:19:53,719 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:19:53,720 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:19:53,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 01:19:53,721 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 01:19:53,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:19:53,721 INFO L85 PathProgramCache]: Analyzing trace with hash 183335669, now seen corresponding path program 1 times [2024-11-09 01:19:53,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:19:53,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214624429] [2024-11-09 01:19:53,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:19:53,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:19:53,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:53,945 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 01:19:53,946 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:19:53,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214624429] [2024-11-09 01:19:53,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214624429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:19:53,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:19:53,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:19:53,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806106345] [2024-11-09 01:19:53,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:19:53,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:19:53,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:19:53,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:19:53,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:19:53,949 INFO L87 Difference]: Start difference. First operand 72 states and 89 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:19:54,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:19:54,173 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2024-11-09 01:19:54,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:19:54,174 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-09 01:19:54,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:19:54,175 INFO L225 Difference]: With dead ends: 72 [2024-11-09 01:19:54,175 INFO L226 Difference]: Without dead ends: 72 [2024-11-09 01:19:54,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:19:54,176 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 63 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:19:54,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 101 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:19:54,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-09 01:19:54,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 62. [2024-11-09 01:19:54,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 61 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:19:54,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2024-11-09 01:19:54,183 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 73 transitions. Word has length 24 [2024-11-09 01:19:54,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:19:54,183 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 73 transitions. [2024-11-09 01:19:54,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:19:54,184 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2024-11-09 01:19:54,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 01:19:54,185 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:19:54,185 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:19:54,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 01:19:54,186 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 01:19:54,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:19:54,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1388427631, now seen corresponding path program 1 times [2024-11-09 01:19:54,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:19:54,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393284069] [2024-11-09 01:19:54,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:19:54,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:19:54,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:54,604 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 01:19:54,605 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:19:54,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393284069] [2024-11-09 01:19:54,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393284069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:19:54,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:19:54,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:19:54,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926255277] [2024-11-09 01:19:54,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:19:54,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:19:54,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:19:54,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:19:54,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:19:54,607 INFO L87 Difference]: Start difference. First operand 62 states and 73 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:19:55,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:19:55,037 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2024-11-09 01:19:55,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:19:55,037 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-09 01:19:55,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:19:55,038 INFO L225 Difference]: With dead ends: 61 [2024-11-09 01:19:55,038 INFO L226 Difference]: Without dead ends: 61 [2024-11-09 01:19:55,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:19:55,042 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 26 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:19:55,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 128 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:19:55,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-09 01:19:55,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2024-11-09 01:19:55,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 50 states have (on average 1.38) internal successors, (69), 59 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:19:55,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2024-11-09 01:19:55,051 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 25 [2024-11-09 01:19:55,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:19:55,052 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2024-11-09 01:19:55,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:19:55,052 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2024-11-09 01:19:55,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 01:19:55,057 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:19:55,057 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:19:55,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 01:19:55,058 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 01:19:55,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:19:55,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1455777258, now seen corresponding path program 1 times [2024-11-09 01:19:55,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:19:55,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428106756] [2024-11-09 01:19:55,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:19:55,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:19:55,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:56,339 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:19:56,340 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:19:56,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428106756] [2024-11-09 01:19:56,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428106756] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:19:56,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595705283] [2024-11-09 01:19:56,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:19:56,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:19:56,341 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:19:56,344 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:19:56,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 01:19:56,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:56,481 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-09 01:19:56,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:19:56,499 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 01:19:56,628 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 01:19:56,628 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 01:19:56,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 01:19:56,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-09 01:19:56,971 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 01:19:56,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-09 01:19:57,609 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:19:57,609 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 40 treesize of output 16 [2024-11-09 01:19:57,631 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:19:57,632 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:19:58,158 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-09 01:19:58,158 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 21 treesize of output 20 [2024-11-09 01:19:58,171 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_380 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_380) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) is different from false [2024-11-09 01:19:58,199 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_380 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_380) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) is different from false [2024-11-09 01:19:58,228 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:19:58,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 33 [2024-11-09 01:19:58,250 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:19:58,251 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 46 treesize of output 28 [2024-11-09 01:19:58,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 01:19:58,513 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-09 01:19:58,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595705283] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:19:58,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1862639109] [2024-11-09 01:19:58,517 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2024-11-09 01:19:58,517 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:19:58,517 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:19:58,518 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:19:58,518 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:19:59,861 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:20:13,729 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1636#(and (<= 1 |#StackHeapBarrier|) (= 3 |ULTIMATE.start_dll_update_at_~data#1|) (<= 8 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_dll_update_at_~head#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 4)) (= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1) (= |ULTIMATE.start_main_~len~0#1| 2) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))' at error location [2024-11-09 01:20:13,729 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 01:20:13,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:20:13,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2024-11-09 01:20:13,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790971556] [2024-11-09 01:20:13,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:20:13,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-09 01:20:13,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:20:13,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-09 01:20:13,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1414, Unknown=2, NotChecked=154, Total=1722 [2024-11-09 01:20:13,733 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand has 28 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 28 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:20:16,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:20:16,870 INFO L93 Difference]: Finished difference Result 83 states and 97 transitions. [2024-11-09 01:20:16,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 01:20:16,872 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 28 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-09 01:20:16,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:20:16,874 INFO L225 Difference]: With dead ends: 83 [2024-11-09 01:20:16,874 INFO L226 Difference]: Without dead ends: 83 [2024-11-09 01:20:16,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 609 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=295, Invalid=2261, Unknown=2, NotChecked=198, Total=2756 [2024-11-09 01:20:16,877 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 62 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-09 01:20:16,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 576 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 605 Invalid, 0 Unknown, 102 Unchecked, 1.9s Time] [2024-11-09 01:20:16,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-09 01:20:16,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 66. [2024-11-09 01:20:16,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 65 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:20:16,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2024-11-09 01:20:16,884 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 27 [2024-11-09 01:20:16,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:20:16,884 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2024-11-09 01:20:16,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 28 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:20:16,885 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2024-11-09 01:20:16,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 01:20:16,886 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:20:16,886 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:20:16,912 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 01:20:17,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-09 01:20:17,090 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 01:20:17,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:20:17,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1455777257, now seen corresponding path program 1 times [2024-11-09 01:20:17,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:20:17,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477019338] [2024-11-09 01:20:17,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:20:17,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:20:17,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:20:18,745 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:20:18,745 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:20:18,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477019338] [2024-11-09 01:20:18,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477019338] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:20:18,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540650335] [2024-11-09 01:20:18,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:20:18,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:20:18,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:20:18,747 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:20:18,748 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 01:20:18,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:20:18,886 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-09 01:20:18,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:20:18,908 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 01:20:19,201 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 01:20:19,201 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 01:20:19,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 01:20:19,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 01:20:19,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-09 01:20:19,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-09 01:20:19,741 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 01:20:19,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 64 [2024-11-09 01:20:19,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 20 [2024-11-09 01:20:20,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 16 [2024-11-09 01:20:20,536 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:20:20,536 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 19 treesize of output 7 [2024-11-09 01:20:20,656 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:20:20,656 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:20:21,461 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:20:21,461 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 46 treesize of output 50 [2024-11-09 01:20:21,559 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_480 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_480) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0))) (forall ((v_prenex_1 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 9))) (forall ((v_ArrVal_481 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_481) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) is different from false [2024-11-09 01:20:21,636 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0 0))) (.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_481 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_481) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_ArrVal_480 (Array Int Int))) (<= 0 (select (select (store .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_480) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1))) (forall ((v_prenex_1 (Array Int Int))) (< (select (select (store .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 9)))))) is different from false [2024-11-09 01:20:21,680 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:20:21,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 33 [2024-11-09 01:20:21,696 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:20:21,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 32 [2024-11-09 01:20:21,745 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2024-11-09 01:20:21,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 1 [2024-11-09 01:20:21,767 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2024-11-09 01:20:21,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 1 [2024-11-09 01:20:22,587 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-09 01:20:22,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540650335] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:20:22,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1128750904] [2024-11-09 01:20:22,593 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2024-11-09 01:20:22,593 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:20:22,594 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:20:22,594 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:20:22,594 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:20:23,622 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:20:38,842 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2010#(and (<= 1 |#StackHeapBarrier|) (= 3 |ULTIMATE.start_dll_update_at_~data#1|) (<= 8 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| 1) (or (< (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 4))) (< (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 4) 0)) (= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_main_~s~0#1.offset| 0))' at error location [2024-11-09 01:20:38,842 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 01:20:38,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:20:38,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2024-11-09 01:20:38,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485550134] [2024-11-09 01:20:38,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:20:38,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-09 01:20:38,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:20:38,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-09 01:20:38,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1740, Unknown=4, NotChecked=170, Total=2070 [2024-11-09 01:20:38,846 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand has 32 states, 31 states have (on average 2.4838709677419355) internal successors, (77), 32 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:20:42,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:20:42,938 INFO L93 Difference]: Finished difference Result 106 states and 129 transitions. [2024-11-09 01:20:42,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 01:20:42,939 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.4838709677419355) internal successors, (77), 32 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-09 01:20:42,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:20:42,939 INFO L225 Difference]: With dead ends: 106 [2024-11-09 01:20:42,939 INFO L226 Difference]: Without dead ends: 106 [2024-11-09 01:20:42,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 604 ImplicationChecksByTransitivity, 19.9s TimeCoverageRelationStatistics Valid=302, Invalid=2672, Unknown=4, NotChecked=214, Total=3192 [2024-11-09 01:20:42,942 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 84 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:20:42,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 639 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 636 Invalid, 0 Unknown, 122 Unchecked, 2.1s Time] [2024-11-09 01:20:42,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-09 01:20:42,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 86. [2024-11-09 01:20:42,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 76 states have (on average 1.4078947368421053) internal successors, (107), 85 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:20:42,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 107 transitions. [2024-11-09 01:20:42,948 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 107 transitions. Word has length 27 [2024-11-09 01:20:42,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:20:42,949 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 107 transitions. [2024-11-09 01:20:42,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.4838709677419355) internal successors, (77), 32 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:20:42,949 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 107 transitions. [2024-11-09 01:20:42,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 01:20:42,950 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:20:42,951 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:20:42,977 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 01:20:43,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-09 01:20:43,152 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 01:20:43,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:20:43,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1509199796, now seen corresponding path program 2 times [2024-11-09 01:20:43,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:20:43,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407691553] [2024-11-09 01:20:43,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:20:43,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:20:43,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:20:43,381 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 01:20:43,381 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:20:43,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407691553] [2024-11-09 01:20:43,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407691553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:20:43,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:20:43,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:20:43,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476419348] [2024-11-09 01:20:43,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:20:43,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:20:43,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:20:43,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:20:43,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:20:43,384 INFO L87 Difference]: Start difference. First operand 86 states and 107 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:20:43,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:20:43,574 INFO L93 Difference]: Finished difference Result 86 states and 103 transitions. [2024-11-09 01:20:43,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:20:43,575 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-09 01:20:43,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:20:43,576 INFO L225 Difference]: With dead ends: 86 [2024-11-09 01:20:43,576 INFO L226 Difference]: Without dead ends: 86 [2024-11-09 01:20:43,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:20:43,577 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 47 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:20:43,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 133 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:20:43,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-09 01:20:43,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2024-11-09 01:20:43,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 74 states have (on average 1.3783783783783783) internal successors, (102), 83 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:20:43,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 102 transitions. [2024-11-09 01:20:43,583 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 102 transitions. Word has length 30 [2024-11-09 01:20:43,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:20:43,584 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 102 transitions. [2024-11-09 01:20:43,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:20:43,584 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 102 transitions. [2024-11-09 01:20:43,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 01:20:43,585 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:20:43,585 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:20:43,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 01:20:43,586 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 01:20:43,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:20:43,586 INFO L85 PathProgramCache]: Analyzing trace with hash -69540595, now seen corresponding path program 1 times [2024-11-09 01:20:43,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:20:43,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612919489] [2024-11-09 01:20:43,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:20:43,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:20:43,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:20:43,781 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 01:20:43,782 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:20:43,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612919489] [2024-11-09 01:20:43,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612919489] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:20:43,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119736041] [2024-11-09 01:20:43,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:20:43,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:20:43,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:20:43,785 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:20:43,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 01:20:43,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:20:43,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 01:20:43,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:20:44,211 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 01:20:44,212 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:20:44,403 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 01:20:44,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119736041] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:20:44,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1174364875] [2024-11-09 01:20:44,406 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2024-11-09 01:20:44,406 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:20:44,407 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:20:44,407 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:20:44,407 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:20:45,643 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:21:04,120 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2626#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_118| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_update_at_~head#1.base_39| Int) (|v_#memory_int_112| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_35| Int) (|v_#memory_$Pointer$.base_121| (Array Int (Array Int Int)))) (and (<= (+ |v_ULTIMATE.start_dll_update_at_~head#1.offset_35| 4) (select |#length| |v_ULTIMATE.start_dll_update_at_~head#1.base_39|)) (<= (select (select |#memory_int| |v_ULTIMATE.start_dll_update_at_~head#1.base_39|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_35|) 3) (= 1 (select |#valid| |v_ULTIMATE.start_dll_update_at_~head#1.base_39|)) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_118| |v_ULTIMATE.start_dll_update_at_~head#1.base_39| (store (select |v_#memory_$Pointer$.offset_118| |v_ULTIMATE.start_dll_update_at_~head#1.base_39|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_35| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_update_at_~head#1.base_39|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_35|)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_121| |v_ULTIMATE.start_dll_update_at_~head#1.base_39| (store (select |v_#memory_$Pointer$.base_121| |v_ULTIMATE.start_dll_update_at_~head#1.base_39|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_35| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_update_at_~head#1.base_39|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_35|)))) (<= 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_35|) (= |#memory_int| (store |v_#memory_int_112| |v_ULTIMATE.start_dll_update_at_~head#1.base_39| (store (select |v_#memory_int_112| |v_ULTIMATE.start_dll_update_at_~head#1.base_39|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_35| (select (select |#memory_int| |v_ULTIMATE.start_dll_update_at_~head#1.base_39|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_35|)))))) (= |ULTIMATE.start_dll_destroy_~head#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_destroy_~head#1.base_19| Int)) (and (not (= |v_ULTIMATE.start_dll_destroy_~head#1.base_19| 0)) (not (= (select |#valid| |v_ULTIMATE.start_dll_destroy_~head#1.base_19|) 1)))) (= |ULTIMATE.start_main_~len~0#1| 2))' at error location [2024-11-09 01:21:04,120 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 01:21:04,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:21:04,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-11-09 01:21:04,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905036950] [2024-11-09 01:21:04,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:21:04,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:21:04,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:21:04,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:21:04,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=517, Unknown=4, NotChecked=0, Total=650 [2024-11-09 01:21:04,123 INFO L87 Difference]: Start difference. First operand 84 states and 102 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:21:04,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:21:04,331 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2024-11-09 01:21:04,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:21:04,332 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-09 01:21:04,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:21:04,333 INFO L225 Difference]: With dead ends: 88 [2024-11-09 01:21:04,333 INFO L226 Difference]: Without dead ends: 88 [2024-11-09 01:21:04,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 76 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 18.7s TimeCoverageRelationStatistics Valid=147, Invalid=605, Unknown=4, NotChecked=0, Total=756 [2024-11-09 01:21:04,334 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 52 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:21:04,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 130 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:21:04,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-09 01:21:04,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2024-11-09 01:21:04,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 77 states have (on average 1.3376623376623376) internal successors, (103), 86 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:21:04,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 103 transitions. [2024-11-09 01:21:04,340 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 103 transitions. Word has length 34 [2024-11-09 01:21:04,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:21:04,340 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 103 transitions. [2024-11-09 01:21:04,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:21:04,341 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 103 transitions. [2024-11-09 01:21:04,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 01:21:04,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:21:04,342 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:21:04,365 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 01:21:04,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-09 01:21:04,543 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 01:21:04,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:21:04,543 INFO L85 PathProgramCache]: Analyzing trace with hash 78314739, now seen corresponding path program 1 times [2024-11-09 01:21:04,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:21:04,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063924840] [2024-11-09 01:21:04,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:21:04,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:21:04,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:21:04,813 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 01:21:04,813 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:21:04,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063924840] [2024-11-09 01:21:04,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063924840] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:21:04,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522122099] [2024-11-09 01:21:04,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:21:04,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:21:04,814 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:21:04,817 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:21:04,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 01:21:04,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:21:04,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 01:21:04,988 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:21:05,213 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 01:21:05,214 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:21:05,440 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 01:21:05,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522122099] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:21:05,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2118288503] [2024-11-09 01:21:05,442 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2024-11-09 01:21:05,442 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:21:05,443 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:21:05,443 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:21:05,443 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:21:06,634 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:21:18,737 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3030#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_dll_update_at_~head#1.base_50| Int)) (not (= (select |#valid| |v_ULTIMATE.start_dll_update_at_~head#1.base_50|) 1))) (= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_dll_update_at_~data#1| 3) (<= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0))' at error location [2024-11-09 01:21:18,737 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 01:21:18,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:21:18,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-09 01:21:18,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64624668] [2024-11-09 01:21:18,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:21:18,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:21:18,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:21:18,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:21:18,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=393, Unknown=3, NotChecked=0, Total=506 [2024-11-09 01:21:18,739 INFO L87 Difference]: Start difference. First operand 87 states and 103 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:21:19,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:21:19,032 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2024-11-09 01:21:19,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:21:19,033 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-09 01:21:19,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:21:19,033 INFO L225 Difference]: With dead ends: 72 [2024-11-09 01:21:19,033 INFO L226 Difference]: Without dead ends: 72 [2024-11-09 01:21:19,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 79 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=131, Invalid=516, Unknown=3, NotChecked=0, Total=650 [2024-11-09 01:21:19,035 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 36 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:21:19,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 144 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:21:19,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-09 01:21:19,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 67. [2024-11-09 01:21:19,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 60 states have (on average 1.25) internal successors, (75), 66 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:21:19,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2024-11-09 01:21:19,039 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 75 transitions. Word has length 34 [2024-11-09 01:21:19,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:21:19,040 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 75 transitions. [2024-11-09 01:21:19,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:21:19,040 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2024-11-09 01:21:19,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 01:21:19,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:21:19,041 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:21:19,068 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 01:21:19,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-09 01:21:19,242 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 01:21:19,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:21:19,243 INFO L85 PathProgramCache]: Analyzing trace with hash -938113909, now seen corresponding path program 2 times [2024-11-09 01:21:19,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:21:19,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423626921] [2024-11-09 01:21:19,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:21:19,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:21:19,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:21:19,363 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 01:21:19,364 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:21:19,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423626921] [2024-11-09 01:21:19,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423626921] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:21:19,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139743004] [2024-11-09 01:21:19,365 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 01:21:19,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:21:19,365 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:21:19,367 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:21:19,369 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 01:21:19,531 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-09 01:21:19,531 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 01:21:19,533 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 01:21:19,534 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:21:19,883 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 01:21:19,883 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:21:20,145 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 01:21:20,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139743004] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:21:20,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [142552512] [2024-11-09 01:21:20,148 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2024-11-09 01:21:20,148 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:21:20,149 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:21:20,149 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:21:20,149 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:21:21,229 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:21:31,985 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3403#(and (<= 1 |#StackHeapBarrier|) (= 3 |ULTIMATE.start_dll_update_at_~data#1|) (<= 8 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| 1) (or (< (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 4))) (< (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 4) 0)) (= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_main_~s~0#1.offset| 0))' at error location [2024-11-09 01:21:31,986 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 01:21:31,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:21:31,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 9 [2024-11-09 01:21:31,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531661345] [2024-11-09 01:21:31,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:21:31,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 01:21:31,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:21:31,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 01:21:31,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=418, Unknown=2, NotChecked=0, Total=506 [2024-11-09 01:21:31,988 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:21:32,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:21:32,319 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2024-11-09 01:21:32,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:21:32,319 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-09 01:21:32,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:21:32,320 INFO L225 Difference]: With dead ends: 55 [2024-11-09 01:21:32,320 INFO L226 Difference]: Without dead ends: 55 [2024-11-09 01:21:32,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 86 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=111, Invalid=537, Unknown=2, NotChecked=0, Total=650 [2024-11-09 01:21:32,321 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:21:32,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 159 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:21:32,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-09 01:21:32,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2024-11-09 01:21:32,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 49 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:21:32,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2024-11-09 01:21:32,325 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 35 [2024-11-09 01:21:32,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:21:32,326 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2024-11-09 01:21:32,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:21:32,326 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2024-11-09 01:21:32,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 01:21:32,327 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:21:32,327 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:21:32,351 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-09 01:21:32,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:21:32,528 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 01:21:32,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:21:32,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1594530508, now seen corresponding path program 2 times [2024-11-09 01:21:32,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:21:32,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224052587] [2024-11-09 01:21:32,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:21:32,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:21:32,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:21:32,725 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 01:21:32,725 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:21:32,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224052587] [2024-11-09 01:21:32,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224052587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:21:32,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:21:32,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:21:32,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559823243] [2024-11-09 01:21:32,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:21:32,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:21:32,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:21:32,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:21:32,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:21:32,728 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:21:32,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:21:32,994 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2024-11-09 01:21:32,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:21:32,995 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-09 01:21:32,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:21:32,996 INFO L225 Difference]: With dead ends: 52 [2024-11-09 01:21:32,996 INFO L226 Difference]: Without dead ends: 52 [2024-11-09 01:21:32,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:21:32,997 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 10 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:21:32,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 80 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:21:32,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-09 01:21:33,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-09 01:21:33,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 51 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:21:33,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2024-11-09 01:21:33,002 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 38 [2024-11-09 01:21:33,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:21:33,002 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2024-11-09 01:21:33,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:21:33,002 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2024-11-09 01:21:33,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 01:21:33,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:21:33,003 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:21:33,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 01:21:33,004 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 01:21:33,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:21:33,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1594530509, now seen corresponding path program 1 times [2024-11-09 01:21:33,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:21:33,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480971341] [2024-11-09 01:21:33,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:21:33,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:21:33,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:21:33,444 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 01:21:33,444 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:21:33,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480971341] [2024-11-09 01:21:33,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480971341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:21:33,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:21:33,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:21:33,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713200174] [2024-11-09 01:21:33,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:21:33,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:21:33,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:21:33,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:21:33,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:21:33,446 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:21:33,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:21:33,801 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2024-11-09 01:21:33,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:21:33,802 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-09 01:21:33,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:21:33,802 INFO L225 Difference]: With dead ends: 53 [2024-11-09 01:21:33,802 INFO L226 Difference]: Without dead ends: 53 [2024-11-09 01:21:33,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:21:33,803 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 9 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:21:33,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 79 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:21:33,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-09 01:21:33,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-09 01:21:33,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 52 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:21:33,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2024-11-09 01:21:33,807 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 38 [2024-11-09 01:21:33,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:21:33,807 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2024-11-09 01:21:33,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:21:33,807 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2024-11-09 01:21:33,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 01:21:33,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:21:33,810 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:21:33,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 01:21:33,811 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 01:21:33,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:21:33,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1594547304, now seen corresponding path program 1 times [2024-11-09 01:21:33,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:21:33,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608553401] [2024-11-09 01:21:33,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:21:33,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:21:33,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:21:34,047 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 01:21:34,047 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:21:34,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608553401] [2024-11-09 01:21:34,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608553401] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:21:34,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:21:34,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:21:34,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609024173] [2024-11-09 01:21:34,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:21:34,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:21:34,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:21:34,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:21:34,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:21:34,049 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:21:34,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:21:34,380 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2024-11-09 01:21:34,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:21:34,380 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-09 01:21:34,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:21:34,381 INFO L225 Difference]: With dead ends: 55 [2024-11-09 01:21:34,381 INFO L226 Difference]: Without dead ends: 55 [2024-11-09 01:21:34,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:21:34,382 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 14 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:21:34,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 90 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:21:34,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-09 01:21:34,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2024-11-09 01:21:34,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.1875) internal successors, (57), 52 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:21:34,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2024-11-09 01:21:34,384 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 38 [2024-11-09 01:21:34,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:21:34,385 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2024-11-09 01:21:34,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:21:34,385 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2024-11-09 01:21:34,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 01:21:34,386 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:21:34,386 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:21:34,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 01:21:34,386 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 01:21:34,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:21:34,387 INFO L85 PathProgramCache]: Analyzing trace with hash -959473269, now seen corresponding path program 1 times [2024-11-09 01:21:34,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:21:34,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922303085] [2024-11-09 01:21:34,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:21:34,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:21:34,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:21:34,626 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 01:21:34,627 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:21:34,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922303085] [2024-11-09 01:21:34,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922303085] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:21:34,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:21:34,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:21:34,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762506053] [2024-11-09 01:21:34,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:21:34,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:21:34,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:21:34,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:21:34,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:21:34,629 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:21:34,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:21:34,987 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2024-11-09 01:21:34,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:21:34,988 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-11-09 01:21:34,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:21:34,988 INFO L225 Difference]: With dead ends: 54 [2024-11-09 01:21:34,988 INFO L226 Difference]: Without dead ends: 54 [2024-11-09 01:21:34,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:21:34,990 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 10 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:21:34,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 76 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:21:34,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-09 01:21:34,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-09 01:21:34,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.183673469387755) internal successors, (58), 53 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:21:34,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2024-11-09 01:21:34,993 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 40 [2024-11-09 01:21:34,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:21:34,993 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2024-11-09 01:21:34,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:21:34,994 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2024-11-09 01:21:34,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 01:21:34,995 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:21:34,995 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:21:34,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 01:21:34,995 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 01:21:34,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:21:34,996 INFO L85 PathProgramCache]: Analyzing trace with hash 995226943, now seen corresponding path program 1 times [2024-11-09 01:21:34,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:21:34,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369496069] [2024-11-09 01:21:34,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:21:34,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:21:35,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:21:37,023 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 01:21:37,024 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:21:37,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369496069] [2024-11-09 01:21:37,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369496069] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:21:37,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692832078] [2024-11-09 01:21:37,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:21:37,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:21:37,025 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:21:37,026 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:21:37,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 01:21:37,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:21:37,235 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-09 01:21:37,239 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:21:37,253 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 01:21:37,519 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 01:21:37,519 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 01:21:37,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 01:21:37,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-09 01:21:37,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:21:38,019 INFO L349 Elim1Store]: treesize reduction 31, result has 18.4 percent of original size [2024-11-09 01:21:38,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 45 [2024-11-09 01:21:38,911 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 01:21:38,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2024-11-09 01:21:39,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:21:39,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:21:39,170 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:39,171 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 40 treesize of output 27 [2024-11-09 01:21:39,553 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:39,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 32 [2024-11-09 01:21:39,861 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 01:21:39,861 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 13 [2024-11-09 01:21:39,878 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 01:21:39,879 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:21:41,040 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_53| Int) (v_ArrVal_1224 (Array Int Int)) (v_ArrVal_1226 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_53|) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1224) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_53| v_ArrVal_1226) 4)) 1))) is different from false [2024-11-09 01:21:41,093 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_53| Int) (v_ArrVal_1224 (Array Int Int)) (v_ArrVal_1226 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_53|) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_1224) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_53| v_ArrVal_1226) 4)) 1))) is different from false [2024-11-09 01:21:41,187 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_53| Int) (v_ArrVal_1224 (Array Int Int)) (v_ArrVal_1226 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_53|) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1224) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_53| v_ArrVal_1226) 4)) 1))) is different from false [2024-11-09 01:21:41,242 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_53| Int) (v_ArrVal_1224 (Array Int Int)) (v_ArrVal_1226 Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_53|) (= (select (store |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base| 0) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_1224) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_53| v_ArrVal_1226) 4)) 1))) is different from false [2024-11-09 01:21:41,302 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_53| Int) (v_ArrVal_1224 (Array Int Int)) (v_ArrVal_1226 Int)) (or (= (select (store |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1224) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_53| v_ArrVal_1226) 4)) 1) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_53|))) is different from false [2024-11-09 01:21:41,341 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:41,341 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 89 treesize of output 93 [2024-11-09 01:21:41,424 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_53| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_53|) (forall ((v_ArrVal_1224 (Array Int Int)) (v_ArrVal_1223 Int) (v_ArrVal_1226 Int)) (= (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse2 .cse3 v_ArrVal_1223)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_ArrVal_1224)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_53| v_ArrVal_1226) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_53| Int)) (or (forall ((v_ArrVal_1224 (Array Int Int)) (v_ArrVal_1223 Int) (v_ArrVal_1226 Int)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (store (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse2 .cse3 v_ArrVal_1223)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_ArrVal_1224)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_53| v_ArrVal_1226) 4)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_53|))))) is different from false [2024-11-09 01:21:41,549 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)))) (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse3 (select .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_53| Int)) (or (forall ((v_ArrVal_1224 (Array Int Int)) (v_ArrVal_1223 Int) (v_ArrVal_1226 Int)) (= (select (store (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse3 .cse4 v_ArrVal_1223)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_ArrVal_1224)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_53| v_ArrVal_1226) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_53|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_53| Int)) (or (forall ((v_ArrVal_1224 (Array Int Int)) (v_ArrVal_1223 Int) (v_ArrVal_1226 Int)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (store (select (let ((.cse5 (store .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse3 .cse4 v_ArrVal_1223)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_ArrVal_1224)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_53| v_ArrVal_1226) 4)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_53|)))))) is different from false [2024-11-09 01:21:41,782 INFO L349 Elim1Store]: treesize reduction 36, result has 67.0 percent of original size [2024-11-09 01:21:41,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 105 treesize of output 137 [2024-11-09 01:21:41,858 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-11-09 01:21:41,858 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 3 case distinctions, treesize of input 135 treesize of output 119 [2024-11-09 01:21:41,876 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 109 treesize of output 103 [2024-11-09 01:21:41,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 104 [2024-11-09 01:21:41,990 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:41,991 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 132 treesize of output 140 [2024-11-09 01:21:42,603 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:42,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 160 treesize of output 186 [2024-11-09 01:21:43,474 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:21:43,504 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:21:43,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2024-11-09 01:21:43,513 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:21:43,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2024-11-09 01:21:43,526 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:21:43,615 INFO L349 Elim1Store]: treesize reduction 11, result has 42.1 percent of original size [2024-11-09 01:21:43,615 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 22 treesize of output 19 [2024-11-09 01:21:44,226 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2024-11-09 01:21:44,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692832078] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:21:44,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1594660586] [2024-11-09 01:21:44,228 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2024-11-09 01:21:44,229 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:21:44,229 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:21:44,229 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:21:44,229 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:21:45,402 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:22:32,151 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4295#(and (exists ((|v_ULTIMATE.start_dll_destroy_~head#1.base_25| Int)) (not (= (select |#valid| |v_ULTIMATE.start_dll_destroy_~head#1.base_25|) 1))) (= |ULTIMATE.start_main_~len~0#1| 2))' at error location [2024-11-09 01:22:32,151 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 01:22:32,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:22:32,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 18] total 45 [2024-11-09 01:22:32,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338670867] [2024-11-09 01:22:32,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:22:32,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-09 01:22:32,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:22:32,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-09 01:22:32,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=3255, Unknown=22, NotChecked=854, Total=4422 [2024-11-09 01:22:32,154 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 46 states, 45 states have (on average 2.577777777777778) internal successors, (116), 46 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:22:36,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:22:36,503 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2024-11-09 01:22:36,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 01:22:36,503 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.577777777777778) internal successors, (116), 46 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-11-09 01:22:36,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:22:36,504 INFO L225 Difference]: With dead ends: 64 [2024-11-09 01:22:36,504 INFO L226 Difference]: Without dead ends: 64 [2024-11-09 01:22:36,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 80 SyntacticMatches, 9 SemanticMatches, 76 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1961 ImplicationChecksByTransitivity, 52.4s TimeCoverageRelationStatistics Valid=441, Invalid=4535, Unknown=22, NotChecked=1008, Total=6006 [2024-11-09 01:22:36,506 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 41 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 1208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 406 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:22:36,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 350 Invalid, 1208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 788 Invalid, 0 Unknown, 406 Unchecked, 2.3s Time] [2024-11-09 01:22:36,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-09 01:22:36,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2024-11-09 01:22:36,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 57 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:22:36,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2024-11-09 01:22:36,509 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 44 [2024-11-09 01:22:36,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:22:36,509 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2024-11-09 01:22:36,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.577777777777778) internal successors, (116), 46 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:22:36,510 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2024-11-09 01:22:36,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 01:22:36,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:22:36,511 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:22:36,528 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 01:22:36,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:22:36,711 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 01:22:36,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:22:36,712 INFO L85 PathProgramCache]: Analyzing trace with hash 995226944, now seen corresponding path program 1 times [2024-11-09 01:22:36,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:22:36,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156305301] [2024-11-09 01:22:36,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:22:36,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:22:36,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:22:39,709 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 01:22:39,709 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:22:39,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156305301] [2024-11-09 01:22:39,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156305301] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:22:39,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513645305] [2024-11-09 01:22:39,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:22:39,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:22:39,710 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:22:39,712 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:22:39,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 01:22:39,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:22:39,926 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-11-09 01:22:39,930 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:22:39,945 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 01:22:40,223 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 01:22:40,224 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 01:22:40,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 01:22:40,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 01:22:40,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-09 01:22:40,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-09 01:22:40,809 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 01:22:40,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2024-11-09 01:22:40,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16 [2024-11-09 01:22:42,091 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 01:22:42,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2024-11-09 01:22:42,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16 [2024-11-09 01:22:42,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:22:42,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:22:42,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-09 01:22:42,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:22:42,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:22:42,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 27 [2024-11-09 01:22:43,207 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:22:43,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2024-11-09 01:22:43,288 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:22:43,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 32 [2024-11-09 01:22:43,874 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 01:22:43,874 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:22:46,256 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_70| Int) (v_ArrVal_1356 (Array Int Int)) (v_ArrVal_1355 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_70|) (forall ((v_ArrVal_1360 Int) (v_ArrVal_1357 Int)) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1356) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_70| v_ArrVal_1360) 4) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1355) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_70| v_ArrVal_1357) 4)))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_70| Int) (v_ArrVal_1356 (Array Int Int))) (or (forall ((v_ArrVal_1360 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1356) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_70| v_ArrVal_1360) 4) 4))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_70|))))) is different from false [2024-11-09 01:22:46,394 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_70| Int) (v_ArrVal_1356 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_70|) (forall ((v_ArrVal_1360 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1356) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_70| v_ArrVal_1360) 4) 4))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_70| Int) (v_ArrVal_1356 (Array Int Int)) (v_ArrVal_1355 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_70|) (forall ((v_ArrVal_1360 Int) (v_ArrVal_1357 Int)) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1356) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_70| v_ArrVal_1360) 4) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1355) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_70| v_ArrVal_1357) 4)))))))) is different from false [2024-11-09 01:22:46,506 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_70| Int) (v_ArrVal_1356 (Array Int Int)) (v_ArrVal_1355 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_70|) (forall ((v_ArrVal_1360 Int) (v_ArrVal_1357 Int)) (<= (+ 8 (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1356) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_70| v_ArrVal_1360) 4)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1355) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_70| v_ArrVal_1357) 4)))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_70| Int) (v_ArrVal_1356 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_70|) (forall ((v_ArrVal_1360 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1356) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_70| v_ArrVal_1360) 4) 4))))))) is different from false [2024-11-09 01:22:46,608 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_70| Int) (v_ArrVal_1356 (Array Int Int)) (v_ArrVal_1355 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_70|) (forall ((v_ArrVal_1360 Int) (v_ArrVal_1357 Int)) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1356) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_70| v_ArrVal_1360) 4) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1355) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_70| v_ArrVal_1357) 4)))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_70| Int) (v_ArrVal_1356 (Array Int Int))) (or (forall ((v_ArrVal_1360 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1356) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_70| v_ArrVal_1360) 4) 4))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_70|))))) is different from false [2024-11-09 01:22:46,663 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:22:46,664 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 95 treesize of output 99 [2024-11-09 01:22:46,860 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_70| Int)) (or (forall ((v_ArrVal_1355 (Array Int Int)) (v_ArrVal_1354 (Array Int Int)) (v_ArrVal_1357 Int)) (= (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1354))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_ArrVal_1355)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_70| v_ArrVal_1357) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_70|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_70| Int)) (or (forall ((v_ArrVal_1360 Int) (v_ArrVal_1356 (Array Int Int)) (v_ArrVal_1354 (Array Int Int)) (v_ArrVal_1353 (Array Int Int))) (< (select (store (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1353) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1354) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_ArrVal_1356) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_70| v_ArrVal_1360) 4) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 5))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_70|))) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_4 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int)) (v_prenex_7 (Array Int Int))) (or (< 0 (+ 5 (select (store (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_8) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_7) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_prenex_6) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_5 v_prenex_4) 4))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_5))))) is different from false [2024-11-09 01:22:47,013 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4 0))) (.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4 0)))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_70| Int)) (or (forall ((v_ArrVal_1360 Int) (v_ArrVal_1356 (Array Int Int)) (v_ArrVal_1354 (Array Int Int)) (v_ArrVal_1353 (Array Int Int))) (< (select (store (select (store (store .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1353) (select (select (store .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1354) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) v_ArrVal_1356) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_70| v_ArrVal_1360) 4) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 5))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_70|))) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_4 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int)) (v_prenex_7 (Array Int Int))) (or (< 0 (+ 5 (select (store (select (store (store .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_8) (select (select (store .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_7) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) v_prenex_6) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_5 v_prenex_4) 4))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_5))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_70| Int)) (or (forall ((v_ArrVal_1355 (Array Int Int)) (v_ArrVal_1354 (Array Int Int)) (v_ArrVal_1357 Int)) (= (select (store (select (let ((.cse3 (store .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1354))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) v_ArrVal_1355)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_70| v_ArrVal_1357) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_70|)))))) is different from false [2024-11-09 01:22:47,060 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:22:47,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 63 [2024-11-09 01:22:47,088 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:22:47,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 48 [2024-11-09 01:22:47,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 58 [2024-11-09 01:22:47,111 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 150 treesize of output 142 [2024-11-09 01:22:47,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2024-11-09 01:22:47,148 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 64 treesize of output 62 [2024-11-09 01:22:47,158 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 62 treesize of output 54 [2024-11-09 01:22:47,226 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:22:47,227 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 44 treesize of output 52 [2024-11-09 01:22:47,584 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:22:47,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 63 [2024-11-09 01:22:47,620 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:22:47,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 48 [2024-11-09 01:22:47,627 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:22:47,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 27 [2024-11-09 01:22:47,638 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:22:47,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2024-11-09 01:22:47,655 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:22:47,701 INFO L349 Elim1Store]: treesize reduction 15, result has 21.1 percent of original size [2024-11-09 01:22:47,701 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 24 treesize of output 18 [2024-11-09 01:22:47,744 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:22:47,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 46 [2024-11-09 01:22:47,752 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:22:47,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 50 [2024-11-09 01:22:47,765 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:22:47,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2024-11-09 01:22:47,779 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:22:47,845 INFO L349 Elim1Store]: treesize reduction 11, result has 42.1 percent of original size [2024-11-09 01:22:47,845 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 42 treesize of output 31 [2024-11-09 01:22:48,686 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2024-11-09 01:22:48,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513645305] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:22:48,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1562446912] [2024-11-09 01:22:48,688 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2024-11-09 01:22:48,689 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:22:48,689 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:22:48,689 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:22:48,689 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:22:49,865 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:23:19,328 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4774#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (exists ((|v_ULTIMATE.start_dll_destroy_~head#1.offset_27| Int) (|v_ULTIMATE.start_dll_destroy_~head#1.base_30| Int)) (and (or (not (= |v_ULTIMATE.start_dll_destroy_~head#1.base_30| 0)) (not (= |v_ULTIMATE.start_dll_destroy_~head#1.offset_27| 0))) (or (< (select |#length| |v_ULTIMATE.start_dll_destroy_~head#1.base_30|) (+ |v_ULTIMATE.start_dll_destroy_~head#1.offset_27| 8)) (< (+ |v_ULTIMATE.start_dll_destroy_~head#1.offset_27| 4) 0)))))' at error location [2024-11-09 01:23:19,328 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 01:23:19,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:23:19,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 50 [2024-11-09 01:23:19,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610183862] [2024-11-09 01:23:19,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:23:19,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-11-09 01:23:19,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:23:19,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-09 01:23:19,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=3730, Unknown=31, NotChecked=774, Total=4830 [2024-11-09 01:23:19,332 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand has 51 states, 50 states have (on average 2.54) internal successors, (127), 51 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:23:26,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:23:26,274 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2024-11-09 01:23:26,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 01:23:26,275 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 2.54) internal successors, (127), 51 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-11-09 01:23:26,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:23:26,276 INFO L225 Difference]: With dead ends: 65 [2024-11-09 01:23:26,276 INFO L226 Difference]: Without dead ends: 65 [2024-11-09 01:23:26,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 81 SyntacticMatches, 4 SemanticMatches, 82 ConstructedPredicates, 6 IntricatePredicates, 1 DeprecatedPredicates, 1729 ImplicationChecksByTransitivity, 39.3s TimeCoverageRelationStatistics Valid=483, Invalid=5516, Unknown=31, NotChecked=942, Total=6972 [2024-11-09 01:23:26,278 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 43 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 1058 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 1400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 325 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:23:26,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 497 Invalid, 1400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1058 Invalid, 0 Unknown, 325 Unchecked, 3.3s Time] [2024-11-09 01:23:26,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-09 01:23:26,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 59. [2024-11-09 01:23:26,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 54 states have (on average 1.2037037037037037) internal successors, (65), 58 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:23:26,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2024-11-09 01:23:26,280 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 44 [2024-11-09 01:23:26,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:23:26,281 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2024-11-09 01:23:26,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 2.54) internal successors, (127), 51 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:23:26,281 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2024-11-09 01:23:26,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 01:23:26,282 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:23:26,282 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:23:26,309 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-09 01:23:26,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:23:26,487 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 01:23:26,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:23:26,487 INFO L85 PathProgramCache]: Analyzing trace with hash 995243739, now seen corresponding path program 1 times [2024-11-09 01:23:26,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:23:26,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404049847] [2024-11-09 01:23:26,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:23:26,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:23:26,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:28,522 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 01:23:28,522 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:23:28,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404049847] [2024-11-09 01:23:28,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404049847] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:23:28,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013807927] [2024-11-09 01:23:28,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:23:28,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:23:28,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:23:28,524 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:23:28,525 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 01:23:28,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:28,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-09 01:23:28,738 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:23:28,752 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 01:23:29,043 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 01:23:29,044 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 01:23:29,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 01:23:29,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-09 01:23:29,839 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 01:23:29,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 37 [2024-11-09 01:23:30,782 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 01:23:30,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 37 [2024-11-09 01:23:31,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:23:31,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:23:31,056 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:23:31,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2024-11-09 01:23:31,477 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:23:31,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2024-11-09 01:23:31,654 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 01:23:31,654 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:23:33,020 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_87| Int) (v_ArrVal_1485 Int) (v_ArrVal_1483 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_87|) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_1483) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_87| v_ArrVal_1485) 4) 0)))) is different from false [2024-11-09 01:23:33,119 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_87| Int) (v_ArrVal_1485 Int) (v_ArrVal_1483 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_87|) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1483) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_87| v_ArrVal_1485) 4) 0)))) is different from false [2024-11-09 01:23:35,106 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:23:35,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 47 [2024-11-09 01:23:35,118 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 305 treesize of output 285 [2024-11-09 01:23:35,187 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:23:35,188 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 227 treesize of output 217 [2024-11-09 01:23:35,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:23:35,236 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 83 treesize of output 82 [2024-11-09 01:23:35,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 82 [2024-11-09 01:23:36,279 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-09 01:23:36,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013807927] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:23:36,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [110173354] [2024-11-09 01:23:36,282 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2024-11-09 01:23:36,282 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:23:36,283 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:23:36,283 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:23:36,283 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:23:37,469 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:24:13,862 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5256#(and (exists ((|v_ULTIMATE.start_main_old_#valid#1_10| (Array Int Int))) (not (= |v_ULTIMATE.start_main_old_#valid#1_10| |#valid|))) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_main_#res#1| 0))' at error location [2024-11-09 01:24:13,862 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 01:24:13,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:24:13,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 20] total 49 [2024-11-09 01:24:13,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800594537] [2024-11-09 01:24:13,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:24:13,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-09 01:24:13,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:24:13,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-09 01:24:13,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=4587, Unknown=52, NotChecked=278, Total=5256 [2024-11-09 01:24:13,866 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand has 49 states, 49 states have (on average 2.3877551020408165) internal successors, (117), 49 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:24:19,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:24:19,746 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2024-11-09 01:24:19,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-09 01:24:19,747 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.3877551020408165) internal successors, (117), 49 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-11-09 01:24:19,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:24:19,747 INFO L225 Difference]: With dead ends: 67 [2024-11-09 01:24:19,748 INFO L226 Difference]: Without dead ends: 67 [2024-11-09 01:24:19,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 88 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 2504 ImplicationChecksByTransitivity, 45.6s TimeCoverageRelationStatistics Valid=586, Invalid=7020, Unknown=58, NotChecked=346, Total=8010 [2024-11-09 01:24:19,752 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 62 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 851 mSolverCounterSat, 19 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 851 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 107 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-09 01:24:19,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 510 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 851 Invalid, 1 Unknown, 107 Unchecked, 2.7s Time] [2024-11-09 01:24:19,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-09 01:24:19,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 59. [2024-11-09 01:24:19,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 54 states have (on average 1.1666666666666667) internal successors, (63), 58 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:24:19,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2024-11-09 01:24:19,754 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 44 [2024-11-09 01:24:19,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:24:19,755 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2024-11-09 01:24:19,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.3877551020408165) internal successors, (117), 49 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:24:19,755 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2024-11-09 01:24:19,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 01:24:19,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:24:19,756 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:24:19,777 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-09 01:24:19,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:24:19,956 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 01:24:19,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:24:19,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1364581570, now seen corresponding path program 1 times [2024-11-09 01:24:19,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:24:19,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815933267] [2024-11-09 01:24:19,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:24:19,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:24:19,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:24:22,146 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 01:24:22,146 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:24:22,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815933267] [2024-11-09 01:24:22,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815933267] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:24:22,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908409790] [2024-11-09 01:24:22,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:24:22,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:24:22,147 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:24:22,148 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:24:22,149 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 01:24:22,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:24:22,359 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-09 01:24:22,363 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:24:22,377 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 01:24:22,630 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 01:24:22,631 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 01:24:22,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 01:24:22,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2024-11-09 01:24:23,040 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 01:24:23,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2024-11-09 01:24:23,959 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 01:24:23,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2024-11-09 01:24:24,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:24:24,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:24:24,234 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:24:24,235 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 40 treesize of output 27 [2024-11-09 01:24:24,785 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:24:24,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 32 [2024-11-09 01:24:25,023 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 01:24:25,023 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:24:26,150 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_102| Int) (v_ArrVal_1611 Int) (v_ArrVal_1609 (Array Int Int))) (or (< (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1609) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_102| v_ArrVal_1611) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_102|))) is different from false [2024-11-09 01:24:26,590 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_102| Int) (v_ArrVal_1611 Int) (v_ArrVal_1609 (Array Int Int))) (or (< (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1609) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_102| v_ArrVal_1611) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_102|))) is different from false [2024-11-09 01:24:26,642 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_102| Int) (v_ArrVal_1611 Int) (v_ArrVal_1609 (Array Int Int))) (or (< (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_1609) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_102| v_ArrVal_1611) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_102|))) is different from false [2024-11-09 01:24:26,699 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_102| Int) (v_ArrVal_1611 Int) (v_ArrVal_1609 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_102|) (< (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1609) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_102| v_ArrVal_1611) 4) |c_#StackHeapBarrier|))) is different from false [2024-11-09 01:24:26,730 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_102| Int) (v_ArrVal_1611 Int) (v_ArrVal_1609 (Array Int Int)) (v_ArrVal_1608 (Array Int Int))) (or (< (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1608))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1609)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_102| v_ArrVal_1611) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_102|))) is different from false [2024-11-09 01:24:26,785 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_102| Int) (v_ArrVal_1611 Int) (v_ArrVal_1609 (Array Int Int)) (v_ArrVal_1608 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_102|) (< (select (store (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1608))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1609)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_102| v_ArrVal_1611) 4) |c_#StackHeapBarrier|))) is different from false [2024-11-09 01:24:26,819 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:24:26,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 46 [2024-11-09 01:24:26,828 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 176 treesize of output 162 [2024-11-09 01:24:26,845 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 110 treesize of output 106 [2024-11-09 01:24:26,934 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:24:26,935 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 82 treesize of output 82 [2024-11-09 01:24:26,983 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:24:26,983 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 64 treesize of output 63 [2024-11-09 01:24:28,085 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2024-11-09 01:24:28,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908409790] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:24:28,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1523646143] [2024-11-09 01:24:28,088 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2024-11-09 01:24:28,088 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:24:28,088 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:24:28,088 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:24:28,089 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:24:29,234 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:25:04,587 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5758#(and (exists ((|v_ULTIMATE.start_dll_destroy_~head#1.base_42| Int)) (and (<= 8 (select |#length| |v_ULTIMATE.start_dll_destroy_~head#1.base_42|)) (= (select |#valid| |v_ULTIMATE.start_dll_destroy_~head#1.base_42|) 1) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_destroy_~head#1.base_42|) 4) |ULTIMATE.start_dll_destroy_~temp~1#1.base|) (not (= |v_ULTIMATE.start_dll_destroy_~head#1.base_42| 0)) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_destroy_~head#1.base_42|) 4) |ULTIMATE.start_dll_destroy_~temp~1#1.offset|) (<= |#StackHeapBarrier| |v_ULTIMATE.start_dll_destroy_~head#1.base_42|))) (= |ULTIMATE.start_main_~len~0#1| 2))' at error location [2024-11-09 01:25:04,587 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 01:25:04,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:25:04,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 43 [2024-11-09 01:25:04,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485426630] [2024-11-09 01:25:04,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:25:04,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-09 01:25:04,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:25:04,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-09 01:25:04,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=3132, Unknown=34, NotChecked=714, Total=4160 [2024-11-09 01:25:04,591 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 44 states, 43 states have (on average 2.6511627906976742) internal successors, (114), 44 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:25:08,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:25:08,665 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2024-11-09 01:25:08,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 01:25:08,665 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.6511627906976742) internal successors, (114), 44 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-11-09 01:25:08,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:25:08,666 INFO L225 Difference]: With dead ends: 66 [2024-11-09 01:25:08,666 INFO L226 Difference]: Without dead ends: 66 [2024-11-09 01:25:08,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 91 SyntacticMatches, 5 SemanticMatches, 75 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1616 ImplicationChecksByTransitivity, 41.6s TimeCoverageRelationStatistics Valid=420, Invalid=4540, Unknown=34, NotChecked=858, Total=5852 [2024-11-09 01:25:08,668 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 30 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 322 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:25:08,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 437 Invalid, 988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 658 Invalid, 0 Unknown, 322 Unchecked, 2.0s Time] [2024-11-09 01:25:08,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-09 01:25:08,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2024-11-09 01:25:08,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 59 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:25:08,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2024-11-09 01:25:08,671 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 46 [2024-11-09 01:25:08,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:25:08,671 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2024-11-09 01:25:08,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.6511627906976742) internal successors, (114), 44 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:25:08,672 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2024-11-09 01:25:08,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 01:25:08,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:25:08,672 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:25:08,692 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-09 01:25:08,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:25:08,873 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 01:25:08,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:25:08,873 INFO L85 PathProgramCache]: Analyzing trace with hash 983199090, now seen corresponding path program 2 times [2024-11-09 01:25:08,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:25:08,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652830155] [2024-11-09 01:25:08,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:25:08,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:25:08,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:13,376 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:25:13,376 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:25:13,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652830155] [2024-11-09 01:25:13,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652830155] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:25:13,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597572158] [2024-11-09 01:25:13,377 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 01:25:13,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:25:13,377 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:25:13,379 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:25:13,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-09 01:25:13,843 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-09 01:25:13,843 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 01:25:13,846 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 102 conjuncts are in the unsatisfiable core [2024-11-09 01:25:13,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:25:13,889 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 01:25:13,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 01:25:13,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 01:25:14,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-09 01:25:14,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-09 01:25:14,548 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 01:25:14,548 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 01:25:14,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-09 01:25:14,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-09 01:25:15,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-09 01:25:15,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-11-09 01:25:15,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2024-11-09 01:25:15,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2024-11-09 01:25:15,849 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-09 01:25:15,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 106 treesize of output 74 [2024-11-09 01:25:15,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 49 [2024-11-09 01:25:17,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:25:17,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:25:17,755 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 01:25:17,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 75 [2024-11-09 01:25:17,849 INFO L349 Elim1Store]: treesize reduction 56, result has 29.1 percent of original size [2024-11-09 01:25:17,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 52 [2024-11-09 01:25:18,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:25:18,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:25:18,374 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 01:25:18,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 49 [2024-11-09 01:25:18,398 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 0 case distinctions, treesize of input 45 treesize of output 30 [2024-11-09 01:25:19,358 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 01:25:19,837 INFO L349 Elim1Store]: treesize reduction 33, result has 19.5 percent of original size [2024-11-09 01:25:19,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 84 treesize of output 53 [2024-11-09 01:25:19,917 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:25:19,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2024-11-09 01:25:20,201 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 01:25:20,201 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:25:20,520 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 10 treesize of output 8 [2024-11-09 01:25:35,671 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (.cse4 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse7 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_121| Int) (v_ArrVal_1746 Int)) (or (forall ((v_ArrVal_1751 Int)) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse5 .cse6 v_ArrVal_1746)))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4))) (let ((.cse2 (select (select (store .cse3 .cse1 (store (select .cse3 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_121| v_ArrVal_1751)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4))) (or (forall ((v_ArrVal_1748 Int)) (= (select (select (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_121| v_ArrVal_1748)) .cse2) 4) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2)))))) (< .cse7 |v_ULTIMATE.start_dll_update_at_~head#1.offset_121|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_121| Int) (v_ArrVal_1746 Int)) (or (forall ((v_ArrVal_1751 Int)) (let ((.cse9 (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse5 .cse6 v_ArrVal_1746)))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4))) (store .cse10 .cse11 (store (select .cse10 .cse11) |v_ULTIMATE.start_dll_update_at_~head#1.offset_121| v_ArrVal_1751)))))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse8) (= (select (select .cse9 .cse8) 4) 0))))) (< .cse7 |v_ULTIMATE.start_dll_update_at_~head#1.offset_121|))))))) is different from false [2024-11-09 01:25:37,879 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) (.cse13 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse10 (let ((.cse14 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse13 0)))) (store .cse14 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse14 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))) (.cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse13 0)))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse0 (select (select .cse10 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_121| Int) (v_ArrVal_1746 Int)) (or (< .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_121|) (forall ((v_ArrVal_1751 Int)) (let ((.cse2 (let ((.cse4 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse7 .cse8 v_ArrVal_1746)))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3))) (store .cse4 .cse5 (store (select .cse4 .cse5) |v_ULTIMATE.start_dll_update_at_~head#1.offset_121| v_ArrVal_1751)))))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3))) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) (= (select (select .cse2 .cse1) 4) 0))))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_121| Int) (v_ArrVal_1746 Int)) (or (forall ((v_ArrVal_1751 Int)) (let ((.cse12 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse7 .cse8 v_ArrVal_1746)))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3))) (let ((.cse9 (select (select (store .cse12 .cse11 (store (select .cse12 .cse11) |v_ULTIMATE.start_dll_update_at_~head#1.offset_121| v_ArrVal_1751)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3))) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse9) (forall ((v_ArrVal_1748 Int)) (= (select (select (store .cse10 .cse11 (store (select .cse10 .cse11) |v_ULTIMATE.start_dll_update_at_~head#1.offset_121| v_ArrVal_1748)) .cse9) 4) 0))))))) (< .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_121|))))))) is different from false [2024-11-09 01:25:46,536 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:25:46,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 515 treesize of output 291 [2024-11-09 01:25:46,591 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:25:46,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 42 [2024-11-09 01:25:46,744 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:25:46,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 387 treesize of output 343 [2024-11-09 01:25:46,798 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:25:46,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 475 treesize of output 291 [2024-11-09 01:26:02,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:26:03,797 INFO L349 Elim1Store]: treesize reduction 237, result has 35.8 percent of original size [2024-11-09 01:26:03,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 11 new quantified variables, introduced 28 case distinctions, treesize of input 161407 treesize of output 92521 [2024-11-09 01:26:05,132 INFO L349 Elim1Store]: treesize reduction 63, result has 59.9 percent of original size [2024-11-09 01:26:05,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 8734 treesize of output 8390 [2024-11-09 01:26:05,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 10462 treesize of output 9838 [2024-11-09 01:26:07,615 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:26:07,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 50 [2024-11-09 01:26:07,933 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 61 treesize of output 55 [2024-11-09 01:26:08,313 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:26:08,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 01:26:08,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2024-11-09 01:26:11,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1022 treesize of output 1004 [2024-11-09 01:26:12,216 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 376 treesize of output 366 [2024-11-09 01:26:12,653 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 478 treesize of output 470 [2024-11-09 01:26:13,451 INFO L349 Elim1Store]: treesize reduction 20, result has 64.3 percent of original size [2024-11-09 01:26:13,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 11915 treesize of output 8882 [2024-11-09 01:26:13,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:26:13,744 INFO L224 Elim1Store]: Index analysis took 102 ms [2024-11-09 01:26:14,323 INFO L349 Elim1Store]: treesize reduction 212, result has 44.5 percent of original size [2024-11-09 01:26:14,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 21977 treesize of output 17856 [2024-11-09 01:26:14,597 INFO L349 Elim1Store]: treesize reduction 8, result has 79.5 percent of original size [2024-11-09 01:26:14,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 7555 treesize of output 7196 [2024-11-09 01:26:15,442 INFO L349 Elim1Store]: treesize reduction 176, result has 51.9 percent of original size [2024-11-09 01:26:15,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 4190 treesize of output 4244 [2024-11-09 01:26:15,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 3782 treesize of output 3682 [2024-11-09 01:26:15,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18124 treesize of output 17148 [2024-11-09 01:26:33,360 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:33,361 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:33,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2024-11-09 01:26:33,395 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:33,411 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:33,413 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:33,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2024-11-09 01:26:33,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:26:33,488 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:33,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:26:33,508 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:33,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:26:33,538 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:33,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:26:33,555 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:33,616 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:33,616 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:33,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 18 treesize of output 16 [2024-11-09 01:26:33,713 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:33,714 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:33,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2024-11-09 01:26:33,826 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:33,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 44 treesize of output 42 [2024-11-09 01:26:33,907 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:33,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2024-11-09 01:26:33,984 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:33,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2024-11-09 01:26:34,069 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:34,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2024-11-09 01:26:34,165 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:34,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2024-11-09 01:26:34,256 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:34,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2024-11-09 01:26:34,339 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:34,340 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:34,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2024-11-09 01:26:34,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:26:34,424 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:34,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:26:34,445 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:34,468 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:34,469 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:34,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2024-11-09 01:26:34,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:26:34,529 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:34,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:26:34,556 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:34,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:26:34,578 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:34,639 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:34,640 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:34,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2024-11-09 01:26:34,740 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:34,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2024-11-09 01:26:34,843 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:34,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2024-11-09 01:26:34,930 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:34,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2024-11-09 01:26:35,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:26:35,031 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:35,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:26:35,057 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:35,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:26:35,086 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:35,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:26:35,125 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:35,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:26:35,168 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:35,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:26:35,196 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:35,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:26:35,224 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:35,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:26:35,254 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:35,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:26:35,291 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:35,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:26:35,326 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:35,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 94 [2024-11-09 01:26:35,626 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 4741 treesize of output 4641 [2024-11-09 01:26:38,804 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:38,804 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:38,805 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:38,811 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 01:26:38,818 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:38,819 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:38,819 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:38,825 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 01:26:39,007 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:39,020 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 770 treesize of output 736 [2024-11-09 01:26:39,534 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:39,539 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:39,548 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:39,553 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:39,568 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:39,572 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:39,578 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:39,581 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:39,588 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:39,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:26:39,978 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:39,984 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 01:26:40,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:26:40,018 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:40,024 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 01:26:40,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:26:40,058 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:40,067 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 01:26:40,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:26:40,098 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:40,104 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 63 treesize of output 61 [2024-11-09 01:26:40,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:26:40,177 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:40,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:26:40,224 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:40,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:26:40,251 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:40,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:26:40,277 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:40,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:26:40,295 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:40,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:26:40,324 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:40,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 60 [2024-11-09 01:26:40,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:26:40,406 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:40,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:26:40,427 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:40,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:26:40,446 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:40,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:26:40,465 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:40,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:26:40,490 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:40,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 68 [2024-11-09 01:26:40,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:26:40,546 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:40,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:26:40,565 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:40,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:26:40,593 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:40,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:26:40,629 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:40,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:26:40,675 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:40,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:26:40,700 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:40,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:26:40,730 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:40,777 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:40,875 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:26:40,918 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 3332 treesize of output 3178 [2024-11-09 01:26:43,084 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-11-09 01:26:43,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597572158] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:26:43,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1760264974] [2024-11-09 01:26:43,086 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2024-11-09 01:26:43,086 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:26:43,086 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:26:43,087 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:26:43,087 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:26:44,092 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:27:29,421 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6286#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (exists ((|v_ULTIMATE.start_dll_destroy_~head#1.base_49| Int)) (and (not (= (select |#valid| |v_ULTIMATE.start_dll_destroy_~head#1.base_49|) 1)) (or (not (= |v_ULTIMATE.start_dll_destroy_~head#1.base_49| 0)) (not (= |ULTIMATE.start_dll_destroy_~head#1.offset| 0))))))' at error location [2024-11-09 01:27:29,421 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 01:27:29,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:27:29,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22, 23] total 58 [2024-11-09 01:27:29,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124909292] [2024-11-09 01:27:29,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:27:29,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2024-11-09 01:27:29,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:27:29,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2024-11-09 01:27:29,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=324, Invalid=5335, Unknown=49, NotChecked=298, Total=6006 [2024-11-09 01:27:29,425 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 59 states, 59 states have (on average 2.305084745762712) internal successors, (136), 58 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:27:38,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:27:38,163 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2024-11-09 01:27:38,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-09 01:27:38,164 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 2.305084745762712) internal successors, (136), 58 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-09 01:27:38,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:27:38,164 INFO L225 Difference]: With dead ends: 100 [2024-11-09 01:27:38,164 INFO L226 Difference]: Without dead ends: 100 [2024-11-09 01:27:38,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2612 ImplicationChecksByTransitivity, 93.2s TimeCoverageRelationStatistics Valid=462, Invalid=7322, Unknown=56, NotChecked=350, Total=8190 [2024-11-09 01:27:38,167 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 35 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 948 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 1080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 123 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:27:38,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 589 Invalid, 1080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 948 Invalid, 0 Unknown, 123 Unchecked, 5.4s Time] [2024-11-09 01:27:38,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-09 01:27:38,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2024-11-09 01:27:38,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 93 states have (on average 1.1290322580645162) internal successors, (105), 97 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:27:38,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2024-11-09 01:27:38,171 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 50 [2024-11-09 01:27:38,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:27:38,171 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2024-11-09 01:27:38,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 2.305084745762712) internal successors, (136), 58 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:27:38,171 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2024-11-09 01:27:38,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 01:27:38,172 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:27:38,172 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:27:38,192 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-09 01:27:38,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-09 01:27:38,373 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 01:27:38,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:27:38,373 INFO L85 PathProgramCache]: Analyzing trace with hash 983215886, now seen corresponding path program 2 times [2024-11-09 01:27:38,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:27:38,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509896890] [2024-11-09 01:27:38,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:38,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:27:38,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:40,331 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 01:27:40,331 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:27:40,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509896890] [2024-11-09 01:27:40,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509896890] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:27:40,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226876848] [2024-11-09 01:27:40,332 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 01:27:40,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:27:40,332 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:27:40,333 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:27:40,334 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-09 01:27:40,756 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-09 01:27:40,756 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 01:27:40,758 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-11-09 01:27:40,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:27:41,088 INFO L349 Elim1Store]: treesize reduction 34, result has 30.6 percent of original size [2024-11-09 01:27:41,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 39 [2024-11-09 01:27:41,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 01:27:41,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-09 01:27:41,781 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 01:27:41,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 49 [2024-11-09 01:27:42,946 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 01:27:42,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 49 [2024-11-09 01:27:43,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:27:43,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:27:43,290 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:27:43,290 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 53 treesize of output 36 [2024-11-09 01:27:43,677 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:27:43,677 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 45 treesize of output 25 [2024-11-09 01:27:43,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 37 [2024-11-09 01:27:44,249 INFO L349 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2024-11-09 01:27:44,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 26 treesize of output 44 [2024-11-09 01:27:44,489 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 01:27:44,489 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:27:44,737 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1884 Int)) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_1884)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2024-11-09 01:27:44,775 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_138| Int)) (or (= |c_ULTIMATE.start_main_old_#valid#1| (store (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) 0)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_138|))) is different from false [2024-11-09 01:27:44,796 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1882 (Array Int Int))) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1882) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2024-11-09 01:27:44,816 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1882 (Array Int Int))) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_1882) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2024-11-09 01:27:44,843 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1882 (Array Int Int))) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) v_ArrVal_1882) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2024-11-09 01:27:44,863 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1882 (Array Int Int))) (= (store (store |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base| 0) (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse0) v_ArrVal_1882) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse0)) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2024-11-09 01:27:44,882 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1882 (Array Int Int))) (= |c_ULTIMATE.start_main_old_#valid#1| (store (store |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0) (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) v_ArrVal_1882) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0)) 0))) is different from false [2024-11-09 01:27:44,896 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1882 (Array Int Int)) (v_ArrVal_1881 (Array Int Int))) (= (store (store |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0) (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1881))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_ArrVal_1882)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1)) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2024-11-09 01:27:44,917 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1882 (Array Int Int)) (v_ArrVal_1881 (Array Int Int))) (= (store (store |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0) (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1881))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_ArrVal_1882)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1)) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2024-11-09 01:27:44,944 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:27:44,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 55 [2024-11-09 01:27:44,957 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:27:44,957 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 368 treesize of output 308 [2024-11-09 01:27:44,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2024-11-09 01:27:44,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 87 [2024-11-09 01:27:48,359 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 12 not checked. [2024-11-09 01:27:48,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226876848] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:27:48,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1804375676] [2024-11-09 01:27:48,361 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2024-11-09 01:27:48,361 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:27:48,362 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:27:48,362 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:27:48,362 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:27:49,239 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:28:18,508 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6869#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (exists ((|v_ULTIMATE.start_main_old_#valid#1_11| (Array Int Int))) (not (= |v_ULTIMATE.start_main_old_#valid#1_11| |#valid|))) (= |ULTIMATE.start_main_#res#1| 0))' at error location [2024-11-09 01:28:18,508 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 01:28:18,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:28:18,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 18] total 44 [2024-11-09 01:28:18,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602918225] [2024-11-09 01:28:18,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:28:18,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-09 01:28:18,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:28:18,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-09 01:28:18,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=2973, Unknown=18, NotChecked=1062, Total=4290 [2024-11-09 01:28:18,510 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand has 46 states, 45 states have (on average 2.8666666666666667) internal successors, (129), 45 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:28:21,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:21,376 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2024-11-09 01:28:21,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 01:28:21,377 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.8666666666666667) internal successors, (129), 45 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-09 01:28:21,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:21,377 INFO L225 Difference]: With dead ends: 100 [2024-11-09 01:28:21,378 INFO L226 Difference]: Without dead ends: 69 [2024-11-09 01:28:21,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 103 SyntacticMatches, 9 SemanticMatches, 67 ConstructedPredicates, 9 IntricatePredicates, 1 DeprecatedPredicates, 1289 ImplicationChecksByTransitivity, 34.5s TimeCoverageRelationStatistics Valid=262, Invalid=3296, Unknown=18, NotChecked=1116, Total=4692 [2024-11-09 01:28:21,379 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 10 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 1208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 562 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:28:21,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 588 Invalid, 1208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 645 Invalid, 1 Unknown, 562 Unchecked, 2.0s Time] [2024-11-09 01:28:21,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-09 01:28:21,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-09 01:28:21,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 64 states have (on average 1.140625) internal successors, (73), 68 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:28:21,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2024-11-09 01:28:21,381 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 50 [2024-11-09 01:28:21,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:21,381 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2024-11-09 01:28:21,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.8666666666666667) internal successors, (129), 45 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:28:21,381 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2024-11-09 01:28:21,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-09 01:28:21,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:21,382 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:28:21,405 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-09 01:28:21,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-09 01:28:21,583 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 01:28:21,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:21,583 INFO L85 PathProgramCache]: Analyzing trace with hash 655477433, now seen corresponding path program 3 times [2024-11-09 01:28:21,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:28:21,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081387773] [2024-11-09 01:28:21,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:21,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:28:21,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:21,803 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 19 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-09 01:28:21,803 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:28:21,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081387773] [2024-11-09 01:28:21,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081387773] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:28:21,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678577899] [2024-11-09 01:28:21,804 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 01:28:21,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:28:21,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:28:21,806 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:28:21,808 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-09 01:28:22,433 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 01:28:22,433 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 01:28:22,435 INFO L255 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 01:28:22,436 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:28:22,563 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-09 01:28:22,563 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:28:22,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678577899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:28:22,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:28:22,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2024-11-09 01:28:22,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132584937] [2024-11-09 01:28:22,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:28:22,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:28:22,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:28:22,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:28:22,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:28:22,566 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:28:22,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:22,629 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2024-11-09 01:28:22,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:28:22,630 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-11-09 01:28:22,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:22,631 INFO L225 Difference]: With dead ends: 19 [2024-11-09 01:28:22,631 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 01:28:22,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:28:22,632 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:28:22,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:28:22,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 01:28:22,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 01:28:22,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:28:22,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 01:28:22,634 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 59 [2024-11-09 01:28:22,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:22,634 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 01:28:22,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:28:22,634 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 01:28:22,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 01:28:22,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 23 remaining) [2024-11-09 01:28:22,638 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 23 remaining) [2024-11-09 01:28:22,638 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 23 remaining) [2024-11-09 01:28:22,638 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 23 remaining) [2024-11-09 01:28:22,639 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 23 remaining) [2024-11-09 01:28:22,639 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 23 remaining) [2024-11-09 01:28:22,639 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 23 remaining) [2024-11-09 01:28:22,639 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 23 remaining) [2024-11-09 01:28:22,639 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 23 remaining) [2024-11-09 01:28:22,639 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 23 remaining) [2024-11-09 01:28:22,640 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 23 remaining) [2024-11-09 01:28:22,640 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 23 remaining) [2024-11-09 01:28:22,640 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 23 remaining) [2024-11-09 01:28:22,640 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 23 remaining) [2024-11-09 01:28:22,640 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 23 remaining) [2024-11-09 01:28:22,640 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 23 remaining) [2024-11-09 01:28:22,640 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 23 remaining) [2024-11-09 01:28:22,641 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 23 remaining) [2024-11-09 01:28:22,641 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (4 of 23 remaining) [2024-11-09 01:28:22,641 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE (3 of 23 remaining) [2024-11-09 01:28:22,641 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE (2 of 23 remaining) [2024-11-09 01:28:22,641 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK (1 of 23 remaining) [2024-11-09 01:28:22,641 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK (0 of 23 remaining) [2024-11-09 01:28:22,667 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-09 01:28:22,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-09 01:28:22,846 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:28:22,849 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 01:28:22,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 01:28:22 BoogieIcfgContainer [2024-11-09 01:28:22,857 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 01:28:22,858 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 01:28:22,858 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 01:28:22,858 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 01:28:22,858 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:18:28" (3/4) ... [2024-11-09 01:28:22,861 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 01:28:22,865 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2024-11-09 01:28:22,872 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2024-11-09 01:28:22,873 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-11-09 01:28:22,874 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 01:28:22,874 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 01:28:22,991 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/witness.graphml [2024-11-09 01:28:22,992 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/witness.yml [2024-11-09 01:28:22,992 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 01:28:22,993 INFO L158 Benchmark]: Toolchain (without parser) took 595505.07ms. Allocated memory was 167.8MB in the beginning and 645.9MB in the end (delta: 478.2MB). Free memory was 134.5MB in the beginning and 271.9MB in the end (delta: -137.4MB). Peak memory consumption was 342.4MB. Max. memory is 16.1GB. [2024-11-09 01:28:22,994 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 123.7MB. Free memory is still 67.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:28:22,994 INFO L158 Benchmark]: CACSL2BoogieTranslator took 659.99ms. Allocated memory is still 167.8MB. Free memory was 133.9MB in the beginning and 114.2MB in the end (delta: 19.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 01:28:22,994 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.82ms. Allocated memory is still 167.8MB. Free memory was 114.2MB in the beginning and 112.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 01:28:22,994 INFO L158 Benchmark]: Boogie Preprocessor took 37.87ms. Allocated memory is still 167.8MB. Free memory was 112.1MB in the beginning and 110.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 01:28:22,995 INFO L158 Benchmark]: RCFGBuilder took 719.22ms. Allocated memory is still 167.8MB. Free memory was 110.2MB in the beginning and 86.9MB in the end (delta: 23.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-09 01:28:22,995 INFO L158 Benchmark]: TraceAbstraction took 593871.45ms. Allocated memory was 167.8MB in the beginning and 645.9MB in the end (delta: 478.2MB). Free memory was 85.7MB in the beginning and 278.2MB in the end (delta: -192.6MB). Peak memory consumption was 287.9MB. Max. memory is 16.1GB. [2024-11-09 01:28:22,995 INFO L158 Benchmark]: Witness Printer took 134.54ms. Allocated memory is still 645.9MB. Free memory was 278.2MB in the beginning and 271.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 01:28:23,000 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 123.7MB. Free memory is still 67.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 659.99ms. Allocated memory is still 167.8MB. Free memory was 133.9MB in the beginning and 114.2MB in the end (delta: 19.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.82ms. Allocated memory is still 167.8MB. Free memory was 114.2MB in the beginning and 112.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.87ms. Allocated memory is still 167.8MB. Free memory was 112.1MB in the beginning and 110.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 719.22ms. Allocated memory is still 167.8MB. Free memory was 110.2MB in the beginning and 86.9MB in the end (delta: 23.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 593871.45ms. Allocated memory was 167.8MB in the beginning and 645.9MB in the end (delta: 478.2MB). Free memory was 85.7MB in the beginning and 278.2MB in the end (delta: -192.6MB). Peak memory consumption was 287.9MB. Max. memory is 16.1GB. * Witness Printer took 134.54ms. Allocated memory is still 645.9MB. Free memory was 278.2MB in the beginning and 271.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 606]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 606]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 606]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 12]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 624]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 65 locations, 23 error locations. Started 1 CEGAR loops. OverallTime: 593.8s, OverallIterations: 26, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 99.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 16 mSolverCounterUnknown, 728 SdHoareTripleChecker+Valid, 46.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 728 mSDsluCounter, 6303 SdHoareTripleChecker+Invalid, 44.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2069 IncrementalHoareTripleChecker+Unchecked, 5469 mSDsCounter, 135 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7639 IncrementalHoareTripleChecker+Invalid, 9859 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 135 mSolverCounterUnsat, 834 mSDtfsCounter, 7639 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1804 GetRequests, 1023 SyntacticMatches, 52 SemanticMatches, 729 ConstructedPredicates, 36 IntricatePredicates, 3 DeprecatedPredicates, 13567 ImplicationChecksByTransitivity, 442.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=24, InterpolantAutomatonStates: 257, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 26 MinimizatonAttempts, 101 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 155.6s InterpolantComputationTime, 1335 NumberOfCodeBlocks, 1327 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 1749 ConstructedInterpolants, 175 QuantifiedInterpolants, 34880 SizeOfPredicates, 61 NumberOfNonLiveVariables, 3926 ConjunctsInSsa, 533 ConjunctsInUnsatCore, 53 InterpolantComputations, 13 PerfectInterpolantSequences, 461/906 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: OVERALL_TIME: 2.4s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 2, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 25, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 55, TOOLS_POST_TIME: 1.7s, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME: 0.0s, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME: 0.0s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 55, TOOLS_QUANTIFIERELIM_TIME: 1.7s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.1s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 85, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 11, DOMAIN_JOIN_TIME: 0.3s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 1, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 3, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 25, DOMAIN_ISBOTTOM_TIME: 0.2s, LOOP_SUMMARIZER_APPLICATIONS: 2, LOOP_SUMMARIZER_CACHE_MISSES: 2, LOOP_SUMMARIZER_OVERALL_TIME: 0.7s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.7s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 3, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 418, DAG_COMPRESSION_RETAINED_NODES: 90, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 23 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-09 01:28:23,215 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2024-11-09 01:28:23,231 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_597fc877-7b78-43ae-b0d9-d0b295334ca6/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE