./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/heap-manipulation/dancing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/dancing.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c2e0266b63b958a771d0226973905d5a39a7a28d05d194ae66381394d9ab520a --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 15:03:11,379 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 15:03:11,442 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-12-02 15:03:11,447 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 15:03:11,447 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 15:03:11,471 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 15:03:11,471 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 15:03:11,472 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 15:03:11,472 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 15:03:11,473 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 15:03:11,474 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 15:03:11,474 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 15:03:11,474 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 15:03:11,475 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 15:03:11,476 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 15:03:11,476 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 15:03:11,477 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 15:03:11,477 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 15:03:11,477 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 15:03:11,478 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 15:03:11,479 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 15:03:11,479 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 15:03:11,480 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 15:03:11,480 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 15:03:11,481 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 15:03:11,482 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 15:03:11,482 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 15:03:11,482 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 15:03:11,483 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 15:03:11,483 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 15:03:11,483 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 15:03:11,484 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 15:03:11,484 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 15:03:11,484 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 15:03:11,485 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 15:03:11,485 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 15:03:11,485 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 15:03:11,485 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 15:03:11,485 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 15:03:11,486 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 15:03:11,486 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 15:03:11,486 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 15:03:11,486 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 15:03:11,487 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 15:03:11,487 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 15:03:11,487 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 15:03:11,487 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 15:03:11,487 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 15:03:11,487 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_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c2e0266b63b958a771d0226973905d5a39a7a28d05d194ae66381394d9ab520a [2023-12-02 15:03:11,691 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 15:03:11,712 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 15:03:11,715 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 15:03:11,716 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 15:03:11,716 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 15:03:11,717 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/heap-manipulation/dancing.i [2023-12-02 15:03:14,466 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 15:03:14,679 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 15:03:14,679 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/sv-benchmarks/c/heap-manipulation/dancing.i [2023-12-02 15:03:14,692 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/data/07f260cab/e55a9e5049384dd9a3b660c8b74b4c1c/FLAGea4dfa12b [2023-12-02 15:03:14,704 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/data/07f260cab/e55a9e5049384dd9a3b660c8b74b4c1c [2023-12-02 15:03:14,706 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 15:03:14,707 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 15:03:14,708 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 15:03:14,708 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 15:03:14,712 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 15:03:14,713 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:03:14" (1/1) ... [2023-12-02 15:03:14,714 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b1933a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:03:14, skipping insertion in model container [2023-12-02 15:03:14,715 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:03:14" (1/1) ... [2023-12-02 15:03:14,758 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 15:03:15,022 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:03:15,032 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 15:03:15,071 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:03:15,101 INFO L206 MainTranslator]: Completed translation [2023-12-02 15:03:15,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:03:15 WrapperNode [2023-12-02 15:03:15,102 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 15:03:15,103 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 15:03:15,103 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 15:03:15,103 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 15:03:15,110 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:03:15" (1/1) ... [2023-12-02 15:03:15,123 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:03:15" (1/1) ... [2023-12-02 15:03:15,147 INFO L138 Inliner]: procedures = 124, calls = 41, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 101 [2023-12-02 15:03:15,148 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 15:03:15,149 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 15:03:15,149 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 15:03:15,149 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 15:03:15,159 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:03:15" (1/1) ... [2023-12-02 15:03:15,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:03:15" (1/1) ... [2023-12-02 15:03:15,163 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:03:15" (1/1) ... [2023-12-02 15:03:15,163 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:03:15" (1/1) ... [2023-12-02 15:03:15,170 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:03:15" (1/1) ... [2023-12-02 15:03:15,174 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:03:15" (1/1) ... [2023-12-02 15:03:15,176 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:03:15" (1/1) ... [2023-12-02 15:03:15,178 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:03:15" (1/1) ... [2023-12-02 15:03:15,181 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 15:03:15,182 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 15:03:15,182 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 15:03:15,182 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 15:03:15,183 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:03:15" (1/1) ... [2023-12-02 15:03:15,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 15:03:15,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:03:15,212 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 15:03:15,215 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 15:03:15,244 INFO L130 BoogieDeclarations]: Found specification of procedure is_list_containing_x [2023-12-02 15:03:15,244 INFO L138 BoogieDeclarations]: Found implementation of procedure is_list_containing_x [2023-12-02 15:03:15,244 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-02 15:03:15,244 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-02 15:03:15,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 15:03:15,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 15:03:15,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 15:03:15,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 15:03:15,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 15:03:15,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 15:03:15,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 15:03:15,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 15:03:15,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 15:03:15,379 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 15:03:15,381 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 15:03:15,673 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 15:03:15,715 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 15:03:15,715 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-02 15:03:15,717 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:03:15 BoogieIcfgContainer [2023-12-02 15:03:15,717 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 15:03:15,719 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 15:03:15,719 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 15:03:15,722 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 15:03:15,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 03:03:14" (1/3) ... [2023-12-02 15:03:15,723 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ffed365 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:03:15, skipping insertion in model container [2023-12-02 15:03:15,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:03:15" (2/3) ... [2023-12-02 15:03:15,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ffed365 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:03:15, skipping insertion in model container [2023-12-02 15:03:15,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:03:15" (3/3) ... [2023-12-02 15:03:15,725 INFO L112 eAbstractionObserver]: Analyzing ICFG dancing.i [2023-12-02 15:03:15,739 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 15:03:15,739 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2023-12-02 15:03:15,778 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 15:03:15,783 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@221a078d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 15:03:15,783 INFO L358 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2023-12-02 15:03:15,787 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 92 states have internal predecessors, (104), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 15:03:15,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 15:03:15,792 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:03:15,792 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 15:03:15,793 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-12-02 15:03:15,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:03:15,796 INFO L85 PathProgramCache]: Analyzing trace with hash 7134, now seen corresponding path program 1 times [2023-12-02 15:03:15,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:03:15,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667662649] [2023-12-02 15:03:15,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:03:15,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:03:15,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:03:15,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:03:15,984 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:03:15,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667662649] [2023-12-02 15:03:15,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667662649] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:03:15,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:03:15,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 15:03:15,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634100187] [2023-12-02 15:03:15,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:03:15,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 15:03:15,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:03:16,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 15:03:16,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:03:16,022 INFO L87 Difference]: Start difference. First operand has 101 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 92 states have internal predecessors, (104), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:03:16,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:03:16,143 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2023-12-02 15:03:16,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:03:16,145 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2023-12-02 15:03:16,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:03:16,153 INFO L225 Difference]: With dead ends: 98 [2023-12-02 15:03:16,153 INFO L226 Difference]: Without dead ends: 97 [2023-12-02 15:03:16,155 INFO L412 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 [2023-12-02 15:03:16,158 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 74 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:03:16,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 81 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:03:16,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-12-02 15:03:16,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2023-12-02 15:03:16,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 47 states have (on average 2.0638297872340425) internal successors, (97), 88 states have internal predecessors, (97), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 15:03:16,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2023-12-02 15:03:16,200 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 109 transitions. Word has length 2 [2023-12-02 15:03:16,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:03:16,201 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 109 transitions. [2023-12-02 15:03:16,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:03:16,201 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2023-12-02 15:03:16,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 15:03:16,202 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:03:16,202 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 15:03:16,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 15:03:16,202 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-12-02 15:03:16,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:03:16,203 INFO L85 PathProgramCache]: Analyzing trace with hash 7135, now seen corresponding path program 1 times [2023-12-02 15:03:16,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:03:16,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79248843] [2023-12-02 15:03:16,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:03:16,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:03:16,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:03:16,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:03:16,285 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:03:16,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79248843] [2023-12-02 15:03:16,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79248843] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:03:16,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:03:16,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 15:03:16,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718946533] [2023-12-02 15:03:16,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:03:16,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 15:03:16,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:03:16,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 15:03:16,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:03:16,289 INFO L87 Difference]: Start difference. First operand 97 states and 109 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:03:16,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:03:16,400 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2023-12-02 15:03:16,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:03:16,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2023-12-02 15:03:16,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:03:16,402 INFO L225 Difference]: With dead ends: 95 [2023-12-02 15:03:16,402 INFO L226 Difference]: Without dead ends: 95 [2023-12-02 15:03:16,403 INFO L412 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 [2023-12-02 15:03:16,404 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 72 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:03:16,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 82 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:03:16,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-12-02 15:03:16,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2023-12-02 15:03:16,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 47 states have (on average 2.021276595744681) internal successors, (95), 86 states have internal predecessors, (95), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 15:03:16,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2023-12-02 15:03:16,415 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 2 [2023-12-02 15:03:16,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:03:16,416 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2023-12-02 15:03:16,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:03:16,416 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2023-12-02 15:03:16,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-02 15:03:16,417 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:03:16,417 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:03:16,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 15:03:16,417 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-12-02 15:03:16,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:03:16,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1768943990, now seen corresponding path program 1 times [2023-12-02 15:03:16,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:03:16,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125642541] [2023-12-02 15:03:16,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:03:16,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:03:16,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:03:16,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:03:16,498 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:03:16,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125642541] [2023-12-02 15:03:16,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125642541] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:03:16,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:03:16,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 15:03:16,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268226417] [2023-12-02 15:03:16,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:03:16,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 15:03:16,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:03:16,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 15:03:16,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:03:16,501 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:03:16,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:03:16,627 INFO L93 Difference]: Finished difference Result 151 states and 173 transitions. [2023-12-02 15:03:16,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:03:16,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-12-02 15:03:16,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:03:16,630 INFO L225 Difference]: With dead ends: 151 [2023-12-02 15:03:16,630 INFO L226 Difference]: Without dead ends: 151 [2023-12-02 15:03:16,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:03:16,632 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 64 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:03:16,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 183 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:03:16,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-12-02 15:03:16,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 93. [2023-12-02 15:03:16,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 47 states have (on average 1.9787234042553192) internal successors, (93), 84 states have internal predecessors, (93), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 15:03:16,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 105 transitions. [2023-12-02 15:03:16,645 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 105 transitions. Word has length 7 [2023-12-02 15:03:16,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:03:16,645 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 105 transitions. [2023-12-02 15:03:16,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:03:16,646 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2023-12-02 15:03:16,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-02 15:03:16,646 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:03:16,646 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:03:16,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 15:03:16,647 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-12-02 15:03:16,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:03:16,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1768943989, now seen corresponding path program 1 times [2023-12-02 15:03:16,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:03:16,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48612740] [2023-12-02 15:03:16,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:03:16,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:03:16,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:03:16,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:03:16,747 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:03:16,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48612740] [2023-12-02 15:03:16,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48612740] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:03:16,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:03:16,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 15:03:16,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084596461] [2023-12-02 15:03:16,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:03:16,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 15:03:16,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:03:16,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 15:03:16,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:03:16,750 INFO L87 Difference]: Start difference. First operand 93 states and 105 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:03:16,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:03:16,877 INFO L93 Difference]: Finished difference Result 151 states and 172 transitions. [2023-12-02 15:03:16,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:03:16,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-12-02 15:03:16,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:03:16,880 INFO L225 Difference]: With dead ends: 151 [2023-12-02 15:03:16,880 INFO L226 Difference]: Without dead ends: 151 [2023-12-02 15:03:16,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:03:16,881 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 64 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:03:16,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 187 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:03:16,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-12-02 15:03:16,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 91. [2023-12-02 15:03:16,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 47 states have (on average 1.9361702127659575) internal successors, (91), 82 states have internal predecessors, (91), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 15:03:16,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2023-12-02 15:03:16,891 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 103 transitions. Word has length 7 [2023-12-02 15:03:16,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:03:16,891 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 103 transitions. [2023-12-02 15:03:16,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:03:16,892 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2023-12-02 15:03:16,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-02 15:03:16,892 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:03:16,892 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:03:16,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 15:03:16,893 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-12-02 15:03:16,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:03:16,893 INFO L85 PathProgramCache]: Analyzing trace with hash 854792323, now seen corresponding path program 1 times [2023-12-02 15:03:16,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:03:16,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181917116] [2023-12-02 15:03:16,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:03:16,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:03:16,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:03:17,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:03:17,012 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:03:17,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181917116] [2023-12-02 15:03:17,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181917116] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:03:17,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:03:17,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 15:03:17,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224225568] [2023-12-02 15:03:17,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:03:17,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 15:03:17,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:03:17,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 15:03:17,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:03:17,014 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:03:17,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:03:17,126 INFO L93 Difference]: Finished difference Result 163 states and 189 transitions. [2023-12-02 15:03:17,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 15:03:17,127 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-02 15:03:17,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:03:17,130 INFO L225 Difference]: With dead ends: 163 [2023-12-02 15:03:17,130 INFO L226 Difference]: Without dead ends: 163 [2023-12-02 15:03:17,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 15:03:17,132 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 70 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:03:17,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 336 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:03:17,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2023-12-02 15:03:17,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 126. [2023-12-02 15:03:17,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 77 states have (on average 2.0259740259740258) internal successors, (156), 113 states have internal predecessors, (156), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-02 15:03:17,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 176 transitions. [2023-12-02 15:03:17,145 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 176 transitions. Word has length 9 [2023-12-02 15:03:17,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:03:17,145 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 176 transitions. [2023-12-02 15:03:17,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:03:17,146 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 176 transitions. [2023-12-02 15:03:17,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-02 15:03:17,146 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:03:17,146 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:03:17,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 15:03:17,147 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-12-02 15:03:17,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:03:17,148 INFO L85 PathProgramCache]: Analyzing trace with hash 851874765, now seen corresponding path program 1 times [2023-12-02 15:03:17,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:03:17,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267406121] [2023-12-02 15:03:17,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:03:17,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:03:17,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:03:17,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:03:17,290 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:03:17,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267406121] [2023-12-02 15:03:17,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267406121] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:03:17,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:03:17,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 15:03:17,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133138984] [2023-12-02 15:03:17,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:03:17,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 15:03:17,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:03:17,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 15:03:17,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:03:17,293 INFO L87 Difference]: Start difference. First operand 126 states and 176 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:03:17,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:03:17,405 INFO L93 Difference]: Finished difference Result 125 states and 175 transitions. [2023-12-02 15:03:17,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 15:03:17,406 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-02 15:03:17,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:03:17,407 INFO L225 Difference]: With dead ends: 125 [2023-12-02 15:03:17,408 INFO L226 Difference]: Without dead ends: 125 [2023-12-02 15:03:17,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-02 15:03:17,409 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 128 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:03:17,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 110 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:03:17,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-12-02 15:03:17,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2023-12-02 15:03:17,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 77 states have (on average 2.012987012987013) internal successors, (155), 112 states have internal predecessors, (155), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-02 15:03:17,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 175 transitions. [2023-12-02 15:03:17,418 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 175 transitions. Word has length 9 [2023-12-02 15:03:17,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:03:17,419 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 175 transitions. [2023-12-02 15:03:17,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:03:17,419 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 175 transitions. [2023-12-02 15:03:17,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-02 15:03:17,419 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:03:17,419 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:03:17,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-02 15:03:17,420 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-12-02 15:03:17,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:03:17,420 INFO L85 PathProgramCache]: Analyzing trace with hash 851874766, now seen corresponding path program 1 times [2023-12-02 15:03:17,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:03:17,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74379781] [2023-12-02 15:03:17,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:03:17,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:03:17,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:03:17,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:03:17,602 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:03:17,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74379781] [2023-12-02 15:03:17,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74379781] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:03:17,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:03:17,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 15:03:17,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352534722] [2023-12-02 15:03:17,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:03:17,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 15:03:17,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:03:17,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 15:03:17,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 15:03:17,604 INFO L87 Difference]: Start difference. First operand 125 states and 175 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:03:17,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:03:17,747 INFO L93 Difference]: Finished difference Result 124 states and 174 transitions. [2023-12-02 15:03:17,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 15:03:17,747 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-02 15:03:17,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:03:17,749 INFO L225 Difference]: With dead ends: 124 [2023-12-02 15:03:17,749 INFO L226 Difference]: Without dead ends: 124 [2023-12-02 15:03:17,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-02 15:03:17,750 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 195 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:03:17,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 95 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:03:17,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-12-02 15:03:17,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2023-12-02 15:03:17,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 77 states have (on average 2.0) internal successors, (154), 111 states have internal predecessors, (154), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-02 15:03:17,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 174 transitions. [2023-12-02 15:03:17,758 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 174 transitions. Word has length 9 [2023-12-02 15:03:17,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:03:17,758 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 174 transitions. [2023-12-02 15:03:17,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:03:17,758 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 174 transitions. [2023-12-02 15:03:17,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 15:03:17,759 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:03:17,759 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:03:17,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-02 15:03:17,759 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-12-02 15:03:17,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:03:17,760 INFO L85 PathProgramCache]: Analyzing trace with hash 256581071, now seen corresponding path program 1 times [2023-12-02 15:03:17,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:03:17,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417259103] [2023-12-02 15:03:17,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:03:17,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:03:17,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:03:17,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:03:17,829 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:03:17,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417259103] [2023-12-02 15:03:17,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417259103] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:03:17,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:03:17,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 15:03:17,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832568271] [2023-12-02 15:03:17,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:03:17,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 15:03:17,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:03:17,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 15:03:17,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 15:03:17,831 INFO L87 Difference]: Start difference. First operand 124 states and 174 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 15:03:18,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:03:18,042 INFO L93 Difference]: Finished difference Result 146 states and 169 transitions. [2023-12-02 15:03:18,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 15:03:18,043 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-12-02 15:03:18,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:03:18,044 INFO L225 Difference]: With dead ends: 146 [2023-12-02 15:03:18,045 INFO L226 Difference]: Without dead ends: 146 [2023-12-02 15:03:18,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-02 15:03:18,046 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 157 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 15:03:18,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 187 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 15:03:18,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-12-02 15:03:18,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 119. [2023-12-02 15:03:18,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 77 states have (on average 1.8571428571428572) internal successors, (143), 106 states have internal predecessors, (143), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-02 15:03:18,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 163 transitions. [2023-12-02 15:03:18,054 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 163 transitions. Word has length 12 [2023-12-02 15:03:18,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:03:18,054 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 163 transitions. [2023-12-02 15:03:18,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 15:03:18,054 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 163 transitions. [2023-12-02 15:03:18,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 15:03:18,055 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:03:18,055 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:03:18,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-02 15:03:18,055 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-12-02 15:03:18,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:03:18,056 INFO L85 PathProgramCache]: Analyzing trace with hash 256581072, now seen corresponding path program 1 times [2023-12-02 15:03:18,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:03:18,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408603242] [2023-12-02 15:03:18,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:03:18,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:03:18,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:03:18,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:03:18,165 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:03:18,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408603242] [2023-12-02 15:03:18,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408603242] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:03:18,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:03:18,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 15:03:18,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323411889] [2023-12-02 15:03:18,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:03:18,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 15:03:18,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:03:18,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 15:03:18,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 15:03:18,167 INFO L87 Difference]: Start difference. First operand 119 states and 163 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 15:03:18,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:03:18,389 INFO L93 Difference]: Finished difference Result 142 states and 164 transitions. [2023-12-02 15:03:18,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 15:03:18,389 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-12-02 15:03:18,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:03:18,390 INFO L225 Difference]: With dead ends: 142 [2023-12-02 15:03:18,390 INFO L226 Difference]: Without dead ends: 142 [2023-12-02 15:03:18,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-02 15:03:18,391 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 228 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 15:03:18,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 157 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 15:03:18,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-12-02 15:03:18,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 119. [2023-12-02 15:03:18,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 77 states have (on average 1.7792207792207793) internal successors, (137), 106 states have internal predecessors, (137), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-02 15:03:18,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 157 transitions. [2023-12-02 15:03:18,398 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 157 transitions. Word has length 12 [2023-12-02 15:03:18,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:03:18,398 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 157 transitions. [2023-12-02 15:03:18,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 15:03:18,399 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 157 transitions. [2023-12-02 15:03:18,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-02 15:03:18,399 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:03:18,399 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:03:18,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-02 15:03:18,400 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-12-02 15:03:18,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:03:18,400 INFO L85 PathProgramCache]: Analyzing trace with hash -2053455688, now seen corresponding path program 1 times [2023-12-02 15:03:18,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:03:18,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702610606] [2023-12-02 15:03:18,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:03:18,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:03:18,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:03:18,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:03:18,485 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:03:18,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702610606] [2023-12-02 15:03:18,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702610606] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:03:18,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400307809] [2023-12-02 15:03:18,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:03:18,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:03:18,486 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:03:18,489 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:03:18,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 15:03:18,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:03:18,597 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-02 15:03:18,601 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:03:18,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 15:03:18,667 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-12-02 15:03:18,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-12-02 15:03:18,697 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 15:03:18,697 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:03:18,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400307809] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:03:18,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 15:03:18,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2023-12-02 15:03:18,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690990153] [2023-12-02 15:03:18,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:03:18,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 15:03:18,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:03:18,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 15:03:18,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 15:03:18,699 INFO L87 Difference]: Start difference. First operand 119 states and 157 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:03:18,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:03:18,850 INFO L93 Difference]: Finished difference Result 131 states and 172 transitions. [2023-12-02 15:03:18,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 15:03:18,851 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-12-02 15:03:18,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:03:18,852 INFO L225 Difference]: With dead ends: 131 [2023-12-02 15:03:18,852 INFO L226 Difference]: Without dead ends: 131 [2023-12-02 15:03:18,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-02 15:03:18,853 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 79 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:03:18,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 141 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:03:18,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-12-02 15:03:18,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2023-12-02 15:03:18,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 84 states have (on average 1.75) internal successors, (147), 112 states have internal predecessors, (147), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-02 15:03:18,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 169 transitions. [2023-12-02 15:03:18,860 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 169 transitions. Word has length 15 [2023-12-02 15:03:18,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:03:18,860 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 169 transitions. [2023-12-02 15:03:18,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:03:18,860 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 169 transitions. [2023-12-02 15:03:18,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-02 15:03:18,861 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:03:18,861 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:03:18,875 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 15:03:19,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-02 15:03:19,064 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-12-02 15:03:19,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:03:19,064 INFO L85 PathProgramCache]: Analyzing trace with hash -2053455687, now seen corresponding path program 1 times [2023-12-02 15:03:19,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:03:19,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77355852] [2023-12-02 15:03:19,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:03:19,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:03:19,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:03:19,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:03:19,224 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:03:19,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77355852] [2023-12-02 15:03:19,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77355852] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:03:19,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035052081] [2023-12-02 15:03:19,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:03:19,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:03:19,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:03:19,225 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:03:19,231 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 15:03:19,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:03:19,336 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-02 15:03:19,339 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:03:19,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:03:19,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 15:03:19,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:03:19,493 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:03:19,696 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 41 treesize of output 37 [2023-12-02 15:03:19,723 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:03:19,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035052081] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:03:19,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1430074818] [2023-12-02 15:03:19,741 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-12-02 15:03:19,741 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:03:19,745 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:03:19,750 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:03:19,751 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:03:25,448 INFO L197 IcfgInterpreter]: Interpreting procedure is_list_containing_x with input of size 174 for LOIs [2023-12-02 15:03:25,745 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:03:33,077 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2751#(and (or (not (= is_list_containing_x_~x.offset is_list_containing_x_~l.offset)) (not (= is_list_containing_x_~l.base is_list_containing_x_~x.base))) (exists ((|v_ULTIMATE.start_main_#t~nondet16#1_17| Int)) (= (mod |v_ULTIMATE.start_main_#t~nondet16#1_17| 256) 0)) (= |is_list_containing_x_#in~x.offset| is_list_containing_x_~x.offset) (= is_list_containing_x_~x.base |is_list_containing_x_#in~x.base|) (= |is_list_containing_x_#in~l.offset| is_list_containing_x_~l.offset) (exists ((|v_ULTIMATE.start_main_~tail~0#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1| Int)) (and (= (select |#valid| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|) (+ |v_ULTIMATE.start_main_~tail~0#1.offset_BEFORE_CALL_1| 4))) 1) (<= (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|) (+ |v_ULTIMATE.start_main_~tail~0#1.offset_BEFORE_CALL_1| 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|) (+ |v_ULTIMATE.start_main_~tail~0#1.offset_BEFORE_CALL_1| 4)))) (exists ((|v_#memory_$Pointer$.offset_77| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_77| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|) (+ |v_ULTIMATE.start_main_~tail~0#1.offset_BEFORE_CALL_1| 4)) (store (select |v_#memory_$Pointer$.offset_77| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|) (+ |v_ULTIMATE.start_main_~tail~0#1.offset_BEFORE_CALL_1| 4))) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|) (+ |v_ULTIMATE.start_main_~tail~0#1.offset_BEFORE_CALL_1| 4)) 4) 0)) |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1| (store (select (store |v_#memory_$Pointer$.offset_77| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|) (+ |v_ULTIMATE.start_main_~tail~0#1.offset_BEFORE_CALL_1| 4)) (store (select |v_#memory_$Pointer$.offset_77| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|) (+ |v_ULTIMATE.start_main_~tail~0#1.offset_BEFORE_CALL_1| 4))) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|) (+ |v_ULTIMATE.start_main_~tail~0#1.offset_BEFORE_CALL_1| 4)) 4) 0)) |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|) (+ |v_ULTIMATE.start_main_~tail~0#1.offset_BEFORE_CALL_1| 4) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|) (+ |v_ULTIMATE.start_main_~tail~0#1.offset_BEFORE_CALL_1| 4)))))) (exists ((|v_#memory_int_68| (Array Int (Array Int Int))) (|v_#memory_int_69| (Array Int (Array Int Int)))) (and (= |v_#memory_int_69| (store |v_#memory_int_68| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|) (+ |v_ULTIMATE.start_main_~tail~0#1.offset_BEFORE_CALL_1| 4)) (store (select |v_#memory_int_68| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|) (+ |v_ULTIMATE.start_main_~tail~0#1.offset_BEFORE_CALL_1| 4))) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|) (+ |v_ULTIMATE.start_main_~tail~0#1.offset_BEFORE_CALL_1| 4)) 4) (select (select |v_#memory_int_69| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|) (+ |v_ULTIMATE.start_main_~tail~0#1.offset_BEFORE_CALL_1| 4))) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|) (+ |v_ULTIMATE.start_main_~tail~0#1.offset_BEFORE_CALL_1| 4)) 4))))) (= (store |v_#memory_int_69| |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1| (store (select |v_#memory_int_69| |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|) (+ |v_ULTIMATE.start_main_~tail~0#1.offset_BEFORE_CALL_1| 4) (select (select |#memory_int| |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|) (+ |v_ULTIMATE.start_main_~tail~0#1.offset_BEFORE_CALL_1| 4)))) |#memory_int|))) (= 1 (select |#valid| |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|)) (<= (+ |v_ULTIMATE.start_main_~tail~0#1.offset_BEFORE_CALL_1| 8) (select |#length| |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|)) (exists ((|v_ULTIMATE.start_main_#t~nondet18#1_19| Int) (|v_ULTIMATE.start_main_~x~0#1.base_34| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_34| Int)) (and (or (and (not (= (mod |v_ULTIMATE.start_main_#t~nondet18#1_19| 256) 0)) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|) 4) |is_list_containing_x_#in~x.base|) (= |is_list_containing_x_#in~x.offset| 0)) (and (= |is_list_containing_x_#in~x.base| |v_ULTIMATE.start_main_~x~0#1.base_34|) (= (mod |v_ULTIMATE.start_main_#t~nondet18#1_19| 256) 0) (= |is_list_containing_x_#in~x.offset| |v_ULTIMATE.start_main_~x~0#1.offset_34|))) (<= 1 |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|) 4) 0) (<= 2 |is_list_containing_x_#in~l.base|) (= |is_list_containing_x_#in~l.offset| 0) (<= 2 |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|) (= |v_ULTIMATE.start_main_~tail~0#1.offset_BEFORE_CALL_1| 0))) (exists ((|v_#memory_$Pointer$.base_77| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store (store |v_#memory_$Pointer$.base_77| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|) (+ |v_ULTIMATE.start_main_~tail~0#1.offset_BEFORE_CALL_1| 4)) (store (select |v_#memory_$Pointer$.base_77| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|) (+ |v_ULTIMATE.start_main_~tail~0#1.offset_BEFORE_CALL_1| 4))) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|) (+ |v_ULTIMATE.start_main_~tail~0#1.offset_BEFORE_CALL_1| 4)) 4) 0)) |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1| (store (select (store |v_#memory_$Pointer$.base_77| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|) (+ |v_ULTIMATE.start_main_~tail~0#1.offset_BEFORE_CALL_1| 4)) (store (select |v_#memory_$Pointer$.base_77| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|) (+ |v_ULTIMATE.start_main_~tail~0#1.offset_BEFORE_CALL_1| 4))) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|) (+ |v_ULTIMATE.start_main_~tail~0#1.offset_BEFORE_CALL_1| 4)) 4) 0)) |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|) (+ |v_ULTIMATE.start_main_~tail~0#1.offset_BEFORE_CALL_1| 4) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tail~0#1.base_BEFORE_CALL_1|) (+ |v_ULTIMATE.start_main_~tail~0#1.offset_BEFORE_CALL_1| 4)))))))) (<= (select |#length| is_list_containing_x_~l.base) (+ 7 is_list_containing_x_~l.offset)) (= is_list_containing_x_~l.base |is_list_containing_x_#in~l.base|))' at error location [2023-12-02 15:03:33,077 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 15:03:33,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:03:33,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2023-12-02 15:03:33,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423384883] [2023-12-02 15:03:33,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:03:33,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-02 15:03:33,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:03:33,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-02 15:03:33,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=602, Unknown=3, NotChecked=0, Total=702 [2023-12-02 15:03:33,079 INFO L87 Difference]: Start difference. First operand 127 states and 169 transitions. Second operand has 17 states, 16 states have (on average 2.625) internal successors, (42), 13 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:03:33,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:03:33,419 INFO L93 Difference]: Finished difference Result 128 states and 169 transitions. [2023-12-02 15:03:33,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 15:03:33,419 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.625) internal successors, (42), 13 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-12-02 15:03:33,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:03:33,420 INFO L225 Difference]: With dead ends: 128 [2023-12-02 15:03:33,420 INFO L226 Difference]: Without dead ends: 128 [2023-12-02 15:03:33,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=129, Invalid=738, Unknown=3, NotChecked=0, Total=870 [2023-12-02 15:03:33,421 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 311 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 15:03:33,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 267 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 15:03:33,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-12-02 15:03:33,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2023-12-02 15:03:33,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 84 states have (on average 1.7142857142857142) internal successors, (144), 111 states have internal predecessors, (144), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-02 15:03:33,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 166 transitions. [2023-12-02 15:03:33,427 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 166 transitions. Word has length 15 [2023-12-02 15:03:33,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:03:33,428 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 166 transitions. [2023-12-02 15:03:33,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.625) internal successors, (42), 13 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:03:33,428 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 166 transitions. [2023-12-02 15:03:33,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-02 15:03:33,429 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:03:33,429 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:03:33,433 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-02 15:03:33,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:03:33,632 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-12-02 15:03:33,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:03:33,632 INFO L85 PathProgramCache]: Analyzing trace with hash 367477203, now seen corresponding path program 1 times [2023-12-02 15:03:33,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:03:33,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702146988] [2023-12-02 15:03:33,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:03:33,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:03:33,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:03:33,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:03:33,819 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:03:33,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702146988] [2023-12-02 15:03:33,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702146988] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:03:33,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:03:33,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 15:03:33,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657733480] [2023-12-02 15:03:33,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:03:33,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 15:03:33,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:03:33,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 15:03:33,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-02 15:03:33,821 INFO L87 Difference]: Start difference. First operand 126 states and 166 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 15:03:33,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:03:33,983 INFO L93 Difference]: Finished difference Result 158 states and 199 transitions. [2023-12-02 15:03:33,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 15:03:33,983 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2023-12-02 15:03:33,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:03:33,985 INFO L225 Difference]: With dead ends: 158 [2023-12-02 15:03:33,985 INFO L226 Difference]: Without dead ends: 158 [2023-12-02 15:03:33,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-02 15:03:33,985 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 191 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:03:33,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 276 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:03:33,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2023-12-02 15:03:33,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 123. [2023-12-02 15:03:33,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 81 states have (on average 1.7037037037037037) internal successors, (138), 108 states have internal predecessors, (138), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-02 15:03:33,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 160 transitions. [2023-12-02 15:03:33,991 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 160 transitions. Word has length 16 [2023-12-02 15:03:33,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:03:33,992 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 160 transitions. [2023-12-02 15:03:33,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 15:03:33,992 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 160 transitions. [2023-12-02 15:03:33,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-02 15:03:33,993 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:03:33,993 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:03:33,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-02 15:03:33,993 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-12-02 15:03:33,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:03:33,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1314290421, now seen corresponding path program 1 times [2023-12-02 15:03:33,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:03:33,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381851418] [2023-12-02 15:03:33,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:03:33,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:03:34,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:03:34,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:03:34,153 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:03:34,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381851418] [2023-12-02 15:03:34,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381851418] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:03:34,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:03:34,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 15:03:34,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182259769] [2023-12-02 15:03:34,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:03:34,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 15:03:34,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:03:34,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 15:03:34,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-02 15:03:34,155 INFO L87 Difference]: Start difference. First operand 123 states and 160 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 15:03:34,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:03:34,335 INFO L93 Difference]: Finished difference Result 143 states and 173 transitions. [2023-12-02 15:03:34,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 15:03:34,336 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2023-12-02 15:03:34,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:03:34,337 INFO L225 Difference]: With dead ends: 143 [2023-12-02 15:03:34,337 INFO L226 Difference]: Without dead ends: 143 [2023-12-02 15:03:34,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-02 15:03:34,338 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 72 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:03:34,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 331 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:03:34,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2023-12-02 15:03:34,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 120. [2023-12-02 15:03:34,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 78 states have (on average 1.6923076923076923) internal successors, (132), 105 states have internal predecessors, (132), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-02 15:03:34,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 154 transitions. [2023-12-02 15:03:34,344 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 154 transitions. Word has length 18 [2023-12-02 15:03:34,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:03:34,344 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 154 transitions. [2023-12-02 15:03:34,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 15:03:34,344 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 154 transitions. [2023-12-02 15:03:34,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-02 15:03:34,345 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:03:34,345 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:03:34,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-02 15:03:34,346 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-12-02 15:03:34,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:03:34,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1279619718, now seen corresponding path program 1 times [2023-12-02 15:03:34,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:03:34,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372866296] [2023-12-02 15:03:34,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:03:34,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:03:34,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:03:34,444 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:03:34,444 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:03:34,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372866296] [2023-12-02 15:03:34,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372866296] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:03:34,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715998607] [2023-12-02 15:03:34,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:03:34,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:03:34,445 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:03:34,446 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:03:34,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 15:03:34,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:03:34,545 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-02 15:03:34,546 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:03:34,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:03:34,633 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:03:34,720 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-12-02 15:03:34,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2023-12-02 15:03:34,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:03:34,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715998607] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:03:34,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [491151139] [2023-12-02 15:03:34,732 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2023-12-02 15:03:34,732 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:03:34,733 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:03:34,733 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:03:34,733 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:03:35,110 INFO L197 IcfgInterpreter]: Interpreting procedure is_list_containing_x with input of size 22 for LOIs [2023-12-02 15:03:35,123 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:03:36,869 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3702#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (= |ULTIMATE.start_remove_#in~x#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= 2 |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~tail~0#1.base|) (= |ULTIMATE.start_remove_~x#1.offset| 0) (exists ((|v_ULTIMATE.start_main_#t~nondet16#1_23| Int)) (= (mod |v_ULTIMATE.start_main_#t~nondet16#1_23| 256) 0)) (= |ULTIMATE.start_remove_#in~x#1.offset| 0) (not (= (select |#valid| |ULTIMATE.start_remove_~x#1.base|) 1)) (= |ULTIMATE.start_main_~tail~0#1.offset| 0) (= |ULTIMATE.start_remove_#in~x#1.base| |ULTIMATE.start_remove_~x#1.base|))' at error location [2023-12-02 15:03:36,869 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 15:03:36,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:03:36,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 12 [2023-12-02 15:03:36,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839103967] [2023-12-02 15:03:36,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:03:36,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-02 15:03:36,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:03:36,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-02 15:03:36,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=556, Unknown=2, NotChecked=0, Total=650 [2023-12-02 15:03:36,871 INFO L87 Difference]: Start difference. First operand 120 states and 154 transitions. Second operand has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-02 15:03:37,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:03:37,328 INFO L93 Difference]: Finished difference Result 187 states and 238 transitions. [2023-12-02 15:03:37,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 15:03:37,328 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 18 [2023-12-02 15:03:37,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:03:37,330 INFO L225 Difference]: With dead ends: 187 [2023-12-02 15:03:37,330 INFO L226 Difference]: Without dead ends: 187 [2023-12-02 15:03:37,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=146, Invalid=908, Unknown=2, NotChecked=0, Total=1056 [2023-12-02 15:03:37,331 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 471 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 15:03:37,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 244 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 15:03:37,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2023-12-02 15:03:37,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 158. [2023-12-02 15:03:37,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 110 states have (on average 1.7545454545454546) internal successors, (193), 138 states have internal predecessors, (193), 15 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (20), 14 states have call predecessors, (20), 15 states have call successors, (20) [2023-12-02 15:03:37,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 228 transitions. [2023-12-02 15:03:37,340 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 228 transitions. Word has length 18 [2023-12-02 15:03:37,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:03:37,340 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 228 transitions. [2023-12-02 15:03:37,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-02 15:03:37,341 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 228 transitions. [2023-12-02 15:03:37,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-02 15:03:37,341 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:03:37,341 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:03:37,347 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-02 15:03:37,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:03:37,542 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-12-02 15:03:37,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:03:37,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1279619717, now seen corresponding path program 1 times [2023-12-02 15:03:37,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:03:37,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230948] [2023-12-02 15:03:37,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:03:37,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:03:37,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:03:37,714 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:03:37,714 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:03:37,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230948] [2023-12-02 15:03:37,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230948] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:03:37,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543139521] [2023-12-02 15:03:37,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:03:37,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:03:37,715 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:03:37,716 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:03:37,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 15:03:37,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:03:37,820 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 34 conjunts are in the unsatisfiable core [2023-12-02 15:03:37,822 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:03:38,031 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:03:38,031 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:03:38,229 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:03:38,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2023-12-02 15:03:38,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:03:38,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543139521] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:03:38,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1053445679] [2023-12-02 15:03:38,303 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2023-12-02 15:03:38,303 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:03:38,303 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:03:38,303 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:03:38,304 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:03:38,590 INFO L197 IcfgInterpreter]: Interpreting procedure is_list_containing_x with input of size 22 for LOIs [2023-12-02 15:03:38,607 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:03:40,678 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4201#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (= |ULTIMATE.start_remove_#in~x#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= 2 |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_#t~nondet16#1_29| Int)) (= (mod |v_ULTIMATE.start_main_#t~nondet16#1_29| 256) 0)) (<= 2 |ULTIMATE.start_main_~tail~0#1.base|) (= |ULTIMATE.start_remove_~x#1.offset| 0) (= |ULTIMATE.start_remove_#in~x#1.offset| 0) (= |ULTIMATE.start_main_~tail~0#1.offset| 0) (= |ULTIMATE.start_remove_#in~x#1.base| |ULTIMATE.start_remove_~x#1.base|) (<= (select |#length| |ULTIMATE.start_remove_~x#1.base|) 7))' at error location [2023-12-02 15:03:40,679 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 15:03:40,679 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:03:40,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2023-12-02 15:03:40,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67149239] [2023-12-02 15:03:40,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:03:40,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-02 15:03:40,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:03:40,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-02 15:03:40,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1152, Unknown=2, NotChecked=0, Total=1332 [2023-12-02 15:03:40,681 INFO L87 Difference]: Start difference. First operand 158 states and 228 transitions. Second operand has 24 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 19 states have internal predecessors, (48), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 15:03:41,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:03:41,448 INFO L93 Difference]: Finished difference Result 181 states and 231 transitions. [2023-12-02 15:03:41,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 15:03:41,449 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 19 states have internal predecessors, (48), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 18 [2023-12-02 15:03:41,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:03:41,451 INFO L225 Difference]: With dead ends: 181 [2023-12-02 15:03:41,451 INFO L226 Difference]: Without dead ends: 181 [2023-12-02 15:03:41,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 639 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=283, Invalid=1695, Unknown=2, NotChecked=0, Total=1980 [2023-12-02 15:03:41,452 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 861 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 15:03:41,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [863 Valid, 442 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 15:03:41,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-12-02 15:03:41,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 156. [2023-12-02 15:03:41,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 111 states have (on average 1.6666666666666667) internal successors, (185), 136 states have internal predecessors, (185), 15 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (20), 14 states have call predecessors, (20), 15 states have call successors, (20) [2023-12-02 15:03:41,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 220 transitions. [2023-12-02 15:03:41,460 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 220 transitions. Word has length 18 [2023-12-02 15:03:41,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:03:41,461 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 220 transitions. [2023-12-02 15:03:41,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 19 states have internal predecessors, (48), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 15:03:41,461 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 220 transitions. [2023-12-02 15:03:41,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 15:03:41,462 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:03:41,462 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:03:41,468 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 15:03:41,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-12-02 15:03:41,668 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-12-02 15:03:41,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:03:41,668 INFO L85 PathProgramCache]: Analyzing trace with hash -184074293, now seen corresponding path program 1 times [2023-12-02 15:03:41,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:03:41,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763910089] [2023-12-02 15:03:41,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:03:41,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:03:41,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:03:41,948 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:03:41,948 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:03:41,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763910089] [2023-12-02 15:03:41,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763910089] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:03:41,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328282507] [2023-12-02 15:03:41,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:03:41,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:03:41,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:03:41,950 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:03:41,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 15:03:42,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:03:42,063 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-02 15:03:42,065 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:03:42,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 15:03:42,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 15:03:42,185 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 21 treesize of output 9 [2023-12-02 15:03:42,191 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:03:42,191 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:03:42,213 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 34 treesize of output 28 [2023-12-02 15:03:42,293 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:03:42,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328282507] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:03:42,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [667720511] [2023-12-02 15:03:42,295 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2023-12-02 15:03:42,295 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:03:42,296 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 15:03:42,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:03:42,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2023-12-02 15:03:42,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599341346] [2023-12-02 15:03:42,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:03:42,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-02 15:03:42,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:03:42,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-02 15:03:42,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2023-12-02 15:03:42,299 INFO L87 Difference]: Start difference. First operand 156 states and 220 transitions. Second operand has 17 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:03:43,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:03:43,302 INFO L93 Difference]: Finished difference Result 404 states and 600 transitions. [2023-12-02 15:03:43,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 15:03:43,303 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-12-02 15:03:43,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:03:43,306 INFO L225 Difference]: With dead ends: 404 [2023-12-02 15:03:43,307 INFO L226 Difference]: Without dead ends: 404 [2023-12-02 15:03:43,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2023-12-02 15:03:43,308 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 261 mSDsluCounter, 1080 mSDsCounter, 0 mSdLazyCounter, 1589 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 1614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-02 15:03:43,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 1233 Invalid, 1614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1589 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-02 15:03:43,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2023-12-02 15:03:43,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 179. [2023-12-02 15:03:43,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 127 states have (on average 1.5905511811023623) internal successors, (202), 153 states have internal predecessors, (202), 20 states have call successors, (20), 7 states have call predecessors, (20), 8 states have return successors, (25), 18 states have call predecessors, (25), 20 states have call successors, (25) [2023-12-02 15:03:43,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 247 transitions. [2023-12-02 15:03:43,323 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 247 transitions. Word has length 21 [2023-12-02 15:03:43,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:03:43,323 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 247 transitions. [2023-12-02 15:03:43,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:03:43,324 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 247 transitions. [2023-12-02 15:03:43,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 15:03:43,324 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:03:43,325 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:03:43,330 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 15:03:43,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-12-02 15:03:43,525 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-12-02 15:03:43,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:03:43,526 INFO L85 PathProgramCache]: Analyzing trace with hash -184074292, now seen corresponding path program 1 times [2023-12-02 15:03:43,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:03:43,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018232028] [2023-12-02 15:03:43,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:03:43,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:03:43,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:03:43,958 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:03:43,958 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:03:43,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018232028] [2023-12-02 15:03:43,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018232028] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:03:43,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741831150] [2023-12-02 15:03:43,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:03:43,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:03:43,959 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:03:43,960 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:03:43,963 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 15:03:44,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:03:44,053 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 72 conjunts are in the unsatisfiable core [2023-12-02 15:03:44,056 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:03:44,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 15:03:44,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 15:03:44,186 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 15:03:44,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-12-02 15:03:44,212 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 15:03:44,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-12-02 15:03:44,280 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 15:03:44,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2023-12-02 15:03:44,302 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 15:03:44,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2023-12-02 15:03:44,352 INFO L349 Elim1Store]: treesize reduction 19, result has 36.7 percent of original size [2023-12-02 15:03:44,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 25 [2023-12-02 15:03:44,367 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-12-02 15:03:44,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 34 [2023-12-02 15:03:45,400 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 23 treesize of output 11 [2023-12-02 15:03:45,402 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 [2023-12-02 15:03:45,485 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:03:45,485 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:03:48,904 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (and (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_583 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_583))) (store .cse1 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) |ULTIMATE.start_main_~n~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2))) (or (= .cse0 0) (= |ULTIMATE.start_main_~n~0#1.base| .cse0)))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (let ((.cse4 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_583))) (store .cse3 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse4 |ULTIMATE.start_main_~n~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2) 0) (= |c_ULTIMATE.start_main_~n~0#1.offset| (select (select (let ((.cse5 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_582))) (store .cse5 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse4 |c_ULTIMATE.start_main_~n~0#1.offset|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2))))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (or (and (= |c_ULTIMATE.start_main_~#list~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~#list~0#1.offset|)) (and (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (let ((.cse7 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (= (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_583))) (store .cse6 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse7 |ULTIMATE.start_main_~n~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2) |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (let ((.cse8 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_582))) (store .cse8 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse7 |c_ULTIMATE.start_main_~n~0#1.offset|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2) 0)))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_583 (Array Int Int))) (let ((.cse9 (select (select (let ((.cse10 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_583))) (store .cse10 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) |ULTIMATE.start_main_~n~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2))) (or (= .cse9 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse9 0)))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_582 (Array Int Int))) (let ((.cse11 (select (select (let ((.cse12 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_582))) (store .cse12 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse12 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) |c_ULTIMATE.start_main_~n~0#1.offset|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2))) (or (= .cse11 0) (= |c_ULTIMATE.start_main_~x~0#1.offset| .cse11)))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (let ((.cse14 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (= (select (select (let ((.cse13 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_583))) (store .cse13 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse13 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse14 |ULTIMATE.start_main_~n~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2) 0) (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select (let ((.cse15 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_582))) (store .cse15 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse15 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse14 |c_ULTIMATE.start_main_~n~0#1.offset|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2))))))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (let ((.cse17 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (= |ULTIMATE.start_main_~n~0#1.base| (select (select (let ((.cse16 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_583))) (store .cse16 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse16 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse17 |ULTIMATE.start_main_~n~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2)) (= (select (select (let ((.cse18 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_582))) (store .cse18 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse18 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse17 |c_ULTIMATE.start_main_~n~0#1.offset|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2) 0)))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_582 (Array Int Int))) (let ((.cse19 (select (select (let ((.cse20 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_582))) (store .cse20 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse20 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) |c_ULTIMATE.start_main_~n~0#1.offset|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~n~0#1.offset| .cse19) (= .cse19 0)))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (or (and (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (let ((.cse22 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (= |ULTIMATE.start_main_~n~0#1.base| (select (select (let ((.cse21 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_583))) (store .cse21 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse21 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse22 |ULTIMATE.start_main_~n~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2)) (= (select (select (let ((.cse23 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_582))) (store .cse23 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse23 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse22 |c_ULTIMATE.start_main_~n~0#1.offset|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2) 0)))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_583 (Array Int Int))) (let ((.cse24 (select (select (let ((.cse25 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_583))) (store .cse25 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse25 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) |ULTIMATE.start_main_~n~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2))) (or (= .cse24 0) (= |ULTIMATE.start_main_~n~0#1.base| .cse24)))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (let ((.cse27 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (= (select (select (let ((.cse26 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_583))) (store .cse26 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse26 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse27 |ULTIMATE.start_main_~n~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2) 0) (= |c_ULTIMATE.start_main_~n~0#1.offset| (select (select (let ((.cse28 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_582))) (store .cse28 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse28 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse27 |c_ULTIMATE.start_main_~n~0#1.offset|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2))))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_582 (Array Int Int))) (let ((.cse29 (select (select (let ((.cse30 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_582))) (store .cse30 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse30 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) |c_ULTIMATE.start_main_~n~0#1.offset|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~n~0#1.offset| .cse29) (= .cse29 0))))) (= |c_ULTIMATE.start_main_~n~0#1.offset| |c_ULTIMATE.start_main_~#list~0#1.offset|)))) is different from false [2023-12-02 15:03:49,211 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (and (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_583 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_583))) (store .cse1 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) |ULTIMATE.start_main_~n~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2))) (or (= .cse0 0) (= |ULTIMATE.start_main_~n~0#1.base| .cse0)))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (let ((.cse4 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_582))) (store .cse3 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse4 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2) 0) (= |ULTIMATE.start_main_~n~0#1.base| (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_583))) (store .cse5 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse4 |ULTIMATE.start_main_~n~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2))))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (or (= |c_ULTIMATE.start_main_~#list~0#1.offset| 0) (and (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (let ((.cse7 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (= (select (select (let ((.cse6 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_582))) (store .cse6 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse7 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2) 0) (= (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_583))) (store .cse8 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse7 |ULTIMATE.start_main_~n~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2) 0)))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_583 (Array Int Int))) (let ((.cse9 (select (select (let ((.cse10 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_583))) (store .cse10 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) |ULTIMATE.start_main_~n~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2))) (or (= .cse9 0) (= |ULTIMATE.start_main_~n~0#1.base| .cse9)))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (let ((.cse12 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (= (select (select (let ((.cse11 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_582))) (store .cse11 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse11 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse12 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2) 0) (= |ULTIMATE.start_main_~n~0#1.base| (select (select (let ((.cse13 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_583))) (store .cse13 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse13 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse12 |ULTIMATE.start_main_~n~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2))))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_582 (Array Int Int))) (= (select (select (let ((.cse14 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_582))) (store .cse14 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse14 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2) 0)))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (let ((.cse16 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (= (select (select (let ((.cse15 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_582))) (store .cse15 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse15 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse16 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2) 0) (= (select (select (let ((.cse17 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_583))) (store .cse17 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse17 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse16 |ULTIMATE.start_main_~n~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2) 0)))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (or (and (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_582 (Array Int Int))) (let ((.cse18 (select (select (let ((.cse19 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_582))) (store .cse19 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse19 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| .cse18) (= .cse18 0)))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_583 (Array Int Int))) (let ((.cse20 (select (select (let ((.cse21 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_583))) (store .cse21 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse21 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) |ULTIMATE.start_main_~n~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2))) (or (= .cse20 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse20 0)))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (let ((.cse23 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (= (select (select (let ((.cse22 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_583))) (store .cse22 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse22 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse23 |ULTIMATE.start_main_~n~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2) |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (let ((.cse24 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_582))) (store .cse24 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse24 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse23 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2) 0)))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (let ((.cse26 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select (let ((.cse25 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_582))) (store .cse25 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse25 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse26 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2)) (= (select (select (let ((.cse27 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_583))) (store .cse27 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse27 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse26 |ULTIMATE.start_main_~n~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2) 0))))) (and (= |c_ULTIMATE.start_main_~#list~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~#list~0#1.offset|))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_582 (Array Int Int))) (= (select (select (let ((.cse28 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_582))) (store .cse28 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse28 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse2) 0)) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))))) is different from false [2023-12-02 15:03:49,382 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 15:03:49,390 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:03:49,391 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 27 treesize of output 28 [2023-12-02 15:03:49,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:03:49,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2023-12-02 15:03:49,403 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:03:49,403 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 27 treesize of output 28 [2023-12-02 15:03:49,408 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 46 treesize of output 42 [2023-12-02 15:03:49,411 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:03:49,414 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 [2023-12-02 15:03:49,417 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:03:49,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-12-02 15:03:49,422 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 16 treesize of output 12 [2023-12-02 15:03:49,430 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-02 15:03:49,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741831150] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:03:49,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1351476127] [2023-12-02 15:03:49,433 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2023-12-02 15:03:49,433 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:03:49,433 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 15:03:49,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:03:49,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 15] total 33 [2023-12-02 15:03:49,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660813913] [2023-12-02 15:03:49,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:03:49,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-02 15:03:49,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:03:49,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-02 15:03:49,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=868, Unknown=4, NotChecked=122, Total=1122 [2023-12-02 15:03:49,436 INFO L87 Difference]: Start difference. First operand 179 states and 247 transitions. Second operand has 34 states, 32 states have (on average 1.53125) internal successors, (49), 28 states have internal predecessors, (49), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:03:54,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:03:54,896 INFO L93 Difference]: Finished difference Result 371 states and 479 transitions. [2023-12-02 15:03:54,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-02 15:03:54,896 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 1.53125) internal successors, (49), 28 states have internal predecessors, (49), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-12-02 15:03:54,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:03:54,899 INFO L225 Difference]: With dead ends: 371 [2023-12-02 15:03:54,899 INFO L226 Difference]: Without dead ends: 371 [2023-12-02 15:03:54,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=292, Invalid=1782, Unknown=4, NotChecked=178, Total=2256 [2023-12-02 15:03:54,900 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 628 mSDsluCounter, 1016 mSDsCounter, 0 mSdLazyCounter, 972 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 640 SdHoareTripleChecker+Valid, 1105 SdHoareTripleChecker+Invalid, 1654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 582 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:03:54,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [640 Valid, 1105 Invalid, 1654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 972 Invalid, 0 Unknown, 582 Unchecked, 4.0s Time] [2023-12-02 15:03:54,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2023-12-02 15:03:54,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 252. [2023-12-02 15:03:54,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 185 states have (on average 1.5675675675675675) internal successors, (290), 214 states have internal predecessors, (290), 30 states have call successors, (30), 11 states have call predecessors, (30), 13 states have return successors, (40), 26 states have call predecessors, (40), 30 states have call successors, (40) [2023-12-02 15:03:54,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 360 transitions. [2023-12-02 15:03:54,914 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 360 transitions. Word has length 21 [2023-12-02 15:03:54,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:03:54,915 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 360 transitions. [2023-12-02 15:03:54,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 1.53125) internal successors, (49), 28 states have internal predecessors, (49), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:03:54,915 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 360 transitions. [2023-12-02 15:03:54,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-02 15:03:54,916 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:03:54,916 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:03:54,921 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 15:03:55,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-12-02 15:03:55,120 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-12-02 15:03:55,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:03:55,120 INFO L85 PathProgramCache]: Analyzing trace with hash -831508794, now seen corresponding path program 1 times [2023-12-02 15:03:55,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:03:55,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168669808] [2023-12-02 15:03:55,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:03:55,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:03:55,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:03:55,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 15:03:55,184 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:03:55,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168669808] [2023-12-02 15:03:55,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168669808] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:03:55,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:03:55,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 15:03:55,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93343142] [2023-12-02 15:03:55,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:03:55,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:03:55,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:03:55,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:03:55,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:03:55,186 INFO L87 Difference]: Start difference. First operand 252 states and 360 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 15:03:55,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:03:55,220 INFO L93 Difference]: Finished difference Result 268 states and 384 transitions. [2023-12-02 15:03:55,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 15:03:55,221 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2023-12-02 15:03:55,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:03:55,223 INFO L225 Difference]: With dead ends: 268 [2023-12-02 15:03:55,224 INFO L226 Difference]: Without dead ends: 266 [2023-12-02 15:03:55,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:03:55,225 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:03:55,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 253 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 15:03:55,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2023-12-02 15:03:55,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 256. [2023-12-02 15:03:55,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 187 states have (on average 1.5614973262032086) internal successors, (292), 218 states have internal predecessors, (292), 30 states have call successors, (30), 11 states have call predecessors, (30), 15 states have return successors, (44), 26 states have call predecessors, (44), 30 states have call successors, (44) [2023-12-02 15:03:55,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 366 transitions. [2023-12-02 15:03:55,238 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 366 transitions. Word has length 20 [2023-12-02 15:03:55,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:03:55,239 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 366 transitions. [2023-12-02 15:03:55,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 15:03:55,239 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 366 transitions. [2023-12-02 15:03:55,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 15:03:55,240 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:03:55,240 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:03:55,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-02 15:03:55,240 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-12-02 15:03:55,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:03:55,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1574614893, now seen corresponding path program 1 times [2023-12-02 15:03:55,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:03:55,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255153586] [2023-12-02 15:03:55,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:03:55,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:03:55,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:03:55,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:03:55,313 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:03:55,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255153586] [2023-12-02 15:03:55,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255153586] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:03:55,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:03:55,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 15:03:55,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303829730] [2023-12-02 15:03:55,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:03:55,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 15:03:55,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:03:55,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 15:03:55,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:03:55,314 INFO L87 Difference]: Start difference. First operand 256 states and 366 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 15:03:55,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:03:55,379 INFO L93 Difference]: Finished difference Result 272 states and 387 transitions. [2023-12-02 15:03:55,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 15:03:55,380 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2023-12-02 15:03:55,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:03:55,382 INFO L225 Difference]: With dead ends: 272 [2023-12-02 15:03:55,382 INFO L226 Difference]: Without dead ends: 272 [2023-12-02 15:03:55,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 15:03:55,383 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 6 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:03:55,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 310 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:03:55,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2023-12-02 15:03:55,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 266. [2023-12-02 15:03:55,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 190 states have (on average 1.5526315789473684) internal successors, (295), 227 states have internal predecessors, (295), 36 states have call successors, (36), 12 states have call predecessors, (36), 16 states have return successors, (50), 26 states have call predecessors, (50), 36 states have call successors, (50) [2023-12-02 15:03:55,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 381 transitions. [2023-12-02 15:03:55,395 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 381 transitions. Word has length 22 [2023-12-02 15:03:55,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:03:55,395 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 381 transitions. [2023-12-02 15:03:55,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 15:03:55,396 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 381 transitions. [2023-12-02 15:03:55,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 15:03:55,396 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:03:55,396 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:03:55,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-02 15:03:55,397 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-12-02 15:03:55,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:03:55,397 INFO L85 PathProgramCache]: Analyzing trace with hash 275833854, now seen corresponding path program 1 times [2023-12-02 15:03:55,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:03:55,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834400330] [2023-12-02 15:03:55,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:03:55,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:03:55,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:03:56,048 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:03:56,049 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:03:56,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834400330] [2023-12-02 15:03:56,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834400330] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:03:56,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332513592] [2023-12-02 15:03:56,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:03:56,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:03:56,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:03:56,050 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:03:56,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 15:03:56,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:03:56,171 INFO L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 44 conjunts are in the unsatisfiable core [2023-12-02 15:03:56,173 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:03:56,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 15:03:56,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 15:03:56,550 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:03:56,550 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 32 treesize of output 26 [2023-12-02 15:03:56,574 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:03:56,574 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:03:56,771 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 34 treesize of output 28 [2023-12-02 15:03:56,879 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:03:56,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332513592] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:03:56,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1589359317] [2023-12-02 15:03:56,881 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-12-02 15:03:56,881 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:03:56,881 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:03:56,881 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:03:56,881 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:03:57,277 INFO L197 IcfgInterpreter]: Interpreting procedure is_list_containing_x with input of size 22 for LOIs [2023-12-02 15:03:57,296 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:04:00,108 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7335#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_remove_~x#1.base|) 1) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (= |ULTIMATE.start_remove_#t~mem5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_~x#1.base|) 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_~x#1.base|) 4) |ULTIMATE.start_remove_#t~mem4#1.offset|) (= |ULTIMATE.start_remove_#in~x#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= 8 (select |#length| |ULTIMATE.start_remove_~x#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_~x#1.base|) 0) |ULTIMATE.start_remove_#t~mem5#1.base|) (<= 2 |ULTIMATE.start_main_~tail~0#1.base|) (= |ULTIMATE.start_remove_~x#1.offset| 0) (= |ULTIMATE.start_remove_#in~x#1.offset| 0) (= |ULTIMATE.start_remove_#t~mem4#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_~x#1.base|) 4)) (exists ((|v_ULTIMATE.start_main_#t~nondet16#1_39| Int)) (= (mod |v_ULTIMATE.start_main_#t~nondet16#1_39| 256) 0)) (<= 2 |ULTIMATE.start_main_~x~0#1.base|) (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_~x#1.base|) 4) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_~x#1.base|) 4) 0))) (= |ULTIMATE.start_main_~tail~0#1.offset| 0) (= |ULTIMATE.start_remove_#in~x#1.base| |ULTIMATE.start_remove_~x#1.base|) (not (= (select |#valid| |ULTIMATE.start_remove_#t~mem4#1.base|) 1)))' at error location [2023-12-02 15:04:00,108 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 15:04:00,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:04:00,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 9] total 28 [2023-12-02 15:04:00,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493292637] [2023-12-02 15:04:00,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:04:00,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-02 15:04:00,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:04:00,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-02 15:04:00,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1888, Unknown=2, NotChecked=0, Total=2070 [2023-12-02 15:04:00,111 INFO L87 Difference]: Start difference. First operand 266 states and 381 transitions. Second operand has 29 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 25 states have internal predecessors, (51), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 15:04:02,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:04:05,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:04:07,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:04:09,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:04:11,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:04:13,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:04:15,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:04:17,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:04:20,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:04:22,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:04:24,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:04:26,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:04:26,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:04:26,721 INFO L93 Difference]: Finished difference Result 564 states and 773 transitions. [2023-12-02 15:04:26,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-02 15:04:26,722 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 25 states have internal predecessors, (51), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2023-12-02 15:04:26,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:04:26,726 INFO L225 Difference]: With dead ends: 564 [2023-12-02 15:04:26,726 INFO L226 Difference]: Without dead ends: 564 [2023-12-02 15:04:26,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 1140 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=481, Invalid=3677, Unknown=2, NotChecked=0, Total=4160 [2023-12-02 15:04:26,728 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 1106 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 1740 mSolverCounterSat, 218 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1110 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 1970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 1740 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.7s IncrementalHoareTripleChecker+Time [2023-12-02 15:04:26,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1110 Valid, 1050 Invalid, 1970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 1740 Invalid, 12 Unknown, 0 Unchecked, 25.7s Time] [2023-12-02 15:04:26,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2023-12-02 15:04:26,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 308. [2023-12-02 15:04:26,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 221 states have (on average 1.5339366515837105) internal successors, (339), 260 states have internal predecessors, (339), 43 states have call successors, (43), 16 states have call predecessors, (43), 20 states have return successors, (57), 31 states have call predecessors, (57), 43 states have call successors, (57) [2023-12-02 15:04:26,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 439 transitions. [2023-12-02 15:04:26,746 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 439 transitions. Word has length 22 [2023-12-02 15:04:26,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:04:26,746 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 439 transitions. [2023-12-02 15:04:26,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 25 states have internal predecessors, (51), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 15:04:26,747 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 439 transitions. [2023-12-02 15:04:26,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 15:04:26,747 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:04:26,747 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:04:26,752 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-02 15:04:26,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:04:26,948 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-12-02 15:04:26,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:04:26,948 INFO L85 PathProgramCache]: Analyzing trace with hash 275833855, now seen corresponding path program 1 times [2023-12-02 15:04:26,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:04:26,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401836505] [2023-12-02 15:04:26,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:04:26,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:04:26,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:04:27,967 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:04:27,967 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:04:27,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401836505] [2023-12-02 15:04:27,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401836505] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:04:27,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342612922] [2023-12-02 15:04:27,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:04:27,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:04:27,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:04:27,969 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:04:27,975 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-02 15:04:28,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:04:28,070 INFO L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 52 conjunts are in the unsatisfiable core [2023-12-02 15:04:28,073 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:04:28,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-02 15:04:28,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 15:04:28,472 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:04:28,472 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 32 treesize of output 26 [2023-12-02 15:04:28,480 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 15:04:28,481 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 19 treesize of output 7 [2023-12-02 15:04:28,506 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:04:28,506 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:04:28,839 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 70 treesize of output 64 [2023-12-02 15:04:28,841 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 94 treesize of output 82 [2023-12-02 15:04:28,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:04:28,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:04:28,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 7 treesize of output 5 [2023-12-02 15:04:28,933 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:04:28,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342612922] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:04:28,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1154338095] [2023-12-02 15:04:28,935 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-12-02 15:04:28,935 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:04:28,936 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:04:28,936 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:04:28,936 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:04:29,219 INFO L197 IcfgInterpreter]: Interpreting procedure is_list_containing_x with input of size 22 for LOIs [2023-12-02 15:04:29,236 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:04:32,339 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '8421#(and (exists ((|v_ULTIMATE.start_main_#t~nondet16#1_45| Int)) (= (mod |v_ULTIMATE.start_main_#t~nondet16#1_45| 256) 0)) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_remove_~x#1.base|) 1) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (= |ULTIMATE.start_remove_#t~mem5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_~x#1.base|) 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_~x#1.base|) 4) |ULTIMATE.start_remove_#t~mem4#1.offset|) (or (< (select |#length| |ULTIMATE.start_remove_#t~mem4#1.base|) (+ |ULTIMATE.start_remove_#t~mem4#1.offset| 4)) (< |ULTIMATE.start_remove_#t~mem4#1.offset| 0)) (= |ULTIMATE.start_remove_#in~x#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= 8 (select |#length| |ULTIMATE.start_remove_~x#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_~x#1.base|) 0) |ULTIMATE.start_remove_#t~mem5#1.base|) (<= 2 |ULTIMATE.start_main_~tail~0#1.base|) (= |ULTIMATE.start_remove_~x#1.offset| 0) (= |ULTIMATE.start_remove_#in~x#1.offset| 0) (= |ULTIMATE.start_remove_#t~mem4#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_~x#1.base|) 4)) (<= 2 |ULTIMATE.start_main_~x~0#1.base|) (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_~x#1.base|) 4) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_~x#1.base|) 4) 0))) (= |ULTIMATE.start_main_~tail~0#1.offset| 0) (= |ULTIMATE.start_remove_#in~x#1.base| |ULTIMATE.start_remove_~x#1.base|))' at error location [2023-12-02 15:04:32,339 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 15:04:32,339 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:04:32,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 10] total 31 [2023-12-02 15:04:32,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860077204] [2023-12-02 15:04:32,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:04:32,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-02 15:04:32,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:04:32,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-02 15:04:32,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=2182, Unknown=2, NotChecked=0, Total=2352 [2023-12-02 15:04:32,342 INFO L87 Difference]: Start difference. First operand 308 states and 439 transitions. Second operand has 32 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 28 states have internal predecessors, (55), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 15:04:37,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:04:37,052 INFO L93 Difference]: Finished difference Result 652 states and 881 transitions. [2023-12-02 15:04:37,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-12-02 15:04:37,053 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 28 states have internal predecessors, (55), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 22 [2023-12-02 15:04:37,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:04:37,057 INFO L225 Difference]: With dead ends: 652 [2023-12-02 15:04:37,057 INFO L226 Difference]: Without dead ends: 652 [2023-12-02 15:04:37,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1301 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=618, Invalid=4782, Unknown=2, NotChecked=0, Total=5402 [2023-12-02 15:04:37,061 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 1289 mSDsluCounter, 889 mSDsCounter, 0 mSdLazyCounter, 2773 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1293 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 3021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 2773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-12-02 15:04:37,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1293 Valid, 975 Invalid, 3021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 2773 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-12-02 15:04:37,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2023-12-02 15:04:37,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 359. [2023-12-02 15:04:37,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 258 states have (on average 1.5155038759689923) internal successors, (391), 299 states have internal predecessors, (391), 51 states have call successors, (51), 22 states have call predecessors, (51), 26 states have return successors, (65), 37 states have call predecessors, (65), 51 states have call successors, (65) [2023-12-02 15:04:37,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 507 transitions. [2023-12-02 15:04:37,077 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 507 transitions. Word has length 22 [2023-12-02 15:04:37,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:04:37,077 INFO L495 AbstractCegarLoop]: Abstraction has 359 states and 507 transitions. [2023-12-02 15:04:37,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 28 states have internal predecessors, (55), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 15:04:37,077 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 507 transitions. [2023-12-02 15:04:37,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-02 15:04:37,078 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:04:37,078 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:04:37,083 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-02 15:04:37,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-12-02 15:04:37,280 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-12-02 15:04:37,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:04:37,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1397410877, now seen corresponding path program 1 times [2023-12-02 15:04:37,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:04:37,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978721628] [2023-12-02 15:04:37,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:04:37,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:04:37,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:04:37,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:04:37,350 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:04:37,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978721628] [2023-12-02 15:04:37,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978721628] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:04:37,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:04:37,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 15:04:37,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790775380] [2023-12-02 15:04:37,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:04:37,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 15:04:37,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:04:37,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 15:04:37,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 15:04:37,352 INFO L87 Difference]: Start difference. First operand 359 states and 507 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 15:04:37,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:04:37,521 INFO L93 Difference]: Finished difference Result 366 states and 495 transitions. [2023-12-02 15:04:37,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 15:04:37,521 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2023-12-02 15:04:37,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:04:37,524 INFO L225 Difference]: With dead ends: 366 [2023-12-02 15:04:37,524 INFO L226 Difference]: Without dead ends: 366 [2023-12-02 15:04:37,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-02 15:04:37,525 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 142 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:04:37,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 140 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:04:37,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2023-12-02 15:04:37,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 356. [2023-12-02 15:04:37,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 258 states have (on average 1.4573643410852712) internal successors, (376), 296 states have internal predecessors, (376), 51 states have call successors, (51), 22 states have call predecessors, (51), 26 states have return successors, (65), 37 states have call predecessors, (65), 51 states have call successors, (65) [2023-12-02 15:04:37,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 492 transitions. [2023-12-02 15:04:37,538 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 492 transitions. Word has length 24 [2023-12-02 15:04:37,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:04:37,538 INFO L495 AbstractCegarLoop]: Abstraction has 356 states and 492 transitions. [2023-12-02 15:04:37,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 15:04:37,538 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 492 transitions. [2023-12-02 15:04:37,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-02 15:04:37,539 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:04:37,539 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:04:37,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-02 15:04:37,539 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-12-02 15:04:37,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:04:37,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1397410876, now seen corresponding path program 1 times [2023-12-02 15:04:37,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:04:37,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200946447] [2023-12-02 15:04:37,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:04:37,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:04:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:04:37,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:04:37,629 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:04:37,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200946447] [2023-12-02 15:04:37,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200946447] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:04:37,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:04:37,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 15:04:37,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288340686] [2023-12-02 15:04:37,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:04:37,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 15:04:37,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:04:37,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 15:04:37,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 15:04:37,630 INFO L87 Difference]: Start difference. First operand 356 states and 492 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 15:04:37,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:04:37,821 INFO L93 Difference]: Finished difference Result 364 states and 489 transitions. [2023-12-02 15:04:37,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 15:04:37,821 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2023-12-02 15:04:37,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:04:37,823 INFO L225 Difference]: With dead ends: 364 [2023-12-02 15:04:37,823 INFO L226 Difference]: Without dead ends: 364 [2023-12-02 15:04:37,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-02 15:04:37,824 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 147 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 15:04:37,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 145 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 15:04:37,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2023-12-02 15:04:37,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 356. [2023-12-02 15:04:37,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 258 states have (on average 1.430232558139535) internal successors, (369), 296 states have internal predecessors, (369), 51 states have call successors, (51), 22 states have call predecessors, (51), 26 states have return successors, (65), 37 states have call predecessors, (65), 51 states have call successors, (65) [2023-12-02 15:04:37,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 485 transitions. [2023-12-02 15:04:37,834 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 485 transitions. Word has length 24 [2023-12-02 15:04:37,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:04:37,835 INFO L495 AbstractCegarLoop]: Abstraction has 356 states and 485 transitions. [2023-12-02 15:04:37,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 15:04:37,835 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 485 transitions. [2023-12-02 15:04:37,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-02 15:04:37,836 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:04:37,836 INFO L195 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] [2023-12-02 15:04:37,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-02 15:04:37,836 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-12-02 15:04:37,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:04:37,837 INFO L85 PathProgramCache]: Analyzing trace with hash -855622048, now seen corresponding path program 1 times [2023-12-02 15:04:37,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:04:37,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170555940] [2023-12-02 15:04:37,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:04:37,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:04:37,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:04:38,291 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:04:38,291 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:04:38,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170555940] [2023-12-02 15:04:38,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170555940] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:04:38,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945732226] [2023-12-02 15:04:38,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:04:38,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:04:38,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:04:38,292 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:04:38,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-02 15:04:38,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:04:38,398 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 36 conjunts are in the unsatisfiable core [2023-12-02 15:04:38,400 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:04:38,489 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 19 treesize of output 1 [2023-12-02 15:04:38,762 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:04:38,762 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 30 treesize of output 44 [2023-12-02 15:04:38,830 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:04:38,830 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:04:39,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945732226] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:04:39,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1883412969] [2023-12-02 15:04:39,080 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2023-12-02 15:04:39,081 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:04:39,081 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:04:39,081 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:04:39,081 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:04:39,389 INFO L197 IcfgInterpreter]: Interpreting procedure is_list_containing_x with input of size 22 for LOIs [2023-12-02 15:04:39,406 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:04:52,778 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '11084#(and (not (= (select |#valid| |ULTIMATE.start_remove_#t~mem7#1.base|) 1)) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_remove_~x#1.base|) 1) (exists ((|v_ULTIMATE.start_main_#t~nondet16#1_49| Int)) (= (mod |v_ULTIMATE.start_main_#t~nondet16#1_49| 256) 0)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_~x#1.base|) 4) 0) (= |ULTIMATE.start_remove_#in~x#1.base| |ULTIMATE.start_main_~x~0#1.base|) (= |ULTIMATE.start_remove_#t~mem7#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_~x#1.base|) 0)) (<= 8 (select |#length| |ULTIMATE.start_remove_~x#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_~x#1.base|) 0) |ULTIMATE.start_remove_#t~mem7#1.base|) (<= 2 |ULTIMATE.start_main_~tail~0#1.base|) (= |ULTIMATE.start_remove_~x#1.offset| 0) (= |ULTIMATE.start_remove_#in~x#1.offset| 0) (<= 2 |ULTIMATE.start_main_~x~0#1.base|) (= |ULTIMATE.start_main_~tail~0#1.offset| 0) (= |ULTIMATE.start_remove_#in~x#1.base| |ULTIMATE.start_remove_~x#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_~x#1.base|) 4) 0) (= |ULTIMATE.start_remove_#t~mem8#1.offset| 0) (= |ULTIMATE.start_remove_#t~mem8#1.base| 0) (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_~x#1.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_~x#1.base|) 0) 0))))' at error location [2023-12-02 15:04:52,778 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 15:04:52,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 15:04:52,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2023-12-02 15:04:52,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205081898] [2023-12-02 15:04:52,778 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 15:04:52,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-02 15:04:52,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:04:52,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-02 15:04:52,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1876, Unknown=7, NotChecked=0, Total=2070 [2023-12-02 15:04:52,781 INFO L87 Difference]: Start difference. First operand 356 states and 485 transitions. Second operand has 23 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 19 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 15:04:54,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:04:56,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:04:58,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:05:00,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:05:02,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:05:05,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:05:07,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:05:09,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:05:12,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:05:14,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:05:16,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:05:18,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:05:20,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:05:22,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:05:24,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:05:26,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:05:28,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:05:30,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:05:32,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:05:35,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:05:37,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:05:39,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:05:39,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:05:39,212 INFO L93 Difference]: Finished difference Result 383 states and 484 transitions. [2023-12-02 15:05:39,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-02 15:05:39,214 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 19 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2023-12-02 15:05:39,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:05:39,216 INFO L225 Difference]: With dead ends: 383 [2023-12-02 15:05:39,216 INFO L226 Difference]: Without dead ends: 381 [2023-12-02 15:05:39,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 907 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=401, Invalid=3374, Unknown=7, NotChecked=0, Total=3782 [2023-12-02 15:05:39,218 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 591 mSDsluCounter, 1151 mSDsCounter, 0 mSdLazyCounter, 1380 mSolverCounterSat, 123 mSolverCounterUnsat, 22 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 45.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 1525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1380 IncrementalHoareTripleChecker+Invalid, 22 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 45.6s IncrementalHoareTripleChecker+Time [2023-12-02 15:05:39,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [593 Valid, 1245 Invalid, 1525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1380 Invalid, 22 Unknown, 0 Unchecked, 45.6s Time] [2023-12-02 15:05:39,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2023-12-02 15:05:39,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 313. [2023-12-02 15:05:39,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 226 states have (on average 1.4380530973451326) internal successors, (325), 259 states have internal predecessors, (325), 42 states have call successors, (42), 20 states have call predecessors, (42), 24 states have return successors, (54), 33 states have call predecessors, (54), 42 states have call successors, (54) [2023-12-02 15:05:39,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 421 transitions. [2023-12-02 15:05:39,232 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 421 transitions. Word has length 24 [2023-12-02 15:05:39,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:05:39,232 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 421 transitions. [2023-12-02 15:05:39,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 19 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 15:05:39,232 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 421 transitions. [2023-12-02 15:05:39,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-02 15:05:39,233 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:05:39,233 INFO L195 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] [2023-12-02 15:05:39,239 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-12-02 15:05:39,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-12-02 15:05:39,434 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-12-02 15:05:39,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:05:39,434 INFO L85 PathProgramCache]: Analyzing trace with hash -942124674, now seen corresponding path program 1 times [2023-12-02 15:05:39,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:05:39,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012200177] [2023-12-02 15:05:39,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:05:39,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:05:39,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:05:39,479 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 15:05:39,479 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:05:39,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012200177] [2023-12-02 15:05:39,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012200177] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:05:39,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:05:39,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 15:05:39,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412066889] [2023-12-02 15:05:39,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:05:39,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:05:39,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:05:39,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:05:39,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:05:39,481 INFO L87 Difference]: Start difference. First operand 313 states and 421 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 15:05:39,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:05:39,539 INFO L93 Difference]: Finished difference Result 320 states and 422 transitions. [2023-12-02 15:05:39,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 15:05:39,540 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2023-12-02 15:05:39,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:05:39,542 INFO L225 Difference]: With dead ends: 320 [2023-12-02 15:05:39,542 INFO L226 Difference]: Without dead ends: 320 [2023-12-02 15:05:39,542 INFO L412 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 [2023-12-02 15:05:39,543 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 23 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:05:39,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 220 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 15:05:39,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2023-12-02 15:05:39,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 277. [2023-12-02 15:05:39,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 201 states have (on average 1.427860696517413) internal successors, (287), 232 states have internal predecessors, (287), 34 states have call successors, (34), 17 states have call predecessors, (34), 21 states have return successors, (46), 27 states have call predecessors, (46), 34 states have call successors, (46) [2023-12-02 15:05:39,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 367 transitions. [2023-12-02 15:05:39,555 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 367 transitions. Word has length 28 [2023-12-02 15:05:39,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:05:39,555 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 367 transitions. [2023-12-02 15:05:39,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 15:05:39,556 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 367 transitions. [2023-12-02 15:05:39,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-02 15:05:39,556 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:05:39,557 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-02 15:05:39,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-12-02 15:05:39,557 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-12-02 15:05:39,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:05:39,558 INFO L85 PathProgramCache]: Analyzing trace with hash 850640910, now seen corresponding path program 1 times [2023-12-02 15:05:39,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:05:39,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501452055] [2023-12-02 15:05:39,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:05:39,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:05:39,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:05:39,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:05:39,784 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:05:39,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501452055] [2023-12-02 15:05:39,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501452055] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:05:39,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:05:39,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 15:05:39,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568451989] [2023-12-02 15:05:39,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:05:39,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 15:05:39,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:05:39,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 15:05:39,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-02 15:05:39,786 INFO L87 Difference]: Start difference. First operand 277 states and 367 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 15:05:39,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:05:39,948 INFO L93 Difference]: Finished difference Result 279 states and 363 transitions. [2023-12-02 15:05:39,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 15:05:39,949 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2023-12-02 15:05:39,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:05:39,951 INFO L225 Difference]: With dead ends: 279 [2023-12-02 15:05:39,951 INFO L226 Difference]: Without dead ends: 279 [2023-12-02 15:05:39,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-02 15:05:39,951 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 91 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:05:39,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 273 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:05:39,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2023-12-02 15:05:39,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 273. [2023-12-02 15:05:39,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 197 states have (on average 1.416243654822335) internal successors, (279), 228 states have internal predecessors, (279), 34 states have call successors, (34), 17 states have call predecessors, (34), 21 states have return successors, (46), 27 states have call predecessors, (46), 34 states have call successors, (46) [2023-12-02 15:05:39,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 359 transitions. [2023-12-02 15:05:39,961 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 359 transitions. Word has length 27 [2023-12-02 15:05:39,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:05:39,961 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 359 transitions. [2023-12-02 15:05:39,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 15:05:39,961 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 359 transitions. [2023-12-02 15:05:39,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-02 15:05:39,962 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:05:39,962 INFO L195 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] [2023-12-02 15:05:39,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-12-02 15:05:39,962 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-12-02 15:05:39,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:05:39,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1680083276, now seen corresponding path program 1 times [2023-12-02 15:05:39,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:05:39,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639359963] [2023-12-02 15:05:39,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:05:39,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:05:39,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:05:40,203 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 15:05:40,203 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:05:40,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639359963] [2023-12-02 15:05:40,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639359963] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:05:40,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863479753] [2023-12-02 15:05:40,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:05:40,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:05:40,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:05:40,204 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:05:40,208 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-02 15:05:40,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:05:40,324 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 48 conjunts are in the unsatisfiable core [2023-12-02 15:05:40,326 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:05:40,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 15:05:40,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2023-12-02 15:05:40,792 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 15:05:40,792 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:05:40,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-12-02 15:05:41,139 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 10 treesize of output 4 [2023-12-02 15:05:41,303 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 14 treesize of output 12 [2023-12-02 15:05:41,330 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 15:05:41,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863479753] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:05:41,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [75212164] [2023-12-02 15:05:41,331 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2023-12-02 15:05:41,331 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:05:41,332 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 15:05:41,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:05:41,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 12] total 27 [2023-12-02 15:05:41,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357451605] [2023-12-02 15:05:41,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:05:41,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-02 15:05:41,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:05:41,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-02 15:05:41,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=636, Unknown=0, NotChecked=0, Total=756 [2023-12-02 15:05:41,334 INFO L87 Difference]: Start difference. First operand 273 states and 359 transitions. Second operand has 28 states, 25 states have (on average 2.36) internal successors, (59), 26 states have internal predecessors, (59), 5 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-02 15:05:42,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:05:42,625 INFO L93 Difference]: Finished difference Result 416 states and 540 transitions. [2023-12-02 15:05:42,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-12-02 15:05:42,625 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 2.36) internal successors, (59), 26 states have internal predecessors, (59), 5 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 27 [2023-12-02 15:05:42,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:05:42,628 INFO L225 Difference]: With dead ends: 416 [2023-12-02 15:05:42,628 INFO L226 Difference]: Without dead ends: 416 [2023-12-02 15:05:42,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=485, Invalid=2271, Unknown=0, NotChecked=0, Total=2756 [2023-12-02 15:05:42,629 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 511 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 835 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-02 15:05:42,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 462 Invalid, 941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 835 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-02 15:05:42,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2023-12-02 15:05:42,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 276. [2023-12-02 15:05:42,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 200 states have (on average 1.405) internal successors, (281), 230 states have internal predecessors, (281), 34 states have call successors, (34), 18 states have call predecessors, (34), 22 states have return successors, (46), 27 states have call predecessors, (46), 34 states have call successors, (46) [2023-12-02 15:05:42,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 361 transitions. [2023-12-02 15:05:42,637 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 361 transitions. Word has length 27 [2023-12-02 15:05:42,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:05:42,637 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 361 transitions. [2023-12-02 15:05:42,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 2.36) internal successors, (59), 26 states have internal predecessors, (59), 5 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-02 15:05:42,637 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 361 transitions. [2023-12-02 15:05:42,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-02 15:05:42,637 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:05:42,637 INFO L195 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] [2023-12-02 15:05:42,642 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-12-02 15:05:42,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-12-02 15:05:42,838 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-12-02 15:05:42,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:05:42,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1680083275, now seen corresponding path program 1 times [2023-12-02 15:05:42,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:05:42,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352249273] [2023-12-02 15:05:42,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:05:42,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:05:42,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:05:43,086 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 15:05:43,086 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:05:43,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352249273] [2023-12-02 15:05:43,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352249273] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:05:43,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898236994] [2023-12-02 15:05:43,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:05:43,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:05:43,087 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:05:43,088 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:05:43,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-02 15:05:43,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:05:43,208 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 38 conjunts are in the unsatisfiable core [2023-12-02 15:05:43,210 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:05:43,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 15:05:43,572 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 15:05:43,572 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:05:44,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2023-12-02 15:05:44,124 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 15:05:44,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898236994] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:05:44,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [106312795] [2023-12-02 15:05:44,126 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2023-12-02 15:05:44,127 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:05:44,127 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 15:05:44,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:05:44,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 9] total 24 [2023-12-02 15:05:44,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138233647] [2023-12-02 15:05:44,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:05:44,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-12-02 15:05:44,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:05:44,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-12-02 15:05:44,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2023-12-02 15:05:44,129 INFO L87 Difference]: Start difference. First operand 276 states and 361 transitions. Second operand has 25 states, 24 states have (on average 2.5833333333333335) internal successors, (62), 23 states have internal predecessors, (62), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 15:05:45,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:05:45,660 INFO L93 Difference]: Finished difference Result 480 states and 634 transitions. [2023-12-02 15:05:45,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-02 15:05:45,661 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.5833333333333335) internal successors, (62), 23 states have internal predecessors, (62), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Word has length 27 [2023-12-02 15:05:45,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:05:45,663 INFO L225 Difference]: With dead ends: 480 [2023-12-02 15:05:45,664 INFO L226 Difference]: Without dead ends: 480 [2023-12-02 15:05:45,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=321, Invalid=1485, Unknown=0, NotChecked=0, Total=1806 [2023-12-02 15:05:45,665 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 690 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 1091 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 1204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:05:45,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 575 Invalid, 1204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1091 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-02 15:05:45,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2023-12-02 15:05:45,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 287. [2023-12-02 15:05:45,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 210 states have (on average 1.380952380952381) internal successors, (290), 240 states have internal predecessors, (290), 35 states have call successors, (35), 18 states have call predecessors, (35), 22 states have return successors, (48), 28 states have call predecessors, (48), 35 states have call successors, (48) [2023-12-02 15:05:45,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 373 transitions. [2023-12-02 15:05:45,673 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 373 transitions. Word has length 27 [2023-12-02 15:05:45,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:05:45,673 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 373 transitions. [2023-12-02 15:05:45,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.5833333333333335) internal successors, (62), 23 states have internal predecessors, (62), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 15:05:45,673 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 373 transitions. [2023-12-02 15:05:45,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-02 15:05:45,673 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:05:45,673 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:05:45,678 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-12-02 15:05:45,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:05:45,874 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-12-02 15:05:45,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:05:45,875 INFO L85 PathProgramCache]: Analyzing trace with hash -493666175, now seen corresponding path program 2 times [2023-12-02 15:05:45,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:05:45,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610576215] [2023-12-02 15:05:45,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:05:45,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:05:45,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:05:46,255 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 15:05:46,256 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:05:46,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610576215] [2023-12-02 15:05:46,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610576215] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:05:46,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260620841] [2023-12-02 15:05:46,256 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 15:05:46,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:05:46,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:05:46,257 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:05:46,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-02 15:05:46,378 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 15:05:46,378 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 15:05:46,379 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 38 conjunts are in the unsatisfiable core [2023-12-02 15:05:46,381 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:05:46,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 15:05:46,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-02 15:05:46,552 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 21 treesize of output 9 [2023-12-02 15:05:46,600 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 15:05:46,600 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:05:46,769 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 34 treesize of output 28 [2023-12-02 15:05:46,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:05:46,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:05:46,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:05:46,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:05:46,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-12-02 15:05:46,874 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 15:05:46,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260620841] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:05:46,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [305466764] [2023-12-02 15:05:46,876 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2023-12-02 15:05:46,876 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:05:46,876 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 15:05:46,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:05:46,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2023-12-02 15:05:46,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714748885] [2023-12-02 15:05:46,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:05:46,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-02 15:05:46,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:05:46,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-02 15:05:46,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=717, Unknown=0, NotChecked=0, Total=812 [2023-12-02 15:05:46,879 INFO L87 Difference]: Start difference. First operand 287 states and 373 transitions. Second operand has 29 states, 25 states have (on average 2.52) internal successors, (63), 23 states have internal predecessors, (63), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:05:47,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:05:47,783 INFO L93 Difference]: Finished difference Result 312 states and 397 transitions. [2023-12-02 15:05:47,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 15:05:47,783 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 2.52) internal successors, (63), 23 states have internal predecessors, (63), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-12-02 15:05:47,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:05:47,785 INFO L225 Difference]: With dead ends: 312 [2023-12-02 15:05:47,785 INFO L226 Difference]: Without dead ends: 312 [2023-12-02 15:05:47,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=172, Invalid=1088, Unknown=0, NotChecked=0, Total=1260 [2023-12-02 15:05:47,786 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 240 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 1157 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-02 15:05:47,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 901 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1157 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-02 15:05:47,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2023-12-02 15:05:47,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 287. [2023-12-02 15:05:47,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 210 states have (on average 1.3761904761904762) internal successors, (289), 240 states have internal predecessors, (289), 35 states have call successors, (35), 18 states have call predecessors, (35), 22 states have return successors, (48), 28 states have call predecessors, (48), 35 states have call successors, (48) [2023-12-02 15:05:47,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 372 transitions. [2023-12-02 15:05:47,793 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 372 transitions. Word has length 27 [2023-12-02 15:05:47,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:05:47,793 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 372 transitions. [2023-12-02 15:05:47,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 2.52) internal successors, (63), 23 states have internal predecessors, (63), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:05:47,793 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 372 transitions. [2023-12-02 15:05:47,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-02 15:05:47,794 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:05:47,794 INFO L195 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] [2023-12-02 15:05:47,800 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-12-02 15:05:47,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-12-02 15:05:47,995 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-12-02 15:05:47,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:05:47,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1554092433, now seen corresponding path program 1 times [2023-12-02 15:05:47,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:05:47,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215764024] [2023-12-02 15:05:47,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:05:47,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:05:48,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:05:48,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:05:48,597 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:05:48,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215764024] [2023-12-02 15:05:48,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215764024] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:05:48,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20478938] [2023-12-02 15:05:48,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:05:48,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:05:48,598 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:05:48,598 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:05:48,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-02 15:05:48,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:05:48,726 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 69 conjunts are in the unsatisfiable core [2023-12-02 15:05:48,730 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:05:48,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 15:05:48,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 15:05:48,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-12-02 15:05:48,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-02 15:05:48,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:05:48,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 15:05:48,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:05:48,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-12-02 15:05:48,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:05:48,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 15:05:48,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:05:48,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-12-02 15:05:48,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2023-12-02 15:05:48,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-02 15:05:49,510 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-12-02 15:05:49,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 65 [2023-12-02 15:05:49,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:05:49,533 INFO L349 Elim1Store]: treesize reduction 29, result has 31.0 percent of original size [2023-12-02 15:05:49,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 29 [2023-12-02 15:05:49,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-02 15:05:49,598 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:05:49,598 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:05:49,770 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)))) (and (forall ((v_ArrVal_1250 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1250) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 0)) (forall ((v_ArrVal_1249 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1249) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 0)))) is different from false [2023-12-02 15:05:49,831 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)))) (and (forall ((v_ArrVal_1249 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1249) |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 0)) (forall ((v_ArrVal_1250 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1250) |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 0)))) is different from false [2023-12-02 15:05:49,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20478938] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:05:49,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1625629403] [2023-12-02 15:05:49,834 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2023-12-02 15:05:49,834 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:05:49,834 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:05:49,834 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:05:49,835 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:05:50,196 INFO L197 IcfgInterpreter]: Interpreting procedure is_list_containing_x with input of size 22 for LOIs [2023-12-02 15:05:50,212 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:05:54,449 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '15857#(and (exists ((|v_#memory_$Pointer$.offset_198| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_199| (Array Int (Array Int Int))) (|v_#memory_int_175| (Array Int (Array Int Int)))) (and (<= 0 (select (select |v_#memory_$Pointer$.offset_198| |ULTIMATE.start_remove_~x#1.base|) 4)) (= (select |#valid| (select (select |v_#memory_$Pointer$.base_199| |ULTIMATE.start_remove_~x#1.base|) 4)) 1) (= |#memory_int| (store |v_#memory_int_175| (select (select |v_#memory_$Pointer$.base_199| |ULTIMATE.start_remove_~x#1.base|) 4) (store (select |v_#memory_int_175| (select (select |v_#memory_$Pointer$.base_199| |ULTIMATE.start_remove_~x#1.base|) 4)) (select (select |v_#memory_$Pointer$.offset_198| |ULTIMATE.start_remove_~x#1.base|) 4) (select (select |#memory_int| (select (select |v_#memory_$Pointer$.base_199| |ULTIMATE.start_remove_~x#1.base|) 4)) (select (select |v_#memory_$Pointer$.offset_198| |ULTIMATE.start_remove_~x#1.base|) 4))))) (or (not (= (select (select |v_#memory_$Pointer$.offset_198| |ULTIMATE.start_remove_~x#1.base|) 4) 0)) (not (= (select (select |v_#memory_$Pointer$.base_199| |ULTIMATE.start_remove_~x#1.base|) 4) 0))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_199| (select (select |v_#memory_$Pointer$.base_199| |ULTIMATE.start_remove_~x#1.base|) 4) (store (select |v_#memory_$Pointer$.base_199| (select (select |v_#memory_$Pointer$.base_199| |ULTIMATE.start_remove_~x#1.base|) 4)) (select (select |v_#memory_$Pointer$.offset_198| |ULTIMATE.start_remove_~x#1.base|) 4) (select (select |v_#memory_$Pointer$.base_199| |ULTIMATE.start_remove_~x#1.base|) 0)))) (<= (+ (select (select |v_#memory_$Pointer$.offset_198| |ULTIMATE.start_remove_~x#1.base|) 4) 4) (select |#length| (select (select |v_#memory_$Pointer$.base_199| |ULTIMATE.start_remove_~x#1.base|) 4))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_198| (select (select |v_#memory_$Pointer$.base_199| |ULTIMATE.start_remove_~x#1.base|) 4) (store (select |v_#memory_$Pointer$.offset_198| (select (select |v_#memory_$Pointer$.base_199| |ULTIMATE.start_remove_~x#1.base|) 4)) (select (select |v_#memory_$Pointer$.offset_198| |ULTIMATE.start_remove_~x#1.base|) 4) (select (select |v_#memory_$Pointer$.offset_198| |ULTIMATE.start_remove_~x#1.base|) 0)))))) (not (= (select |#valid| |ULTIMATE.start_remove_#t~mem7#1.base|) 1)) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_remove_~x#1.base|) 1) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (= |ULTIMATE.start_remove_#in~x#1.base| |ULTIMATE.start_main_~x~0#1.base|) (= |ULTIMATE.start_remove_#t~mem7#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_~x#1.base|) 0)) (<= 8 (select |#length| |ULTIMATE.start_remove_~x#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_~x#1.base|) 0) |ULTIMATE.start_remove_#t~mem7#1.base|) (<= 2 |ULTIMATE.start_main_~tail~0#1.base|) (= |ULTIMATE.start_remove_~x#1.offset| 0) (= |ULTIMATE.start_remove_#in~x#1.offset| 0) (= |ULTIMATE.start_remove_#t~mem8#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_~x#1.base|) 4)) (<= 2 |ULTIMATE.start_main_~x~0#1.base|) (= |ULTIMATE.start_main_~tail~0#1.offset| 0) (= |ULTIMATE.start_remove_#in~x#1.base| |ULTIMATE.start_remove_~x#1.base|) (exists ((|v_ULTIMATE.start_main_#t~nondet16#1_60| Int)) (= (mod |v_ULTIMATE.start_main_#t~nondet16#1_60| 256) 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_~x#1.base|) 4) |ULTIMATE.start_remove_#t~mem8#1.offset|) (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_~x#1.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_~x#1.base|) 0) 0))))' at error location [2023-12-02 15:05:54,449 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 15:05:54,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 15:05:54,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2023-12-02 15:05:54,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267416091] [2023-12-02 15:05:54,449 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 15:05:54,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-12-02 15:05:54,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:05:54,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-12-02 15:05:54,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=2127, Unknown=17, NotChecked=190, Total=2550 [2023-12-02 15:05:54,451 INFO L87 Difference]: Start difference. First operand 287 states and 372 transitions. Second operand has 25 states, 25 states have (on average 1.84) internal successors, (46), 21 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 15:05:56,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:05:56,697 INFO L93 Difference]: Finished difference Result 459 states and 544 transitions. [2023-12-02 15:05:56,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-12-02 15:05:56,697 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.84) internal successors, (46), 21 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2023-12-02 15:05:56,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:05:56,699 INFO L225 Difference]: With dead ends: 459 [2023-12-02 15:05:56,699 INFO L226 Difference]: Without dead ends: 459 [2023-12-02 15:05:56,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 1418 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=523, Invalid=4580, Unknown=17, NotChecked=282, Total=5402 [2023-12-02 15:05:56,701 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 890 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 1222 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 900 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 1392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-02 15:05:56,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [900 Valid, 1075 Invalid, 1392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1222 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-02 15:05:56,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2023-12-02 15:05:56,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 296. [2023-12-02 15:05:56,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 216 states have (on average 1.3657407407407407) internal successors, (295), 246 states have internal predecessors, (295), 36 states have call successors, (36), 20 states have call predecessors, (36), 24 states have return successors, (49), 29 states have call predecessors, (49), 36 states have call successors, (49) [2023-12-02 15:05:56,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 380 transitions. [2023-12-02 15:05:56,708 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 380 transitions. Word has length 27 [2023-12-02 15:05:56,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:05:56,709 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 380 transitions. [2023-12-02 15:05:56,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.84) internal successors, (46), 21 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 15:05:56,709 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 380 transitions. [2023-12-02 15:05:56,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-02 15:05:56,709 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:05:56,709 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-02 15:05:56,714 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-12-02 15:05:56,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:05:56,910 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-12-02 15:05:56,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:05:56,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1430752444, now seen corresponding path program 1 times [2023-12-02 15:05:56,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:05:56,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043370715] [2023-12-02 15:05:56,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:05:56,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:05:56,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:05:57,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:05:57,017 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:05:57,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043370715] [2023-12-02 15:05:57,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043370715] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:05:57,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:05:57,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 15:05:57,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712318929] [2023-12-02 15:05:57,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:05:57,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 15:05:57,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:05:57,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 15:05:57,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-02 15:05:57,019 INFO L87 Difference]: Start difference. First operand 296 states and 380 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 15:05:57,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:05:57,181 INFO L93 Difference]: Finished difference Result 313 states and 396 transitions. [2023-12-02 15:05:57,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 15:05:57,182 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2023-12-02 15:05:57,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:05:57,184 INFO L225 Difference]: With dead ends: 313 [2023-12-02 15:05:57,184 INFO L226 Difference]: Without dead ends: 313 [2023-12-02 15:05:57,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-12-02 15:05:57,184 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 45 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:05:57,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 290 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:05:57,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2023-12-02 15:05:57,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 299. [2023-12-02 15:05:57,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 218 states have (on average 1.353211009174312) internal successors, (295), 248 states have internal predecessors, (295), 38 states have call successors, (38), 19 states have call predecessors, (38), 23 states have return successors, (51), 31 states have call predecessors, (51), 38 states have call successors, (51) [2023-12-02 15:05:57,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 384 transitions. [2023-12-02 15:05:57,191 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 384 transitions. Word has length 29 [2023-12-02 15:05:57,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:05:57,192 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 384 transitions. [2023-12-02 15:05:57,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 15:05:57,192 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 384 transitions. [2023-12-02 15:05:57,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 15:05:57,192 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:05:57,192 INFO L195 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] [2023-12-02 15:05:57,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-12-02 15:05:57,193 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-12-02 15:05:57,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:05:57,193 INFO L85 PathProgramCache]: Analyzing trace with hash -890822600, now seen corresponding path program 1 times [2023-12-02 15:05:57,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:05:57,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920519365] [2023-12-02 15:05:57,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:05:57,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:05:57,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:05:57,562 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 15:05:57,562 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:05:57,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920519365] [2023-12-02 15:05:57,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920519365] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:05:57,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702029750] [2023-12-02 15:05:57,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:05:57,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:05:57,563 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:05:57,564 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:05:57,564 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-12-02 15:05:57,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:05:57,686 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 66 conjunts are in the unsatisfiable core [2023-12-02 15:05:57,689 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:05:57,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 15:05:57,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 15:05:57,829 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 15:05:57,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-12-02 15:05:57,845 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 15:05:57,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-12-02 15:05:58,170 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 15:05:58,171 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:06:04,695 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:06:04,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 175 treesize of output 116 [2023-12-02 15:06:04,711 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:06:04,712 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 105 treesize of output 106 [2023-12-02 15:06:04,735 INFO L349 Elim1Store]: treesize reduction 20, result has 45.9 percent of original size [2023-12-02 15:06:04,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 244 treesize of output 202 [2023-12-02 15:06:04,773 INFO L349 Elim1Store]: treesize reduction 20, result has 45.9 percent of original size [2023-12-02 15:06:04,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 212 treesize of output 208 [2023-12-02 15:06:04,783 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 192 treesize of output 176 [2023-12-02 15:06:04,796 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:06:04,796 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 167 treesize of output 172 [2023-12-02 15:06:04,822 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:06:04,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 174 treesize of output 186 [2023-12-02 15:06:04,948 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:06:04,949 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 109 treesize of output 69 [2023-12-02 15:06:04,992 INFO L349 Elim1Store]: treesize reduction 47, result has 38.2 percent of original size [2023-12-02 15:06:04,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 170 treesize of output 152 [2023-12-02 15:06:05,035 INFO L349 Elim1Store]: treesize reduction 10, result has 65.5 percent of original size [2023-12-02 15:06:05,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 104 [2023-12-02 15:06:05,129 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:06:05,129 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 109 treesize of output 69 [2023-12-02 15:06:05,198 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:06:05,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 170 treesize of output 205 [2023-12-02 15:06:05,256 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:06:05,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 146 treesize of output 146 [2023-12-02 15:06:06,144 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:06:06,144 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 87 treesize of output 67 [2023-12-02 15:06:06,153 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:06:06,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2023-12-02 15:06:06,171 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:06:06,172 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 107 treesize of output 94 [2023-12-02 15:06:06,214 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:06:06,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 96 [2023-12-02 15:06:06,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 71 [2023-12-02 15:06:06,241 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:06:06,242 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 50 treesize of output 50 [2023-12-02 15:06:06,415 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 15:06:06,415 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 87 treesize of output 1 [2023-12-02 15:06:06,422 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 15:06:06,422 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 109 treesize of output 1 [2023-12-02 15:06:06,429 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 15:06:06,430 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 109 treesize of output 1 [2023-12-02 15:06:06,573 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 15:06:06,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702029750] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:06:06,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [451037587] [2023-12-02 15:06:06,575 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2023-12-02 15:06:06,575 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:06:06,576 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 15:06:06,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:06:06,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 17] total 34 [2023-12-02 15:06:06,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745657053] [2023-12-02 15:06:06,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:06:06,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-02 15:06:06,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:06:06,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-02 15:06:06,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=987, Unknown=3, NotChecked=0, Total=1122 [2023-12-02 15:06:06,578 INFO L87 Difference]: Start difference. First operand 299 states and 384 transitions. Second operand has 34 states, 32 states have (on average 2.0625) internal successors, (66), 31 states have internal predecessors, (66), 5 states have call successors, (5), 1 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-02 15:06:08,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:06:08,605 INFO L93 Difference]: Finished difference Result 362 states and 457 transitions. [2023-12-02 15:06:08,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-12-02 15:06:08,605 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 2.0625) internal successors, (66), 31 states have internal predecessors, (66), 5 states have call successors, (5), 1 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 31 [2023-12-02 15:06:08,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:06:08,607 INFO L225 Difference]: With dead ends: 362 [2023-12-02 15:06:08,607 INFO L226 Difference]: Without dead ends: 360 [2023-12-02 15:06:08,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 748 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=426, Invalid=2541, Unknown=3, NotChecked=0, Total=2970 [2023-12-02 15:06:08,609 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 292 mSDsluCounter, 1113 mSDsCounter, 0 mSdLazyCounter, 1305 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 1189 SdHoareTripleChecker+Invalid, 1370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-02 15:06:08,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 1189 Invalid, 1370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1305 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-02 15:06:08,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2023-12-02 15:06:08,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 303. [2023-12-02 15:06:08,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 221 states have (on average 1.3484162895927603) internal successors, (298), 251 states have internal predecessors, (298), 38 states have call successors, (38), 20 states have call predecessors, (38), 24 states have return successors, (51), 31 states have call predecessors, (51), 38 states have call successors, (51) [2023-12-02 15:06:08,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 387 transitions. [2023-12-02 15:06:08,617 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 387 transitions. Word has length 31 [2023-12-02 15:06:08,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:06:08,617 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 387 transitions. [2023-12-02 15:06:08,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 2.0625) internal successors, (66), 31 states have internal predecessors, (66), 5 states have call successors, (5), 1 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-02 15:06:08,617 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 387 transitions. [2023-12-02 15:06:08,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-02 15:06:08,618 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:06:08,618 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-12-02 15:06:08,623 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-12-02 15:06:08,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:06:08,819 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-12-02 15:06:08,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:06:08,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1128450451, now seen corresponding path program 2 times [2023-12-02 15:06:08,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:06:08,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455394452] [2023-12-02 15:06:08,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:06:08,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:06:08,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:06:09,946 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 15:06:09,946 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:06:09,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455394452] [2023-12-02 15:06:09,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455394452] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:06:09,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508148260] [2023-12-02 15:06:09,946 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 15:06:09,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:06:09,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:06:09,947 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:06:09,950 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-12-02 15:06:10,132 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 15:06:10,132 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 15:06:10,134 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 51 conjunts are in the unsatisfiable core [2023-12-02 15:06:10,137 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:06:10,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 15:06:10,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 15:06:10,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:06:10,371 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 15 [2023-12-02 15:06:10,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:06:10,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-12-02 15:06:10,787 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 15:06:10,787 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:06:11,179 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:06:11,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 1679 treesize of output 1428 [2023-12-02 15:06:11,254 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:06:11,255 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 1338 treesize of output 1292 [2023-12-02 15:06:13,445 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 738 treesize of output 726 [2023-12-02 15:06:13,677 INFO L349 Elim1Store]: treesize reduction 389, result has 16.5 percent of original size [2023-12-02 15:06:13,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 11 new quantified variables, introduced 45 case distinctions, treesize of input 4114 treesize of output 3736 [2023-12-02 15:06:15,264 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 15:06:15,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508148260] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:06:15,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [17334154] [2023-12-02 15:06:15,265 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2023-12-02 15:06:15,265 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:06:15,265 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 15:06:15,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:06:15,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 35 [2023-12-02 15:06:15,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256716688] [2023-12-02 15:06:15,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:06:15,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-12-02 15:06:15,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:06:15,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-12-02 15:06:15,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1151, Unknown=0, NotChecked=0, Total=1260 [2023-12-02 15:06:15,267 INFO L87 Difference]: Start difference. First operand 303 states and 387 transitions. Second operand has 36 states, 33 states have (on average 2.272727272727273) internal successors, (75), 29 states have internal predecessors, (75), 7 states have call successors, (7), 7 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:06:16,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:06:16,939 INFO L93 Difference]: Finished difference Result 307 states and 383 transitions. [2023-12-02 15:06:16,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-02 15:06:16,939 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 33 states have (on average 2.272727272727273) internal successors, (75), 29 states have internal predecessors, (75), 7 states have call successors, (7), 7 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-12-02 15:06:16,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:06:16,941 INFO L225 Difference]: With dead ends: 307 [2023-12-02 15:06:16,941 INFO L226 Difference]: Without dead ends: 307 [2023-12-02 15:06:16,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=286, Invalid=2164, Unknown=0, NotChecked=0, Total=2450 [2023-12-02 15:06:16,942 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 497 mSDsluCounter, 779 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-02 15:06:16,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 850 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1033 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-02 15:06:16,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2023-12-02 15:06:16,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 291. [2023-12-02 15:06:16,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 212 states have (on average 1.3396226415094339) internal successors, (284), 242 states have internal predecessors, (284), 36 states have call successors, (36), 19 states have call predecessors, (36), 23 states have return successors, (49), 29 states have call predecessors, (49), 36 states have call successors, (49) [2023-12-02 15:06:16,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 369 transitions. [2023-12-02 15:06:16,948 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 369 transitions. Word has length 33 [2023-12-02 15:06:16,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:06:16,948 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 369 transitions. [2023-12-02 15:06:16,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 33 states have (on average 2.272727272727273) internal successors, (75), 29 states have internal predecessors, (75), 7 states have call successors, (7), 7 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:06:16,948 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 369 transitions. [2023-12-02 15:06:16,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-02 15:06:16,949 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:06:16,949 INFO L195 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] [2023-12-02 15:06:16,954 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-12-02 15:06:17,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2023-12-02 15:06:17,149 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-12-02 15:06:17,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:06:17,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1603066947, now seen corresponding path program 1 times [2023-12-02 15:06:17,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:06:17,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22670483] [2023-12-02 15:06:17,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:06:17,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:06:17,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:06:17,238 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:06:17,238 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:06:17,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22670483] [2023-12-02 15:06:17,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22670483] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:06:17,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735548902] [2023-12-02 15:06:17,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:06:17,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:06:17,239 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:06:17,240 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:06:17,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-12-02 15:06:17,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:06:17,377 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-02 15:06:17,379 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:06:17,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 15:06:17,432 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:06:17,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735548902] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:06:17,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 15:06:17,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2023-12-02 15:06:17,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888454193] [2023-12-02 15:06:17,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:06:17,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 15:06:17,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:06:17,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 15:06:17,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-12-02 15:06:17,433 INFO L87 Difference]: Start difference. First operand 291 states and 369 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 15:06:17,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:06:17,650 INFO L93 Difference]: Finished difference Result 296 states and 373 transitions. [2023-12-02 15:06:17,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 15:06:17,650 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2023-12-02 15:06:17,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:06:17,652 INFO L225 Difference]: With dead ends: 296 [2023-12-02 15:06:17,652 INFO L226 Difference]: Without dead ends: 296 [2023-12-02 15:06:17,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2023-12-02 15:06:17,652 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 114 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 15:06:17,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 158 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 15:06:17,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2023-12-02 15:06:17,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 290. [2023-12-02 15:06:17,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 212 states have (on average 1.3113207547169812) internal successors, (278), 241 states have internal predecessors, (278), 36 states have call successors, (36), 19 states have call predecessors, (36), 23 states have return successors, (49), 29 states have call predecessors, (49), 36 states have call successors, (49) [2023-12-02 15:06:17,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 363 transitions. [2023-12-02 15:06:17,659 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 363 transitions. Word has length 33 [2023-12-02 15:06:17,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:06:17,659 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 363 transitions. [2023-12-02 15:06:17,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 15:06:17,659 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 363 transitions. [2023-12-02 15:06:17,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-02 15:06:17,659 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:06:17,659 INFO L195 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] [2023-12-02 15:06:17,665 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-12-02 15:06:17,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:06:17,860 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-12-02 15:06:17,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:06:17,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1603066946, now seen corresponding path program 1 times [2023-12-02 15:06:17,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:06:17,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431989550] [2023-12-02 15:06:17,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:06:17,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:06:17,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:06:18,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:06:18,059 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:06:18,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431989550] [2023-12-02 15:06:18,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431989550] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:06:18,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120590338] [2023-12-02 15:06:18,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:06:18,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:06:18,060 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:06:18,060 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:06:18,062 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-12-02 15:06:18,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:06:18,206 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 39 conjunts are in the unsatisfiable core [2023-12-02 15:06:18,207 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:06:18,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 15:06:18,327 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:06:18,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120590338] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:06:18,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 15:06:18,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 13 [2023-12-02 15:06:18,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139163199] [2023-12-02 15:06:18,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:06:18,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-02 15:06:18,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:06:18,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-02 15:06:18,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2023-12-02 15:06:18,328 INFO L87 Difference]: Start difference. First operand 290 states and 363 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 15:06:18,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:06:18,800 INFO L93 Difference]: Finished difference Result 352 states and 445 transitions. [2023-12-02 15:06:18,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 15:06:18,801 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2023-12-02 15:06:18,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:06:18,802 INFO L225 Difference]: With dead ends: 352 [2023-12-02 15:06:18,803 INFO L226 Difference]: Without dead ends: 352 [2023-12-02 15:06:18,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2023-12-02 15:06:18,803 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 271 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 15:06:18,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 309 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 15:06:18,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2023-12-02 15:06:18,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 302. [2023-12-02 15:06:18,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 222 states have (on average 1.3153153153153154) internal successors, (292), 251 states have internal predecessors, (292), 38 states have call successors, (38), 19 states have call predecessors, (38), 23 states have return successors, (51), 31 states have call predecessors, (51), 38 states have call successors, (51) [2023-12-02 15:06:18,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 381 transitions. [2023-12-02 15:06:18,810 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 381 transitions. Word has length 33 [2023-12-02 15:06:18,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:06:18,810 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 381 transitions. [2023-12-02 15:06:18,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 15:06:18,810 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 381 transitions. [2023-12-02 15:06:18,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-02 15:06:18,811 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:06:18,811 INFO L195 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] [2023-12-02 15:06:18,816 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-12-02 15:06:19,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:06:19,011 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-12-02 15:06:19,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:06:19,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1026010086, now seen corresponding path program 1 times [2023-12-02 15:06:19,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:06:19,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166940540] [2023-12-02 15:06:19,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:06:19,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:06:19,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:06:19,326 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 15:06:19,326 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:06:19,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166940540] [2023-12-02 15:06:19,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166940540] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:06:19,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317557360] [2023-12-02 15:06:19,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:06:19,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:06:19,326 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:06:19,327 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:06:19,328 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-12-02 15:06:19,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:06:19,448 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 62 conjunts are in the unsatisfiable core [2023-12-02 15:06:19,451 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:06:19,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 15:06:19,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-02 15:06:19,569 INFO L349 Elim1Store]: treesize reduction 15, result has 37.5 percent of original size [2023-12-02 15:06:19,569 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 24 treesize of output 29 [2023-12-02 15:06:19,577 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 [2023-12-02 15:06:19,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 15:06:20,065 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 [2023-12-02 15:06:20,087 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:06:20,087 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:06:20,243 INFO L349 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2023-12-02 15:06:20,243 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 16 treesize of output 15 [2023-12-02 15:06:20,248 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 24 treesize of output 12 [2023-12-02 15:06:20,568 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 10 treesize of output 4 [2023-12-02 15:06:20,582 INFO L349 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2023-12-02 15:06:20,582 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 16 treesize of output 15 [2023-12-02 15:06:20,710 WARN L854 $PredicateComparison]: unable to prove that (and (or (and (= |c_ULTIMATE.start_main_~n~0#1.offset| |c_ULTIMATE.start_main_~#list~0#1.offset|) (= |c_ULTIMATE.start_main_~#list~0#1.base| |c_ULTIMATE.start_main_~n~0#1.base|)) (forall ((v_ArrVal_1687 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| v_ArrVal_1687) |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) |c_ULTIMATE.start_main_~#list~0#1.base|))) (or (and (= |c_ULTIMATE.start_main_~#list~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~#list~0#1.offset|)) (forall ((v_ArrVal_1687 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| v_ArrVal_1687) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_~#list~0#1.base|)))) is different from false [2023-12-02 15:06:20,814 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:06:20,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2023-12-02 15:06:20,817 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 30 treesize of output 22 [2023-12-02 15:06:20,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-12-02 15:06:20,831 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:06:20,836 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:06:20,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2023-12-02 15:06:20,849 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-12-02 15:06:20,849 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 30 treesize of output 29 [2023-12-02 15:06:20,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-02 15:06:20,910 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 15:06:20,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317557360] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:06:20,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [178468122] [2023-12-02 15:06:20,912 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-12-02 15:06:20,912 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:06:20,912 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 15:06:20,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:06:20,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17, 17] total 35 [2023-12-02 15:06:20,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148297347] [2023-12-02 15:06:20,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:06:20,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-12-02 15:06:20,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:06:20,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-12-02 15:06:20,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1038, Unknown=9, NotChecked=66, Total=1260 [2023-12-02 15:06:20,914 INFO L87 Difference]: Start difference. First operand 302 states and 381 transitions. Second operand has 36 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 states have internal predecessors, (68), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 15:06:22,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:06:22,703 INFO L93 Difference]: Finished difference Result 343 states and 434 transitions. [2023-12-02 15:06:22,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-02 15:06:22,704 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 states have internal predecessors, (68), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Word has length 33 [2023-12-02 15:06:22,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:06:22,705 INFO L225 Difference]: With dead ends: 343 [2023-12-02 15:06:22,705 INFO L226 Difference]: Without dead ends: 343 [2023-12-02 15:06:22,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=514, Invalid=2787, Unknown=9, NotChecked=112, Total=3422 [2023-12-02 15:06:22,707 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 417 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 1352 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 1640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 1352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 185 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:06:22,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 861 Invalid, 1640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 1352 Invalid, 0 Unknown, 185 Unchecked, 1.0s Time] [2023-12-02 15:06:22,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2023-12-02 15:06:22,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 305. [2023-12-02 15:06:22,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 225 states have (on average 1.3155555555555556) internal successors, (296), 254 states have internal predecessors, (296), 38 states have call successors, (38), 19 states have call predecessors, (38), 23 states have return successors, (51), 31 states have call predecessors, (51), 38 states have call successors, (51) [2023-12-02 15:06:22,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 385 transitions. [2023-12-02 15:06:22,714 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 385 transitions. Word has length 33 [2023-12-02 15:06:22,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:06:22,714 INFO L495 AbstractCegarLoop]: Abstraction has 305 states and 385 transitions. [2023-12-02 15:06:22,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 states have internal predecessors, (68), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 15:06:22,714 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 385 transitions. [2023-12-02 15:06:22,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-02 15:06:22,715 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:06:22,715 INFO L195 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] [2023-12-02 15:06:22,720 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-12-02 15:06:22,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2023-12-02 15:06:22,915 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-12-02 15:06:22,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:06:22,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1026010085, now seen corresponding path program 1 times [2023-12-02 15:06:22,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:06:22,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083725750] [2023-12-02 15:06:22,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:06:22,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:06:22,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:06:23,359 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 15:06:23,359 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:06:23,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083725750] [2023-12-02 15:06:23,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083725750] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:06:23,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209198738] [2023-12-02 15:06:23,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:06:23,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:06:23,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:06:23,360 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:06:23,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-12-02 15:06:23,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:06:23,495 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 74 conjunts are in the unsatisfiable core [2023-12-02 15:06:23,499 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:06:23,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 15:06:23,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 15:06:23,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-02 15:06:23,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-02 15:06:23,700 INFO L349 Elim1Store]: treesize reduction 15, result has 37.5 percent of original size [2023-12-02 15:06:23,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2023-12-02 15:06:23,721 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-12-02 15:06:23,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 17 [2023-12-02 15:06:23,746 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 [2023-12-02 15:06:24,280 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 36 treesize of output 20 [2023-12-02 15:06:24,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-02 15:06:24,290 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 15:06:24,290 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:06:24,558 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:06:24,558 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 33 treesize of output 37 [2023-12-02 15:06:25,251 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:06:25,251 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 33 treesize of output 37 [2023-12-02 15:06:27,192 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:06:27,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 65 [2023-12-02 15:06:27,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:06:27,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 143 treesize of output 188 [2023-12-02 15:06:27,266 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:06:27,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 127 treesize of output 131 [2023-12-02 15:06:28,095 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:06:28,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 76 [2023-12-02 15:06:28,100 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:06:28,107 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:06:28,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 38 [2023-12-02 15:06:28,119 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:06:28,119 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 101 treesize of output 92 [2023-12-02 15:06:28,151 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-02 15:06:28,151 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 70 treesize of output 74 [2023-12-02 15:06:28,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 56 [2023-12-02 15:06:28,171 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:06:28,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 50 [2023-12-02 15:06:28,257 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:06:28,262 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:06:28,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 53 [2023-12-02 15:06:28,285 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-02 15:06:28,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 118 treesize of output 108 [2023-12-02 15:06:28,311 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:06:28,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 100 [2023-12-02 15:06:28,413 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:06:28,418 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:06:28,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 53 [2023-12-02 15:06:28,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:06:28,422 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:06:28,434 INFO L349 Elim1Store]: treesize reduction 7, result has 53.3 percent of original size [2023-12-02 15:06:28,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 26 [2023-12-02 15:06:28,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-12-02 15:06:28,445 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:06:28,448 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-12-02 15:06:28,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 1 [2023-12-02 15:06:28,453 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:06:28,459 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:06:28,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 53 [2023-12-02 15:06:28,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:06:28,464 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:06:28,472 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-12-02 15:06:28,472 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 30 treesize of output 22 [2023-12-02 15:06:28,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-12-02 15:06:28,483 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:06:28,486 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-12-02 15:06:28,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 1 [2023-12-02 15:06:28,491 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:06:28,493 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-12-02 15:06:28,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 1 [2023-12-02 15:06:28,499 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:06:28,502 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-12-02 15:06:28,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 1 [2023-12-02 15:06:28,508 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:06:28,511 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-12-02 15:06:28,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 1 [2023-12-02 15:06:28,661 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 15:06:28,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209198738] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:06:28,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1415106842] [2023-12-02 15:06:28,663 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-12-02 15:06:28,663 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:06:28,663 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 15:06:28,663 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:06:28,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16, 17] total 39 [2023-12-02 15:06:28,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255616404] [2023-12-02 15:06:28,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:06:28,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-12-02 15:06:28,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:06:28,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-12-02 15:06:28,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1402, Unknown=8, NotChecked=0, Total=1560 [2023-12-02 15:06:28,665 INFO L87 Difference]: Start difference. First operand 305 states and 385 transitions. Second operand has 40 states, 37 states have (on average 2.2162162162162162) internal successors, (82), 37 states have internal predecessors, (82), 6 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 15:06:35,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:06:35,822 INFO L93 Difference]: Finished difference Result 404 states and 517 transitions. [2023-12-02 15:06:35,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-12-02 15:06:35,823 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 37 states have (on average 2.2162162162162162) internal successors, (82), 37 states have internal predecessors, (82), 6 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 33 [2023-12-02 15:06:35,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:06:35,824 INFO L225 Difference]: With dead ends: 404 [2023-12-02 15:06:35,824 INFO L226 Difference]: Without dead ends: 404 [2023-12-02 15:06:35,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=541, Invalid=3483, Unknown=8, NotChecked=0, Total=4032 [2023-12-02 15:06:35,825 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 474 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 2152 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 2261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 2152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2023-12-02 15:06:35,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 1097 Invalid, 2261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 2152 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2023-12-02 15:06:35,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2023-12-02 15:06:35,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 327. [2023-12-02 15:06:35,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 241 states have (on average 1.3195020746887967) internal successors, (318), 272 states have internal predecessors, (318), 43 states have call successors, (43), 20 states have call predecessors, (43), 24 states have return successors, (56), 34 states have call predecessors, (56), 43 states have call successors, (56) [2023-12-02 15:06:35,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 417 transitions. [2023-12-02 15:06:35,833 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 417 transitions. Word has length 33 [2023-12-02 15:06:35,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:06:35,834 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 417 transitions. [2023-12-02 15:06:35,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 37 states have (on average 2.2162162162162162) internal successors, (82), 37 states have internal predecessors, (82), 6 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 15:06:35,834 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 417 transitions. [2023-12-02 15:06:35,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-02 15:06:35,834 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:06:35,834 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:06:35,839 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2023-12-02 15:06:36,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:06:36,035 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-12-02 15:06:36,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:06:36,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1015471421, now seen corresponding path program 1 times [2023-12-02 15:06:36,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:06:36,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231388545] [2023-12-02 15:06:36,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:06:36,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:06:36,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:06:36,154 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 15:06:36,155 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:06:36,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231388545] [2023-12-02 15:06:36,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231388545] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:06:36,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:06:36,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 15:06:36,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297118838] [2023-12-02 15:06:36,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:06:36,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 15:06:36,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:06:36,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 15:06:36,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 15:06:36,156 INFO L87 Difference]: Start difference. First operand 327 states and 417 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 15:06:36,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:06:36,284 INFO L93 Difference]: Finished difference Result 366 states and 467 transitions. [2023-12-02 15:06:36,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 15:06:36,284 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2023-12-02 15:06:36,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:06:36,286 INFO L225 Difference]: With dead ends: 366 [2023-12-02 15:06:36,287 INFO L226 Difference]: Without dead ends: 366 [2023-12-02 15:06:36,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-02 15:06:36,287 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 45 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:06:36,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 305 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:06:36,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2023-12-02 15:06:36,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 347. [2023-12-02 15:06:36,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 260 states have (on average 1.3423076923076922) internal successors, (349), 287 states have internal predecessors, (349), 44 states have call successors, (44), 22 states have call predecessors, (44), 24 states have return successors, (60), 37 states have call predecessors, (60), 44 states have call successors, (60) [2023-12-02 15:06:36,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 453 transitions. [2023-12-02 15:06:36,295 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 453 transitions. Word has length 36 [2023-12-02 15:06:36,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:06:36,295 INFO L495 AbstractCegarLoop]: Abstraction has 347 states and 453 transitions. [2023-12-02 15:06:36,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 15:06:36,296 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 453 transitions. [2023-12-02 15:06:36,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 15:06:36,296 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:06:36,296 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-12-02 15:06:36,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-12-02 15:06:36,297 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-12-02 15:06:36,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:06:36,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1968727412, now seen corresponding path program 1 times [2023-12-02 15:06:36,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:06:36,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339128028] [2023-12-02 15:06:36,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:06:36,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:06:36,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:06:36,516 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-02 15:06:36,517 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:06:36,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339128028] [2023-12-02 15:06:36,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339128028] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:06:36,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090400106] [2023-12-02 15:06:36,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:06:36,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:06:36,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:06:36,518 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:06:36,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-12-02 15:06:36,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:06:36,701 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 34 conjunts are in the unsatisfiable core [2023-12-02 15:06:36,702 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:06:36,842 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-02 15:06:36,842 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:06:36,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-12-02 15:06:36,950 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 10 treesize of output 4 [2023-12-02 15:06:37,047 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-02 15:06:37,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090400106] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-02 15:06:37,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-02 15:06:37,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 11] total 19 [2023-12-02 15:06:37,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176963041] [2023-12-02 15:06:37,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:06:37,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 15:06:37,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:06:37,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 15:06:37,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2023-12-02 15:06:37,048 INFO L87 Difference]: Start difference. First operand 347 states and 453 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 15:06:37,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:06:37,186 INFO L93 Difference]: Finished difference Result 345 states and 451 transitions. [2023-12-02 15:06:37,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 15:06:37,187 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2023-12-02 15:06:37,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:06:37,188 INFO L225 Difference]: With dead ends: 345 [2023-12-02 15:06:37,188 INFO L226 Difference]: Without dead ends: 345 [2023-12-02 15:06:37,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2023-12-02 15:06:37,189 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 109 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:06:37,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 251 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:06:37,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2023-12-02 15:06:37,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2023-12-02 15:06:37,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 260 states have (on average 1.3346153846153845) internal successors, (347), 285 states have internal predecessors, (347), 44 states have call successors, (44), 22 states have call predecessors, (44), 24 states have return successors, (60), 37 states have call predecessors, (60), 44 states have call successors, (60) [2023-12-02 15:06:37,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 451 transitions. [2023-12-02 15:06:37,195 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 451 transitions. Word has length 35 [2023-12-02 15:06:37,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:06:37,196 INFO L495 AbstractCegarLoop]: Abstraction has 345 states and 451 transitions. [2023-12-02 15:06:37,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 15:06:37,196 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 451 transitions. [2023-12-02 15:06:37,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-02 15:06:37,196 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:06:37,197 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:06:37,203 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2023-12-02 15:06:37,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:06:37,397 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-12-02 15:06:37,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:06:37,397 INFO L85 PathProgramCache]: Analyzing trace with hash 523720370, now seen corresponding path program 1 times [2023-12-02 15:06:37,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:06:37,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724891241] [2023-12-02 15:06:37,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:06:37,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:06:37,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:06:37,448 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 15:06:37,448 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:06:37,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724891241] [2023-12-02 15:06:37,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724891241] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:06:37,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:06:37,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 15:06:37,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121287126] [2023-12-02 15:06:37,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:06:37,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 15:06:37,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:06:37,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 15:06:37,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 15:06:37,449 INFO L87 Difference]: Start difference. First operand 345 states and 451 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-02 15:06:37,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:06:37,504 INFO L93 Difference]: Finished difference Result 363 states and 469 transitions. [2023-12-02 15:06:37,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 15:06:37,505 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2023-12-02 15:06:37,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:06:37,506 INFO L225 Difference]: With dead ends: 363 [2023-12-02 15:06:37,506 INFO L226 Difference]: Without dead ends: 363 [2023-12-02 15:06:37,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-02 15:06:37,507 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 5 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:06:37,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 360 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 15:06:37,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2023-12-02 15:06:37,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 348. [2023-12-02 15:06:37,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 263 states have (on average 1.3307984790874525) internal successors, (350), 288 states have internal predecessors, (350), 43 states have call successors, (43), 23 states have call predecessors, (43), 25 states have return successors, (59), 36 states have call predecessors, (59), 43 states have call successors, (59) [2023-12-02 15:06:37,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 452 transitions. [2023-12-02 15:06:37,513 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 452 transitions. Word has length 38 [2023-12-02 15:06:37,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:06:37,513 INFO L495 AbstractCegarLoop]: Abstraction has 348 states and 452 transitions. [2023-12-02 15:06:37,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-02 15:06:37,513 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 452 transitions. [2023-12-02 15:06:37,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-02 15:06:37,514 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:06:37,514 INFO L195 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] [2023-12-02 15:06:37,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2023-12-02 15:06:37,514 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-12-02 15:06:37,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:06:37,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1225976364, now seen corresponding path program 1 times [2023-12-02 15:06:37,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:06:37,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570864017] [2023-12-02 15:06:37,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:06:37,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:06:37,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:06:38,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:06:38,506 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:06:38,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570864017] [2023-12-02 15:06:38,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570864017] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:06:38,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107903638] [2023-12-02 15:06:38,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:06:38,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:06:38,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:06:38,507 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:06:38,508 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-12-02 15:06:38,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:06:38,660 INFO L262 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 58 conjunts are in the unsatisfiable core [2023-12-02 15:06:38,662 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:06:38,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 15:06:40,785 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#list~0#1.offset_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_46| Int)) (<= (+ (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_46|) (+ |v_ULTIMATE.start_main_~#list~0#1.offset_BEFORE_CALL_44| 4)) 2) |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_46|)) is different from true [2023-12-02 15:06:45,071 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2023-12-02 15:06:45,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 60 [2023-12-02 15:06:45,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-12-02 15:06:45,326 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 14 [2023-12-02 15:06:45,328 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:06:45,329 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:06:45,406 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2023-12-02 15:06:45,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2023-12-02 15:06:45,410 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2010 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_#t~mem4#1.base| v_ArrVal_2010) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) |c_ULTIMATE.start_remove_#t~mem4#1.base|)) is different from false [2023-12-02 15:06:45,492 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2010 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse1))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2010) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) .cse0)))) is different from false [2023-12-02 15:06:45,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107903638] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:06:45,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [596522719] [2023-12-02 15:06:45,616 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2023-12-02 15:06:45,616 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:06:45,616 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:06:45,616 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:06:45,616 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:06:46,018 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 68 for LOIs [2023-12-02 15:06:46,037 INFO L197 IcfgInterpreter]: Interpreting procedure is_list_containing_x with input of size 22 for LOIs [2023-12-02 15:06:46,052 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:06:56,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [596522719] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:06:56,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-02 15:06:56,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [19, 14] total 57 [2023-12-02 15:06:56,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325288331] [2023-12-02 15:06:56,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:06:56,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-02 15:06:56,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:06:56,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-02 15:06:56,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=3394, Unknown=19, NotChecked=360, Total=4032 [2023-12-02 15:06:56,664 INFO L87 Difference]: Start difference. First operand 348 states and 452 transitions. Second operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 23 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 15:06:59,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:07:03,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:07:03,017 INFO L93 Difference]: Finished difference Result 352 states and 455 transitions. [2023-12-02 15:07:03,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-12-02 15:07:03,017 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 23 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2023-12-02 15:07:03,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:07:03,019 INFO L225 Difference]: With dead ends: 352 [2023-12-02 15:07:03,019 INFO L226 Difference]: Without dead ends: 352 [2023-12-02 15:07:03,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 66 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1170 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=299, Invalid=3854, Unknown=19, NotChecked=384, Total=4556 [2023-12-02 15:07:03,020 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 90 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 1208 mSolverCounterSat, 11 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 1224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1208 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2023-12-02 15:07:03,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 460 Invalid, 1224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1208 Invalid, 5 Unknown, 0 Unchecked, 5.6s Time] [2023-12-02 15:07:03,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2023-12-02 15:07:03,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 348. [2023-12-02 15:07:03,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 263 states have (on average 1.3231939163498099) internal successors, (348), 288 states have internal predecessors, (348), 43 states have call successors, (43), 23 states have call predecessors, (43), 25 states have return successors, (59), 36 states have call predecessors, (59), 43 states have call successors, (59) [2023-12-02 15:07:03,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 450 transitions. [2023-12-02 15:07:03,026 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 450 transitions. Word has length 36 [2023-12-02 15:07:03,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:07:03,026 INFO L495 AbstractCegarLoop]: Abstraction has 348 states and 450 transitions. [2023-12-02 15:07:03,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 23 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 15:07:03,027 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 450 transitions. [2023-12-02 15:07:03,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-02 15:07:03,027 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:07:03,027 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:07:03,032 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2023-12-02 15:07:03,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:07:03,228 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-12-02 15:07:03,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:07:03,228 INFO L85 PathProgramCache]: Analyzing trace with hash 895448287, now seen corresponding path program 2 times [2023-12-02 15:07:03,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:07:03,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661436666] [2023-12-02 15:07:03,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:07:03,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:07:03,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:07:03,751 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-02 15:07:03,751 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:07:03,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661436666] [2023-12-02 15:07:03,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661436666] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:07:03,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452414355] [2023-12-02 15:07:03,751 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 15:07:03,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:07:03,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:07:03,752 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:07:03,753 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-12-02 15:07:03,911 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 15:07:03,911 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 15:07:03,913 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 63 conjunts are in the unsatisfiable core [2023-12-02 15:07:03,915 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:07:04,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 15:07:04,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 15:07:04,378 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:07:04,378 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 48 treesize of output 42 [2023-12-02 15:07:04,388 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:07:04,388 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 54 treesize of output 36 [2023-12-02 15:07:04,494 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-02 15:07:04,494 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:07:05,234 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 34 treesize of output 28 [2023-12-02 15:07:05,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:07:05,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:07:05,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:07:05,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:07:05,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-12-02 15:07:05,377 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-02 15:07:05,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452414355] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:07:05,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1077180590] [2023-12-02 15:07:05,378 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2023-12-02 15:07:05,378 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:07:05,379 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 15:07:05,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:07:05,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 32 [2023-12-02 15:07:05,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898566200] [2023-12-02 15:07:05,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:07:05,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-02 15:07:05,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:07:05,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-02 15:07:05,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=944, Unknown=0, NotChecked=0, Total=1056 [2023-12-02 15:07:05,380 INFO L87 Difference]: Start difference. First operand 348 states and 450 transitions. Second operand has 33 states, 30 states have (on average 2.533333333333333) internal successors, (76), 29 states have internal predecessors, (76), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 15:07:07,915 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, 1] [2023-12-02 15:07:10,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:07:10,767 INFO L93 Difference]: Finished difference Result 412 states and 519 transitions. [2023-12-02 15:07:10,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-12-02 15:07:10,768 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 2.533333333333333) internal successors, (76), 29 states have internal predecessors, (76), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 39 [2023-12-02 15:07:10,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:07:10,769 INFO L225 Difference]: With dead ends: 412 [2023-12-02 15:07:10,769 INFO L226 Difference]: Without dead ends: 412 [2023-12-02 15:07:10,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1091 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=521, Invalid=3639, Unknown=0, NotChecked=0, Total=4160 [2023-12-02 15:07:10,770 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 699 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 1706 mSolverCounterSat, 146 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 1853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 1706 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2023-12-02 15:07:10,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 938 Invalid, 1853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 1706 Invalid, 1 Unknown, 0 Unchecked, 3.9s Time] [2023-12-02 15:07:10,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2023-12-02 15:07:10,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 338. [2023-12-02 15:07:10,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 255 states have (on average 1.3254901960784313) internal successors, (338), 279 states have internal predecessors, (338), 42 states have call successors, (42), 23 states have call predecessors, (42), 25 states have return successors, (57), 35 states have call predecessors, (57), 42 states have call successors, (57) [2023-12-02 15:07:10,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 437 transitions. [2023-12-02 15:07:10,777 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 437 transitions. Word has length 39 [2023-12-02 15:07:10,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:07:10,778 INFO L495 AbstractCegarLoop]: Abstraction has 338 states and 437 transitions. [2023-12-02 15:07:10,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 2.533333333333333) internal successors, (76), 29 states have internal predecessors, (76), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 15:07:10,778 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 437 transitions. [2023-12-02 15:07:10,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-02 15:07:10,778 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:07:10,778 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-12-02 15:07:10,783 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2023-12-02 15:07:10,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:07:10,979 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-12-02 15:07:10,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:07:10,979 INFO L85 PathProgramCache]: Analyzing trace with hash 2133164717, now seen corresponding path program 2 times [2023-12-02 15:07:10,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:07:10,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420509992] [2023-12-02 15:07:10,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:07:10,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:07:11,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:07:12,078 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 15:07:12,078 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:07:12,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420509992] [2023-12-02 15:07:12,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420509992] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:07:12,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337843774] [2023-12-02 15:07:12,079 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 15:07:12,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:07:12,079 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:07:12,080 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:07:12,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-12-02 15:07:12,251 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 15:07:12,251 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 15:07:12,254 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 78 conjunts are in the unsatisfiable core [2023-12-02 15:07:12,256 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:07:12,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 15:07:12,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 15:07:12,421 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-12-02 15:07:12,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2023-12-02 15:07:12,439 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2023-12-02 15:07:12,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2023-12-02 15:07:13,533 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 15:07:13,533 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:07:14,971 INFO L349 Elim1Store]: treesize reduction 49, result has 71.2 percent of original size [2023-12-02 15:07:14,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 3005 treesize of output 2787 [2023-12-02 15:07:15,586 INFO L349 Elim1Store]: treesize reduction 322, result has 42.9 percent of original size [2023-12-02 15:07:15,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 12 new quantified variables, introduced 55 case distinctions, treesize of input 8835 treesize of output 8032 [2023-12-02 15:07:27,822 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 15:07:27,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337843774] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:07:27,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1972231996] [2023-12-02 15:07:27,824 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2023-12-02 15:07:27,824 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:07:27,824 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 15:07:27,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:07:27,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 14] total 41 [2023-12-02 15:07:27,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541668095] [2023-12-02 15:07:27,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:07:27,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-12-02 15:07:27,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:07:27,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-12-02 15:07:27,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1490, Unknown=0, NotChecked=0, Total=1640 [2023-12-02 15:07:27,826 INFO L87 Difference]: Start difference. First operand 338 states and 437 transitions. Second operand has 41 states, 39 states have (on average 2.2051282051282053) internal successors, (86), 37 states have internal predecessors, (86), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 15:07:39,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 15:07:41,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 15:07:44,083 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] [2023-12-02 15:07:57,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 15:08:00,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:08:00,557 INFO L93 Difference]: Finished difference Result 437 states and 546 transitions. [2023-12-02 15:08:00,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-12-02 15:08:00,558 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 39 states have (on average 2.2051282051282053) internal successors, (86), 37 states have internal predecessors, (86), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 37 [2023-12-02 15:08:00,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:08:00,560 INFO L225 Difference]: With dead ends: 437 [2023-12-02 15:08:00,560 INFO L226 Difference]: Without dead ends: 435 [2023-12-02 15:08:00,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1726 ImplicationChecksByTransitivity, 22.6s TimeCoverageRelationStatistics Valid=680, Invalid=5165, Unknown=7, NotChecked=0, Total=5852 [2023-12-02 15:08:00,561 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 584 mSDsluCounter, 1389 mSDsCounter, 0 mSdLazyCounter, 2255 mSolverCounterSat, 162 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 1465 SdHoareTripleChecker+Invalid, 2420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 2255 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time [2023-12-02 15:08:00,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 1465 Invalid, 2420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 2255 Invalid, 3 Unknown, 0 Unchecked, 11.8s Time] [2023-12-02 15:08:00,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2023-12-02 15:08:00,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 289. [2023-12-02 15:08:00,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 218 states have (on average 1.2798165137614679) internal successors, (279), 239 states have internal predecessors, (279), 32 states have call successors, (32), 21 states have call predecessors, (32), 25 states have return successors, (47), 28 states have call predecessors, (47), 32 states have call successors, (47) [2023-12-02 15:08:00,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 358 transitions. [2023-12-02 15:08:00,569 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 358 transitions. Word has length 37 [2023-12-02 15:08:00,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:08:00,569 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 358 transitions. [2023-12-02 15:08:00,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 39 states have (on average 2.2051282051282053) internal successors, (86), 37 states have internal predecessors, (86), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 15:08:00,569 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 358 transitions. [2023-12-02 15:08:00,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-02 15:08:00,570 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:08:00,570 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:08:00,576 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2023-12-02 15:08:00,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2023-12-02 15:08:00,771 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-12-02 15:08:00,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:08:00,771 INFO L85 PathProgramCache]: Analyzing trace with hash 763120038, now seen corresponding path program 1 times [2023-12-02 15:08:00,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:08:00,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240371945] [2023-12-02 15:08:00,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:08:00,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:08:00,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:08:00,819 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 15:08:00,819 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:08:00,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240371945] [2023-12-02 15:08:00,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240371945] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:08:00,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:08:00,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 15:08:00,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516315930] [2023-12-02 15:08:00,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:08:00,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:08:00,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:08:00,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:08:00,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:08:00,820 INFO L87 Difference]: Start difference. First operand 289 states and 358 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-02 15:08:00,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:08:00,917 INFO L93 Difference]: Finished difference Result 292 states and 361 transitions. [2023-12-02 15:08:00,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 15:08:00,918 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), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2023-12-02 15:08:00,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:08:00,919 INFO L225 Difference]: With dead ends: 292 [2023-12-02 15:08:00,919 INFO L226 Difference]: Without dead ends: 269 [2023-12-02 15:08:00,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:08:00,919 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:08:00,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:08:00,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2023-12-02 15:08:00,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2023-12-02 15:08:00,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 202 states have (on average 1.297029702970297) internal successors, (262), 222 states have internal predecessors, (262), 29 states have call successors, (29), 20 states have call predecessors, (29), 24 states have return successors, (44), 26 states have call predecessors, (44), 29 states have call successors, (44) [2023-12-02 15:08:00,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 335 transitions. [2023-12-02 15:08:00,927 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 335 transitions. Word has length 40 [2023-12-02 15:08:00,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:08:00,927 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 335 transitions. [2023-12-02 15:08:00,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-02 15:08:00,928 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 335 transitions. [2023-12-02 15:08:00,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-02 15:08:00,928 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:08:00,928 INFO L195 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, 1, 1, 1, 1, 1, 1] [2023-12-02 15:08:00,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2023-12-02 15:08:00,928 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-12-02 15:08:00,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:08:00,928 INFO L85 PathProgramCache]: Analyzing trace with hash -906568407, now seen corresponding path program 1 times [2023-12-02 15:08:00,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:08:00,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616491686] [2023-12-02 15:08:00,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:08:00,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:08:00,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:08:01,031 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 15:08:01,032 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:08:01,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616491686] [2023-12-02 15:08:01,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616491686] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:08:01,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559073810] [2023-12-02 15:08:01,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:08:01,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:08:01,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:08:01,033 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:08:01,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-12-02 15:08:01,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:08:01,202 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-02 15:08:01,204 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:08:01,310 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 15:08:01,310 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:08:01,470 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 15:08:01,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559073810] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:08:01,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1422658757] [2023-12-02 15:08:01,472 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2023-12-02 15:08:01,472 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:08:01,472 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 15:08:01,472 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:08:01,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 9 [2023-12-02 15:08:01,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879992234] [2023-12-02 15:08:01,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:08:01,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 15:08:01,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:08:01,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 15:08:01,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-02 15:08:01,474 INFO L87 Difference]: Start difference. First operand 269 states and 335 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-12-02 15:08:01,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:08:01,647 INFO L93 Difference]: Finished difference Result 223 states and 259 transitions. [2023-12-02 15:08:01,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 15:08:01,648 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 39 [2023-12-02 15:08:01,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:08:01,649 INFO L225 Difference]: With dead ends: 223 [2023-12-02 15:08:01,649 INFO L226 Difference]: Without dead ends: 223 [2023-12-02 15:08:01,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-12-02 15:08:01,650 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 113 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:08:01,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 351 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:08:01,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2023-12-02 15:08:01,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 218. [2023-12-02 15:08:01,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 164 states have (on average 1.2439024390243902) internal successors, (204), 182 states have internal predecessors, (204), 21 states have call successors, (21), 15 states have call predecessors, (21), 19 states have return successors, (30), 20 states have call predecessors, (30), 21 states have call successors, (30) [2023-12-02 15:08:01,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 255 transitions. [2023-12-02 15:08:01,655 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 255 transitions. Word has length 39 [2023-12-02 15:08:01,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:08:01,655 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 255 transitions. [2023-12-02 15:08:01,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-12-02 15:08:01,655 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 255 transitions. [2023-12-02 15:08:01,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-02 15:08:01,656 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:08:01,656 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-12-02 15:08:01,661 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2023-12-02 15:08:01,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2023-12-02 15:08:01,857 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-12-02 15:08:01,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:08:01,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1627909455, now seen corresponding path program 2 times [2023-12-02 15:08:01,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:08:01,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295241263] [2023-12-02 15:08:01,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:08:01,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:08:01,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:08:02,661 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 15:08:02,661 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:08:02,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295241263] [2023-12-02 15:08:02,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295241263] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:08:02,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603621079] [2023-12-02 15:08:02,661 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 15:08:02,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:08:02,661 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:08:02,662 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:08:02,664 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-12-02 15:08:02,863 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 15:08:02,863 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 15:08:02,866 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 78 conjunts are in the unsatisfiable core [2023-12-02 15:08:02,868 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:08:02,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 15:08:03,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-02 15:08:03,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 15:08:03,031 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 15 [2023-12-02 15:08:03,757 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 15:08:03,757 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 15 treesize of output 7 [2023-12-02 15:08:03,943 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:08:03,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 36 [2023-12-02 15:08:03,961 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 15:08:03,961 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:08:04,141 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2023-12-02 15:08:04,142 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 28 treesize of output 27 [2023-12-02 15:08:05,027 INFO L349 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2023-12-02 15:08:05,027 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 16 treesize of output 15 [2023-12-02 15:08:05,179 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 140 treesize of output 128 [2023-12-02 15:08:07,222 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |c_ULTIMATE.start_main_~tail~0#1.offset| 4) |c_ULTIMATE.start_main_~n~0#1.base|)))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)))) (let ((.cse2 (select .cse5 .cse3)) (.cse1 (= |c_ULTIMATE.start_main_~tail~0#1.offset| |c_ULTIMATE.start_main_~#list~0#1.offset|)) (.cse0 (= |c_ULTIMATE.start_main_~tail~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (or (and .cse0 .cse1 (= (select .cse2 |c_ULTIMATE.start_main_~n~0#1.offset|) |c_ULTIMATE.start_main_~#list~0#1.base|)) (let ((.cse4 (or (not .cse1) (not .cse0)))) (and (or (= .cse3 |c_ULTIMATE.start_main_~#list~0#1.base|) (and .cse4 (forall ((v_arrayElimCell_214 Int)) (= (select .cse2 v_arrayElimCell_214) |c_ULTIMATE.start_main_~#list~0#1.base|)))) (or (and (forall ((v_arrayElimCell_214 Int)) (or (= (select .cse2 v_arrayElimCell_214) |c_ULTIMATE.start_main_~#list~0#1.base|) (= |c_ULTIMATE.start_main_~#list~0#1.offset| v_arrayElimCell_214))) .cse4) (and (= |c_ULTIMATE.start_main_~n~0#1.offset| |c_ULTIMATE.start_main_~#list~0#1.offset|) .cse0 .cse1)))))))) is different from false [2023-12-02 15:08:09,329 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) (.cse5 (+ |c_ULTIMATE.start_main_~tail~0#1.offset| 4)) (.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|)) (.cse7 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4)) (.cse14 (= |c_ULTIMATE.start_main_~tail~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|)) (.cse15 (= |c_ULTIMATE.start_main_~tail~0#1.offset| |c_ULTIMATE.start_main_~#list~0#1.offset|))) (let ((.cse0 (not .cse15)) (.cse8 (not .cse14)) (.cse16 (and (forall ((v_ArrVal_2472 Int)) (let ((.cse22 (let ((.cse23 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse6 .cse7 v_ArrVal_2472)))) (store .cse23 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse23 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse5 |c_ULTIMATE.start_main_~n~0#1.base|))))) (let ((.cse21 (select (select .cse22 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3))) (or (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse21) (forall ((v_arrayElimCell_214 Int)) (= (select (select .cse22 .cse21) v_arrayElimCell_214) |c_ULTIMATE.start_main_~#list~0#1.base|)))))) (forall ((v_ArrVal_2472 Int) (v_arrayElimCell_214 Int)) (or (= (select (let ((.cse24 (let ((.cse25 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse6 .cse7 v_ArrVal_2472)))) (store .cse25 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse25 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse5 |c_ULTIMATE.start_main_~n~0#1.base|))))) (select .cse24 (select (select .cse24 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3))) v_arrayElimCell_214) |c_ULTIMATE.start_main_~#list~0#1.base|) (= |c_ULTIMATE.start_main_~#list~0#1.offset| v_arrayElimCell_214)))))) (and (or .cse0 (forall ((v_ArrVal_2472 Int)) (let ((.cse2 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse6 .cse7 v_ArrVal_2472)))) (store .cse4 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse5 |c_ULTIMATE.start_main_~n~0#1.base|))))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3))) (or (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse1) (= (select (select .cse2 .cse1) |c_ULTIMATE.start_main_~n~0#1.offset|) |c_ULTIMATE.start_main_~#list~0#1.base|))))) .cse8) (or (and (forall ((v_ArrVal_2472 Int)) (let ((.cse9 (let ((.cse10 (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse6 .cse7 v_ArrVal_2472)))) (store .cse11 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse11 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse5 |c_ULTIMATE.start_main_~n~0#1.base|))))) (select .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3))))) (or (forall ((v_arrayElimCell_214 Int)) (or (= (select .cse9 v_arrayElimCell_214) |c_ULTIMATE.start_main_~#list~0#1.base|) (= |c_ULTIMATE.start_main_~#list~0#1.offset| v_arrayElimCell_214))) (= (select .cse9 |c_ULTIMATE.start_main_~n~0#1.offset|) |c_ULTIMATE.start_main_~#list~0#1.base|)))) (or .cse0 (forall ((v_ArrVal_2472 Int)) (= (select (let ((.cse12 (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse6 .cse7 v_ArrVal_2472)))) (store .cse13 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse13 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse5 |c_ULTIMATE.start_main_~n~0#1.base|))))) (select .cse12 (select (select .cse12 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3))) |c_ULTIMATE.start_main_~n~0#1.offset|) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse8)) (and (= |c_ULTIMATE.start_main_~n~0#1.offset| |c_ULTIMATE.start_main_~#list~0#1.offset|) .cse14 .cse15)) (or .cse16 .cse14) (forall ((v_ArrVal_2472 Int)) (let ((.cse19 (let ((.cse20 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse6 .cse7 v_ArrVal_2472)))) (store .cse20 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse20 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse5 |c_ULTIMATE.start_main_~n~0#1.base|))))) (let ((.cse17 (select (select .cse19 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3))) (let ((.cse18 (select .cse19 .cse17))) (or (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse17) (= (select .cse18 |c_ULTIMATE.start_main_~n~0#1.offset|) |c_ULTIMATE.start_main_~#list~0#1.base|) (forall ((v_arrayElimCell_214 Int)) (= (select .cse18 v_arrayElimCell_214) |c_ULTIMATE.start_main_~#list~0#1.base|))))))) (or .cse16 .cse15)))) is different from false [2023-12-02 15:08:09,369 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:08:09,403 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:08:09,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 2687 treesize of output 2517 [2023-12-02 15:08:12,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:08:12,261 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:08:12,305 INFO L349 Elim1Store]: treesize reduction 26, result has 57.4 percent of original size [2023-12-02 15:08:12,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 2687 treesize of output 2501 [2023-12-02 15:08:14,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:08:14,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:08:14,727 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 608 treesize of output 592 [2023-12-02 15:08:14,764 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:08:14,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:08:14,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:08:14,768 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 391 treesize of output 383 [2023-12-02 15:08:14,802 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:08:14,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:08:14,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:08:14,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:08:14,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:08:14,878 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 2 not checked. [2023-12-02 15:08:14,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603621079] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:08:14,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [772036822] [2023-12-02 15:08:14,879 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-12-02 15:08:14,879 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:08:14,879 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 15:08:14,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:08:14,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 15] total 41 [2023-12-02 15:08:14,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333025855] [2023-12-02 15:08:14,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:08:14,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-12-02 15:08:14,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:08:14,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-12-02 15:08:14,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1409, Unknown=2, NotChecked=154, Total=1722 [2023-12-02 15:08:14,881 INFO L87 Difference]: Start difference. First operand 218 states and 255 transitions. Second operand has 42 states, 39 states have (on average 2.3076923076923075) internal successors, (90), 38 states have internal predecessors, (90), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 15:08:20,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:08:20,152 INFO L93 Difference]: Finished difference Result 334 states and 389 transitions. [2023-12-02 15:08:20,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-12-02 15:08:20,152 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 39 states have (on average 2.3076923076923075) internal successors, (90), 38 states have internal predecessors, (90), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Word has length 39 [2023-12-02 15:08:20,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:08:20,154 INFO L225 Difference]: With dead ends: 334 [2023-12-02 15:08:20,154 INFO L226 Difference]: Without dead ends: 334 [2023-12-02 15:08:20,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 80 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1802 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=843, Invalid=5483, Unknown=2, NotChecked=314, Total=6642 [2023-12-02 15:08:20,155 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 934 mSDsluCounter, 1030 mSDsCounter, 0 mSdLazyCounter, 1920 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 934 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 2740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 1920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 600 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-12-02 15:08:20,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [934 Valid, 1087 Invalid, 2740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 1920 Invalid, 0 Unknown, 600 Unchecked, 2.4s Time] [2023-12-02 15:08:20,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2023-12-02 15:08:20,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 233. [2023-12-02 15:08:20,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 178 states have (on average 1.2415730337078652) internal successors, (221), 196 states have internal predecessors, (221), 22 states have call successors, (22), 15 states have call predecessors, (22), 19 states have return successors, (33), 21 states have call predecessors, (33), 22 states have call successors, (33) [2023-12-02 15:08:20,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 276 transitions. [2023-12-02 15:08:20,160 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 276 transitions. Word has length 39 [2023-12-02 15:08:20,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:08:20,160 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 276 transitions. [2023-12-02 15:08:20,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 39 states have (on average 2.3076923076923075) internal successors, (90), 38 states have internal predecessors, (90), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 15:08:20,160 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 276 transitions. [2023-12-02 15:08:20,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-02 15:08:20,161 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:08:20,161 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-12-02 15:08:20,166 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2023-12-02 15:08:20,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2023-12-02 15:08:20,362 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-12-02 15:08:20,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:08:20,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1627909456, now seen corresponding path program 2 times [2023-12-02 15:08:20,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:08:20,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274754272] [2023-12-02 15:08:20,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:08:20,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:08:20,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:08:21,422 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 15:08:21,422 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:08:21,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274754272] [2023-12-02 15:08:21,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274754272] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:08:21,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222633055] [2023-12-02 15:08:21,422 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 15:08:21,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:08:21,422 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:08:21,423 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:08:21,424 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc5ce40-6f6d-4599-a8f7-a1f8854b0c6b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-12-02 15:08:21,615 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 15:08:21,615 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 15:08:21,618 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 87 conjunts are in the unsatisfiable core [2023-12-02 15:08:21,621 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:08:21,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 15:08:21,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 15:08:21,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-02 15:08:21,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-02 15:08:21,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-12-02 15:08:21,819 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 15 [2023-12-02 15:08:22,922 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:08:22,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 50 [2023-12-02 15:08:22,936 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-12-02 15:08:22,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 29 treesize of output 13 [2023-12-02 15:08:22,977 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 15:08:22,977 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:08:23,332 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:08:23,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 73 [2023-12-02 15:08:30,335 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:08:30,335 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 33 treesize of output 37 [2023-12-02 15:08:32,458 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 1931 treesize of output 1907 [2023-12-02 15:08:35,675 INFO L349 Elim1Store]: treesize reduction 1163, result has 27.3 percent of original size [2023-12-02 15:08:35,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 1 disjoint index pairs (out of 78 index pairs), introduced 15 new quantified variables, introduced 93 case distinctions, treesize of input 108075 treesize of output 86023 [2023-12-02 15:08:37,602 INFO L349 Elim1Store]: treesize reduction 8, result has 90.1 percent of original size [2023-12-02 15:08:37,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 2145 treesize of output 2073 [2023-12-02 15:09:15,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-12-02 15:11:30,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 5 treesize of output 3 [2023-12-02 15:11:30,991 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 15:11:31,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-02 15:11:31,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-12-02 15:11:34,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-12-02 15:11:34,940 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 3 [2023-12-02 15:11:34,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-12-02 15:11:35,538 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:11:35,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 52 [2023-12-02 15:11:35,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-02 15:11:35,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-02 15:11:35,912 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 3 [2023-12-02 15:11:36,296 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 [2023-12-02 15:11:36,561 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 [2023-12-02 15:11:37,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-12-02 15:11:37,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-12-02 15:11:37,417 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 5 [2023-12-02 15:11:37,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-12-02 15:11:37,708 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 3 [2023-12-02 15:11:37,746 INFO L349 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2023-12-02 15:11:37,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 65 [2023-12-02 15:11:37,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-12-02 15:11:37,886 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:11:37,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 20 [2023-12-02 15:11:38,206 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:11:38,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 96 treesize of output 176 [2023-12-02 15:11:39,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:11:39,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:11:39,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 87 treesize of output 159 [2023-12-02 15:11:39,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:11:39,827 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:11:39,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 18 [2023-12-02 15:11:39,852 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:11:39,864 INFO L349 Elim1Store]: treesize reduction 194, result has 0.5 percent of original size [2023-12-02 15:11:39,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 20 case distinctions, treesize of input 115 treesize of output 1 [2023-12-02 15:11:39,939 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 15:11:39,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-12-02 15:11:39,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-02 15:11:40,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-12-02 15:11:40,380 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 39 treesize of output 27 [2023-12-02 15:11:40,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2023-12-02 15:11:40,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2023-12-02 15:11:40,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-12-02 15:11:40,684 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:11:40,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2023-12-02 15:11:40,740 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