./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext-properties/test-0513_1.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_63998fbf-0d08-484b-8914-064e59d2e1f3/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63998fbf-0d08-484b-8914-064e59d2e1f3/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_63998fbf-0d08-484b-8914-064e59d2e1f3/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63998fbf-0d08-484b-8914-064e59d2e1f3/bin/utaipan-verify-YMUCfTKeje/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0513_1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63998fbf-0d08-484b-8914-064e59d2e1f3/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_63998fbf-0d08-484b-8914-064e59d2e1f3/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 2cd9310cc22b48510db29915dc2047c5968d5424a204e513aea9283dac5ac7bf --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 06:09:13,503 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:09:13,602 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63998fbf-0d08-484b-8914-064e59d2e1f3/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-09 06:09:13,609 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:09:13,610 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:09:13,636 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:09:13,637 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:09:13,637 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:09:13,638 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:09:13,638 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:09:13,638 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 06:09:13,639 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 06:09:13,639 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 06:09:13,640 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 06:09:13,640 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 06:09:13,640 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 06:09:13,641 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 06:09:13,641 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 06:09:13,641 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 06:09:13,642 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 06:09:13,642 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 06:09:13,643 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 06:09:13,643 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 06:09:13,644 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 06:09:13,644 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:09:13,644 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:09:13,645 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:09:13,645 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:09:13,646 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:09:13,646 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 06:09:13,646 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 06:09:13,647 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 06:09:13,647 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:09:13,647 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 06:09:13,648 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:09:13,648 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 06:09:13,648 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:09:13,649 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:09:13,649 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:09:13,649 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 06:09:13,650 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:09:13,650 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:09:13,651 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:09:13,651 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:09:13,651 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 06:09:13,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:09:13,652 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:09:13,652 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 06:09:13,653 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:09:13,653 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_63998fbf-0d08-484b-8914-064e59d2e1f3/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_63998fbf-0d08-484b-8914-064e59d2e1f3/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 -> 2cd9310cc22b48510db29915dc2047c5968d5424a204e513aea9283dac5ac7bf [2024-11-09 06:09:13,908 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:09:13,940 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:09:13,943 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:09:13,945 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:09:13,945 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:09:13,947 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63998fbf-0d08-484b-8914-064e59d2e1f3/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/list-ext-properties/test-0513_1.i Unable to find full path for "g++" [2024-11-09 06:09:15,991 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:09:16,260 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:09:16,261 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63998fbf-0d08-484b-8914-064e59d2e1f3/sv-benchmarks/c/list-ext-properties/test-0513_1.i [2024-11-09 06:09:16,274 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63998fbf-0d08-484b-8914-064e59d2e1f3/bin/utaipan-verify-YMUCfTKeje/data/cdefe1ab6/b2ee922ddb814a23b7a70b7efa47281c/FLAG0beed3d2e [2024-11-09 06:09:16,565 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63998fbf-0d08-484b-8914-064e59d2e1f3/bin/utaipan-verify-YMUCfTKeje/data/cdefe1ab6/b2ee922ddb814a23b7a70b7efa47281c [2024-11-09 06:09:16,567 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:09:16,569 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:09:16,570 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:09:16,570 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:09:16,576 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:09:16,577 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:09:16" (1/1) ... [2024-11-09 06:09:16,580 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fe59d5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:09:16, skipping insertion in model container [2024-11-09 06:09:16,580 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:09:16" (1/1) ... [2024-11-09 06:09:16,636 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:09:17,017 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:09:17,028 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:09:17,105 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:09:17,146 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:09:17,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:09:17 WrapperNode [2024-11-09 06:09:17,147 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:09:17,148 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:09:17,148 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:09:17,148 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:09:17,156 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:09:17" (1/1) ... [2024-11-09 06:09:17,177 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:09:17" (1/1) ... [2024-11-09 06:09:17,215 INFO L138 Inliner]: procedures = 123, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 145 [2024-11-09 06:09:17,215 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:09:17,216 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:09:17,216 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:09:17,216 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:09:17,225 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:09:17" (1/1) ... [2024-11-09 06:09:17,225 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:09:17" (1/1) ... [2024-11-09 06:09:17,228 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:09:17" (1/1) ... [2024-11-09 06:09:17,229 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:09:17" (1/1) ... [2024-11-09 06:09:17,237 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:09:17" (1/1) ... [2024-11-09 06:09:17,240 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:09:17" (1/1) ... [2024-11-09 06:09:17,242 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:09:17" (1/1) ... [2024-11-09 06:09:17,243 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:09:17" (1/1) ... [2024-11-09 06:09:17,246 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:09:17,247 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:09:17,247 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:09:17,247 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:09:17,248 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:09:17" (1/1) ... [2024-11-09 06:09:17,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:09:17,268 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63998fbf-0d08-484b-8914-064e59d2e1f3/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:09:17,287 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63998fbf-0d08-484b-8914-064e59d2e1f3/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 06:09:17,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63998fbf-0d08-484b-8914-064e59d2e1f3/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 06:09:17,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 06:09:17,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 06:09:17,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 06:09:17,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:09:17,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 06:09:17,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 06:09:17,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 06:09:17,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 06:09:17,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:09:17,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:09:17,449 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:09:17,451 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:09:17,923 INFO L? ?]: Removed 163 outVars from TransFormulas that were not future-live. [2024-11-09 06:09:17,923 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:09:18,001 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:09:18,002 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 06:09:18,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:09:18 BoogieIcfgContainer [2024-11-09 06:09:18,002 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:09:18,005 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:09:18,005 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:09:18,008 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:09:18,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:09:16" (1/3) ... [2024-11-09 06:09:18,009 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19dcf7b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:09:18, skipping insertion in model container [2024-11-09 06:09:18,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:09:17" (2/3) ... [2024-11-09 06:09:18,010 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19dcf7b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:09:18, skipping insertion in model container [2024-11-09 06:09:18,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:09:18" (3/3) ... [2024-11-09 06:09:18,012 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0513_1.i [2024-11-09 06:09:18,029 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:09:18,030 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 70 error locations. [2024-11-09 06:09:18,112 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:09:18,119 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;@198374bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:09:18,119 INFO L334 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2024-11-09 06:09:18,124 INFO L276 IsEmpty]: Start isEmpty. Operand has 132 states, 61 states have (on average 2.442622950819672) internal successors, (149), 131 states have internal predecessors, (149), 0 states have call successors, (0), 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 06:09:18,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 06:09:18,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:09:18,132 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 06:09:18,133 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-11-09 06:09:18,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:09:18,140 INFO L85 PathProgramCache]: Analyzing trace with hash 8927660, now seen corresponding path program 1 times [2024-11-09 06:09:18,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:09:18,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876316141] [2024-11-09 06:09:18,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:09:18,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:09:18,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:09:18,284 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 06:09:18,285 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:09:18,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876316141] [2024-11-09 06:09:18,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876316141] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:09:18,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:09:18,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:09:18,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875154525] [2024-11-09 06:09:18,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:09:18,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 06:09:18,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:09:18,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 06:09:18,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 06:09:18,332 INFO L87 Difference]: Start difference. First operand has 132 states, 61 states have (on average 2.442622950819672) internal successors, (149), 131 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:09:18,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:09:18,398 INFO L93 Difference]: Finished difference Result 132 states and 147 transitions. [2024-11-09 06:09:18,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 06:09:18,401 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-09 06:09:18,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:09:18,409 INFO L225 Difference]: With dead ends: 132 [2024-11-09 06:09:18,409 INFO L226 Difference]: Without dead ends: 131 [2024-11-09 06:09:18,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 06:09:18,414 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:09:18,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 06:09:18,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-09 06:09:18,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-11-09 06:09:18,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 61 states have (on average 2.3934426229508197) internal successors, (146), 130 states have internal predecessors, (146), 0 states have call successors, (0), 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 06:09:18,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 146 transitions. [2024-11-09 06:09:18,452 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 146 transitions. Word has length 4 [2024-11-09 06:09:18,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:09:18,453 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 146 transitions. [2024-11-09 06:09:18,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:09:18,453 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 146 transitions. [2024-11-09 06:09:18,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 06:09:18,454 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:09:18,454 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 06:09:18,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 06:09:18,455 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-11-09 06:09:18,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:09:18,456 INFO L85 PathProgramCache]: Analyzing trace with hash 9117838, now seen corresponding path program 1 times [2024-11-09 06:09:18,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:09:18,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002217794] [2024-11-09 06:09:18,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:09:18,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:09:18,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:09:18,623 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 06:09:18,623 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:09:18,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002217794] [2024-11-09 06:09:18,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002217794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:09:18,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:09:18,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:09:18,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309024803] [2024-11-09 06:09:18,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:09:18,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:09:18,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:09:18,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:09:18,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:09:18,628 INFO L87 Difference]: Start difference. First operand 131 states and 146 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:09:18,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:09:18,856 INFO L93 Difference]: Finished difference Result 136 states and 155 transitions. [2024-11-09 06:09:18,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:09:18,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-09 06:09:18,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:09:18,859 INFO L225 Difference]: With dead ends: 136 [2024-11-09 06:09:18,861 INFO L226 Difference]: Without dead ends: 136 [2024-11-09 06:09:18,862 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 06:09:18,863 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 50 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:09:18,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 136 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:09:18,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-09 06:09:18,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 130. [2024-11-09 06:09:18,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 65 states have (on average 2.3076923076923075) internal successors, (150), 129 states have internal predecessors, (150), 0 states have call successors, (0), 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 06:09:18,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 150 transitions. [2024-11-09 06:09:18,875 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 150 transitions. Word has length 4 [2024-11-09 06:09:18,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:09:18,875 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 150 transitions. [2024-11-09 06:09:18,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:09:18,876 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 150 transitions. [2024-11-09 06:09:18,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 06:09:18,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:09:18,876 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 06:09:18,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 06:09:18,877 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-11-09 06:09:18,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:09:18,877 INFO L85 PathProgramCache]: Analyzing trace with hash 9117839, now seen corresponding path program 1 times [2024-11-09 06:09:18,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:09:18,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644775292] [2024-11-09 06:09:18,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:09:18,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:09:18,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:09:19,055 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 06:09:19,055 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:09:19,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644775292] [2024-11-09 06:09:19,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644775292] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:09:19,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:09:19,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:09:19,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159063781] [2024-11-09 06:09:19,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:09:19,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:09:19,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:09:19,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:09:19,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:09:19,060 INFO L87 Difference]: Start difference. First operand 130 states and 150 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:09:19,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:09:19,233 INFO L93 Difference]: Finished difference Result 126 states and 146 transitions. [2024-11-09 06:09:19,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:09:19,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-09 06:09:19,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:09:19,235 INFO L225 Difference]: With dead ends: 126 [2024-11-09 06:09:19,235 INFO L226 Difference]: Without dead ends: 126 [2024-11-09 06:09:19,235 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 06:09:19,237 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 26 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:09:19,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 157 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:09:19,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-09 06:09:19,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-09 06:09:19,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 65 states have (on average 2.246153846153846) internal successors, (146), 125 states have internal predecessors, (146), 0 states have call successors, (0), 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 06:09:19,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 146 transitions. [2024-11-09 06:09:19,255 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 146 transitions. Word has length 4 [2024-11-09 06:09:19,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:09:19,255 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 146 transitions. [2024-11-09 06:09:19,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:09:19,259 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 146 transitions. [2024-11-09 06:09:19,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 06:09:19,259 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:09:19,259 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 06:09:19,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 06:09:19,260 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-11-09 06:09:19,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:09:19,261 INFO L85 PathProgramCache]: Analyzing trace with hash 282406157, now seen corresponding path program 1 times [2024-11-09 06:09:19,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:09:19,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914038001] [2024-11-09 06:09:19,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:09:19,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:09:19,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:09:19,296 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 06:09:19,296 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:09:19,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914038001] [2024-11-09 06:09:19,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914038001] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:09:19,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:09:19,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 06:09:19,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963326492] [2024-11-09 06:09:19,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:09:19,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:09:19,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:09:19,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:09:19,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:09:19,299 INFO L87 Difference]: Start difference. First operand 126 states and 146 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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 06:09:19,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:09:19,447 INFO L93 Difference]: Finished difference Result 167 states and 189 transitions. [2024-11-09 06:09:19,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:09:19,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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 06:09:19,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:09:19,449 INFO L225 Difference]: With dead ends: 167 [2024-11-09 06:09:19,449 INFO L226 Difference]: Without dead ends: 166 [2024-11-09 06:09:19,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 06:09:19,451 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 37 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:09:19,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 173 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:09:19,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-09 06:09:19,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 129. [2024-11-09 06:09:19,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 68 states have (on average 2.2058823529411766) internal successors, (150), 128 states have internal predecessors, (150), 0 states have call successors, (0), 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 06:09:19,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 150 transitions. [2024-11-09 06:09:19,469 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 150 transitions. Word has length 5 [2024-11-09 06:09:19,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:09:19,470 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 150 transitions. [2024-11-09 06:09:19,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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 06:09:19,470 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 150 transitions. [2024-11-09 06:09:19,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 06:09:19,471 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:09:19,471 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 06:09:19,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 06:09:19,472 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-11-09 06:09:19,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:09:19,472 INFO L85 PathProgramCache]: Analyzing trace with hash 282406061, now seen corresponding path program 1 times [2024-11-09 06:09:19,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:09:19,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149690554] [2024-11-09 06:09:19,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:09:19,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:09:19,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:09:19,527 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 06:09:19,528 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:09:19,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149690554] [2024-11-09 06:09:19,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149690554] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:09:19,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:09:19,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:09:19,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905920525] [2024-11-09 06:09:19,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:09:19,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:09:19,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:09:19,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:09:19,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:09:19,534 INFO L87 Difference]: Start difference. First operand 129 states and 150 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 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 06:09:19,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:09:19,637 INFO L93 Difference]: Finished difference Result 138 states and 161 transitions. [2024-11-09 06:09:19,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:09:19,638 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 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 06:09:19,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:09:19,639 INFO L225 Difference]: With dead ends: 138 [2024-11-09 06:09:19,639 INFO L226 Difference]: Without dead ends: 137 [2024-11-09 06:09:19,640 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 06:09:19,641 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 12 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:09:19,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 198 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:09:19,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-09 06:09:19,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-11-09 06:09:19,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 76 states have (on average 2.1052631578947367) internal successors, (160), 136 states have internal predecessors, (160), 0 states have call successors, (0), 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 06:09:19,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 160 transitions. [2024-11-09 06:09:19,648 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 160 transitions. Word has length 5 [2024-11-09 06:09:19,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:09:19,648 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 160 transitions. [2024-11-09 06:09:19,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 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 06:09:19,648 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 160 transitions. [2024-11-09 06:09:19,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 06:09:19,649 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:09:19,649 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:09:19,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 06:09:19,650 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-11-09 06:09:19,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:09:19,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1392308538, now seen corresponding path program 1 times [2024-11-09 06:09:19,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:09:19,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830687557] [2024-11-09 06:09:19,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:09:19,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:09:19,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:09:19,770 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 06:09:19,770 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:09:19,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830687557] [2024-11-09 06:09:19,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830687557] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:09:19,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:09:19,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:09:19,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851300128] [2024-11-09 06:09:19,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:09:19,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:09:19,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:09:19,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:09:19,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:09:19,776 INFO L87 Difference]: Start difference. First operand 137 states and 160 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:09:19,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:09:19,893 INFO L93 Difference]: Finished difference Result 259 states and 296 transitions. [2024-11-09 06:09:19,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:09:19,895 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-09 06:09:19,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:09:19,896 INFO L225 Difference]: With dead ends: 259 [2024-11-09 06:09:19,896 INFO L226 Difference]: Without dead ends: 259 [2024-11-09 06:09:19,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:09:19,897 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 131 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:09:19,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 338 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:09:19,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-11-09 06:09:19,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 140. [2024-11-09 06:09:19,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 79 states have (on average 2.0253164556962027) internal successors, (160), 139 states have internal predecessors, (160), 0 states have call successors, (0), 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 06:09:19,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 160 transitions. [2024-11-09 06:09:19,912 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 160 transitions. Word has length 10 [2024-11-09 06:09:19,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:09:19,912 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 160 transitions. [2024-11-09 06:09:19,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:09:19,916 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 160 transitions. [2024-11-09 06:09:19,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 06:09:19,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:09:19,916 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:09:19,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 06:09:19,917 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-11-09 06:09:19,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:09:19,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1039582472, now seen corresponding path program 1 times [2024-11-09 06:09:19,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:09:19,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296938890] [2024-11-09 06:09:19,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:09:19,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:09:19,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:09:20,031 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 06:09:20,032 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:09:20,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296938890] [2024-11-09 06:09:20,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296938890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:09:20,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:09:20,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:09:20,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079387525] [2024-11-09 06:09:20,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:09:20,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:09:20,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:09:20,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:09:20,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:09:20,034 INFO L87 Difference]: Start difference. First operand 140 states and 160 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:09:20,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:09:20,140 INFO L93 Difference]: Finished difference Result 136 states and 156 transitions. [2024-11-09 06:09:20,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:09:20,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-09 06:09:20,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:09:20,141 INFO L225 Difference]: With dead ends: 136 [2024-11-09 06:09:20,141 INFO L226 Difference]: Without dead ends: 136 [2024-11-09 06:09:20,142 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 06:09:20,142 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 15 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:09:20,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 160 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:09:20,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-09 06:09:20,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-11-09 06:09:20,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 79 states have (on average 1.9746835443037976) internal successors, (156), 135 states have internal predecessors, (156), 0 states have call successors, (0), 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 06:09:20,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 156 transitions. [2024-11-09 06:09:20,148 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 156 transitions. Word has length 13 [2024-11-09 06:09:20,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:09:20,148 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 156 transitions. [2024-11-09 06:09:20,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:09:20,148 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 156 transitions. [2024-11-09 06:09:20,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 06:09:20,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:09:20,149 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:09:20,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 06:09:20,149 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-11-09 06:09:20,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:09:20,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1039582473, now seen corresponding path program 1 times [2024-11-09 06:09:20,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:09:20,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189926732] [2024-11-09 06:09:20,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:09:20,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:09:20,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:09:20,283 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 06:09:20,284 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:09:20,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189926732] [2024-11-09 06:09:20,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189926732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:09:20,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:09:20,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:09:20,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574131633] [2024-11-09 06:09:20,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:09:20,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:09:20,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:09:20,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:09:20,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:09:20,286 INFO L87 Difference]: Start difference. First operand 136 states and 156 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:09:20,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:09:20,393 INFO L93 Difference]: Finished difference Result 133 states and 153 transitions. [2024-11-09 06:09:20,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:09:20,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-09 06:09:20,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:09:20,394 INFO L225 Difference]: With dead ends: 133 [2024-11-09 06:09:20,394 INFO L226 Difference]: Without dead ends: 133 [2024-11-09 06:09:20,395 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 06:09:20,395 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 9 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:09:20,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 169 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:09:20,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-09 06:09:20,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2024-11-09 06:09:20,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 79 states have (on average 1.9367088607594938) internal successors, (153), 132 states have internal predecessors, (153), 0 states have call successors, (0), 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 06:09:20,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 153 transitions. [2024-11-09 06:09:20,401 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 153 transitions. Word has length 13 [2024-11-09 06:09:20,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:09:20,402 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 153 transitions. [2024-11-09 06:09:20,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:09:20,402 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 153 transitions. [2024-11-09 06:09:20,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 06:09:20,403 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:09:20,403 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:09:20,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 06:09:20,403 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-11-09 06:09:20,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:09:20,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1812571608, now seen corresponding path program 1 times [2024-11-09 06:09:20,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:09:20,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486888569] [2024-11-09 06:09:20,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:09:20,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:09:20,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:09:20,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:09:20,485 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:09:20,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486888569] [2024-11-09 06:09:20,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486888569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:09:20,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:09:20,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:09:20,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808433277] [2024-11-09 06:09:20,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:09:20,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:09:20,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:09:20,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:09:20,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:09:20,488 INFO L87 Difference]: Start difference. First operand 133 states and 153 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:09:20,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:09:20,671 INFO L93 Difference]: Finished difference Result 192 states and 237 transitions. [2024-11-09 06:09:20,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:09:20,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-09 06:09:20,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:09:20,676 INFO L225 Difference]: With dead ends: 192 [2024-11-09 06:09:20,676 INFO L226 Difference]: Without dead ends: 192 [2024-11-09 06:09:20,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:09:20,677 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 85 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:09:20,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 237 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:09:20,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-09 06:09:20,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 133. [2024-11-09 06:09:20,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 79 states have (on average 1.9113924050632911) internal successors, (151), 132 states have internal predecessors, (151), 0 states have call successors, (0), 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 06:09:20,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 151 transitions. [2024-11-09 06:09:20,685 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 151 transitions. Word has length 18 [2024-11-09 06:09:20,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:09:20,685 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 151 transitions. [2024-11-09 06:09:20,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:09:20,685 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 151 transitions. [2024-11-09 06:09:20,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 06:09:20,686 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:09:20,686 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:09:20,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 06:09:20,686 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-11-09 06:09:20,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:09:20,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1812571704, now seen corresponding path program 1 times [2024-11-09 06:09:20,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:09:20,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682782815] [2024-11-09 06:09:20,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:09:20,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:09:20,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:09:20,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:09:20,815 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:09:20,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682782815] [2024-11-09 06:09:20,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682782815] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:09:20,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:09:20,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:09:20,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009953096] [2024-11-09 06:09:20,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:09:20,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:09:20,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:09:20,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:09:20,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:09:20,817 INFO L87 Difference]: Start difference. First operand 133 states and 151 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:09:20,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:09:20,962 INFO L93 Difference]: Finished difference Result 126 states and 145 transitions. [2024-11-09 06:09:20,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:09:20,963 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-09 06:09:20,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:09:20,964 INFO L225 Difference]: With dead ends: 126 [2024-11-09 06:09:20,964 INFO L226 Difference]: Without dead ends: 126 [2024-11-09 06:09:20,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:09:20,965 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 43 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:09:20,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 128 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:09:20,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-09 06:09:20,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-09 06:09:20,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 80 states have (on average 1.8125) internal successors, (145), 125 states have internal predecessors, (145), 0 states have call successors, (0), 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 06:09:20,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 145 transitions. [2024-11-09 06:09:20,970 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 145 transitions. Word has length 18 [2024-11-09 06:09:20,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:09:20,971 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 145 transitions. [2024-11-09 06:09:20,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:09:20,971 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 145 transitions. [2024-11-09 06:09:20,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 06:09:20,972 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:09:20,972 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:09:20,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 06:09:20,973 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-11-09 06:09:20,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:09:20,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1812571703, now seen corresponding path program 1 times [2024-11-09 06:09:20,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:09:20,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768598714] [2024-11-09 06:09:20,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:09:20,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:09:21,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:09:21,145 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:09:21,145 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:09:21,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768598714] [2024-11-09 06:09:21,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768598714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:09:21,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:09:21,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:09:21,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724160223] [2024-11-09 06:09:21,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:09:21,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:09:21,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:09:21,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:09:21,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:09:21,147 INFO L87 Difference]: Start difference. First operand 126 states and 145 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:09:21,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:09:21,379 INFO L93 Difference]: Finished difference Result 179 states and 209 transitions. [2024-11-09 06:09:21,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:09:21,379 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-09 06:09:21,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:09:21,380 INFO L225 Difference]: With dead ends: 179 [2024-11-09 06:09:21,380 INFO L226 Difference]: Without dead ends: 179 [2024-11-09 06:09:21,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:09:21,381 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 75 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:09:21,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 176 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:09:21,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-09 06:09:21,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 156. [2024-11-09 06:09:21,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 112 states have (on average 1.8660714285714286) internal successors, (209), 155 states have internal predecessors, (209), 0 states have call successors, (0), 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 06:09:21,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 209 transitions. [2024-11-09 06:09:21,386 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 209 transitions. Word has length 18 [2024-11-09 06:09:21,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:09:21,386 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 209 transitions. [2024-11-09 06:09:21,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:09:21,387 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 209 transitions. [2024-11-09 06:09:21,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 06:09:21,388 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:09:21,389 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:09:21,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 06:09:21,389 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-11-09 06:09:21,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:09:21,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1706691322, now seen corresponding path program 1 times [2024-11-09 06:09:21,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:09:21,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751808806] [2024-11-09 06:09:21,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:09:21,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:09:21,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:09:21,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:09:21,665 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:09:21,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751808806] [2024-11-09 06:09:21,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751808806] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:09:21,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:09:21,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:09:21,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427556637] [2024-11-09 06:09:21,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:09:21,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:09:21,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:09:21,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:09:21,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:09:21,667 INFO L87 Difference]: Start difference. First operand 156 states and 209 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:09:21,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:09:21,878 INFO L93 Difference]: Finished difference Result 174 states and 229 transitions. [2024-11-09 06:09:21,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:09:21,879 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-09 06:09:21,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:09:21,880 INFO L225 Difference]: With dead ends: 174 [2024-11-09 06:09:21,880 INFO L226 Difference]: Without dead ends: 174 [2024-11-09 06:09:21,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-09 06:09:21,882 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 22 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:09:21,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 219 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:09:21,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-09 06:09:21,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 165. [2024-11-09 06:09:21,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 121 states have (on average 1.8264462809917354) internal successors, (221), 164 states have internal predecessors, (221), 0 states have call successors, (0), 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 06:09:21,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 221 transitions. [2024-11-09 06:09:21,890 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 221 transitions. Word has length 22 [2024-11-09 06:09:21,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:09:21,891 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 221 transitions. [2024-11-09 06:09:21,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:09:21,892 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 221 transitions. [2024-11-09 06:09:21,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 06:09:21,894 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:09:21,895 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:09:21,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 06:09:21,895 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-11-09 06:09:21,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:09:21,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1706691321, now seen corresponding path program 1 times [2024-11-09 06:09:21,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:09:21,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020835821] [2024-11-09 06:09:21,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:09:21,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:09:21,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:09:22,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:09:22,212 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:09:22,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020835821] [2024-11-09 06:09:22,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020835821] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:09:22,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:09:22,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:09:22,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72493179] [2024-11-09 06:09:22,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:09:22,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:09:22,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:09:22,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:09:22,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:09:22,215 INFO L87 Difference]: Start difference. First operand 165 states and 221 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:09:22,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:09:22,414 INFO L93 Difference]: Finished difference Result 165 states and 219 transitions. [2024-11-09 06:09:22,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:09:22,415 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-09 06:09:22,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:09:22,416 INFO L225 Difference]: With dead ends: 165 [2024-11-09 06:09:22,416 INFO L226 Difference]: Without dead ends: 165 [2024-11-09 06:09:22,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:09:22,417 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 4 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:09:22,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 299 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:09:22,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-09 06:09:22,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 162. [2024-11-09 06:09:22,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 118 states have (on average 1.8305084745762712) internal successors, (216), 161 states have internal predecessors, (216), 0 states have call successors, (0), 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 06:09:22,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 216 transitions. [2024-11-09 06:09:22,424 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 216 transitions. Word has length 22 [2024-11-09 06:09:22,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:09:22,424 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 216 transitions. [2024-11-09 06:09:22,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:09:22,425 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 216 transitions. [2024-11-09 06:09:22,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 06:09:22,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:09:22,426 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:09:22,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 06:09:22,427 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-11-09 06:09:22,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:09:22,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1706737200, now seen corresponding path program 1 times [2024-11-09 06:09:22,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:09:22,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370235438] [2024-11-09 06:09:22,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:09:22,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:09:22,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:09:22,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:09:22,528 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:09:22,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370235438] [2024-11-09 06:09:22,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370235438] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:09:22,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:09:22,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:09:22,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438175653] [2024-11-09 06:09:22,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:09:22,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:09:22,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:09:22,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:09:22,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:09:22,531 INFO L87 Difference]: Start difference. First operand 162 states and 216 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:09:22,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:09:22,678 INFO L93 Difference]: Finished difference Result 186 states and 217 transitions. [2024-11-09 06:09:22,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:09:22,679 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-09 06:09:22,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:09:22,680 INFO L225 Difference]: With dead ends: 186 [2024-11-09 06:09:22,680 INFO L226 Difference]: Without dead ends: 186 [2024-11-09 06:09:22,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:09:22,681 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 75 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:09:22,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 221 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:09:22,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-09 06:09:22,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 163. [2024-11-09 06:09:22,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 119 states have (on average 1.8235294117647058) internal successors, (217), 162 states have internal predecessors, (217), 0 states have call successors, (0), 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 06:09:22,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 217 transitions. [2024-11-09 06:09:22,687 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 217 transitions. Word has length 22 [2024-11-09 06:09:22,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:09:22,687 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 217 transitions. [2024-11-09 06:09:22,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:09:22,690 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 217 transitions. [2024-11-09 06:09:22,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 06:09:22,690 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:09:22,690 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:09:22,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 06:09:22,691 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-11-09 06:09:22,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:09:22,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1885481865, now seen corresponding path program 1 times [2024-11-09 06:09:22,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:09:22,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987690902] [2024-11-09 06:09:22,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:09:22,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:09:22,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:09:23,151 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:09:23,152 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:09:23,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987690902] [2024-11-09 06:09:23,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987690902] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:09:23,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:09:23,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:09:23,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045953788] [2024-11-09 06:09:23,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:09:23,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 06:09:23,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:09:23,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 06:09:23,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-09 06:09:23,154 INFO L87 Difference]: Start difference. First operand 163 states and 217 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:09:23,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:09:23,595 INFO L93 Difference]: Finished difference Result 211 states and 275 transitions. [2024-11-09 06:09:23,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 06:09:23,596 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-09 06:09:23,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:09:23,597 INFO L225 Difference]: With dead ends: 211 [2024-11-09 06:09:23,597 INFO L226 Difference]: Without dead ends: 211 [2024-11-09 06:09:23,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-11-09 06:09:23,599 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 94 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:09:23,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 265 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 06:09:23,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-09 06:09:23,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 185. [2024-11-09 06:09:23,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 141 states have (on average 1.75177304964539) internal successors, (247), 184 states have internal predecessors, (247), 0 states have call successors, (0), 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 06:09:23,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 247 transitions. [2024-11-09 06:09:23,607 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 247 transitions. Word has length 26 [2024-11-09 06:09:23,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:09:23,607 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 247 transitions. [2024-11-09 06:09:23,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:09:23,607 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 247 transitions. [2024-11-09 06:09:23,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 06:09:23,608 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:09:23,608 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:09:23,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 06:09:23,608 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-11-09 06:09:23,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:09:23,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1885481864, now seen corresponding path program 1 times [2024-11-09 06:09:23,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:09:23,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965917069] [2024-11-09 06:09:23,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:09:23,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:09:23,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:09:24,185 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:09:24,185 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:09:24,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965917069] [2024-11-09 06:09:24,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965917069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:09:24,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:09:24,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 06:09:24,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581281744] [2024-11-09 06:09:24,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:09:24,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 06:09:24,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:09:24,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 06:09:24,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-09 06:09:24,188 INFO L87 Difference]: Start difference. First operand 185 states and 247 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:09:24,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:09:24,762 INFO L93 Difference]: Finished difference Result 284 states and 361 transitions. [2024-11-09 06:09:24,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 06:09:24,763 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-09 06:09:24,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:09:24,764 INFO L225 Difference]: With dead ends: 284 [2024-11-09 06:09:24,764 INFO L226 Difference]: Without dead ends: 284 [2024-11-09 06:09:24,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2024-11-09 06:09:24,765 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 287 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:09:24,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 203 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 06:09:24,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-09 06:09:24,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 207. [2024-11-09 06:09:24,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 163 states have (on average 1.7791411042944785) internal successors, (290), 206 states have internal predecessors, (290), 0 states have call successors, (0), 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 06:09:24,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 290 transitions. [2024-11-09 06:09:24,771 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 290 transitions. Word has length 26 [2024-11-09 06:09:24,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:09:24,771 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 290 transitions. [2024-11-09 06:09:24,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:09:24,772 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 290 transitions. [2024-11-09 06:09:24,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 06:09:24,772 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:09:24,772 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:09:24,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 06:09:24,773 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-11-09 06:09:24,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:09:24,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1885445220, now seen corresponding path program 1 times [2024-11-09 06:09:24,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:09:24,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115850387] [2024-11-09 06:09:24,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:09:24,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:09:24,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:09:25,056 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:09:25,058 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:09:25,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115850387] [2024-11-09 06:09:25,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115850387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:09:25,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:09:25,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 06:09:25,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781806738] [2024-11-09 06:09:25,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:09:25,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 06:09:25,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:09:25,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 06:09:25,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-09 06:09:25,062 INFO L87 Difference]: Start difference. First operand 207 states and 290 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:09:25,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:09:25,440 INFO L93 Difference]: Finished difference Result 284 states and 357 transitions. [2024-11-09 06:09:25,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 06:09:25,441 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-09 06:09:25,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:09:25,442 INFO L225 Difference]: With dead ends: 284 [2024-11-09 06:09:25,442 INFO L226 Difference]: Without dead ends: 284 [2024-11-09 06:09:25,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2024-11-09 06:09:25,443 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 180 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:09:25,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 408 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 06:09:25,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-09 06:09:25,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 208. [2024-11-09 06:09:25,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 164 states have (on average 1.7621951219512195) internal successors, (289), 207 states have internal predecessors, (289), 0 states have call successors, (0), 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 06:09:25,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 289 transitions. [2024-11-09 06:09:25,449 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 289 transitions. Word has length 26 [2024-11-09 06:09:25,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:09:25,449 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 289 transitions. [2024-11-09 06:09:25,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:09:25,449 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 289 transitions. [2024-11-09 06:09:25,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 06:09:25,450 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:09:25,450 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:09:25,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 06:09:25,451 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-11-09 06:09:25,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:09:25,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1679606160, now seen corresponding path program 1 times [2024-11-09 06:09:25,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:09:25,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335914558] [2024-11-09 06:09:25,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:09:25,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:09:25,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:09:25,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 06:09:25,517 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:09:25,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335914558] [2024-11-09 06:09:25,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335914558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:09:25,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:09:25,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:09:25,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73414673] [2024-11-09 06:09:25,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:09:25,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:09:25,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:09:25,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:09:25,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:09:25,519 INFO L87 Difference]: Start difference. First operand 208 states and 289 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:09:25,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:09:25,746 INFO L93 Difference]: Finished difference Result 271 states and 377 transitions. [2024-11-09 06:09:25,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:09:25,747 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-09 06:09:25,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:09:25,748 INFO L225 Difference]: With dead ends: 271 [2024-11-09 06:09:25,749 INFO L226 Difference]: Without dead ends: 271 [2024-11-09 06:09:25,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:09:25,749 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 72 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:09:25,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 207 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:09:25,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-11-09 06:09:25,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 212. [2024-11-09 06:09:25,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 172 states have (on average 1.75) internal successors, (301), 211 states have internal predecessors, (301), 0 states have call successors, (0), 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 06:09:25,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 301 transitions. [2024-11-09 06:09:25,755 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 301 transitions. Word has length 27 [2024-11-09 06:09:25,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:09:25,756 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 301 transitions. [2024-11-09 06:09:25,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:09:25,757 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 301 transitions. [2024-11-09 06:09:25,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 06:09:25,757 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:09:25,757 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:09:25,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 06:09:25,758 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-11-09 06:09:25,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:09:25,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1679606161, now seen corresponding path program 1 times [2024-11-09 06:09:25,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:09:25,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149808595] [2024-11-09 06:09:25,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:09:25,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:09:25,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:09:26,507 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:09:26,507 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:09:26,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149808595] [2024-11-09 06:09:26,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149808595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:09:26,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:09:26,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 06:09:26,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078912271] [2024-11-09 06:09:26,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:09:26,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 06:09:26,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:09:26,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 06:09:26,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-09 06:09:26,509 INFO L87 Difference]: Start difference. First operand 212 states and 301 transitions. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 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 06:09:27,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:09:27,309 INFO L93 Difference]: Finished difference Result 296 states and 382 transitions. [2024-11-09 06:09:27,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 06:09:27,310 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 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 06:09:27,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:09:27,311 INFO L225 Difference]: With dead ends: 296 [2024-11-09 06:09:27,311 INFO L226 Difference]: Without dead ends: 296 [2024-11-09 06:09:27,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2024-11-09 06:09:27,312 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 293 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 06:09:27,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 285 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 06:09:27,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-11-09 06:09:27,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 215. [2024-11-09 06:09:27,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 175 states have (on average 1.7428571428571429) internal successors, (305), 214 states have internal predecessors, (305), 0 states have call successors, (0), 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 06:09:27,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 305 transitions. [2024-11-09 06:09:27,318 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 305 transitions. Word has length 27 [2024-11-09 06:09:27,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:09:27,318 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 305 transitions. [2024-11-09 06:09:27,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 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 06:09:27,319 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 305 transitions. [2024-11-09 06:09:27,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 06:09:27,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:09:27,320 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:09:27,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 06:09:27,320 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-11-09 06:09:27,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:09:27,320 INFO L85 PathProgramCache]: Analyzing trace with hash 779832229, now seen corresponding path program 1 times [2024-11-09 06:09:27,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:09:27,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116988434] [2024-11-09 06:09:27,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:09:27,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:09:27,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:09:27,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 06:09:27,363 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:09:27,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116988434] [2024-11-09 06:09:27,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116988434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:09:27,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:09:27,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:09:27,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325599642] [2024-11-09 06:09:27,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:09:27,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:09:27,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:09:27,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:09:27,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:09:27,365 INFO L87 Difference]: Start difference. First operand 215 states and 305 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 06:09:27,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:09:27,409 INFO L93 Difference]: Finished difference Result 216 states and 306 transitions. [2024-11-09 06:09:27,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:09:27,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 06:09:27,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:09:27,411 INFO L225 Difference]: With dead ends: 216 [2024-11-09 06:09:27,411 INFO L226 Difference]: Without dead ends: 216 [2024-11-09 06:09:27,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:09:27,412 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:09:27,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 185 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 06:09:27,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-09 06:09:27,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2024-11-09 06:09:27,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 176 states have (on average 1.7386363636363635) internal successors, (306), 215 states have internal predecessors, (306), 0 states have call successors, (0), 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 06:09:27,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 306 transitions. [2024-11-09 06:09:27,417 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 306 transitions. Word has length 30 [2024-11-09 06:09:27,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:09:27,417 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 306 transitions. [2024-11-09 06:09:27,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 06:09:27,418 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 306 transitions. [2024-11-09 06:09:27,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 06:09:27,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:09:27,418 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:09:27,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 06:09:27,419 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-11-09 06:09:27,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:09:27,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1595148623, now seen corresponding path program 1 times [2024-11-09 06:09:27,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:09:27,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938636307] [2024-11-09 06:09:27,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:09:27,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:09:27,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:09:27,718 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:09:27,718 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:09:27,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938636307] [2024-11-09 06:09:27,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938636307] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:09:27,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:09:27,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 06:09:27,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538032807] [2024-11-09 06:09:27,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:09:27,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:09:27,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:09:27,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:09:27,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:09:27,721 INFO L87 Difference]: Start difference. First operand 216 states and 306 transitions. Second operand has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:09:28,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:09:28,137 INFO L93 Difference]: Finished difference Result 299 states and 383 transitions. [2024-11-09 06:09:28,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 06:09:28,137 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-09 06:09:28,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:09:28,138 INFO L225 Difference]: With dead ends: 299 [2024-11-09 06:09:28,138 INFO L226 Difference]: Without dead ends: 299 [2024-11-09 06:09:28,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-09 06:09:28,139 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 177 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:09:28,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 501 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 06:09:28,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-11-09 06:09:28,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 218. [2024-11-09 06:09:28,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 178 states have (on average 1.7359550561797752) internal successors, (309), 217 states have internal predecessors, (309), 0 states have call successors, (0), 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 06:09:28,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 309 transitions. [2024-11-09 06:09:28,147 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 309 transitions. Word has length 31 [2024-11-09 06:09:28,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:09:28,147 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 309 transitions. [2024-11-09 06:09:28,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:09:28,147 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 309 transitions. [2024-11-09 06:09:28,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 06:09:28,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:09:28,149 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:09:28,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 06:09:28,149 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-11-09 06:09:28,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:09:28,149 INFO L85 PathProgramCache]: Analyzing trace with hash 2090000507, now seen corresponding path program 1 times [2024-11-09 06:09:28,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:09:28,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433460549] [2024-11-09 06:09:28,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:09:28,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:09:28,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:09:28,460 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:09:28,460 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:09:28,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433460549] [2024-11-09 06:09:28,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433460549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:09:28,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:09:28,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 06:09:28,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311210447] [2024-11-09 06:09:28,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:09:28,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 06:09:28,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:09:28,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 06:09:28,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-09 06:09:28,462 INFO L87 Difference]: Start difference. First operand 218 states and 309 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:09:28,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:09:28,748 INFO L93 Difference]: Finished difference Result 238 states and 332 transitions. [2024-11-09 06:09:28,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 06:09:28,748 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-09 06:09:28,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:09:28,749 INFO L225 Difference]: With dead ends: 238 [2024-11-09 06:09:28,750 INFO L226 Difference]: Without dead ends: 238 [2024-11-09 06:09:28,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-09 06:09:28,750 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 18 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:09:28,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 362 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 06:09:28,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-09 06:09:28,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 231. [2024-11-09 06:09:28,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 191 states have (on average 1.6963350785340314) internal successors, (324), 230 states have internal predecessors, (324), 0 states have call successors, (0), 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 06:09:28,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 324 transitions. [2024-11-09 06:09:28,755 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 324 transitions. Word has length 32 [2024-11-09 06:09:28,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:09:28,757 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 324 transitions. [2024-11-09 06:09:28,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:09:28,757 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 324 transitions. [2024-11-09 06:09:28,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 06:09:28,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:09:28,759 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:09:28,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 06:09:28,759 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-11-09 06:09:28,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:09:28,761 INFO L85 PathProgramCache]: Analyzing trace with hash 2094681764, now seen corresponding path program 1 times [2024-11-09 06:09:28,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:09:28,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304292409] [2024-11-09 06:09:28,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:09:28,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:09:28,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:09:29,528 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:09:29,528 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:09:29,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304292409] [2024-11-09 06:09:29,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304292409] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:09:29,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86275123] [2024-11-09 06:09:29,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:09:29,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:09:29,529 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63998fbf-0d08-484b-8914-064e59d2e1f3/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:09:29,531 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63998fbf-0d08-484b-8914-064e59d2e1f3/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:09:29,537 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63998fbf-0d08-484b-8914-064e59d2e1f3/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 06:09:29,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:09:29,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 06:09:29,682 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:09:29,757 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 06:09:29,823 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 17 treesize of output 13 [2024-11-09 06:09:29,919 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 06:09:29,919 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 06:09:30,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2024-11-09 06:09:30,075 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 51 treesize of output 40 [2024-11-09 06:09:30,089 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 15 treesize of output 1 [2024-11-09 06:09:30,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 06:09:30,271 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:09:30,271 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 60 treesize of output 50 [2024-11-09 06:09:30,291 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:09:30,292 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 44 treesize of output 38 [2024-11-09 06:09:30,633 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 51 treesize of output 27 [2024-11-09 06:09:30,648 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:09:30,648 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:09:30,881 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 74 treesize of output 70 [2024-11-09 06:09:30,885 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 102 treesize of output 94 [2024-11-09 06:09:30,985 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (let ((.cse1 (forall ((v_ArrVal_724 (Array Int Int)) (v_arrayElimCell_10 Int) (v_arrayElimCell_11 Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_724))) (or (< 1 (select (select .cse8 v_arrayElimCell_10) (+ 4 v_arrayElimCell_11))) (< 1 (select (select .cse8 |c_ULTIMATE.start_main_~item~0#1.base|) .cse3)))))) (.cse2 (= |c_ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~data~0#1.base|)) (.cse0 (= |c_ULTIMATE.start_main_~lItem~0#1.offset| 0)) (.cse6 (and (forall ((v_ArrVal_724 (Array Int Int)) (v_arrayElimCell_10 Int) (v_arrayElimCell_11 Int)) (< 1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_724) v_arrayElimCell_10) (+ 4 v_arrayElimCell_11)))) (forall ((v_ArrVal_724 (Array Int Int)) (v_arrayElimCell_10 Int) (v_arrayElimCell_11 Int)) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_724) v_arrayElimCell_10))) (or (< 1 (select .cse7 .cse3)) (< 1 (select .cse7 (+ 4 v_arrayElimCell_11))))))))) (and (or .cse0 .cse1) (or (not .cse0) (not .cse2) (forall ((v_ArrVal_724 (Array Int Int))) (< 1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_724) |c_ULTIMATE.start_main_~item~0#1.base|) .cse3)))) (or .cse2 .cse1) (forall ((v_ArrVal_724 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_724))) (or (forall ((v_arrayElimCell_10 Int) (v_arrayElimCell_11 Int)) (let ((.cse4 (select .cse5 v_arrayElimCell_10))) (or (< 1 (select .cse4 .cse3)) (< 1 (select .cse4 (+ 4 v_arrayElimCell_11)))))) (< 1 (select (select .cse5 |c_ULTIMATE.start_main_~item~0#1.base|) .cse3))))) (or .cse6 .cse2) (or .cse0 .cse6)))) is different from false [2024-11-09 06:09:31,057 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~lItem~0#1.offset| 0)) (.cse2 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (and (or .cse0 (forall ((v_ArrVal_724 (Array Int Int)) (v_arrayElimCell_10 Int) (v_arrayElimCell_11 Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_724))) (or (< 1 (select (select .cse1 v_arrayElimCell_10) (+ 4 v_arrayElimCell_11))) (< 1 (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) .cse2)))))) (or (not .cse0) (forall ((v_ArrVal_724 (Array Int Int))) (< 1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_724) |c_ULTIMATE.start_main_~item~0#1.base|) .cse2)))) (forall ((v_ArrVal_724 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_724))) (or (forall ((v_arrayElimCell_10 Int) (v_arrayElimCell_11 Int)) (let ((.cse3 (select .cse4 v_arrayElimCell_10))) (or (< 1 (select .cse3 .cse2)) (< 1 (select .cse3 (+ 4 v_arrayElimCell_11)))))) (< 1 (select (select .cse4 |c_ULTIMATE.start_main_~item~0#1.base|) .cse2))))) (or .cse0 (and (forall ((v_ArrVal_724 (Array Int Int)) (v_arrayElimCell_10 Int) (v_arrayElimCell_11 Int)) (< 1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_724) v_arrayElimCell_10) (+ 4 v_arrayElimCell_11)))) (forall ((v_ArrVal_724 (Array Int Int)) (v_arrayElimCell_10 Int) (v_arrayElimCell_11 Int)) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_724) v_arrayElimCell_10))) (or (< 1 (select .cse5 .cse2)) (< 1 (select .cse5 (+ 4 v_arrayElimCell_11)))))))))) is different from false [2024-11-09 06:09:31,297 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:09:31,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 51 [2024-11-09 06:09:31,329 INFO L349 Elim1Store]: treesize reduction 11, result has 60.7 percent of original size [2024-11-09 06:09:31,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 82 [2024-11-09 06:09:31,348 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:09:31,349 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 34 treesize of output 30 [2024-11-09 06:09:31,392 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:09:31,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2024-11-09 06:09:31,396 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:09:31,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-09 06:09:31,545 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:09:31,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86275123] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:09:31,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1847626215] [2024-11-09 06:09:31,567 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2024-11-09 06:09:31,567 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:09:31,571 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:09:31,576 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:09:31,577 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:09:32,888 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:11:01,100 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '8548#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~c1~0#1| 1) (exists ((|v_ULTIMATE.start_main_~item~0#1.base_88| Int)) (not (= (select |#valid| |v_ULTIMATE.start_main_~item~0#1.base_88|) 1))))' at error location [2024-11-09 06:11:01,100 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:11:01,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:11:01,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 34 [2024-11-09 06:11:01,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029928791] [2024-11-09 06:11:01,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:11:01,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-09 06:11:01,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:11:01,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-09 06:11:01,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=352, Invalid=2706, Unknown=30, NotChecked=218, Total=3306 [2024-11-09 06:11:01,104 INFO L87 Difference]: Start difference. First operand 231 states and 324 transitions. Second operand has 35 states, 35 states have (on average 2.4571428571428573) internal successors, (86), 34 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:11:05,921 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~lItem~0#1.offset| 0)) (.cse2 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (and (or .cse0 (forall ((v_ArrVal_724 (Array Int Int)) (v_arrayElimCell_10 Int) (v_arrayElimCell_11 Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_724))) (or (< 1 (select (select .cse1 v_arrayElimCell_10) (+ 4 v_arrayElimCell_11))) (< 1 (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) .cse2)))))) (forall ((|v_ULTIMATE.start_main_~lItem~0#1.base_43| Int)) (or (forall ((v_ArrVal_724 (Array Int Int))) (< 1 (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_~lItem~0#1.base_43| v_ArrVal_724) |c_ULTIMATE.start_main_~item~0#1.base|) .cse2))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~lItem~0#1.base_43|) 0)))) (or (not .cse0) (forall ((v_ArrVal_724 (Array Int Int))) (< 1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_724) |c_ULTIMATE.start_main_~item~0#1.base|) .cse2)))) (forall ((v_ArrVal_724 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_724))) (or (forall ((v_arrayElimCell_10 Int) (v_arrayElimCell_11 Int)) (let ((.cse3 (select .cse4 v_arrayElimCell_10))) (or (< 1 (select .cse3 .cse2)) (< 1 (select .cse3 (+ 4 v_arrayElimCell_11)))))) (< 1 (select (select .cse4 |c_ULTIMATE.start_main_~item~0#1.base|) .cse2))))) (forall ((|v_ULTIMATE.start_main_~lItem~0#1.base_43| Int)) (or (forall ((v_ArrVal_724 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |v_ULTIMATE.start_main_~lItem~0#1.base_43| v_ArrVal_724))) (or (< 1 (select (select .cse5 |c_ULTIMATE.start_main_~item~0#1.base|) .cse2)) (forall ((v_arrayElimCell_10 Int) (v_arrayElimCell_11 Int)) (let ((.cse6 (select .cse5 v_arrayElimCell_10))) (or (< 1 (select .cse6 .cse2)) (< 1 (select .cse6 (+ 4 v_arrayElimCell_11))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~lItem~0#1.base_43|) 0)))) (< 1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base|) 1) (<= 1 |c_ULTIMATE.start_main_~c1~0#1|) (or .cse0 (and (forall ((v_ArrVal_724 (Array Int Int)) (v_arrayElimCell_10 Int) (v_arrayElimCell_11 Int)) (< 1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_724) v_arrayElimCell_10) (+ 4 v_arrayElimCell_11)))) (forall ((v_ArrVal_724 (Array Int Int)) (v_arrayElimCell_10 Int) (v_arrayElimCell_11 Int)) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_724) v_arrayElimCell_10))) (or (< 1 (select .cse7 .cse2)) (< 1 (select .cse7 (+ 4 v_arrayElimCell_11)))))))))) is different from false [2024-11-09 06:11:10,184 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 06:11:12,975 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~lItem~0#1.offset| 0)) (.cse2 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (and (or .cse0 (forall ((v_ArrVal_724 (Array Int Int)) (v_arrayElimCell_10 Int) (v_arrayElimCell_11 Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_724))) (or (< 1 (select (select .cse1 v_arrayElimCell_10) (+ 4 v_arrayElimCell_11))) (< 1 (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) .cse2)))))) (forall ((|v_ULTIMATE.start_main_~lItem~0#1.base_43| Int)) (or (forall ((v_ArrVal_724 (Array Int Int))) (< 1 (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_~lItem~0#1.base_43| v_ArrVal_724) |c_ULTIMATE.start_main_~item~0#1.base|) .cse2))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~lItem~0#1.base_43|) 0)))) (or (not .cse0) (forall ((v_ArrVal_724 (Array Int Int))) (< 1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_724) |c_ULTIMATE.start_main_~item~0#1.base|) .cse2)))) (forall ((v_ArrVal_724 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_724))) (or (forall ((v_arrayElimCell_10 Int) (v_arrayElimCell_11 Int)) (let ((.cse3 (select .cse4 v_arrayElimCell_10))) (or (< 1 (select .cse3 .cse2)) (< 1 (select .cse3 (+ 4 v_arrayElimCell_11)))))) (< 1 (select (select .cse4 |c_ULTIMATE.start_main_~item~0#1.base|) .cse2))))) (<= 0 |c_ULTIMATE.start_main_~c1~0#1|) (forall ((|v_ULTIMATE.start_main_~lItem~0#1.base_43| Int)) (or (forall ((v_ArrVal_724 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |v_ULTIMATE.start_main_~lItem~0#1.base_43| v_ArrVal_724))) (or (< 1 (select (select .cse5 |c_ULTIMATE.start_main_~item~0#1.base|) .cse2)) (forall ((v_arrayElimCell_10 Int) (v_arrayElimCell_11 Int)) (let ((.cse6 (select .cse5 v_arrayElimCell_10))) (or (< 1 (select .cse6 .cse2)) (< 1 (select .cse6 (+ 4 v_arrayElimCell_11))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~lItem~0#1.base_43|) 0)))) (< 1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base|) .cse2)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base|) 0)) (or (< 0 (+ 2 |c_ULTIMATE.start_main_~c1~0#1|)) (forall ((|v_ULTIMATE.start_main_~lItem~0#1.base_43| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~lItem~0#1.base_43|) 0)))) (or .cse0 (and (forall ((v_ArrVal_724 (Array Int Int)) (v_arrayElimCell_10 Int) (v_arrayElimCell_11 Int)) (< 1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_724) v_arrayElimCell_10) (+ 4 v_arrayElimCell_11)))) (forall ((v_ArrVal_724 (Array Int Int)) (v_arrayElimCell_10 Int) (v_arrayElimCell_11 Int)) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_724) v_arrayElimCell_10))) (or (< 1 (select .cse7 .cse2)) (< 1 (select .cse7 (+ 4 v_arrayElimCell_11)))))))))) is different from false [2024-11-09 06:11:17,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:11:17,433 INFO L93 Difference]: Finished difference Result 432 states and 594 transitions. [2024-11-09 06:11:17,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-09 06:11:17,434 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.4571428571428573) internal successors, (86), 34 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-09 06:11:17,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:11:17,435 INFO L225 Difference]: With dead ends: 432 [2024-11-09 06:11:17,436 INFO L226 Difference]: Without dead ends: 432 [2024-11-09 06:11:17,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 77 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1673 ImplicationChecksByTransitivity, 93.6s TimeCoverageRelationStatistics Valid=719, Invalid=4815, Unknown=32, NotChecked=596, Total=6162 [2024-11-09 06:11:17,438 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 425 mSDsluCounter, 1337 mSDsCounter, 0 mSdLazyCounter, 2290 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 1410 SdHoareTripleChecker+Invalid, 2946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2290 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 595 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time [2024-11-09 06:11:17,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 1410 Invalid, 2946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2290 Invalid, 1 Unknown, 595 Unchecked, 11.8s Time] [2024-11-09 06:11:17,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2024-11-09 06:11:17,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 231. [2024-11-09 06:11:17,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 191 states have (on average 1.6910994764397906) internal successors, (323), 230 states have internal predecessors, (323), 0 states have call successors, (0), 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 06:11:17,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 323 transitions. [2024-11-09 06:11:17,445 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 323 transitions. Word has length 32 [2024-11-09 06:11:17,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:11:17,445 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 323 transitions. [2024-11-09 06:11:17,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.4571428571428573) internal successors, (86), 34 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:11:17,445 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 323 transitions. [2024-11-09 06:11:17,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 06:11:17,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:11:17,446 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:11:17,468 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63998fbf-0d08-484b-8914-064e59d2e1f3/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 06:11:17,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63998fbf-0d08-484b-8914-064e59d2e1f3/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:11:17,647 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-11-09 06:11:17,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:11:17,647 INFO L85 PathProgramCache]: Analyzing trace with hash 365717168, now seen corresponding path program 1 times [2024-11-09 06:11:17,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:11:17,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802675409] [2024-11-09 06:11:17,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:11:17,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:11:17,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:11:19,254 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:11:19,255 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:11:19,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802675409] [2024-11-09 06:11:19,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802675409] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:11:19,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079008316] [2024-11-09 06:11:19,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:11:19,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:11:19,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63998fbf-0d08-484b-8914-064e59d2e1f3/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:11:19,257 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63998fbf-0d08-484b-8914-064e59d2e1f3/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:11:19,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63998fbf-0d08-484b-8914-064e59d2e1f3/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 06:11:19,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:11:19,393 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-09 06:11:19,396 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:11:19,479 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 06:11:19,654 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 17 treesize of output 13 [2024-11-09 06:11:19,838 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 06:11:19,839 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 06:11:20,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2024-11-09 06:11:20,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 06:11:20,309 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 15 treesize of output 1 [2024-11-09 06:11:20,322 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 51 treesize of output 40 [2024-11-09 06:11:20,843 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:11:20,843 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 60 treesize of output 50 [2024-11-09 06:11:20,905 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:11:20,905 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 44 treesize of output 38 [2024-11-09 06:11:21,840 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 51 treesize of output 27 [2024-11-09 06:11:21,974 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:11:21,974 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:11:23,009 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 74 treesize of output 70 [2024-11-09 06:11:23,021 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 102 treesize of output 94 [2024-11-09 06:11:23,312 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (let ((.cse1 (and (forall ((v_ArrVal_812 (Array Int Int)) (v_arrayElimCell_28 Int) (v_arrayElimCell_27 Int)) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_812) v_arrayElimCell_27))) (or (< (select .cse8 (+ 4 v_arrayElimCell_28)) 15) (< (select .cse8 .cse3) 15)))) (forall ((v_ArrVal_812 (Array Int Int)) (v_arrayElimCell_28 Int) (v_arrayElimCell_27 Int)) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_812) v_arrayElimCell_27) (+ 4 v_arrayElimCell_28)) 15)))) (.cse5 (= |c_ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~data~0#1.base|)) (.cse0 (= |c_ULTIMATE.start_main_~lItem~0#1.offset| 0)) (.cse6 (forall ((v_ArrVal_812 (Array Int Int)) (v_arrayElimCell_28 Int) (v_arrayElimCell_27 Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_812))) (or (< (select (select .cse7 |c_ULTIMATE.start_main_~item~0#1.base|) .cse3) 15) (< (select (select .cse7 v_arrayElimCell_27) (+ 4 v_arrayElimCell_28)) 15)))))) (and (or .cse0 .cse1) (forall ((v_ArrVal_812 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_812))) (or (< (select (select .cse2 |c_ULTIMATE.start_main_~item~0#1.base|) .cse3) 15) (forall ((v_arrayElimCell_28 Int) (v_arrayElimCell_27 Int)) (let ((.cse4 (select .cse2 v_arrayElimCell_27))) (or (< (select .cse4 (+ 4 v_arrayElimCell_28)) 15) (< (select .cse4 .cse3) 15))))))) (or .cse5 .cse1) (or (not .cse0) (not .cse5) (forall ((v_ArrVal_812 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~item~0#1.base|) .cse3) 15))) (or .cse5 .cse6) (or .cse0 .cse6)))) is different from false [2024-11-09 06:11:23,481 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~lItem~0#1.offset| 0)) (.cse2 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (and (or .cse0 (and (forall ((v_ArrVal_812 (Array Int Int)) (v_arrayElimCell_28 Int) (v_arrayElimCell_27 Int)) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_812) v_arrayElimCell_27))) (or (< (select .cse1 (+ 4 v_arrayElimCell_28)) 15) (< (select .cse1 .cse2) 15)))) (forall ((v_ArrVal_812 (Array Int Int)) (v_arrayElimCell_28 Int) (v_arrayElimCell_27 Int)) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_812) v_arrayElimCell_27) (+ 4 v_arrayElimCell_28)) 15)))) (forall ((v_ArrVal_812 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_812))) (or (< (select (select .cse3 |c_ULTIMATE.start_main_~item~0#1.base|) .cse2) 15) (forall ((v_arrayElimCell_28 Int) (v_arrayElimCell_27 Int)) (let ((.cse4 (select .cse3 v_arrayElimCell_27))) (or (< (select .cse4 (+ 4 v_arrayElimCell_28)) 15) (< (select .cse4 .cse2) 15))))))) (or (not .cse0) (forall ((v_ArrVal_812 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~item~0#1.base|) .cse2) 15))) (or .cse0 (forall ((v_ArrVal_812 (Array Int Int)) (v_arrayElimCell_28 Int) (v_arrayElimCell_27 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_812))) (or (< (select (select .cse5 |c_ULTIMATE.start_main_~item~0#1.base|) .cse2) 15) (< (select (select .cse5 v_arrayElimCell_27) (+ 4 v_arrayElimCell_28)) 15))))))) is different from false [2024-11-09 06:11:23,921 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:11:23,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2024-11-09 06:11:23,930 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 40 treesize of output 28 [2024-11-09 06:11:23,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 06:11:23,997 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:11:23,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 51 [2024-11-09 06:11:24,005 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:11:24,139 INFO L349 Elim1Store]: treesize reduction 11, result has 60.7 percent of original size [2024-11-09 06:11:24,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 66 [2024-11-09 06:11:24,210 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:11:24,211 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 23 treesize of output 23 [2024-11-09 06:11:24,811 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:11:24,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079008316] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:11:24,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2092666017] [2024-11-09 06:11:24,814 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2024-11-09 06:11:24,814 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:11:24,815 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:11:24,815 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:11:24,815 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:11:28,783 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:11:46,455 WARN L286 SmtUtils]: Spent 6.29s on a formula simplification. DAG size of input: 217 DAG size of output: 207 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 06:13:07,581 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '9501#(and (<= 0 |ULTIMATE.start_main_~c1~0#1|) (<= 1 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~c1~0#1| 1) (exists ((|v_ULTIMATE.start_main_~item~0#1.base_99| Int)) (not (= (select |#valid| |v_ULTIMATE.start_main_~item~0#1.base_99|) 1))))' at error location [2024-11-09 06:13:07,581 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:13:07,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:13:07,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 31 [2024-11-09 06:13:07,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560733239] [2024-11-09 06:13:07,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:13:07,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-09 06:13:07,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:13:07,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-09 06:13:07,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=2408, Unknown=27, NotChecked=206, Total=2970 [2024-11-09 06:13:07,584 INFO L87 Difference]: Start difference. First operand 231 states and 323 transitions. Second operand has 31 states, 31 states have (on average 3.0) internal successors, (93), 31 states have internal predecessors, (93), 0 states have call successors, (0), 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 06:13:16,762 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 [1] [2024-11-09 06:13:31,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:13:31,192 INFO L93 Difference]: Finished difference Result 436 states and 594 transitions. [2024-11-09 06:13:31,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-11-09 06:13:31,193 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.0) internal successors, (93), 31 states have internal predecessors, (93), 0 states have call successors, (0), 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 33 [2024-11-09 06:13:31,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:13:31,195 INFO L225 Difference]: With dead ends: 436 [2024-11-09 06:13:31,195 INFO L226 Difference]: Without dead ends: 436 [2024-11-09 06:13:31,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 57 SyntacticMatches, 9 SemanticMatches, 98 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3393 ImplicationChecksByTransitivity, 113.9s TimeCoverageRelationStatistics Valid=1278, Invalid=8209, Unknown=27, NotChecked=386, Total=9900 [2024-11-09 06:13:31,198 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 326 mSDsluCounter, 1570 mSDsCounter, 0 mSdLazyCounter, 2123 mSolverCounterSat, 101 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 1696 SdHoareTripleChecker+Invalid, 2771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 2123 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 546 IncrementalHoareTripleChecker+Unchecked, 11.6s IncrementalHoareTripleChecker+Time [2024-11-09 06:13:31,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 1696 Invalid, 2771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 2123 Invalid, 1 Unknown, 546 Unchecked, 11.6s Time] [2024-11-09 06:13:31,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2024-11-09 06:13:31,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 232. [2024-11-09 06:13:31,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 192 states have (on average 1.6822916666666667) internal successors, (323), 231 states have internal predecessors, (323), 0 states have call successors, (0), 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 06:13:31,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 323 transitions. [2024-11-09 06:13:31,206 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 323 transitions. Word has length 33 [2024-11-09 06:13:31,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:13:31,206 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 323 transitions. [2024-11-09 06:13:31,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.0) internal successors, (93), 31 states have internal predecessors, (93), 0 states have call successors, (0), 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 06:13:31,207 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 323 transitions. [2024-11-09 06:13:31,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 06:13:31,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:13:31,207 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:13:31,230 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63998fbf-0d08-484b-8914-064e59d2e1f3/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 06:13:31,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63998fbf-0d08-484b-8914-064e59d2e1f3/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:13:31,408 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-11-09 06:13:31,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:13:31,408 INFO L85 PathProgramCache]: Analyzing trace with hash 732964717, now seen corresponding path program 1 times [2024-11-09 06:13:31,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:13:31,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95636967] [2024-11-09 06:13:31,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:13:31,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:13:31,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:13:31,569 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:13:31,569 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:13:31,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95636967] [2024-11-09 06:13:31,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95636967] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:13:31,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831461891] [2024-11-09 06:13:31,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:13:31,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:13:31,570 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63998fbf-0d08-484b-8914-064e59d2e1f3/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:13:31,572 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63998fbf-0d08-484b-8914-064e59d2e1f3/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:13:31,577 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63998fbf-0d08-484b-8914-064e59d2e1f3/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 06:13:31,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:13:31,730 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 06:13:31,732 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:13:31,972 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:13:31,973 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:13:32,324 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:13:32,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831461891] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:13:32,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [805967933] [2024-11-09 06:13:32,327 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2024-11-09 06:13:32,328 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:13:32,328 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:13:32,329 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:13:32,329 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:13:52,501 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:14:51,349 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '10497#(and (= |ULTIMATE.start_main_~item~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (= |ULTIMATE.start_main_#t~mem11#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) (= |ULTIMATE.start_main_~item~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (<= (+ 8 |ULTIMATE.start_main_~data~0#1.offset|) (select |#length| |ULTIMATE.start_main_~data~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 1)) (or (not (= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (= |ULTIMATE.start_main_~data~0#1.base| 0))) (<= 0 |ULTIMATE.start_main_~data~0#1.offset|))' at error location [2024-11-09 06:14:51,349 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:14:51,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:14:51,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-11-09 06:14:51,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667679072] [2024-11-09 06:14:51,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:14:51,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 06:14:51,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:14:51,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 06:14:51,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=631, Unknown=35, NotChecked=0, Total=812 [2024-11-09 06:14:51,351 INFO L87 Difference]: Start difference. First operand 232 states and 323 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 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 06:14:52,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:14:52,198 INFO L93 Difference]: Finished difference Result 902 states and 1267 transitions. [2024-11-09 06:14:52,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 06:14:52,198 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 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 34 [2024-11-09 06:14:52,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:14:52,201 INFO L225 Difference]: With dead ends: 902 [2024-11-09 06:14:52,201 INFO L226 Difference]: Without dead ends: 902 [2024-11-09 06:14:52,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 59.1s TimeCoverageRelationStatistics Valid=146, Invalid=631, Unknown=35, NotChecked=0, Total=812 [2024-11-09 06:14:52,202 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 834 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 834 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 06:14:52,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [834 Valid, 666 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 06:14:52,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2024-11-09 06:14:52,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 236. [2024-11-09 06:14:52,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 196 states have (on average 1.5765306122448979) internal successors, (309), 235 states have internal predecessors, (309), 0 states have call successors, (0), 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 06:14:52,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 309 transitions. [2024-11-09 06:14:52,212 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 309 transitions. Word has length 34 [2024-11-09 06:14:52,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:14:52,213 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 309 transitions. [2024-11-09 06:14:52,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 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 06:14:52,213 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 309 transitions. [2024-11-09 06:14:52,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 06:14:52,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:14:52,214 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:14:52,234 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63998fbf-0d08-484b-8914-064e59d2e1f3/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 06:14:52,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63998fbf-0d08-484b-8914-064e59d2e1f3/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:14:52,415 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-11-09 06:14:52,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:14:52,418 INFO L85 PathProgramCache]: Analyzing trace with hash -886307674, now seen corresponding path program 1 times [2024-11-09 06:14:52,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:14:52,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121177615] [2024-11-09 06:14:52,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:14:52,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:14:52,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:14:53,250 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:14:53,250 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:14:53,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121177615] [2024-11-09 06:14:53,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121177615] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:14:53,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468048324] [2024-11-09 06:14:53,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:14:53,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:14:53,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63998fbf-0d08-484b-8914-064e59d2e1f3/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:14:53,253 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63998fbf-0d08-484b-8914-064e59d2e1f3/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:14:53,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63998fbf-0d08-484b-8914-064e59d2e1f3/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 06:14:53,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:14:53,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 06:14:53,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:14:53,755 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 06:14:53,968 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 06:14:54,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:14:54,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2024-11-09 06:14:54,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 06:14:54,331 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:14:54,331 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:14:57,472 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:14:57,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468048324] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:14:57,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1614291960] [2024-11-09 06:14:57,475 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2024-11-09 06:14:57,475 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:14:57,475 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:14:57,475 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:14:57,476 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:15:17,876 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:15:39,930 WARN L286 SmtUtils]: Spent 7.29s on a formula simplification. DAG size of input: 203 DAG size of output: 189 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 06:16:00,061 WARN L286 SmtUtils]: Spent 12.68s on a formula simplification. DAG size of input: 228 DAG size of output: 208 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 06:16:43,995 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '11885#(and (= |ULTIMATE.start_main_~item~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (= |ULTIMATE.start_main_#t~mem11#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) (= |ULTIMATE.start_main_~item~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (<= (+ 8 |ULTIMATE.start_main_~data~0#1.offset|) (select |#length| |ULTIMATE.start_main_~data~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 1)) (or (not (= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (= |ULTIMATE.start_main_~data~0#1.base| 0))) (<= 0 |ULTIMATE.start_main_~data~0#1.offset|))' at error location [2024-11-09 06:16:43,995 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:16:43,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:16:43,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 18 [2024-11-09 06:16:43,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879093541] [2024-11-09 06:16:43,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:16:43,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 06:16:43,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:16:43,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 06:16:43,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1340, Unknown=23, NotChecked=0, Total=1560 [2024-11-09 06:16:43,998 INFO L87 Difference]: Start difference. First operand 236 states and 309 transitions. Second operand has 19 states, 18 states have (on average 4.388888888888889) internal successors, (79), 19 states have internal predecessors, (79), 0 states have call successors, (0), 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 06:17:08,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:17:08,637 INFO L93 Difference]: Finished difference Result 258 states and 308 transitions. [2024-11-09 06:17:08,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 06:17:08,638 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.388888888888889) internal successors, (79), 19 states have internal predecessors, (79), 0 states have call successors, (0), 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 36 [2024-11-09 06:17:08,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:17:08,639 INFO L225 Difference]: With dead ends: 258 [2024-11-09 06:17:08,639 INFO L226 Difference]: Without dead ends: 258 [2024-11-09 06:17:08,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 719 ImplicationChecksByTransitivity, 109.3s TimeCoverageRelationStatistics Valid=321, Invalid=2000, Unknown=31, NotChecked=0, Total=2352 [2024-11-09 06:17:08,641 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 215 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:17:08,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 658 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-11-09 06:17:08,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-11-09 06:17:08,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 236. [2024-11-09 06:17:08,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 196 states have (on average 1.5714285714285714) internal successors, (308), 235 states have internal predecessors, (308), 0 states have call successors, (0), 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 06:17:08,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 308 transitions. [2024-11-09 06:17:08,648 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 308 transitions. Word has length 36 [2024-11-09 06:17:08,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:17:08,649 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 308 transitions. [2024-11-09 06:17:08,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.388888888888889) internal successors, (79), 19 states have internal predecessors, (79), 0 states have call successors, (0), 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 06:17:08,649 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 308 transitions. [2024-11-09 06:17:08,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 06:17:08,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:17:08,650 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:17:08,677 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63998fbf-0d08-484b-8914-064e59d2e1f3/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 06:17:08,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63998fbf-0d08-484b-8914-064e59d2e1f3/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-09 06:17:08,851 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-11-09 06:17:08,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:17:08,852 INFO L85 PathProgramCache]: Analyzing trace with hash -886307673, now seen corresponding path program 1 times [2024-11-09 06:17:08,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:17:08,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707385889] [2024-11-09 06:17:08,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:17:08,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:17:08,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:17:10,143 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:17:10,143 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:17:10,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707385889] [2024-11-09 06:17:10,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707385889] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:17:10,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885624404] [2024-11-09 06:17:10,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:17:10,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:17:10,144 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63998fbf-0d08-484b-8914-064e59d2e1f3/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:17:10,146 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63998fbf-0d08-484b-8914-064e59d2e1f3/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:17:10,148 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63998fbf-0d08-484b-8914-064e59d2e1f3/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 06:17:10,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:17:10,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 06:17:10,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:17:10,350 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 06:17:10,648 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 06:17:10,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-09 06:17:10,800 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 06:17:10,801 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 06:17:10,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 06:17:11,129 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 06:17:11,172 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 06:17:11,464 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:17:11,464 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 50 treesize of output 45 [2024-11-09 06:17:11,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-09 06:17:11,959 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 25 treesize of output 13 [2024-11-09 06:17:11,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 06:17:12,119 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:17:12,119 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:17:12,718 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1283 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) 4))) (forall ((v_ArrVal_1283 (Array Int Int)) (v_ArrVal_1282 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1283) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1282) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|))))) is different from false [2024-11-09 06:17:12,768 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:17:12,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2024-11-09 06:17:12,803 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:17:12,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2024-11-09 06:17:12,822 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 52 treesize of output 44 [2024-11-09 06:17:12,837 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 82 treesize of output 70 [2024-11-09 06:17:12,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-11-09 06:17:12,907 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 06:17:12,937 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:17:12,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2024-11-09 06:17:12,946 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:17:12,954 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 18 treesize of output 10 [2024-11-09 06:17:13,973 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-09 06:17:13,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885624404] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:17:13,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [726672636] [2024-11-09 06:17:13,976 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2024-11-09 06:17:13,976 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:17:13,977 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:17:13,977 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:17:13,977 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:17:34,275 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:17:57,464 WARN L286 SmtUtils]: Spent 7.39s on a formula simplification. DAG size of input: 203 DAG size of output: 189 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 06:18:18,809 WARN L286 SmtUtils]: Spent 14.11s on a formula simplification. DAG size of input: 228 DAG size of output: 208 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 06:19:12,988 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '12651#(and (or (< (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) (+ 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|))) (< (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 0)) (= |ULTIMATE.start_main_~item~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (= |ULTIMATE.start_main_~item~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (<= (+ 8 |ULTIMATE.start_main_~data~0#1.offset|) (select |#length| |ULTIMATE.start_main_~data~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1) (or (not (= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (= |ULTIMATE.start_main_~data~0#1.base| 0))) (<= 0 |ULTIMATE.start_main_~data~0#1.offset|))' at error location [2024-11-09 06:19:12,988 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:19:12,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:19:12,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 19 [2024-11-09 06:19:12,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654398707] [2024-11-09 06:19:12,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:19:12,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-09 06:19:12,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:19:12,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 06:19:12,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1367, Unknown=26, NotChecked=76, Total=1640 [2024-11-09 06:19:12,991 INFO L87 Difference]: Start difference. First operand 236 states and 308 transitions. Second operand has 20 states, 19 states have (on average 4.315789473684211) internal successors, (82), 20 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 06:19:24,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:19:24,935 INFO L93 Difference]: Finished difference Result 238 states and 306 transitions. [2024-11-09 06:19:24,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 06:19:24,935 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.315789473684211) internal successors, (82), 20 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) Word has length 36 [2024-11-09 06:19:24,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:19:24,936 INFO L225 Difference]: With dead ends: 238 [2024-11-09 06:19:24,937 INFO L226 Difference]: Without dead ends: 238 [2024-11-09 06:19:24,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 108.8s TimeCoverageRelationStatistics Valid=245, Invalid=1800, Unknown=29, NotChecked=88, Total=2162 [2024-11-09 06:19:24,938 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 76 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 107 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:19:24,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 513 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 694 Invalid, 0 Unknown, 107 Unchecked, 4.1s Time] [2024-11-09 06:19:24,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-09 06:19:24,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 236. [2024-11-09 06:19:24,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 196 states have (on average 1.5561224489795917) internal successors, (305), 235 states have internal predecessors, (305), 0 states have call successors, (0), 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 06:19:24,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 305 transitions. [2024-11-09 06:19:24,944 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 305 transitions. Word has length 36 [2024-11-09 06:19:24,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:19:24,945 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 305 transitions. [2024-11-09 06:19:24,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.315789473684211) internal successors, (82), 20 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 06:19:24,945 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 305 transitions. [2024-11-09 06:19:24,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 06:19:24,946 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:19:24,946 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:19:24,968 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63998fbf-0d08-484b-8914-064e59d2e1f3/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 06:19:25,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63998fbf-0d08-484b-8914-064e59d2e1f3/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-09 06:19:25,147 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-11-09 06:19:25,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:19:25,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1063719459, now seen corresponding path program 1 times [2024-11-09 06:19:25,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:19:25,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140509547] [2024-11-09 06:19:25,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:19:25,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:19:25,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:19:26,264 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:19:26,265 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:19:26,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140509547] [2024-11-09 06:19:26,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140509547] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:19:26,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416506767] [2024-11-09 06:19:26,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:19:26,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:19:26,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63998fbf-0d08-484b-8914-064e59d2e1f3/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:19:26,266 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63998fbf-0d08-484b-8914-064e59d2e1f3/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:19:26,267 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63998fbf-0d08-484b-8914-064e59d2e1f3/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 06:19:26,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:19:26,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 06:19:26,425 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:19:26,706 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 06:19:26,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 27 [2024-11-09 06:19:27,142 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 15 treesize of output 1 [2024-11-09 06:19:27,716 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:19:27,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 30 [2024-11-09 06:19:28,184 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 06:19:28,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 29 [2024-11-09 06:19:28,480 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~data~0#1.base_80| Int)) (and (= (select |c_#valid| |v_ULTIMATE.start_main_~data~0#1.base_80|) 0) (= (store (store |c_#valid| |v_ULTIMATE.start_main_~data~0#1.base_80| 0) |c_ULTIMATE.start_main_~item2~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|))) is different from true [2024-11-09 06:19:28,778 INFO L349 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2024-11-09 06:19:28,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 37 [2024-11-09 06:19:28,848 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~item2~0#1.base_64| Int) (|v_ULTIMATE.start_main_~data~0#1.base_80| Int)) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~data~0#1.base_80|) 0) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~data~0#1.base_80| 0) |v_ULTIMATE.start_main_~item2~0#1.base_64| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~item2~0#1.base_64|) 0))) is different from true [2024-11-09 06:19:28,916 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-09 06:19:28,916 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:19:29,666 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 60 treesize of output 52 [2024-11-09 06:19:29,823 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 32 treesize of output 28 [2024-11-09 06:19:45,336 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:19:45,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416506767] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:19:45,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [153417286] [2024-11-09 06:19:45,338 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2024-11-09 06:19:45,338 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:19:45,339 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:19:45,339 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:19:45,339 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:19:46,250 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:20:08,050 WARN L286 SmtUtils]: Spent 7.36s on a formula simplification. DAG size of input: 217 DAG size of output: 207 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 06:22:06,650 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '13395#(and (<= 0 |ULTIMATE.start_main_~c1~0#1|) (<= 1 |#StackHeapBarrier|) (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_~c1~0#1| 1) (or (exists ((|v_ULTIMATE.start_main_~item2~0#1.base_68| Int) (|v_#valid_218| (Array Int Int))) (and (<= 2 (select (select |#memory_int| |v_ULTIMATE.start_main_~item2~0#1.base_68|) 4)) (= (select |v_#valid_218| |v_ULTIMATE.start_main_~item2~0#1.base_68|) 1) (<= (+ |v_ULTIMATE.start_main_~item2~0#1.base_68| 1) |#StackHeapBarrier|) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~item2~0#1.base_68|) 4) 14) (<= 8 (select |#length| |v_ULTIMATE.start_main_~item2~0#1.base_68|)) (= (store |v_#valid_218| |v_ULTIMATE.start_main_~item2~0#1.base_68| 0) |#valid|))) (exists ((|v_#valid_215| (Array Int Int)) (|v_ULTIMATE.start_main_~data~0#1.base_83| Int)) (and (<= (+ |v_ULTIMATE.start_main_~data~0#1.base_83| 1) |#StackHeapBarrier|) (<= 8 (select |#length| |v_ULTIMATE.start_main_~data~0#1.base_83|)) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~data~0#1.base_83|) 4) 0) (= (select |v_#valid_215| |v_ULTIMATE.start_main_~data~0#1.base_83|) 1) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~data~0#1.base_83|) 0) |v_ULTIMATE.start_main_~data~0#1.base_83|) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~data~0#1.base_83|) 4) 0) (not (= |v_ULTIMATE.start_main_~data~0#1.base_83| 0)) (= (store |v_#valid_215| |v_ULTIMATE.start_main_~data~0#1.base_83| 0) |#valid|) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~data~0#1.base_83|) 0) 0)))) (= |ULTIMATE.start_main_#res#1| 0))' at error location [2024-11-09 06:22:06,650 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:22:06,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:22:06,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 22 [2024-11-09 06:22:06,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083504943] [2024-11-09 06:22:06,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:22:06,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 06:22:06,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:22:06,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 06:22:06,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=2260, Unknown=49, NotChecked=198, Total=2756 [2024-11-09 06:22:06,652 INFO L87 Difference]: Start difference. First operand 236 states and 305 transitions. Second operand has 24 states, 23 states have (on average 3.782608695652174) internal successors, (87), 23 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:22:13,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:22:13,728 INFO L93 Difference]: Finished difference Result 238 states and 306 transitions. [2024-11-09 06:22:13,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 06:22:13,728 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.782608695652174) internal successors, (87), 23 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-09 06:22:13,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:22:13,730 INFO L225 Difference]: With dead ends: 238 [2024-11-09 06:22:13,730 INFO L226 Difference]: Without dead ends: 218 [2024-11-09 06:22:13,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 60 SyntacticMatches, 5 SemanticMatches, 57 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1102 ImplicationChecksByTransitivity, 157.0s TimeCoverageRelationStatistics Valid=285, Invalid=2866, Unknown=49, NotChecked=222, Total=3422 [2024-11-09 06:22:13,731 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 10 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 849 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 285 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2024-11-09 06:22:13,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 554 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 849 Invalid, 0 Unknown, 285 Unchecked, 5.6s Time] [2024-11-09 06:22:13,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-09 06:22:13,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2024-11-09 06:22:13,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 178 states have (on average 1.6067415730337078) internal successors, (286), 217 states have internal predecessors, (286), 0 states have call successors, (0), 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 06:22:13,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 286 transitions. [2024-11-09 06:22:13,736 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 286 transitions. Word has length 36 [2024-11-09 06:22:13,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:22:13,736 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 286 transitions. [2024-11-09 06:22:13,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.782608695652174) internal successors, (87), 23 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:22:13,736 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 286 transitions. [2024-11-09 06:22:13,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 06:22:13,737 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:22:13,737 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:22:13,754 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63998fbf-0d08-484b-8914-064e59d2e1f3/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 06:22:13,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63998fbf-0d08-484b-8914-064e59d2e1f3/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-09 06:22:13,938 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-11-09 06:22:13,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:22:13,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1337999859, now seen corresponding path program 1 times [2024-11-09 06:22:13,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:22:13,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758947448] [2024-11-09 06:22:13,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:22:13,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:22:13,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:22:14,223 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 06:22:14,223 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:22:14,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758947448] [2024-11-09 06:22:14,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758947448] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:22:14,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:22:14,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:22:14,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583024529] [2024-11-09 06:22:14,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:22:14,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:22:14,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:22:14,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:22:14,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:22:14,226 INFO L87 Difference]: Start difference. First operand 218 states and 286 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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 06:22:15,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:22:15,398 INFO L93 Difference]: Finished difference Result 217 states and 284 transitions. [2024-11-09 06:22:15,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:22:15,399 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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 06:22:15,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:22:15,400 INFO L225 Difference]: With dead ends: 217 [2024-11-09 06:22:15,400 INFO L226 Difference]: Without dead ends: 217 [2024-11-09 06:22:15,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:22:15,401 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 15 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:22:15,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 241 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 06:22:15,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-09 06:22:15,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2024-11-09 06:22:15,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 178 states have (on average 1.595505617977528) internal successors, (284), 216 states have internal predecessors, (284), 0 states have call successors, (0), 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 06:22:15,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 284 transitions. [2024-11-09 06:22:15,405 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 284 transitions. Word has length 38 [2024-11-09 06:22:15,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:22:15,405 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 284 transitions. [2024-11-09 06:22:15,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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 06:22:15,406 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 284 transitions. [2024-11-09 06:22:15,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 06:22:15,406 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:22:15,406 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:22:15,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-09 06:22:15,406 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-11-09 06:22:15,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:22:15,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1179446249, now seen corresponding path program 1 times [2024-11-09 06:22:15,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:22:15,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985753951] [2024-11-09 06:22:15,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:22:15,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:22:15,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:22:16,186 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:22:16,186 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:22:16,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985753951] [2024-11-09 06:22:16,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985753951] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:22:16,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921893000] [2024-11-09 06:22:16,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:22:16,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:22:16,187 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63998fbf-0d08-484b-8914-064e59d2e1f3/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:22:16,188 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63998fbf-0d08-484b-8914-064e59d2e1f3/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:22:16,189 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63998fbf-0d08-484b-8914-064e59d2e1f3/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 06:22:16,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:22:16,374 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 06:22:16,376 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:22:16,388 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 06:22:16,524 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 06:22:16,524 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 06:22:16,690 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 06:22:16,691 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 06:22:16,759 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 06:22:16,847 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:22:16,848 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 25 treesize of output 26 [2024-11-09 06:22:16,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-09 06:22:16,916 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:22:16,916 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:22:17,132 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:22:17,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2024-11-09 06:22:17,149 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 33 treesize of output 25 [2024-11-09 06:22:17,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-09 06:22:17,638 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:22:17,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921893000] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:22:17,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [732733412] [2024-11-09 06:22:17,640 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2024-11-09 06:22:17,640 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:22:17,640 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:22:17,640 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:22:17,640 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:22:37,697 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:23:23,116 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '14581#(and (not (= (select |#valid| |ULTIMATE.start_main_~item2~0#1.base|) 1)) (or (not (= |ULTIMATE.start_main_~item2~0#1.base| 0)) (not (= |ULTIMATE.start_main_~item~0#1.offset| 0))) (= |ULTIMATE.start_main_~item2~0#1.offset| |ULTIMATE.start_main_~item~0#1.offset|) (exists ((|v_ULTIMATE.start_main_~data~0#1.base_88| Int) (|v_#valid_243| (Array Int Int))) (and (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~data~0#1.base_88|) 4) |ULTIMATE.start_main_~item~0#1.offset|) (= (store |v_#valid_243| |v_ULTIMATE.start_main_~data~0#1.base_88| 0) |#valid|) (not (= |v_ULTIMATE.start_main_~data~0#1.base_88| 0)) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~data~0#1.base_88|) 4) |ULTIMATE.start_main_~item2~0#1.base|) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~data~0#1.base_88|) 0) |v_ULTIMATE.start_main_~data~0#1.base_88|) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~data~0#1.base_88|) 0) 0) (<= (+ |v_ULTIMATE.start_main_~data~0#1.base_88| 1) |#StackHeapBarrier|) (<= 8 (select |#length| |v_ULTIMATE.start_main_~data~0#1.base_88|)) (= (select |v_#valid_243| |v_ULTIMATE.start_main_~data~0#1.base_88|) 1))))' at error location [2024-11-09 06:23:23,117 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:23:23,117 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:23:23,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 13 [2024-11-09 06:23:23,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542571600] [2024-11-09 06:23:23,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:23:23,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 06:23:23,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:23:23,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 06:23:23,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1286, Unknown=15, NotChecked=0, Total=1482 [2024-11-09 06:23:23,119 INFO L87 Difference]: Start difference. First operand 217 states and 284 transitions. Second operand has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 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 06:23:26,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:23:26,906 INFO L93 Difference]: Finished difference Result 231 states and 280 transitions. [2024-11-09 06:23:26,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 06:23:26,907 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 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) Word has length 40 [2024-11-09 06:23:26,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:23:26,908 INFO L225 Difference]: With dead ends: 231 [2024-11-09 06:23:26,908 INFO L226 Difference]: Without dead ends: 231 [2024-11-09 06:23:26,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 46.9s TimeCoverageRelationStatistics Valid=239, Invalid=1726, Unknown=15, NotChecked=0, Total=1980 [2024-11-09 06:23:26,909 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 252 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:23:26,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 407 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-09 06:23:26,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-11-09 06:23:26,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 214. [2024-11-09 06:23:26,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 175 states have (on average 1.5942857142857143) internal successors, (279), 213 states have internal predecessors, (279), 0 states have call successors, (0), 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 06:23:26,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 279 transitions. [2024-11-09 06:23:26,915 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 279 transitions. Word has length 40 [2024-11-09 06:23:26,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:23:26,916 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 279 transitions. [2024-11-09 06:23:26,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 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 06:23:26,916 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 279 transitions. [2024-11-09 06:23:26,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 06:23:26,917 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:23:26,917 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:23:26,941 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63998fbf-0d08-484b-8914-064e59d2e1f3/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-09 06:23:27,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63998fbf-0d08-484b-8914-064e59d2e1f3/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:23:27,118 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-11-09 06:23:27,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:23:27,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1237894805, now seen corresponding path program 1 times [2024-11-09 06:23:27,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:23:27,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014155205] [2024-11-09 06:23:27,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:23:27,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:23:27,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:23:28,073 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:23:28,073 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:23:28,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014155205] [2024-11-09 06:23:28,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014155205] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:23:28,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937134112] [2024-11-09 06:23:28,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:23:28,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:23:28,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63998fbf-0d08-484b-8914-064e59d2e1f3/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:23:28,075 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63998fbf-0d08-484b-8914-064e59d2e1f3/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:23:28,076 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63998fbf-0d08-484b-8914-064e59d2e1f3/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 06:23:28,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:23:28,285 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 06:23:28,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:23:28,952 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 15 treesize of output 1 [2024-11-09 06:23:29,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:23:29,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-09 06:23:29,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 06:23:29,558 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:23:29,558 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:23:30,755 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:23:30,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937134112] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:23:30,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1717309669] [2024-11-09 06:23:30,758 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2024-11-09 06:23:30,758 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:23:30,759 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:23:30,759 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:23:30,759 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:23:50,885 INFO L180 IcfgInterpreter]: Interpretation finished