./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974817c-a19b-4c9e-b20c-7222b090b3e9/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974817c-a19b-4c9e-b20c-7222b090b3e9/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974817c-a19b-4c9e-b20c-7222b090b3e9/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974817c-a19b-4c9e-b20c-7222b090b3e9/bin/utaipan-verify-YMUCfTKeje/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974817c-a19b-4c9e-b20c-7222b090b3e9/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974817c-a19b-4c9e-b20c-7222b090b3e9/bin/utaipan-verify-YMUCfTKeje --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7408f3b7e084094987873e007e2bbb0a022372240d1ad946af6301d3e9707406 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 05:23:55,452 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 05:23:55,535 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974817c-a19b-4c9e-b20c-7222b090b3e9/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-09 05:23:55,544 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 05:23:55,548 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 05:23:55,605 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 05:23:55,606 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 05:23:55,607 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 05:23:55,608 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 05:23:55,610 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 05:23:55,611 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 05:23:55,611 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 05:23:55,612 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 05:23:55,613 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 05:23:55,616 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 05:23:55,616 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 05:23:55,617 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 05:23:55,617 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 05:23:55,618 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 05:23:55,618 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 05:23:55,618 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 05:23:55,619 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 05:23:55,620 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 05:23:55,620 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 05:23:55,621 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 05:23:55,621 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 05:23:55,622 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 05:23:55,622 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 05:23:55,623 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 05:23:55,623 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 05:23:55,624 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 05:23:55,624 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 05:23:55,625 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 05:23:55,625 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 05:23:55,625 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 05:23:55,626 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 05:23:55,626 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 05:23:55,627 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 05:23:55,627 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 05:23:55,628 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 05:23:55,628 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 05:23:55,629 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:23:55,629 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 05:23:55,630 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 05:23:55,630 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 05:23:55,630 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 05:23:55,631 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 05:23:55,631 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 05:23:55,632 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 05:23:55,632 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_c974817c-a19b-4c9e-b20c-7222b090b3e9/bin/utaipan-verify-YMUCfTKeje/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974817c-a19b-4c9e-b20c-7222b090b3e9/bin/utaipan-verify-YMUCfTKeje Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7408f3b7e084094987873e007e2bbb0a022372240d1ad946af6301d3e9707406 [2024-11-09 05:23:55,961 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 05:23:55,999 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 05:23:56,003 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 05:23:56,006 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 05:23:56,007 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 05:23:56,009 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974817c-a19b-4c9e-b20c-7222b090b3e9/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i Unable to find full path for "g++" [2024-11-09 05:23:58,365 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 05:23:58,756 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 05:23:58,756 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974817c-a19b-4c9e-b20c-7222b090b3e9/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i [2024-11-09 05:23:58,774 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974817c-a19b-4c9e-b20c-7222b090b3e9/bin/utaipan-verify-YMUCfTKeje/data/5b905fe3c/19c53d483a2a4535a26fe7c0295a5517/FLAG8c4b2495e [2024-11-09 05:23:58,976 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974817c-a19b-4c9e-b20c-7222b090b3e9/bin/utaipan-verify-YMUCfTKeje/data/5b905fe3c/19c53d483a2a4535a26fe7c0295a5517 [2024-11-09 05:23:58,980 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 05:23:58,982 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 05:23:58,983 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 05:23:58,984 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 05:23:58,992 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 05:23:58,993 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:23:58" (1/1) ... [2024-11-09 05:23:58,995 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fb8eb80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:23:58, skipping insertion in model container [2024-11-09 05:23:58,995 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:23:58" (1/1) ... [2024-11-09 05:23:59,048 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 05:23:59,520 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 05:23:59,561 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:23:59,577 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 05:23:59,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:23:59,709 INFO L204 MainTranslator]: Completed translation [2024-11-09 05:23:59,709 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:23:59 WrapperNode [2024-11-09 05:23:59,709 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 05:23:59,711 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 05:23:59,711 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 05:23:59,711 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 05:23:59,719 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:23:59" (1/1) ... [2024-11-09 05:23:59,736 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:23:59" (1/1) ... [2024-11-09 05:23:59,766 INFO L138 Inliner]: procedures = 126, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 117 [2024-11-09 05:23:59,767 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 05:23:59,768 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 05:23:59,768 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 05:23:59,769 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 05:23:59,781 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:23:59" (1/1) ... [2024-11-09 05:23:59,781 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:23:59" (1/1) ... [2024-11-09 05:23:59,785 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:23:59" (1/1) ... [2024-11-09 05:23:59,786 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:23:59" (1/1) ... [2024-11-09 05:23:59,797 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:23:59" (1/1) ... [2024-11-09 05:23:59,801 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:23:59" (1/1) ... [2024-11-09 05:23:59,803 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:23:59" (1/1) ... [2024-11-09 05:23:59,805 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:23:59" (1/1) ... [2024-11-09 05:23:59,809 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 05:23:59,810 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 05:23:59,810 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 05:23:59,811 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 05:23:59,813 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:23:59" (1/1) ... [2024-11-09 05:23:59,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:23:59,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974817c-a19b-4c9e-b20c-7222b090b3e9/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:23:59,854 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974817c-a19b-4c9e-b20c-7222b090b3e9/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 05:23:59,862 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974817c-a19b-4c9e-b20c-7222b090b3e9/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 05:23:59,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 05:23:59,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 05:23:59,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 05:23:59,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 05:23:59,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 05:23:59,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 05:23:59,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 05:23:59,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-09 05:23:59,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 05:23:59,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 05:23:59,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 05:24:00,017 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 05:24:00,022 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 05:24:00,581 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2024-11-09 05:24:00,583 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 05:24:00,686 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 05:24:00,687 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 05:24:00,687 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:24:00 BoogieIcfgContainer [2024-11-09 05:24:00,687 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 05:24:00,690 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 05:24:00,691 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 05:24:00,694 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 05:24:00,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 05:23:58" (1/3) ... [2024-11-09 05:24:00,696 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@373acfd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:24:00, skipping insertion in model container [2024-11-09 05:24:00,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:23:59" (2/3) ... [2024-11-09 05:24:00,696 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@373acfd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:24:00, skipping insertion in model container [2024-11-09 05:24:00,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:24:00" (3/3) ... [2024-11-09 05:24:00,698 INFO L112 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04-1.i [2024-11-09 05:24:00,722 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 05:24:00,723 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 46 error locations. [2024-11-09 05:24:00,812 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 05:24:00,820 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@177cc5e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 05:24:00,821 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2024-11-09 05:24:00,826 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 43 states have (on average 2.302325581395349) internal successors, (99), 89 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:00,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 05:24:00,835 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:24:00,836 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 05:24:00,836 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 05:24:00,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:24:00,843 INFO L85 PathProgramCache]: Analyzing trace with hash 181823, now seen corresponding path program 1 times [2024-11-09 05:24:00,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:24:00,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861469928] [2024-11-09 05:24:00,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:24:00,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:24:01,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:24:01,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:24:01,356 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:24:01,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861469928] [2024-11-09 05:24:01,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861469928] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:24:01,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:24:01,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:24:01,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770491104] [2024-11-09 05:24:01,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:24:01,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:24:01,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:24:01,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:24:01,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:24:01,414 INFO L87 Difference]: Start difference. First operand has 90 states, 43 states have (on average 2.302325581395349) internal successors, (99), 89 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:01,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:24:01,692 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2024-11-09 05:24:01,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:24:01,695 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-11-09 05:24:01,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:24:01,706 INFO L225 Difference]: With dead ends: 93 [2024-11-09 05:24:01,707 INFO L226 Difference]: Without dead ends: 92 [2024-11-09 05:24:01,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:24:01,714 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 105 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:24:01,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 76 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:24:01,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-09 05:24:01,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 86. [2024-11-09 05:24:01,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 45 states have (on average 2.088888888888889) internal successors, (94), 85 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:01,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2024-11-09 05:24:01,761 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 3 [2024-11-09 05:24:01,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:24:01,762 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2024-11-09 05:24:01,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:01,763 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2024-11-09 05:24:01,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 05:24:01,764 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:24:01,764 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 05:24:01,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 05:24:01,765 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 05:24:01,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:24:01,766 INFO L85 PathProgramCache]: Analyzing trace with hash 181824, now seen corresponding path program 1 times [2024-11-09 05:24:01,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:24:01,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606318774] [2024-11-09 05:24:01,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:24:01,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:24:01,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:24:02,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:24:02,020 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:24:02,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606318774] [2024-11-09 05:24:02,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606318774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:24:02,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:24:02,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:24:02,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643601151] [2024-11-09 05:24:02,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:24:02,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:24:02,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:24:02,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:24:02,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:24:02,025 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:02,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:24:02,377 INFO L93 Difference]: Finished difference Result 129 states and 140 transitions. [2024-11-09 05:24:02,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:24:02,378 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-11-09 05:24:02,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:24:02,380 INFO L225 Difference]: With dead ends: 129 [2024-11-09 05:24:02,380 INFO L226 Difference]: Without dead ends: 129 [2024-11-09 05:24:02,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:24:02,382 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 87 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:24:02,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 89 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 05:24:02,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-09 05:24:02,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 97. [2024-11-09 05:24:02,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 57 states have (on average 1.9824561403508771) internal successors, (113), 96 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:02,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 113 transitions. [2024-11-09 05:24:02,402 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 113 transitions. Word has length 3 [2024-11-09 05:24:02,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:24:02,403 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 113 transitions. [2024-11-09 05:24:02,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:02,403 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 113 transitions. [2024-11-09 05:24:02,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 05:24:02,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:24:02,404 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 05:24:02,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 05:24:02,405 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 05:24:02,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:24:02,409 INFO L85 PathProgramCache]: Analyzing trace with hash 5636493, now seen corresponding path program 1 times [2024-11-09 05:24:02,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:24:02,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589216279] [2024-11-09 05:24:02,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:24:02,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:24:02,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:24:02,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:24:02,526 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:24:02,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589216279] [2024-11-09 05:24:02,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589216279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:24:02,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:24:02,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:24:02,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538208491] [2024-11-09 05:24:02,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:24:02,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:24:02,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:24:02,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:24:02,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:24:02,531 INFO L87 Difference]: Start difference. First operand 97 states and 113 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:02,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:24:02,671 INFO L93 Difference]: Finished difference Result 95 states and 110 transitions. [2024-11-09 05:24:02,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:24:02,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-09 05:24:02,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:24:02,675 INFO L225 Difference]: With dead ends: 95 [2024-11-09 05:24:02,675 INFO L226 Difference]: Without dead ends: 95 [2024-11-09 05:24:02,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:24:02,680 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 27 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:24:02,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 96 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:24:02,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-09 05:24:02,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-09 05:24:02,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 57 states have (on average 1.9298245614035088) internal successors, (110), 94 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:02,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 110 transitions. [2024-11-09 05:24:02,701 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 110 transitions. Word has length 4 [2024-11-09 05:24:02,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:24:02,702 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 110 transitions. [2024-11-09 05:24:02,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:02,702 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 110 transitions. [2024-11-09 05:24:02,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 05:24:02,703 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:24:02,703 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 05:24:02,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 05:24:02,703 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 05:24:02,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:24:02,707 INFO L85 PathProgramCache]: Analyzing trace with hash 5636494, now seen corresponding path program 1 times [2024-11-09 05:24:02,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:24:02,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097843339] [2024-11-09 05:24:02,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:24:02,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:24:02,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:24:02,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:24:02,860 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:24:02,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097843339] [2024-11-09 05:24:02,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097843339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:24:02,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:24:02,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:24:02,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563208295] [2024-11-09 05:24:02,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:24:02,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:24:02,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:24:02,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:24:02,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:24:02,864 INFO L87 Difference]: Start difference. First operand 95 states and 110 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:03,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:24:03,054 INFO L93 Difference]: Finished difference Result 93 states and 107 transitions. [2024-11-09 05:24:03,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:24:03,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-09 05:24:03,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:24:03,056 INFO L225 Difference]: With dead ends: 93 [2024-11-09 05:24:03,057 INFO L226 Difference]: Without dead ends: 93 [2024-11-09 05:24:03,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:24:03,059 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 27 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:24:03,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 100 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:24:03,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-09 05:24:03,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-09 05:24:03,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 57 states have (on average 1.8771929824561404) internal successors, (107), 92 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:03,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 107 transitions. [2024-11-09 05:24:03,068 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 107 transitions. Word has length 4 [2024-11-09 05:24:03,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:24:03,068 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 107 transitions. [2024-11-09 05:24:03,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:03,069 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 107 transitions. [2024-11-09 05:24:03,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 05:24:03,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:24:03,070 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:24:03,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 05:24:03,070 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 05:24:03,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:24:03,071 INFO L85 PathProgramCache]: Analyzing trace with hash 417466323, now seen corresponding path program 1 times [2024-11-09 05:24:03,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:24:03,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852390340] [2024-11-09 05:24:03,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:24:03,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:24:03,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:24:03,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:24:03,170 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:24:03,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852390340] [2024-11-09 05:24:03,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852390340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:24:03,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:24:03,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:24:03,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512544210] [2024-11-09 05:24:03,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:24:03,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:24:03,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:24:03,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:24:03,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:24:03,176 INFO L87 Difference]: Start difference. First operand 93 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) [2024-11-09 05:24:03,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:24:03,288 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2024-11-09 05:24:03,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:24:03,290 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 [2024-11-09 05:24:03,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:24:03,291 INFO L225 Difference]: With dead ends: 89 [2024-11-09 05:24:03,291 INFO L226 Difference]: Without dead ends: 89 [2024-11-09 05:24:03,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:24:03,294 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 12 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:24:03,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 96 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:24:03,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-09 05:24:03,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-09 05:24:03,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 57 states have (on average 1.8070175438596492) internal successors, (103), 88 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:03,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 103 transitions. [2024-11-09 05:24:03,309 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 103 transitions. Word has length 7 [2024-11-09 05:24:03,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:24:03,309 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 103 transitions. [2024-11-09 05:24:03,314 INFO L472 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) [2024-11-09 05:24:03,314 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 103 transitions. [2024-11-09 05:24:03,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 05:24:03,314 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:24:03,315 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:24:03,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 05:24:03,315 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 05:24:03,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:24:03,316 INFO L85 PathProgramCache]: Analyzing trace with hash 417466324, now seen corresponding path program 1 times [2024-11-09 05:24:03,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:24:03,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850492314] [2024-11-09 05:24:03,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:24:03,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:24:03,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:24:03,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:24:03,470 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:24:03,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850492314] [2024-11-09 05:24:03,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850492314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:24:03,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:24:03,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:24:03,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233832388] [2024-11-09 05:24:03,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:24:03,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:24:03,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:24:03,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:24:03,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:24:03,476 INFO L87 Difference]: Start difference. First operand 89 states and 103 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) [2024-11-09 05:24:03,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:24:03,571 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2024-11-09 05:24:03,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:24:03,573 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 [2024-11-09 05:24:03,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:24:03,574 INFO L225 Difference]: With dead ends: 85 [2024-11-09 05:24:03,574 INFO L226 Difference]: Without dead ends: 85 [2024-11-09 05:24:03,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:24:03,576 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 12 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:24:03,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 100 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:24:03,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-09 05:24:03,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-09 05:24:03,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 57 states have (on average 1.736842105263158) internal successors, (99), 84 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:03,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2024-11-09 05:24:03,586 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 7 [2024-11-09 05:24:03,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:24:03,586 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2024-11-09 05:24:03,587 INFO L472 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) [2024-11-09 05:24:03,587 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2024-11-09 05:24:03,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 05:24:03,587 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:24:03,587 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:24:03,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 05:24:03,588 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 05:24:03,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:24:03,589 INFO L85 PathProgramCache]: Analyzing trace with hash 509030128, now seen corresponding path program 1 times [2024-11-09 05:24:03,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:24:03,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348698443] [2024-11-09 05:24:03,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:24:03,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:24:03,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:24:03,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:24:03,790 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:24:03,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348698443] [2024-11-09 05:24:03,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348698443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:24:03,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:24:03,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:24:03,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083192766] [2024-11-09 05:24:03,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:24:03,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:24:03,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:24:03,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:24:03,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:24:03,793 INFO L87 Difference]: Start difference. First operand 85 states and 99 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:03,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:24:03,976 INFO L93 Difference]: Finished difference Result 93 states and 109 transitions. [2024-11-09 05:24:03,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 05:24:03,977 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-09 05:24:03,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:24:03,978 INFO L225 Difference]: With dead ends: 93 [2024-11-09 05:24:03,978 INFO L226 Difference]: Without dead ends: 93 [2024-11-09 05:24:03,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:24:03,979 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 6 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:24:03,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 187 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:24:03,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-09 05:24:03,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2024-11-09 05:24:03,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 61 states have (on average 1.7377049180327868) internal successors, (106), 88 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:03,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 106 transitions. [2024-11-09 05:24:03,992 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 106 transitions. Word has length 11 [2024-11-09 05:24:03,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:24:03,993 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 106 transitions. [2024-11-09 05:24:03,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:03,993 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 106 transitions. [2024-11-09 05:24:03,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 05:24:03,994 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:24:03,994 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:24:03,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 05:24:03,995 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 05:24:03,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:24:03,995 INFO L85 PathProgramCache]: Analyzing trace with hash 509030129, now seen corresponding path program 1 times [2024-11-09 05:24:03,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:24:03,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636069513] [2024-11-09 05:24:03,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:24:03,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:24:04,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:24:04,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:24:04,301 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:24:04,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636069513] [2024-11-09 05:24:04,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636069513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:24:04,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:24:04,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:24:04,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170980316] [2024-11-09 05:24:04,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:24:04,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:24:04,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:24:04,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:24:04,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:24:04,304 INFO L87 Difference]: Start difference. First operand 89 states and 106 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:04,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:24:04,505 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2024-11-09 05:24:04,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 05:24:04,506 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-09 05:24:04,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:24:04,507 INFO L225 Difference]: With dead ends: 89 [2024-11-09 05:24:04,507 INFO L226 Difference]: Without dead ends: 89 [2024-11-09 05:24:04,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:24:04,509 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 1 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:24:04,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 184 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:24:04,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-09 05:24:04,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-09 05:24:04,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 61 states have (on average 1.6885245901639345) internal successors, (103), 88 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:04,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 103 transitions. [2024-11-09 05:24:04,516 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 103 transitions. Word has length 11 [2024-11-09 05:24:04,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:24:04,516 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 103 transitions. [2024-11-09 05:24:04,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:04,517 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 103 transitions. [2024-11-09 05:24:04,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 05:24:04,518 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:24:04,518 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:24:04,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 05:24:04,518 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 05:24:04,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:24:04,519 INFO L85 PathProgramCache]: Analyzing trace with hash 2144960094, now seen corresponding path program 1 times [2024-11-09 05:24:04,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:24:04,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044872867] [2024-11-09 05:24:04,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:24:04,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:24:04,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:24:04,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:24:04,738 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:24:04,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044872867] [2024-11-09 05:24:04,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044872867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:24:04,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:24:04,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:24:04,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181454370] [2024-11-09 05:24:04,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:24:04,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:24:04,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:24:04,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:24:04,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:24:04,740 INFO L87 Difference]: Start difference. First operand 89 states and 103 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:04,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:24:04,866 INFO L93 Difference]: Finished difference Result 88 states and 102 transitions. [2024-11-09 05:24:04,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 05:24:04,866 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2024-11-09 05:24:04,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:24:04,867 INFO L225 Difference]: With dead ends: 88 [2024-11-09 05:24:04,867 INFO L226 Difference]: Without dead ends: 88 [2024-11-09 05:24:04,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-09 05:24:04,871 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 109 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:24:04,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 92 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:24:04,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-09 05:24:04,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2024-11-09 05:24:04,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 58 states have (on average 1.706896551724138) internal successors, (99), 84 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:04,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2024-11-09 05:24:04,881 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 12 [2024-11-09 05:24:04,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:24:04,881 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2024-11-09 05:24:04,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:04,882 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2024-11-09 05:24:04,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 05:24:04,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:24:04,885 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:24:04,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 05:24:04,886 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 05:24:04,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:24:04,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1822366465, now seen corresponding path program 1 times [2024-11-09 05:24:04,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:24:04,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614894529] [2024-11-09 05:24:04,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:24:04,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:24:04,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:24:05,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:24:05,109 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:24:05,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614894529] [2024-11-09 05:24:05,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614894529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:24:05,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:24:05,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 05:24:05,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167698028] [2024-11-09 05:24:05,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:24:05,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:24:05,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:24:05,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:24:05,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:24:05,111 INFO L87 Difference]: Start difference. First operand 85 states and 99 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:05,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:24:05,282 INFO L93 Difference]: Finished difference Result 120 states and 134 transitions. [2024-11-09 05:24:05,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:24:05,283 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-09 05:24:05,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:24:05,284 INFO L225 Difference]: With dead ends: 120 [2024-11-09 05:24:05,284 INFO L226 Difference]: Without dead ends: 120 [2024-11-09 05:24:05,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:24:05,286 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 59 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:24:05,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 189 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:24:05,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-09 05:24:05,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 85. [2024-11-09 05:24:05,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 58 states have (on average 1.6896551724137931) internal successors, (98), 84 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:05,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 98 transitions. [2024-11-09 05:24:05,291 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 98 transitions. Word has length 13 [2024-11-09 05:24:05,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:24:05,292 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 98 transitions. [2024-11-09 05:24:05,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:05,292 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 98 transitions. [2024-11-09 05:24:05,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 05:24:05,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:24:05,295 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:24:05,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 05:24:05,295 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 05:24:05,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:24:05,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1822366437, now seen corresponding path program 1 times [2024-11-09 05:24:05,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:24:05,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180639173] [2024-11-09 05:24:05,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:24:05,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:24:05,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:24:05,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:24:05,513 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:24:05,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180639173] [2024-11-09 05:24:05,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180639173] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:24:05,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:24:05,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 05:24:05,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266155558] [2024-11-09 05:24:05,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:24:05,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:24:05,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:24:05,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:24:05,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:24:05,516 INFO L87 Difference]: Start difference. First operand 85 states and 98 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:05,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:24:05,746 INFO L93 Difference]: Finished difference Result 116 states and 126 transitions. [2024-11-09 05:24:05,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:24:05,747 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-09 05:24:05,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:24:05,748 INFO L225 Difference]: With dead ends: 116 [2024-11-09 05:24:05,748 INFO L226 Difference]: Without dead ends: 116 [2024-11-09 05:24:05,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-09 05:24:05,749 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 67 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:24:05,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 143 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:24:05,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-09 05:24:05,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 85. [2024-11-09 05:24:05,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 58 states have (on average 1.6724137931034482) internal successors, (97), 84 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:05,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 97 transitions. [2024-11-09 05:24:05,760 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 97 transitions. Word has length 13 [2024-11-09 05:24:05,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:24:05,760 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 97 transitions. [2024-11-09 05:24:05,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:05,760 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 97 transitions. [2024-11-09 05:24:05,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 05:24:05,761 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:24:05,761 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:24:05,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 05:24:05,766 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 05:24:05,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:24:05,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1822366438, now seen corresponding path program 1 times [2024-11-09 05:24:05,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:24:05,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643199005] [2024-11-09 05:24:05,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:24:05,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:24:05,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:24:06,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:24:06,105 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:24:06,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643199005] [2024-11-09 05:24:06,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643199005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:24:06,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:24:06,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:24:06,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814643655] [2024-11-09 05:24:06,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:24:06,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:24:06,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:24:06,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:24:06,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:24:06,108 INFO L87 Difference]: Start difference. First operand 85 states and 97 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:06,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:24:06,351 INFO L93 Difference]: Finished difference Result 133 states and 152 transitions. [2024-11-09 05:24:06,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:24:06,352 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-09 05:24:06,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:24:06,353 INFO L225 Difference]: With dead ends: 133 [2024-11-09 05:24:06,353 INFO L226 Difference]: Without dead ends: 133 [2024-11-09 05:24:06,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:24:06,355 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 42 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:24:06,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 173 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:24:06,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-09 05:24:06,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 95. [2024-11-09 05:24:06,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 68 states have (on average 1.588235294117647) internal successors, (108), 94 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:06,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2024-11-09 05:24:06,360 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 13 [2024-11-09 05:24:06,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:24:06,360 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2024-11-09 05:24:06,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:06,361 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2024-11-09 05:24:06,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 05:24:06,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:24:06,361 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:24:06,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 05:24:06,362 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 05:24:06,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:24:06,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1052437646, now seen corresponding path program 1 times [2024-11-09 05:24:06,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:24:06,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022251965] [2024-11-09 05:24:06,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:24:06,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:24:06,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:24:06,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:24:06,453 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:24:06,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022251965] [2024-11-09 05:24:06,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022251965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:24:06,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:24:06,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:24:06,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250990790] [2024-11-09 05:24:06,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:24:06,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:24:06,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:24:06,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:24:06,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:24:06,456 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:06,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:24:06,639 INFO L93 Difference]: Finished difference Result 106 states and 118 transitions. [2024-11-09 05:24:06,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 05:24:06,639 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-09 05:24:06,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:24:06,640 INFO L225 Difference]: With dead ends: 106 [2024-11-09 05:24:06,640 INFO L226 Difference]: Without dead ends: 106 [2024-11-09 05:24:06,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:24:06,641 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 30 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:24:06,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 145 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:24:06,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-09 05:24:06,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 94. [2024-11-09 05:24:06,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 68 states have (on average 1.5588235294117647) internal successors, (106), 93 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:06,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 106 transitions. [2024-11-09 05:24:06,646 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 106 transitions. Word has length 15 [2024-11-09 05:24:06,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:24:06,647 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 106 transitions. [2024-11-09 05:24:06,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:06,647 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 106 transitions. [2024-11-09 05:24:06,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 05:24:06,648 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:24:06,648 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:24:06,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 05:24:06,649 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 05:24:06,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:24:06,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1052437645, now seen corresponding path program 1 times [2024-11-09 05:24:06,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:24:06,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895984013] [2024-11-09 05:24:06,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:24:06,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:24:06,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:24:07,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:24:07,046 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:24:07,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895984013] [2024-11-09 05:24:07,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895984013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:24:07,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:24:07,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 05:24:07,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439014516] [2024-11-09 05:24:07,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:24:07,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:24:07,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:24:07,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:24:07,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:24:07,049 INFO L87 Difference]: Start difference. First operand 94 states and 106 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:07,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:24:07,283 INFO L93 Difference]: Finished difference Result 130 states and 148 transitions. [2024-11-09 05:24:07,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 05:24:07,283 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-09 05:24:07,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:24:07,284 INFO L225 Difference]: With dead ends: 130 [2024-11-09 05:24:07,284 INFO L226 Difference]: Without dead ends: 130 [2024-11-09 05:24:07,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-09 05:24:07,286 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 38 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:24:07,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 198 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:24:07,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-09 05:24:07,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 96. [2024-11-09 05:24:07,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 70 states have (on average 1.542857142857143) internal successors, (108), 95 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:07,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2024-11-09 05:24:07,290 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 15 [2024-11-09 05:24:07,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:24:07,290 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2024-11-09 05:24:07,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:07,290 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2024-11-09 05:24:07,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 05:24:07,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:24:07,291 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:24:07,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 05:24:07,292 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 05:24:07,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:24:07,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1228622250, now seen corresponding path program 1 times [2024-11-09 05:24:07,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:24:07,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399135049] [2024-11-09 05:24:07,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:24:07,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:24:07,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:24:07,610 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:24:07,611 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:24:07,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399135049] [2024-11-09 05:24:07,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399135049] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:24:07,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914573187] [2024-11-09 05:24:07,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:24:07,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:24:07,612 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974817c-a19b-4c9e-b20c-7222b090b3e9/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:24:07,615 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974817c-a19b-4c9e-b20c-7222b090b3e9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:24:07,618 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974817c-a19b-4c9e-b20c-7222b090b3e9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 05:24:07,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:24:07,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 05:24:07,798 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:24:07,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 05:24:07,891 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 05:24:07,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 05:24:07,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 05:24:08,001 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:24:08,002 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 42 treesize of output 41 [2024-11-09 05:24:08,040 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 31 treesize of output 13 [2024-11-09 05:24:08,045 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:24:08,045 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:24:08,089 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-09 05:24:08,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2024-11-09 05:24:08,200 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:24:08,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [914573187] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:24:08,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1094433283] [2024-11-09 05:24:08,226 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2024-11-09 05:24:08,226 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:24:08,231 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:24:08,239 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:24:08,239 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:24:10,273 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:24:12,985 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3005#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_append_~pointerToList#1.offset| 0) (= |ULTIMATE.start_create_data_~data~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#list~0#1.base|) (<= 8 (select |#length| |ULTIMATE.start_create_data_~data~0#1.base|)) (<= 2 |ULTIMATE.start_append_~pointerToList#1.base|) (= (select |#valid| |ULTIMATE.start_create_data_~data~0#1.base|) 1) (<= 0 |ULTIMATE.start_create_data_~counter~0#1|) (<= |ULTIMATE.start_create_data_~counter~0#1| 19) (= |ULTIMATE.start_append_~node~0#1.offset| 0) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) 4)) 1)) (<= |ULTIMATE.start_create_data_#t~nondet8#1| 2147483647) (= |ULTIMATE.start_create_data_#t~mem7#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) 4)) (<= 0 (+ |ULTIMATE.start_create_data_#t~nondet8#1| 2147483648)))' at error location [2024-11-09 05:24:12,985 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:24:12,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:24:12,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-11-09 05:24:12,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318876085] [2024-11-09 05:24:12,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:24:12,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 05:24:12,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:24:12,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 05:24:12,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=475, Unknown=3, NotChecked=0, Total=552 [2024-11-09 05:24:12,993 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:13,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:24:13,462 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2024-11-09 05:24:13,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:24:13,463 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-09 05:24:13,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:24:13,464 INFO L225 Difference]: With dead ends: 95 [2024-11-09 05:24:13,464 INFO L226 Difference]: Without dead ends: 95 [2024-11-09 05:24:13,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=100, Invalid=599, Unknown=3, NotChecked=0, Total=702 [2024-11-09 05:24:13,466 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 23 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:24:13,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 454 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 05:24:13,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-09 05:24:13,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-09 05:24:13,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 70 states have (on average 1.5285714285714285) internal successors, (107), 94 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:13,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2024-11-09 05:24:13,477 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 15 [2024-11-09 05:24:13,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:24:13,478 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2024-11-09 05:24:13,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:13,478 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2024-11-09 05:24:13,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 05:24:13,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:24:13,479 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:24:13,508 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974817c-a19b-4c9e-b20c-7222b090b3e9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 05:24:13,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974817c-a19b-4c9e-b20c-7222b090b3e9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-09 05:24:13,681 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 05:24:13,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:24:13,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1228622249, now seen corresponding path program 1 times [2024-11-09 05:24:13,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:24:13,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170097208] [2024-11-09 05:24:13,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:24:13,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:24:13,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:24:14,207 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:24:14,207 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:24:14,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170097208] [2024-11-09 05:24:14,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170097208] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:24:14,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033547778] [2024-11-09 05:24:14,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:24:14,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:24:14,209 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974817c-a19b-4c9e-b20c-7222b090b3e9/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:24:14,210 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974817c-a19b-4c9e-b20c-7222b090b3e9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:24:14,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974817c-a19b-4c9e-b20c-7222b090b3e9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 05:24:14,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:24:14,349 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-09 05:24:14,352 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:24:14,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 05:24:14,394 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 05:24:14,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 05:24:14,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 05:24:14,423 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 [2024-11-09 05:24:14,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 05:24:14,554 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:24:14,554 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 62 treesize of output 57 [2024-11-09 05:24:14,565 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 30 treesize of output 13 [2024-11-09 05:24:14,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-09 05:24:14,675 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 9 treesize of output 3 [2024-11-09 05:24:14,700 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:24:14,700 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:24:14,804 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4)) (.cse1 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4))) (and (forall ((v_ArrVal_336 (Array Int Int)) (v_ArrVal_335 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_336) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) .cse1 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_335) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0)))) (forall ((v_ArrVal_336 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_336) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) .cse1 4))))) is different from false [2024-11-09 05:24:14,924 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:24:14,924 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 24 treesize of output 25 [2024-11-09 05:24:14,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 40 treesize of output 28 [2024-11-09 05:24:14,950 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:24:14,951 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 45 treesize of output 46 [2024-11-09 05:24:14,962 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:24:14,962 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 35 treesize of output 36 [2024-11-09 05:24:14,967 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:24:14,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2024-11-09 05:24:14,975 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:24:14,982 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 [2024-11-09 05:24:15,052 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-09 05:24:15,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033547778] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:24:15,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1112447418] [2024-11-09 05:24:15,056 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2024-11-09 05:24:15,056 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:24:15,056 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:24:15,057 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:24:15,057 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:24:16,505 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:24:18,968 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3313#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_append_~pointerToList#1.offset| 0) (= |ULTIMATE.start_create_data_~data~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_create_data_~data~0#1.base|)) (exists ((|v_ULTIMATE.start_create_data_~counter~0#1_34| Int)) (and (or (< (+ (* |v_ULTIMATE.start_create_data_~counter~0#1_34| 4) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) 4)) 0) (< (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) 4)) (+ (* |v_ULTIMATE.start_create_data_~counter~0#1_34| 4) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) 4) 4))) (<= 1 |#StackHeapBarrier|) (<= 0 |v_ULTIMATE.start_create_data_~counter~0#1_34|) (<= 2 |ULTIMATE.start_main_~#list~0#1.base|) (<= 2 |ULTIMATE.start_append_~pointerToList#1.base|) (<= |v_ULTIMATE.start_create_data_~counter~0#1_34| 19))) (= (select |#valid| |ULTIMATE.start_create_data_~data~0#1.base|) 1) (= |ULTIMATE.start_append_~node~0#1.offset| 0) (<= |ULTIMATE.start_create_data_#t~nondet8#1| 2147483647) (<= 0 (+ |ULTIMATE.start_create_data_#t~nondet8#1| 2147483648)))' at error location [2024-11-09 05:24:18,969 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:24:18,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:24:18,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2024-11-09 05:24:18,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090124414] [2024-11-09 05:24:18,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:24:18,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 05:24:18,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:24:18,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 05:24:18,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=616, Unknown=3, NotChecked=50, Total=756 [2024-11-09 05:24:18,971 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand has 17 states, 16 states have (on average 2.0) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:19,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:24:19,858 INFO L93 Difference]: Finished difference Result 103 states and 117 transitions. [2024-11-09 05:24:19,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 05:24:19,859 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.0) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-09 05:24:19,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:24:19,861 INFO L225 Difference]: With dead ends: 103 [2024-11-09 05:24:19,861 INFO L226 Difference]: Without dead ends: 103 [2024-11-09 05:24:19,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=150, Invalid=973, Unknown=3, NotChecked=64, Total=1190 [2024-11-09 05:24:19,863 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 56 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 4 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 05:24:19,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 422 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 366 Invalid, 12 Unknown, 52 Unchecked, 0.5s Time] [2024-11-09 05:24:19,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-09 05:24:19,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-09 05:24:19,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 78 states have (on average 1.5) internal successors, (117), 102 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:19,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 117 transitions. [2024-11-09 05:24:19,867 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 117 transitions. Word has length 15 [2024-11-09 05:24:19,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:24:19,868 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 117 transitions. [2024-11-09 05:24:19,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.0) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:19,868 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 117 transitions. [2024-11-09 05:24:19,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 05:24:19,869 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:24:19,869 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:24:19,890 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974817c-a19b-4c9e-b20c-7222b090b3e9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 05:24:20,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974817c-a19b-4c9e-b20c-7222b090b3e9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:24:20,070 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 05:24:20,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:24:20,071 INFO L85 PathProgramCache]: Analyzing trace with hash -2075207029, now seen corresponding path program 1 times [2024-11-09 05:24:20,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:24:20,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767659080] [2024-11-09 05:24:20,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:24:20,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:24:20,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:24:20,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:24:20,576 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:24:20,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767659080] [2024-11-09 05:24:20,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767659080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:24:20,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:24:20,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 05:24:20,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570720306] [2024-11-09 05:24:20,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:24:20,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 05:24:20,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:24:20,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 05:24:20,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-09 05:24:20,578 INFO L87 Difference]: Start difference. First operand 103 states and 117 transitions. Second operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:21,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:24:21,081 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2024-11-09 05:24:21,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 05:24:21,081 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-09 05:24:21,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:24:21,082 INFO L225 Difference]: With dead ends: 132 [2024-11-09 05:24:21,082 INFO L226 Difference]: Without dead ends: 132 [2024-11-09 05:24:21,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2024-11-09 05:24:21,083 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 108 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:24:21,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 197 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 05:24:21,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-09 05:24:21,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 114. [2024-11-09 05:24:21,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 89 states have (on average 1.449438202247191) internal successors, (129), 113 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:21,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 129 transitions. [2024-11-09 05:24:21,088 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 129 transitions. Word has length 17 [2024-11-09 05:24:21,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:24:21,088 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 129 transitions. [2024-11-09 05:24:21,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:21,089 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 129 transitions. [2024-11-09 05:24:21,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 05:24:21,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:24:21,090 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:24:21,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 05:24:21,090 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 05:24:21,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:24:21,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1409161816, now seen corresponding path program 1 times [2024-11-09 05:24:21,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:24:21,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224050470] [2024-11-09 05:24:21,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:24:21,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:24:21,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:24:21,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:24:21,259 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:24:21,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224050470] [2024-11-09 05:24:21,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224050470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:24:21,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:24:21,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:24:21,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700982992] [2024-11-09 05:24:21,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:24:21,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:24:21,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:24:21,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:24:21,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:24:21,261 INFO L87 Difference]: Start difference. First operand 114 states and 129 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:21,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:24:21,410 INFO L93 Difference]: Finished difference Result 143 states and 161 transitions. [2024-11-09 05:24:21,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:24:21,410 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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 19 [2024-11-09 05:24:21,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:24:21,411 INFO L225 Difference]: With dead ends: 143 [2024-11-09 05:24:21,411 INFO L226 Difference]: Without dead ends: 143 [2024-11-09 05:24:21,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:24:21,412 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 47 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:24:21,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 185 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:24:21,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-09 05:24:21,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 126. [2024-11-09 05:24:21,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 101 states have (on average 1.5247524752475248) internal successors, (154), 125 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:21,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 154 transitions. [2024-11-09 05:24:21,417 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 154 transitions. Word has length 19 [2024-11-09 05:24:21,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:24:21,418 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 154 transitions. [2024-11-09 05:24:21,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:21,418 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 154 transitions. [2024-11-09 05:24:21,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 05:24:21,419 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:24:21,419 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:24:21,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 05:24:21,420 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 05:24:21,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:24:21,420 INFO L85 PathProgramCache]: Analyzing trace with hash -734343168, now seen corresponding path program 1 times [2024-11-09 05:24:21,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:24:21,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928708999] [2024-11-09 05:24:21,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:24:21,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:24:21,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:24:21,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:24:21,602 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:24:21,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928708999] [2024-11-09 05:24:21,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928708999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:24:21,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:24:21,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:24:21,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503924206] [2024-11-09 05:24:21,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:24:21,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:24:21,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:24:21,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:24:21,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:24:21,605 INFO L87 Difference]: Start difference. First operand 126 states and 154 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:21,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:24:21,799 INFO L93 Difference]: Finished difference Result 142 states and 160 transitions. [2024-11-09 05:24:21,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 05:24:21,799 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 20 [2024-11-09 05:24:21,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:24:21,801 INFO L225 Difference]: With dead ends: 142 [2024-11-09 05:24:21,801 INFO L226 Difference]: Without dead ends: 142 [2024-11-09 05:24:21,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:24:21,802 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 47 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:24:21,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 153 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:24:21,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-09 05:24:21,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 127. [2024-11-09 05:24:21,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 102 states have (on average 1.5196078431372548) internal successors, (155), 126 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:21,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 155 transitions. [2024-11-09 05:24:21,810 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 155 transitions. Word has length 20 [2024-11-09 05:24:21,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:24:21,812 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 155 transitions. [2024-11-09 05:24:21,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:21,812 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 155 transitions. [2024-11-09 05:24:21,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 05:24:21,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:24:21,813 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:24:21,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 05:24:21,813 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 05:24:21,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:24:21,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1289801558, now seen corresponding path program 1 times [2024-11-09 05:24:21,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:24:21,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83158498] [2024-11-09 05:24:21,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:24:21,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:24:21,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:24:21,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:24:21,905 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:24:21,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83158498] [2024-11-09 05:24:21,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83158498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:24:21,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:24:21,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:24:21,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097288772] [2024-11-09 05:24:21,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:24:21,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:24:21,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:24:21,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:24:21,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:24:21,907 INFO L87 Difference]: Start difference. First operand 127 states and 155 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:22,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:24:22,091 INFO L93 Difference]: Finished difference Result 143 states and 174 transitions. [2024-11-09 05:24:22,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 05:24:22,092 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-09 05:24:22,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:24:22,093 INFO L225 Difference]: With dead ends: 143 [2024-11-09 05:24:22,093 INFO L226 Difference]: Without dead ends: 143 [2024-11-09 05:24:22,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:24:22,094 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 26 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:24:22,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 143 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:24:22,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-09 05:24:22,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 132. [2024-11-09 05:24:22,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 107 states have (on average 1.514018691588785) internal successors, (162), 131 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:22,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 162 transitions. [2024-11-09 05:24:22,099 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 162 transitions. Word has length 21 [2024-11-09 05:24:22,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:24:22,099 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 162 transitions. [2024-11-09 05:24:22,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:22,100 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 162 transitions. [2024-11-09 05:24:22,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 05:24:22,100 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:24:22,101 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:24:22,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 05:24:22,101 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 05:24:22,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:24:22,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1420165851, now seen corresponding path program 1 times [2024-11-09 05:24:22,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:24:22,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651103017] [2024-11-09 05:24:22,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:24:22,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:24:22,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:24:22,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:24:22,767 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:24:22,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651103017] [2024-11-09 05:24:22,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651103017] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:24:22,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:24:22,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 05:24:22,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928987250] [2024-11-09 05:24:22,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:24:22,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 05:24:22,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:24:22,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 05:24:22,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-09 05:24:22,769 INFO L87 Difference]: Start difference. First operand 132 states and 162 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:23,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:24:23,400 INFO L93 Difference]: Finished difference Result 156 states and 177 transitions. [2024-11-09 05:24:23,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 05:24:23,401 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-09 05:24:23,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:24:23,402 INFO L225 Difference]: With dead ends: 156 [2024-11-09 05:24:23,402 INFO L226 Difference]: Without dead ends: 156 [2024-11-09 05:24:23,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2024-11-09 05:24:23,403 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 145 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 05:24:23,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 238 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 05:24:23,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-09 05:24:23,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 137. [2024-11-09 05:24:23,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 113 states have (on average 1.4955752212389382) internal successors, (169), 136 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:23,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 169 transitions. [2024-11-09 05:24:23,409 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 169 transitions. Word has length 21 [2024-11-09 05:24:23,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:24:23,409 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 169 transitions. [2024-11-09 05:24:23,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:23,409 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 169 transitions. [2024-11-09 05:24:23,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 05:24:23,410 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:24:23,410 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:24:23,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 05:24:23,411 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 05:24:23,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:24:23,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1420165852, now seen corresponding path program 1 times [2024-11-09 05:24:23,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:24:23,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182386609] [2024-11-09 05:24:23,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:24:23,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:24:23,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:24:24,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:24:24,134 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:24:24,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182386609] [2024-11-09 05:24:24,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182386609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:24:24,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:24:24,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 05:24:24,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934414364] [2024-11-09 05:24:24,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:24:24,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 05:24:24,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:24:24,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 05:24:24,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-09 05:24:24,137 INFO L87 Difference]: Start difference. First operand 137 states and 169 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:24,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:24:24,982 INFO L93 Difference]: Finished difference Result 158 states and 178 transitions. [2024-11-09 05:24:24,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 05:24:24,986 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-09 05:24:24,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:24:24,987 INFO L225 Difference]: With dead ends: 158 [2024-11-09 05:24:24,987 INFO L226 Difference]: Without dead ends: 158 [2024-11-09 05:24:24,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2024-11-09 05:24:24,989 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 127 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 05:24:24,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 322 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 05:24:24,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-09 05:24:24,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 137. [2024-11-09 05:24:24,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 113 states have (on average 1.4601769911504425) internal successors, (165), 136 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:24,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 165 transitions. [2024-11-09 05:24:24,996 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 165 transitions. Word has length 21 [2024-11-09 05:24:24,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:24:24,997 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 165 transitions. [2024-11-09 05:24:24,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:24,997 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 165 transitions. [2024-11-09 05:24:24,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 05:24:24,998 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:24:24,998 INFO L215 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] [2024-11-09 05:24:24,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 05:24:24,999 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 05:24:25,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:24:25,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1329142461, now seen corresponding path program 1 times [2024-11-09 05:24:25,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:24:25,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537759163] [2024-11-09 05:24:25,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:24:25,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:24:25,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:24:25,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:24:25,332 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:24:25,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537759163] [2024-11-09 05:24:25,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537759163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:24:25,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:24:25,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 05:24:25,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920048509] [2024-11-09 05:24:25,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:24:25,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 05:24:25,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:24:25,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 05:24:25,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:24:25,335 INFO L87 Difference]: Start difference. First operand 137 states and 165 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:25,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:24:25,575 INFO L93 Difference]: Finished difference Result 147 states and 168 transitions. [2024-11-09 05:24:25,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 05:24:25,576 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-09 05:24:25,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:24:25,577 INFO L225 Difference]: With dead ends: 147 [2024-11-09 05:24:25,577 INFO L226 Difference]: Without dead ends: 147 [2024-11-09 05:24:25,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-09 05:24:25,578 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 86 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:24:25,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 144 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:24:25,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-09 05:24:25,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 139. [2024-11-09 05:24:25,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 115 states have (on average 1.4608695652173913) internal successors, (168), 138 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:25,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 168 transitions. [2024-11-09 05:24:25,583 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 168 transitions. Word has length 22 [2024-11-09 05:24:25,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:24:25,583 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 168 transitions. [2024-11-09 05:24:25,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:25,584 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 168 transitions. [2024-11-09 05:24:25,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 05:24:25,584 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:24:25,585 INFO L215 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] [2024-11-09 05:24:25,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 05:24:25,585 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 05:24:25,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:24:25,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1329142460, now seen corresponding path program 1 times [2024-11-09 05:24:25,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:24:25,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224967582] [2024-11-09 05:24:25,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:24:25,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:24:25,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:24:25,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:24:25,661 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:24:25,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224967582] [2024-11-09 05:24:25,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224967582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:24:25,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:24:25,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:24:25,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980122261] [2024-11-09 05:24:25,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:24:25,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:24:25,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:24:25,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:24:25,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:24:25,663 INFO L87 Difference]: Start difference. First operand 139 states and 168 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:25,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:24:25,744 INFO L93 Difference]: Finished difference Result 134 states and 160 transitions. [2024-11-09 05:24:25,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:24:25,745 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-09 05:24:25,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:24:25,745 INFO L225 Difference]: With dead ends: 134 [2024-11-09 05:24:25,746 INFO L226 Difference]: Without dead ends: 134 [2024-11-09 05:24:25,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:24:25,746 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 51 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:24:25,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 41 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:24:25,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-09 05:24:25,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-11-09 05:24:25,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 115 states have (on average 1.391304347826087) internal successors, (160), 133 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:25,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 160 transitions. [2024-11-09 05:24:25,751 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 160 transitions. Word has length 22 [2024-11-09 05:24:25,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:24:25,752 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 160 transitions. [2024-11-09 05:24:25,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:25,752 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 160 transitions. [2024-11-09 05:24:25,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 05:24:25,753 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:24:25,753 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:24:25,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 05:24:25,753 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 05:24:25,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:24:25,754 INFO L85 PathProgramCache]: Analyzing trace with hash -907092957, now seen corresponding path program 2 times [2024-11-09 05:24:25,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:24:25,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694054028] [2024-11-09 05:24:25,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:24:25,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:24:25,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:24:26,547 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:24:26,547 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:24:26,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694054028] [2024-11-09 05:24:26,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694054028] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:24:26,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240139051] [2024-11-09 05:24:26,548 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 05:24:26,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:24:26,548 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974817c-a19b-4c9e-b20c-7222b090b3e9/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:24:26,550 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974817c-a19b-4c9e-b20c-7222b090b3e9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:24:26,557 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974817c-a19b-4c9e-b20c-7222b090b3e9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 05:24:26,804 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-09 05:24:26,804 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 05:24:26,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-09 05:24:26,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:24:26,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 05:24:26,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 05:24:26,839 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 05:24:26,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 05:24:26,887 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 [2024-11-09 05:24:26,898 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 [2024-11-09 05:24:27,056 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:24:27,057 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 62 treesize of output 57 [2024-11-09 05:24:27,071 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 30 treesize of output 13 [2024-11-09 05:24:27,224 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:24:27,224 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 62 treesize of output 57 [2024-11-09 05:24:27,236 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 30 treesize of output 13 [2024-11-09 05:24:27,417 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:24:27,417 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 62 treesize of output 57 [2024-11-09 05:24:27,425 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 43 treesize of output 24 [2024-11-09 05:24:27,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2024-11-09 05:24:27,543 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 31 treesize of output 13 [2024-11-09 05:24:27,599 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:24:27,600 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:24:28,246 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((|v_ULTIMATE.start_create_data_~counter~0#1_40| Int)) (or (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_626)) (.cse3 (* |v_ULTIMATE.start_create_data_~counter~0#1_40| 4))) (or (forall ((v_ArrVal_627 (Array Int Int)) (v_ArrVal_628 (Array Int Int))) (<= 0 (+ (select (select (store .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_627) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_628) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse3 4))) (< (+ (select (select .cse0 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse3) 0)))) (< (+ |c_ULTIMATE.start_create_data_~counter~0#1| 1) |v_ULTIMATE.start_create_data_~counter~0#1_40|))) (forall ((v_ArrVal_627 (Array Int Int)) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_629 (Array Int Int)) (v_ArrVal_628 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_626)) (.cse6 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4))) (or (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_627))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (< (+ (select (select (store .cse4 .cse5 v_ArrVal_628) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse6 11) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_629) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))))) (< (+ (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse6 4) 0))))))) is different from false [2024-11-09 05:24:28,452 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_625 (Array Int Int)) (v_ArrVal_624 (Array Int Int)) (v_ArrVal_627 (Array Int Int)) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_628 (Array Int Int)) (|v_ULTIMATE.start_create_data_~counter~0#1_40| Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_624))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse4 (* |v_ULTIMATE.start_create_data_~counter~0#1_40| 4)) (.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_625) .cse2 v_ArrVal_626))) (or (< 0 (+ 5 (select (select (store .cse0 (select (select (store .cse1 .cse2 v_ArrVal_627) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) v_ArrVal_628) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) .cse4)) (< (+ .cse4 (select (select .cse0 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)) 0) (< (+ 2 |c_ULTIMATE.start_create_data_~counter~0#1|) |v_ULTIMATE.start_create_data_~counter~0#1_40|)))))) (forall ((v_ArrVal_625 (Array Int Int)) (v_ArrVal_624 (Array Int Int)) (v_ArrVal_627 (Array Int Int)) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_629 (Array Int Int)) (v_ArrVal_628 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_624))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse5 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse6 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_625) .cse10 v_ArrVal_626))) (or (let ((.cse8 (store .cse9 .cse10 v_ArrVal_627))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (< (+ .cse5 (select (select (store .cse6 .cse7 v_ArrVal_628) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) 15) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_629) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))))) (< (+ .cse5 8 (select (select .cse6 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)) 0)))))))) is different from false [2024-11-09 05:24:28,511 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (and (forall ((v_ArrVal_625 (Array Int Int)) (v_ArrVal_624 (Array Int Int)) (v_ArrVal_627 (Array Int Int)) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_629 (Array Int Int)) (v_ArrVal_628 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse7 v_ArrVal_624))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| .cse7 v_ArrVal_625) .cse6 v_ArrVal_626)) (.cse2 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4))) (or (< (+ (select (select .cse0 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 8) 0) (let ((.cse4 (store .cse5 .cse6 v_ArrVal_627))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (< (+ (select (select (store .cse0 .cse3 v_ArrVal_628) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 15) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_629) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))))))) (forall ((v_ArrVal_625 (Array Int Int)) (v_ArrVal_624 (Array Int Int)) (v_ArrVal_627 (Array Int Int)) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_628 (Array Int Int)) (|v_ULTIMATE.start_create_data_~counter~0#1_40| Int)) (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse7 v_ArrVal_624))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (let ((.cse8 (store (store |c_#memory_$Pointer$.offset| .cse7 v_ArrVal_625) .cse10 v_ArrVal_626)) (.cse11 (* |v_ULTIMATE.start_create_data_~counter~0#1_40| 4))) (or (< 0 (+ (select (select (store .cse8 (select (select (store .cse9 .cse10 v_ArrVal_627) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) v_ArrVal_628) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) 5 .cse11)) (< (+ (select (select .cse8 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse11) 0) (< (+ 2 |c_ULTIMATE.start_create_data_~counter~0#1|) |v_ULTIMATE.start_create_data_~counter~0#1_40|))))))))) is different from false [2024-11-09 05:24:28,644 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:24:28,645 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 378 treesize of output 349 [2024-11-09 05:24:28,661 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:24:28,661 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 338 treesize of output 229 [2024-11-09 05:24:28,685 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 5343 treesize of output 4533 [2024-11-09 05:24:28,786 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 3848 treesize of output 3710 [2024-11-09 05:24:28,843 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 415 treesize of output 411 [2024-11-09 05:24:28,857 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 411 treesize of output 407 [2024-11-09 05:24:28,873 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 407 treesize of output 395 [2024-11-09 05:24:28,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 395 treesize of output 387 [2024-11-09 05:24:28,906 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 387 treesize of output 367 [2024-11-09 05:24:28,920 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 367 treesize of output 359 [2024-11-09 05:24:28,933 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 359 treesize of output 347 [2024-11-09 05:24:28,945 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 347 treesize of output 331 [2024-11-09 05:24:28,959 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 331 treesize of output 319 [2024-11-09 05:24:28,971 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 319 treesize of output 291 [2024-11-09 05:24:29,003 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 291 treesize of output 283 [2024-11-09 05:24:29,297 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 18 not checked. [2024-11-09 05:24:29,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240139051] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:24:29,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1509881163] [2024-11-09 05:24:29,300 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2024-11-09 05:24:29,300 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:24:29,300 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:24:29,301 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:24:29,301 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:24:31,227 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:24:34,077 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6045#(and (<= (+ |ULTIMATE.start_create_data_~data~0#1.offset| 8) (select |#length| |ULTIMATE.start_create_data_~data~0#1.base|)) (= (select |#valid| |ULTIMATE.start_create_data_~data~0#1.base|) 1) (exists ((|v_ULTIMATE.start_create_data_~counter~0#1_46| Int)) (and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_append_~pointerToList#1.offset| 0) (or (< (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) 4)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) 4) (* |v_ULTIMATE.start_create_data_~counter~0#1_46| 4) 4)) (< (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) 4) (* |v_ULTIMATE.start_create_data_~counter~0#1_46| 4)) 0)) (= |ULTIMATE.start_create_data_~data~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#list~0#1.base|) (<= |v_ULTIMATE.start_create_data_~counter~0#1_46| 19) (<= 2 |ULTIMATE.start_append_~pointerToList#1.base|) (<= 0 |v_ULTIMATE.start_create_data_~counter~0#1_46|) (= |ULTIMATE.start_append_~node~0#1.offset| 0))) (<= |ULTIMATE.start_create_data_#t~nondet8#1| 2147483647) (<= 0 (+ |ULTIMATE.start_create_data_#t~nondet8#1| 2147483648)))' at error location [2024-11-09 05:24:34,078 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:24:34,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:24:34,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2024-11-09 05:24:34,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244528089] [2024-11-09 05:24:34,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:24:34,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-09 05:24:34,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:24:34,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-09 05:24:34,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1320, Unknown=12, NotChecked=228, Total=1722 [2024-11-09 05:24:34,081 INFO L87 Difference]: Start difference. First operand 134 states and 160 transitions. Second operand has 31 states, 30 states have (on average 2.0) internal successors, (60), 31 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:35,751 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)) (.cse2 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4))) (let ((.cse1 (+ .cse2 |c_ULTIMATE.start_create_data_#t~mem7#1.offset|)) (.cse0 (+ .cse2 .cse5)) (.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (<= 0 .cse0) (or (< .cse1 0) (and (forall ((v_ArrVal_628 (Array Int Int))) (<= 0 (+ .cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_628) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) 4))) (forall ((v_ArrVal_629 (Array Int Int)) (v_ArrVal_628 (Array Int Int))) (<= (+ .cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_628) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_629) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))))) (<= (+ .cse2 |c_ULTIMATE.start_create_data_#t~mem7#1.offset| 4) (select |c_#length| |c_ULTIMATE.start_create_data_#t~mem7#1.base|)) (<= 0 .cse1) (= (select |c_#valid| |c_ULTIMATE.start_create_data_~data~0#1.base|) 1) (or (< .cse0 0) (and (forall ((v_ArrVal_628 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_628) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) .cse2 4))) (forall ((v_ArrVal_629 (Array Int Int)) (v_ArrVal_628 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_628) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) .cse2 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_629) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))))) (<= (+ .cse2 .cse5 4) (select |c_#length| .cse4)))))) is different from false [2024-11-09 05:24:35,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:24:35,935 INFO L93 Difference]: Finished difference Result 149 states and 177 transitions. [2024-11-09 05:24:35,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 05:24:35,936 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.0) internal successors, (60), 31 states have internal predecessors, (60), 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 23 [2024-11-09 05:24:35,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:24:35,937 INFO L225 Difference]: With dead ends: 149 [2024-11-09 05:24:35,937 INFO L226 Difference]: Without dead ends: 149 [2024-11-09 05:24:35,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=299, Invalid=2143, Unknown=24, NotChecked=396, Total=2862 [2024-11-09 05:24:35,939 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 42 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 7 mSolverCounterUnsat, 27 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 27 IncrementalHoareTripleChecker+Unknown, 214 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 05:24:35,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 574 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 552 Invalid, 27 Unknown, 214 Unchecked, 0.9s Time] [2024-11-09 05:24:35,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-09 05:24:35,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2024-11-09 05:24:35,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 127 states have (on average 1.3700787401574803) internal successors, (174), 145 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:35,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 174 transitions. [2024-11-09 05:24:35,944 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 174 transitions. Word has length 23 [2024-11-09 05:24:35,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:24:35,944 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 174 transitions. [2024-11-09 05:24:35,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.0) internal successors, (60), 31 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:35,945 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 174 transitions. [2024-11-09 05:24:35,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 05:24:35,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:24:35,946 INFO L215 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] [2024-11-09 05:24:35,971 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974817c-a19b-4c9e-b20c-7222b090b3e9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 05:24:36,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974817c-a19b-4c9e-b20c-7222b090b3e9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:24:36,146 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 05:24:36,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:24:36,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1561874303, now seen corresponding path program 1 times [2024-11-09 05:24:36,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:24:36,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058825558] [2024-11-09 05:24:36,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:24:36,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:24:36,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:24:36,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:24:36,713 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:24:36,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058825558] [2024-11-09 05:24:36,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058825558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:24:36,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:24:36,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 05:24:36,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002890749] [2024-11-09 05:24:36,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:24:36,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 05:24:36,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:24:36,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 05:24:36,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-09 05:24:36,715 INFO L87 Difference]: Start difference. First operand 146 states and 174 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:37,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:24:37,571 INFO L93 Difference]: Finished difference Result 166 states and 185 transitions. [2024-11-09 05:24:37,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 05:24:37,572 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-09 05:24:37,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:24:37,573 INFO L225 Difference]: With dead ends: 166 [2024-11-09 05:24:37,573 INFO L226 Difference]: Without dead ends: 166 [2024-11-09 05:24:37,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2024-11-09 05:24:37,574 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 126 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 05:24:37,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 292 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 05:24:37,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-09 05:24:37,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 146. [2024-11-09 05:24:37,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 127 states have (on average 1.3543307086614174) internal successors, (172), 145 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:37,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 172 transitions. [2024-11-09 05:24:37,581 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 172 transitions. Word has length 24 [2024-11-09 05:24:37,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:24:37,581 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 172 transitions. [2024-11-09 05:24:37,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:37,582 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 172 transitions. [2024-11-09 05:24:37,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 05:24:37,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:24:37,582 INFO L215 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] [2024-11-09 05:24:37,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-09 05:24:37,583 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 05:24:37,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:24:37,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1561885288, now seen corresponding path program 1 times [2024-11-09 05:24:37,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:24:37,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218121283] [2024-11-09 05:24:37,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:24:37,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:24:37,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:24:37,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:24:37,659 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:24:37,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218121283] [2024-11-09 05:24:37,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218121283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:24:37,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:24:37,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:24:37,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506651731] [2024-11-09 05:24:37,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:24:37,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:24:37,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:24:37,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:24:37,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:24:37,662 INFO L87 Difference]: Start difference. First operand 146 states and 172 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:37,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:24:37,801 INFO L93 Difference]: Finished difference Result 145 states and 170 transitions. [2024-11-09 05:24:37,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 05:24:37,802 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-09 05:24:37,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:24:37,802 INFO L225 Difference]: With dead ends: 145 [2024-11-09 05:24:37,802 INFO L226 Difference]: Without dead ends: 145 [2024-11-09 05:24:37,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:24:37,803 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 6 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:24:37,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 166 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:24:37,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-09 05:24:37,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2024-11-09 05:24:37,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 127 states have (on average 1.3385826771653544) internal successors, (170), 144 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:37,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 170 transitions. [2024-11-09 05:24:37,807 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 170 transitions. Word has length 24 [2024-11-09 05:24:37,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:24:37,808 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 170 transitions. [2024-11-09 05:24:37,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:37,808 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 170 transitions. [2024-11-09 05:24:37,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 05:24:37,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:24:37,810 INFO L215 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] [2024-11-09 05:24:37,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-09 05:24:37,811 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 05:24:37,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:24:37,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1173803524, now seen corresponding path program 1 times [2024-11-09 05:24:37,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:24:37,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445448437] [2024-11-09 05:24:37,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:24:37,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:24:37,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:24:37,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:24:37,940 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:24:37,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445448437] [2024-11-09 05:24:37,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445448437] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:24:37,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:24:37,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:24:37,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273822253] [2024-11-09 05:24:37,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:24:37,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:24:37,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:24:37,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:24:37,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:24:37,943 INFO L87 Difference]: Start difference. First operand 145 states and 170 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:38,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:24:38,121 INFO L93 Difference]: Finished difference Result 143 states and 166 transitions. [2024-11-09 05:24:38,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:24:38,122 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-09 05:24:38,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:24:38,122 INFO L225 Difference]: With dead ends: 143 [2024-11-09 05:24:38,123 INFO L226 Difference]: Without dead ends: 143 [2024-11-09 05:24:38,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:24:38,123 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 46 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:24:38,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 133 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:24:38,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-09 05:24:38,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2024-11-09 05:24:38,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 127 states have (on average 1.3070866141732282) internal successors, (166), 142 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:38,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 166 transitions. [2024-11-09 05:24:38,128 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 166 transitions. Word has length 25 [2024-11-09 05:24:38,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:24:38,129 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 166 transitions. [2024-11-09 05:24:38,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:24:38,129 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 166 transitions. [2024-11-09 05:24:38,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 05:24:38,129 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:24:38,130 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:24:38,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-09 05:24:38,130 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 05:24:38,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:24:38,131 INFO L85 PathProgramCache]: Analyzing trace with hash 2102981751, now seen corresponding path program 1 times [2024-11-09 05:24:38,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:24:38,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168656820] [2024-11-09 05:24:38,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:24:38,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:24:38,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:24:38,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:24:38,597 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:24:38,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168656820] [2024-11-09 05:24:38,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168656820] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:24:38,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115692375] [2024-11-09 05:24:38,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:24:38,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:24:38,598 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974817c-a19b-4c9e-b20c-7222b090b3e9/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:24:38,599 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974817c-a19b-4c9e-b20c-7222b090b3e9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:24:38,600 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974817c-a19b-4c9e-b20c-7222b090b3e9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 05:24:38,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:24:38,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-09 05:24:38,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:24:38,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:24:38,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 05:24:38,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:24:38,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 05:24:38,996 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-09 05:24:38,997 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 15 [2024-11-09 05:24:39,562 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:24:39,563 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 97 treesize of output 69 [2024-11-09 05:24:39,570 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 13 [2024-11-09 05:24:39,865 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_#t~mem22#1.base_13| Int) (|v_ULTIMATE.start_main_~#list~0#1.base_28| Int)) (and (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_#t~mem22#1.base_13| 0) |v_ULTIMATE.start_main_~#list~0#1.base_28| 0)) (not (= |v_ULTIMATE.start_main_#t~mem22#1.base_13| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#list~0#1.base_28| 1) |v_ULTIMATE.start_main_#t~mem22#1.base_13|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#list~0#1.base_28|) 0))) is different from true [2024-11-09 05:24:39,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:24:39,866 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:24:40,074 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 8 treesize of output 4 [2024-11-09 05:24:40,223 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_801 (Array Int Int)) (|ULTIMATE.start_append_~pointerToList#1.offset| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~node~0#1.base| v_ArrVal_801))) (store .cse1 |c_ULTIMATE.start_append_~pointerToList#1.base| (store (select .cse1 |c_ULTIMATE.start_append_~pointerToList#1.base|) |ULTIMATE.start_append_~pointerToList#1.offset| |c_ULTIMATE.start_append_~node~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (or (= .cse0 0) (= (store (store |c_#valid| .cse0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|)))) is different from false [2024-11-09 05:24:40,305 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_801 (Array Int Int)) (|v_ULTIMATE.start_append_~node~0#1.base_20| Int) (|ULTIMATE.start_append_~pointerToList#1.offset| Int) (v_ArrVal_799 Int)) (let ((.cse0 (select (store (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_append_~node~0#1.base_20| v_ArrVal_801) |c_ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_append_~pointerToList#1.offset| |v_ULTIMATE.start_append_~node~0#1.base_20|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~node~0#1.base_20|) 0)) (= .cse0 0) (= (store (store (store |c_#valid| |v_ULTIMATE.start_append_~node~0#1.base_20| v_ArrVal_799) .cse0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|)))) is different from false [2024-11-09 05:24:40,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:24:40,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115692375] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:24:40,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1441060810] [2024-11-09 05:24:40,310 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2024-11-09 05:24:40,310 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:24:40,311 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:24:40,311 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:24:40,311 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:24:41,689 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:25:25,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1441060810] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:25:25,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:25:25,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [6, 9, 10] total 43 [2024-11-09 05:25:25,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316136943] [2024-11-09 05:25:25,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:25:25,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 05:25:25,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:25:25,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 05:25:25,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=1468, Unknown=10, NotChecked=246, Total=1980 [2024-11-09 05:25:25,476 INFO L87 Difference]: Start difference. First operand 143 states and 166 transitions. Second operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:25:29,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:25:34,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:25:37,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:25:39,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:25:41,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:25:43,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:25:46,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:25:48,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:25:53,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:26:02,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:26:02,859 INFO L93 Difference]: Finished difference Result 169 states and 193 transitions. [2024-11-09 05:26:02,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-09 05:26:02,860 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-09 05:26:02,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:26:02,861 INFO L225 Difference]: With dead ends: 169 [2024-11-09 05:26:02,861 INFO L226 Difference]: Without dead ends: 152 [2024-11-09 05:26:02,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 36 SyntacticMatches, 6 SemanticMatches, 46 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 58.3s TimeCoverageRelationStatistics Valid=296, Invalid=1682, Unknown=14, NotChecked=264, Total=2256 [2024-11-09 05:26:02,863 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 7 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 2 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.5s IncrementalHoareTripleChecker+Time [2024-11-09 05:26:02,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 271 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 838 Invalid, 9 Unknown, 0 Unchecked, 23.5s Time] [2024-11-09 05:26:02,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-09 05:26:02,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2024-11-09 05:26:02,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 135 states have (on average 1.2962962962962963) internal successors, (175), 150 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:26:02,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 175 transitions. [2024-11-09 05:26:02,868 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 175 transitions. Word has length 26 [2024-11-09 05:26:02,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:26:02,868 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 175 transitions. [2024-11-09 05:26:02,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:26:02,869 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 175 transitions. [2024-11-09 05:26:02,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 05:26:02,869 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:26:02,869 INFO L215 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] [2024-11-09 05:26:02,895 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974817c-a19b-4c9e-b20c-7222b090b3e9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 05:26:03,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974817c-a19b-4c9e-b20c-7222b090b3e9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-09 05:26:03,071 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 05:26:03,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:26:03,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1878482145, now seen corresponding path program 1 times [2024-11-09 05:26:03,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:26:03,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712907446] [2024-11-09 05:26:03,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:26:03,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:26:03,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:26:03,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:26:03,298 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:26:03,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712907446] [2024-11-09 05:26:03,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712907446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:26:03,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:26:03,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 05:26:03,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598544479] [2024-11-09 05:26:03,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:26:03,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 05:26:03,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:26:03,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 05:26:03,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-09 05:26:03,301 INFO L87 Difference]: Start difference. First operand 151 states and 175 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:26:03,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:26:03,505 INFO L93 Difference]: Finished difference Result 157 states and 179 transitions. [2024-11-09 05:26:03,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:26:03,506 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-09 05:26:03,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:26:03,507 INFO L225 Difference]: With dead ends: 157 [2024-11-09 05:26:03,507 INFO L226 Difference]: Without dead ends: 157 [2024-11-09 05:26:03,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-09 05:26:03,508 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 66 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:26:03,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 82 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:26:03,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-09 05:26:03,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2024-11-09 05:26:03,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 139 states have (on average 1.2877697841726619) internal successors, (179), 154 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:26:03,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 179 transitions. [2024-11-09 05:26:03,514 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 179 transitions. Word has length 27 [2024-11-09 05:26:03,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:26:03,514 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 179 transitions. [2024-11-09 05:26:03,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:26:03,514 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 179 transitions. [2024-11-09 05:26:03,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 05:26:03,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:26:03,515 INFO L215 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] [2024-11-09 05:26:03,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-09 05:26:03,516 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 05:26:03,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:26:03,516 INFO L85 PathProgramCache]: Analyzing trace with hash 365975843, now seen corresponding path program 1 times [2024-11-09 05:26:03,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:26:03,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424319269] [2024-11-09 05:26:03,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:26:03,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:26:03,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:26:03,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:26:03,675 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:26:03,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424319269] [2024-11-09 05:26:03,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424319269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:26:03,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:26:03,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 05:26:03,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359894526] [2024-11-09 05:26:03,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:26:03,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:26:03,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:26:03,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:26:03,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:26:03,677 INFO L87 Difference]: Start difference. First operand 155 states and 179 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:26:03,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:26:03,795 INFO L93 Difference]: Finished difference Result 154 states and 177 transitions. [2024-11-09 05:26:03,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:26:03,795 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-09 05:26:03,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:26:03,796 INFO L225 Difference]: With dead ends: 154 [2024-11-09 05:26:03,796 INFO L226 Difference]: Without dead ends: 154 [2024-11-09 05:26:03,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:26:03,797 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 5 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:26:03,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 68 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:26:03,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-09 05:26:03,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2024-11-09 05:26:03,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 139 states have (on average 1.2733812949640289) internal successors, (177), 153 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:26:03,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 177 transitions. [2024-11-09 05:26:03,802 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 177 transitions. Word has length 29 [2024-11-09 05:26:03,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:26:03,802 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 177 transitions. [2024-11-09 05:26:03,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:26:03,803 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 177 transitions. [2024-11-09 05:26:03,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 05:26:03,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:26:03,803 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:26:03,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-09 05:26:03,804 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 05:26:03,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:26:03,805 INFO L85 PathProgramCache]: Analyzing trace with hash -276683225, now seen corresponding path program 1 times [2024-11-09 05:26:03,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:26:03,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964700176] [2024-11-09 05:26:03,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:26:03,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:26:03,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:26:04,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:26:04,504 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:26:04,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964700176] [2024-11-09 05:26:04,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964700176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:26:04,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:26:04,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-09 05:26:04,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432740362] [2024-11-09 05:26:04,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:26:04,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 05:26:04,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:26:04,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 05:26:04,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-09 05:26:04,506 INFO L87 Difference]: Start difference. First operand 154 states and 177 transitions. Second operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:26:04,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:26:04,979 INFO L93 Difference]: Finished difference Result 168 states and 189 transitions. [2024-11-09 05:26:04,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 05:26:04,979 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-09 05:26:04,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:26:04,980 INFO L225 Difference]: With dead ends: 168 [2024-11-09 05:26:04,980 INFO L226 Difference]: Without dead ends: 162 [2024-11-09 05:26:04,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2024-11-09 05:26:04,981 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 63 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 05:26:04,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 401 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 05:26:04,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-09 05:26:04,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 154. [2024-11-09 05:26:04,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 139 states have (on average 1.2661870503597121) internal successors, (176), 153 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:26:04,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 176 transitions. [2024-11-09 05:26:04,986 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 176 transitions. Word has length 30 [2024-11-09 05:26:04,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:26:04,986 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 176 transitions. [2024-11-09 05:26:04,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:26:04,987 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 176 transitions. [2024-11-09 05:26:04,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 05:26:04,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:26:04,987 INFO L215 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, 1] [2024-11-09 05:26:04,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-09 05:26:04,988 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 05:26:04,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:26:04,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1562179863, now seen corresponding path program 1 times [2024-11-09 05:26:04,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:26:04,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250512544] [2024-11-09 05:26:04,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:26:04,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:26:05,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:26:05,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:26:05,775 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:26:05,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250512544] [2024-11-09 05:26:05,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250512544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:26:05,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:26:05,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 05:26:05,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665241088] [2024-11-09 05:26:05,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:26:05,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 05:26:05,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:26:05,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 05:26:05,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-09 05:26:05,777 INFO L87 Difference]: Start difference. First operand 154 states and 176 transitions. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:26:06,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:26:06,488 INFO L93 Difference]: Finished difference Result 162 states and 182 transitions. [2024-11-09 05:26:06,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 05:26:06,488 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-09 05:26:06,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:26:06,489 INFO L225 Difference]: With dead ends: 162 [2024-11-09 05:26:06,489 INFO L226 Difference]: Without dead ends: 162 [2024-11-09 05:26:06,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2024-11-09 05:26:06,490 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 76 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 05:26:06,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 306 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 05:26:06,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-09 05:26:06,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 156. [2024-11-09 05:26:06,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 141 states have (on average 1.2624113475177305) internal successors, (178), 155 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:26:06,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 178 transitions. [2024-11-09 05:26:06,495 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 178 transitions. Word has length 30 [2024-11-09 05:26:06,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:26:06,495 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 178 transitions. [2024-11-09 05:26:06,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:26:06,495 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 178 transitions. [2024-11-09 05:26:06,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 05:26:06,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:26:06,496 INFO L215 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, 1, 1] [2024-11-09 05:26:06,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-09 05:26:06,496 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 05:26:06,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:26:06,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1182935324, now seen corresponding path program 1 times [2024-11-09 05:26:06,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:26:06,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713723695] [2024-11-09 05:26:06,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:26:06,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:26:06,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:26:06,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:26:06,741 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:26:06,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713723695] [2024-11-09 05:26:06,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713723695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:26:06,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:26:06,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:26:06,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151094107] [2024-11-09 05:26:06,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:26:06,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:26:06,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:26:06,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:26:06,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:26:06,743 INFO L87 Difference]: Start difference. First operand 156 states and 178 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:26:06,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:26:06,947 INFO L93 Difference]: Finished difference Result 164 states and 182 transitions. [2024-11-09 05:26:06,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 05:26:06,947 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-09 05:26:06,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:26:06,948 INFO L225 Difference]: With dead ends: 164 [2024-11-09 05:26:06,948 INFO L226 Difference]: Without dead ends: 164 [2024-11-09 05:26:06,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-09 05:26:06,949 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 108 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:26:06,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 129 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:26:06,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-09 05:26:06,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 153. [2024-11-09 05:26:06,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 138 states have (on average 1.2753623188405796) internal successors, (176), 152 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:26:06,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 176 transitions. [2024-11-09 05:26:06,954 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 176 transitions. Word has length 31 [2024-11-09 05:26:06,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:26:06,955 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 176 transitions. [2024-11-09 05:26:06,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:26:06,955 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 176 transitions. [2024-11-09 05:26:06,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 05:26:06,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:26:06,956 INFO L215 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, 1, 1] [2024-11-09 05:26:06,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-09 05:26:06,956 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 05:26:06,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:26:06,956 INFO L85 PathProgramCache]: Analyzing trace with hash -484527994, now seen corresponding path program 1 times [2024-11-09 05:26:06,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:26:06,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265778382] [2024-11-09 05:26:06,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:26:06,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:26:06,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:26:07,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:26:07,395 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:26:07,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265778382] [2024-11-09 05:26:07,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265778382] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:26:07,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:26:07,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 05:26:07,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384987018] [2024-11-09 05:26:07,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:26:07,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 05:26:07,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:26:07,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 05:26:07,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-09 05:26:07,397 INFO L87 Difference]: Start difference. First operand 153 states and 176 transitions. Second operand has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:26:07,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:26:07,876 INFO L93 Difference]: Finished difference Result 154 states and 174 transitions. [2024-11-09 05:26:07,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 05:26:07,876 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-09 05:26:07,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:26:07,877 INFO L225 Difference]: With dead ends: 154 [2024-11-09 05:26:07,877 INFO L226 Difference]: Without dead ends: 154 [2024-11-09 05:26:07,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2024-11-09 05:26:07,879 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 184 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:26:07,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 121 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 05:26:07,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-09 05:26:07,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 147. [2024-11-09 05:26:07,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 133 states have (on average 1.255639097744361) internal successors, (167), 146 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:26:07,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 167 transitions. [2024-11-09 05:26:07,883 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 167 transitions. Word has length 31 [2024-11-09 05:26:07,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:26:07,884 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 167 transitions. [2024-11-09 05:26:07,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:26:07,884 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 167 transitions. [2024-11-09 05:26:07,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 05:26:07,884 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:26:07,884 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:26:07,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-09 05:26:07,885 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 05:26:07,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:26:07,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1893980872, now seen corresponding path program 1 times [2024-11-09 05:26:07,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:26:07,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232464233] [2024-11-09 05:26:07,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:26:07,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:26:07,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:26:09,306 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:26:09,306 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:26:09,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232464233] [2024-11-09 05:26:09,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232464233] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:26:09,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53667674] [2024-11-09 05:26:09,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:26:09,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:26:09,307 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974817c-a19b-4c9e-b20c-7222b090b3e9/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:26:09,309 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974817c-a19b-4c9e-b20c-7222b090b3e9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:26:09,314 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974817c-a19b-4c9e-b20c-7222b090b3e9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 05:26:09,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:26:09,509 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-09 05:26:09,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:26:09,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 05:26:09,739 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 05:26:09,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 05:26:09,884 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:26:09,885 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2024-11-09 05:26:09,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 22 [2024-11-09 05:26:10,066 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 39 treesize of output 19 [2024-11-09 05:26:10,430 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 17 [2024-11-09 05:26:10,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:26:10,653 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:26:10,664 INFO L349 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2024-11-09 05:26:10,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 46 [2024-11-09 05:26:10,752 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 27 treesize of output 11 [2024-11-09 05:26:10,754 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:26:10,755 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:26:10,906 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 8 treesize of output 4 [2024-11-09 05:26:11,977 INFO L349 Elim1Store]: treesize reduction 364, result has 41.6 percent of original size [2024-11-09 05:26:11,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 3375 treesize of output 1754 [2024-11-09 05:26:12,696 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:26:12,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 4805 treesize of output 4687 [2024-11-09 05:26:25,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-09 05:26:26,958 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:26:26,959 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 [2024-11-09 05:26:38,397 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 31 treesize of output 27 [2024-11-09 05:26:38,486 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 05:26:38,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-09 05:26:39,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-09 05:26:39,928 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 05:26:39,928 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 102 treesize of output 98 [2024-11-09 05:26:40,460 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 05:26:40,505 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 31 treesize of output 27 [2024-11-09 05:26:41,000 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 31 treesize of output 27 [2024-11-09 05:26:41,071 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 05:26:48,759 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:26:48,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1971 treesize of output 1907 [2024-11-09 05:27:13,717 INFO L349 Elim1Store]: treesize reduction 8, result has 89.0 percent of original size [2024-11-09 05:27:13,718 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 5 new quantified variables, introduced 9 case distinctions, treesize of input 1886 treesize of output 1892 [2024-11-09 05:27:31,017 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:27:31,017 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 41 treesize of output 45 [2024-11-09 05:27:34,024 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:27:34,024 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 61 treesize of output 65 [2024-11-09 05:27:34,483 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:27:34,483 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 30 treesize of output 34 [2024-11-09 05:27:38,531 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 56 treesize of output 52 [2024-11-09 05:27:38,600 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:27:38,600 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 22 treesize of output 26 [2024-11-09 05:27:38,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 57 [2024-11-09 05:27:39,575 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-09 05:27:39,576 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 85 treesize of output 76 [2024-11-09 05:27:39,686 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 6 [2024-11-09 05:27:39,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 31 treesize of output 27 [2024-11-09 05:27:39,738 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 [2024-11-09 05:27:39,844 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:27:39,844 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 1 case distinctions, treesize of input 78 treesize of output 74 [2024-11-09 05:27:39,964 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:27:39,965 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 1 case distinctions, treesize of input 74 treesize of output 72 [2024-11-09 05:27:40,180 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:27:40,180 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 71 treesize of output 69 [2024-11-09 05:27:40,293 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 31 treesize of output 25 [2024-11-09 05:27:40,392 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 138 treesize of output 124 [2024-11-09 05:27:40,534 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2024-11-09 05:27:40,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 108 treesize of output 1 [2024-11-09 05:27:40,560 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 155 treesize of output 147 [2024-11-09 05:27:41,108 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:27:41,108 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 250 treesize of output 246 [2024-11-09 05:27:42,076 INFO L349 Elim1Store]: treesize reduction 8, result has 89.0 percent of original size [2024-11-09 05:27:42,077 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 5 new quantified variables, introduced 9 case distinctions, treesize of input 1001 treesize of output 909 [2024-11-09 05:27:46,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:27:46,403 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:27:46,420 INFO L349 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2024-11-09 05:27:46,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 91 treesize of output 82 [2024-11-09 05:27:46,485 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 05:27:46,500 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 05:27:46,550 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 6 [2024-11-09 05:27:46,570 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:27:46,570 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 13 treesize of output 17 [2024-11-09 05:27:46,597 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 05:27:46,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:27:46,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2024-11-09 05:27:46,741 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 05:27:46,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:27:46,755 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2024-11-09 05:27:46,795 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 05:27:46,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:27:46,815 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 05:27:46,920 INFO L349 Elim1Store]: treesize reduction 28, result has 56.9 percent of original size [2024-11-09 05:27:46,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 286 treesize of output 290 [2024-11-09 05:27:47,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:27:47,364 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2024-11-09 05:27:47,385 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:27:47,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 50 [2024-11-09 05:27:51,220 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:27:51,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 16 select indices, 16 select index equivalence classes, 0 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 120 case distinctions, treesize of input 285 treesize of output 1211 [2024-11-09 05:31:24,241 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:31:24,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53667674] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:31:24,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [497006522] [2024-11-09 05:31:24,244 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2024-11-09 05:31:24,244 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:31:24,244 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:31:24,245 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:31:24,245 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:31:29,508 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:32:17,496 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '10071#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_#valid_130| (Array Int Int)) (|v_ULTIMATE.start_main_~#list~0#1.base_30| Int)) (and (<= 2 |v_ULTIMATE.start_main_~#list~0#1.base_30|) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~#list~0#1.base_30|) 0) 0) (<= 4 (select |#length| |v_ULTIMATE.start_main_~#list~0#1.base_30|)) (= (store |v_#valid_130| |v_ULTIMATE.start_main_~#list~0#1.base_30| 0) |#valid|) (or (and (exists ((|v_#memory_int_101| (Array Int (Array Int Int)))) (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#list~0#1.base_30| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#list~0#1.base_30|) 0 (select (select |#memory_int| |v_ULTIMATE.start_main_~#list~0#1.base_30|) 0))) |#memory_int|)) (exists ((|v_ULTIMATE.start_main_#t~mem18#1.base_23| Int) (|v_ULTIMATE.start_main_#t~mem18#1.offset_22| Int) (|v_#valid_129| (Array Int Int)) (|v_#memory_$Pointer$.offset_123| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_133| (Array Int (Array Int Int)))) (and (= (select (select |v_#memory_$Pointer$.offset_123| (select (select |v_#memory_$Pointer$.base_133| |v_ULTIMATE.start_main_~#list~0#1.base_30|) 0)) 0) 0) (<= 0 (+ |v_ULTIMATE.start_main_#t~mem18#1.offset_22| 4)) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_133| |v_ULTIMATE.start_main_~#list~0#1.base_30| (store (select |v_#memory_$Pointer$.base_133| |v_ULTIMATE.start_main_~#list~0#1.base_30|) 0 (select (select |v_#memory_$Pointer$.base_133| |v_ULTIMATE.start_main_#t~mem18#1.base_23|) (+ |v_ULTIMATE.start_main_#t~mem18#1.offset_22| 4))))) (= (select (select |v_#memory_$Pointer$.offset_123| |v_ULTIMATE.start_main_~#list~0#1.base_30|) 0) 0) (= (select |v_#valid_129| |v_ULTIMATE.start_main_#t~mem18#1.base_23|) 1) (= |v_#valid_130| (store |v_#valid_129| (select (select |v_#memory_$Pointer$.base_133| |v_ULTIMATE.start_main_~#list~0#1.base_30|) 0) 0)) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_123| |v_ULTIMATE.start_main_~#list~0#1.base_30| (store (select |v_#memory_$Pointer$.offset_123| |v_ULTIMATE.start_main_~#list~0#1.base_30|) 0 (select (select |v_#memory_$Pointer$.offset_123| |v_ULTIMATE.start_main_#t~mem18#1.base_23|) (+ |v_ULTIMATE.start_main_#t~mem18#1.offset_22| 4))))) (<= (+ |v_ULTIMATE.start_main_#t~mem18#1.offset_22| 8) (select |#length| |v_ULTIMATE.start_main_#t~mem18#1.base_23|)) (= (select (select |v_#memory_$Pointer$.base_133| (select (select |v_#memory_$Pointer$.base_133| |v_ULTIMATE.start_main_~#list~0#1.base_30|) 0)) 0) 0) (<= 4 (select |#length| (select (select |v_#memory_$Pointer$.base_133| |v_ULTIMATE.start_main_~#list~0#1.base_30|) 0))) (= (select |v_#valid_129| (select (select |v_#memory_$Pointer$.base_133| |v_ULTIMATE.start_main_~#list~0#1.base_30|) 0)) 1) (<= (+ (select (select |v_#memory_$Pointer$.base_133| |v_ULTIMATE.start_main_~#list~0#1.base_30|) 0) 1) |#StackHeapBarrier|)))) (and (exists ((|v_ULTIMATE.start_create_data_#t~nondet3#1_22| Int)) (and (<= 0 (+ |v_ULTIMATE.start_create_data_#t~nondet3#1_22| 2147483648)) (not (= |v_ULTIMATE.start_create_data_#t~nondet3#1_22| 0)) (<= |v_ULTIMATE.start_create_data_#t~nondet3#1_22| 2147483647))) (exists ((|v_#memory_int_97| (Array Int (Array Int Int))) (|v_#memory_int_98| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_119| (Array Int (Array Int Int))) (|v_ULTIMATE.start_append_~pointerToList#1.base_23| Int) (|v_#memory_$Pointer$.base_129| (Array Int (Array Int Int)))) (and (<= 4 (select |#length| |v_ULTIMATE.start_append_~pointerToList#1.base_23|)) (= (select |v_#valid_130| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_23|) 0)) 1) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_119| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_23|) 0) (store (select |v_#memory_$Pointer$.offset_119| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_23|) 0)) 0 0)) |v_ULTIMATE.start_append_~pointerToList#1.base_23| (store (select (store |v_#memory_$Pointer$.offset_119| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_23|) 0) (store (select |v_#memory_$Pointer$.offset_119| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_23|) 0)) 0 0)) |v_ULTIMATE.start_append_~pointerToList#1.base_23|) 0 0))) (= |v_#memory_int_98| (store |v_#memory_int_97| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_23|) 0) (store (select |v_#memory_int_97| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_23|) 0)) 0 (select (select |v_#memory_int_98| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_23|) 0)) 0)))) (<= 2 |v_ULTIMATE.start_append_~pointerToList#1.base_23|) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_23|) 0))) (= (select |v_#valid_130| |v_ULTIMATE.start_append_~pointerToList#1.base_23|) 1) (= (store (store |v_#memory_$Pointer$.base_129| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_23|) 0) (store (select |v_#memory_$Pointer$.base_129| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_23|) 0)) 0 0)) |v_ULTIMATE.start_append_~pointerToList#1.base_23| (store (select (store |v_#memory_$Pointer$.base_129| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_23|) 0) (store (select |v_#memory_$Pointer$.base_129| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_23|) 0)) 0 0)) |v_ULTIMATE.start_append_~pointerToList#1.base_23|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_23|) 0))) |#memory_$Pointer$.base|) (= |#memory_int| (store |v_#memory_int_98| |v_ULTIMATE.start_append_~pointerToList#1.base_23| (store (select |v_#memory_int_98| |v_ULTIMATE.start_append_~pointerToList#1.base_23|) 0 (select (select |#memory_int| |v_ULTIMATE.start_append_~pointerToList#1.base_23|) 0)))))))) (= (select |v_#valid_130| |v_ULTIMATE.start_main_~#list~0#1.base_30|) 1) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~#list~0#1.base_30|) 0) 0))) (exists ((|v_ULTIMATE.start_main_old_#valid#1_11| (Array Int Int))) (not (= |v_ULTIMATE.start_main_old_#valid#1_11| |#valid|))) (= |ULTIMATE.start_main_#res#1| 0))' at error location [2024-11-09 05:32:17,496 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:32:17,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:32:17,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 41 [2024-11-09 05:32:17,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421568118] [2024-11-09 05:32:17,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:32:17,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-09 05:32:17,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:32:17,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-09 05:32:17,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=3867, Unknown=33, NotChecked=0, Total=4160 [2024-11-09 05:32:17,498 INFO L87 Difference]: Start difference. First operand 147 states and 167 transitions. Second operand has 42 states, 42 states have (on average 2.2142857142857144) internal successors, (93), 41 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:32:22,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:32:22,523 INFO L93 Difference]: Finished difference Result 212 states and 237 transitions. [2024-11-09 05:32:22,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-09 05:32:22,524 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.2142857142857144) internal successors, (93), 41 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-09 05:32:22,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:32:22,525 INFO L225 Difference]: With dead ends: 212 [2024-11-09 05:32:22,525 INFO L226 Difference]: Without dead ends: 212 [2024-11-09 05:32:22,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2113 ImplicationChecksByTransitivity, 52.3s TimeCoverageRelationStatistics Valid=661, Invalid=6788, Unknown=33, NotChecked=0, Total=7482 [2024-11-09 05:32:22,532 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 481 mSDsluCounter, 1093 mSDsCounter, 0 mSdLazyCounter, 2011 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 2043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-09 05:32:22,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 1136 Invalid, 2043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2011 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-09 05:32:22,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-09 05:32:22,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 155. [2024-11-09 05:32:22,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 141 states have (on average 1.2411347517730495) internal successors, (175), 154 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:32:22,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 175 transitions. [2024-11-09 05:32:22,540 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 175 transitions. Word has length 34 [2024-11-09 05:32:22,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:32:22,541 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 175 transitions. [2024-11-09 05:32:22,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.2142857142857144) internal successors, (93), 41 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:32:22,541 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 175 transitions. [2024-11-09 05:32:22,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 05:32:22,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:32:22,542 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:32:22,564 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974817c-a19b-4c9e-b20c-7222b090b3e9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 05:32:22,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974817c-a19b-4c9e-b20c-7222b090b3e9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-11-09 05:32:22,746 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 05:32:22,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:32:22,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1893980900, now seen corresponding path program 1 times [2024-11-09 05:32:22,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:32:22,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448874702] [2024-11-09 05:32:22,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:32:22,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:32:22,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:32:24,349 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:32:24,349 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:32:24,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448874702] [2024-11-09 05:32:24,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448874702] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:32:24,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046955559] [2024-11-09 05:32:24,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:32:24,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:32:24,350 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974817c-a19b-4c9e-b20c-7222b090b3e9/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:32:24,351 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974817c-a19b-4c9e-b20c-7222b090b3e9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:32:24,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974817c-a19b-4c9e-b20c-7222b090b3e9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 05:32:24,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:32:24,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-09 05:32:24,545 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:32:24,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 05:32:24,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 05:32:24,822 INFO L349 Elim1Store]: treesize reduction 64, result has 29.7 percent of original size [2024-11-09 05:32:24,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 36 [2024-11-09 05:32:25,024 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2024-11-09 05:32:25,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2024-11-09 05:32:25,266 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 52 treesize of output 28 [2024-11-09 05:32:25,579 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 17 [2024-11-09 05:32:25,753 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-11-09 05:32:25,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 25 [2024-11-09 05:32:25,827 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:32:25,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 31 [2024-11-09 05:32:25,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2024-11-09 05:32:25,970 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:32:25,970 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:32:26,205 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 8 treesize of output 4 [2024-11-09 05:32:30,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2024-11-09 05:32:31,817 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:32:31,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046955559] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:32:31,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1715934376] [2024-11-09 05:32:31,820 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2024-11-09 05:32:31,820 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:32:31,820 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:32:31,821 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:32:31,821 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:32:38,976 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:33:29,669 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '10748#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#list~0#1.base|) (exists ((|v_ULTIMATE.start_main_#t~mem18#1.base_30| Int)) (not (= (select |#valid| |v_ULTIMATE.start_main_#t~mem18#1.base_30|) 1))))' at error location [2024-11-09 05:33:29,669 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:33:29,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:33:29,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 44 [2024-11-09 05:33:29,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279481163] [2024-11-09 05:33:29,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:33:29,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-09 05:33:29,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:33:29,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-09 05:33:29,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=3953, Unknown=26, NotChecked=0, Total=4290 [2024-11-09 05:33:29,673 INFO L87 Difference]: Start difference. First operand 155 states and 175 transitions. Second operand has 45 states, 44 states have (on average 2.159090909090909) internal successors, (95), 45 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:33:33,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:33:33,469 INFO L93 Difference]: Finished difference Result 198 states and 221 transitions. [2024-11-09 05:33:33,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 05:33:33,470 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.159090909090909) internal successors, (95), 45 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-09 05:33:33,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:33:33,471 INFO L225 Difference]: With dead ends: 198 [2024-11-09 05:33:33,471 INFO L226 Difference]: Without dead ends: 198 [2024-11-09 05:33:33,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2090 ImplicationChecksByTransitivity, 58.9s TimeCoverageRelationStatistics Valid=660, Invalid=6454, Unknown=26, NotChecked=0, Total=7140 [2024-11-09 05:33:33,474 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 249 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 1615 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 1654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-09 05:33:33,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 965 Invalid, 1654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1615 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-09 05:33:33,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-09 05:33:33,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 157. [2024-11-09 05:33:33,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 143 states have (on average 1.2447552447552448) internal successors, (178), 156 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:33:33,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 178 transitions. [2024-11-09 05:33:33,479 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 178 transitions. Word has length 34 [2024-11-09 05:33:33,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:33:33,479 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 178 transitions. [2024-11-09 05:33:33,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.159090909090909) internal successors, (95), 45 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:33:33,480 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 178 transitions. [2024-11-09 05:33:33,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 05:33:33,480 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:33:33,481 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:33:33,507 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974817c-a19b-4c9e-b20c-7222b090b3e9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 05:33:33,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974817c-a19b-4c9e-b20c-7222b090b3e9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-11-09 05:33:33,681 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 05:33:33,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:33:33,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1893980899, now seen corresponding path program 1 times [2024-11-09 05:33:33,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:33:33,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928247790] [2024-11-09 05:33:33,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:33:33,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:33:33,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:33:35,755 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:33:35,755 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:33:35,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928247790] [2024-11-09 05:33:35,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928247790] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:33:35,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943547195] [2024-11-09 05:33:35,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:33:35,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:33:35,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974817c-a19b-4c9e-b20c-7222b090b3e9/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:33:35,758 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974817c-a19b-4c9e-b20c-7222b090b3e9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:33:35,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974817c-a19b-4c9e-b20c-7222b090b3e9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 05:33:35,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:33:35,954 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 86 conjuncts are in the unsatisfiable core [2024-11-09 05:33:35,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:33:35,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 05:33:36,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 05:33:36,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 05:33:36,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 05:33:36,315 INFO L349 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2024-11-09 05:33:36,315 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 20 treesize of output 22 [2024-11-09 05:33:36,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-09 05:33:36,534 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2024-11-09 05:33:36,552 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2024-11-09 05:33:36,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-09 05:33:36,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2024-11-09 05:33:36,856 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 27 treesize of output 20 [2024-11-09 05:33:36,871 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 60 treesize of output 28 [2024-11-09 05:33:37,508 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:33:37,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 38 [2024-11-09 05:33:37,517 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 26 treesize of output 21 [2024-11-09 05:33:37,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2024-11-09 05:33:37,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 05:33:37,686 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:33:37,686 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:33:38,361 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~pointerToList#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~pointerToList#1.base|) |c_ULTIMATE.start_append_~pointerToList#1.offset| |c_ULTIMATE.start_append_~node~0#1.base|)))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (and (forall ((v_ArrVal_1363 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~pointerToList#1.base| v_ArrVal_1363))) (or (not (= (select (select .cse0 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 0)) (< (+ 7 (select (select .cse0 .cse1) 4)) (select |c_#length| (select (select .cse2 .cse1) 4)))))) (forall ((v_ArrVal_1363 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~pointerToList#1.base| v_ArrVal_1363))) (or (not (= (select (select .cse3 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 0)) (< 0 (+ 5 (select (select .cse3 .cse1) 4))))))))) is different from false [2024-11-09 05:33:39,735 INFO L349 Elim1Store]: treesize reduction 249, result has 34.6 percent of original size [2024-11-09 05:33:39,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 100 treesize of output 187 [2024-11-09 05:33:39,835 INFO L349 Elim1Store]: treesize reduction 11, result has 80.4 percent of original size [2024-11-09 05:33:39,835 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 4 new quantified variables, introduced 5 case distinctions, treesize of input 352 treesize of output 336 [2024-11-09 05:33:39,872 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:33:39,873 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 70 treesize of output 72 [2024-11-09 05:33:40,117 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:33:40,117 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 22 treesize of output 26 [2024-11-09 05:33:40,173 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:33:40,173 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 48 treesize of output 50 [2024-11-09 05:33:40,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 203 treesize of output 199 [2024-11-09 05:33:40,728 INFO L349 Elim1Store]: treesize reduction 493, result has 33.2 percent of original size [2024-11-09 05:33:40,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 16 case distinctions, treesize of input 356 treesize of output 468 [2024-11-09 05:33:40,856 INFO L349 Elim1Store]: treesize reduction 40, result has 50.0 percent of original size [2024-11-09 05:33:40,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 714 treesize of output 699 [2024-11-09 05:33:40,936 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:33:40,937 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 240 treesize of output 240 [2024-11-09 05:33:40,974 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:33:40,974 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 183 treesize of output 179 [2024-11-09 05:33:41,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 6 treesize of output 4 [2024-11-09 05:33:41,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-09 05:33:41,287 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:33:41,288 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 85 treesize of output 103 [2024-11-09 05:33:41,565 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2024-11-09 05:33:41,565 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 33 treesize of output 43 [2024-11-09 05:33:41,913 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:33:41,913 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 17 treesize of output 13 [2024-11-09 05:33:41,993 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2024-11-09 05:33:41,994 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 43 treesize of output 53 [2024-11-09 05:33:42,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:33:42,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 160 treesize of output 166 [2024-11-09 05:33:42,393 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:33:42,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 159 treesize of output 165 [2024-11-09 05:33:42,798 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:33:42,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 208 treesize of output 208 [2024-11-09 05:33:43,751 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-09 05:33:43,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943547195] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:33:43,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1055138144] [2024-11-09 05:33:43,753 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2024-11-09 05:33:43,753 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:33:43,754 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:33:43,754 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:33:43,754 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:33:52,920 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:34:22,238 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '11407#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#list~0#1.base|))' at error location [2024-11-09 05:34:22,238 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:34:22,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:34:22,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 45 [2024-11-09 05:34:22,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144355289] [2024-11-09 05:34:22,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:34:22,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-09 05:34:22,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:34:22,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-09 05:34:22,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=3843, Unknown=36, NotChecked=126, Total=4290 [2024-11-09 05:34:22,241 INFO L87 Difference]: Start difference. First operand 157 states and 178 transitions. Second operand has 46 states, 45 states have (on average 2.2444444444444445) internal successors, (101), 46 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:34:27,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:34:27,483 INFO L93 Difference]: Finished difference Result 204 states and 229 transitions. [2024-11-09 05:34:27,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-09 05:34:27,484 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.2444444444444445) internal successors, (101), 46 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-09 05:34:27,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:34:27,485 INFO L225 Difference]: With dead ends: 204 [2024-11-09 05:34:27,485 INFO L226 Difference]: Without dead ends: 204 [2024-11-09 05:34:27,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 86 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2183 ImplicationChecksByTransitivity, 34.6s TimeCoverageRelationStatistics Valid=693, Invalid=6757, Unknown=36, NotChecked=170, Total=7656 [2024-11-09 05:34:27,487 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 432 mSDsluCounter, 1006 mSDsCounter, 0 mSdLazyCounter, 1812 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 2010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 162 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:34:27,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 1052 Invalid, 2010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1812 Invalid, 0 Unknown, 162 Unchecked, 3.2s Time] [2024-11-09 05:34:27,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-09 05:34:27,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 157. [2024-11-09 05:34:27,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 143 states have (on average 1.2307692307692308) internal successors, (176), 156 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:34:27,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 176 transitions. [2024-11-09 05:34:27,492 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 176 transitions. Word has length 34 [2024-11-09 05:34:27,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:34:27,493 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 176 transitions. [2024-11-09 05:34:27,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.2444444444444445) internal successors, (101), 46 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:34:27,493 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 176 transitions. [2024-11-09 05:34:27,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 05:34:27,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:34:27,494 INFO L215 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, 1, 1, 1, 1, 1] [2024-11-09 05:34:27,516 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974817c-a19b-4c9e-b20c-7222b090b3e9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 05:34:27,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974817c-a19b-4c9e-b20c-7222b090b3e9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-11-09 05:34:27,695 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 05:34:27,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:34:27,695 INFO L85 PathProgramCache]: Analyzing trace with hash 811717924, now seen corresponding path program 1 times [2024-11-09 05:34:27,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:34:27,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804889777] [2024-11-09 05:34:27,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:34:27,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:34:27,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:34:28,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:34:28,828 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:34:28,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804889777] [2024-11-09 05:34:28,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804889777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:34:28,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:34:28,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-09 05:34:28,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874020861] [2024-11-09 05:34:28,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:34:28,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-09 05:34:28,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:34:28,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 05:34:28,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2024-11-09 05:34:28,830 INFO L87 Difference]: Start difference. First operand 157 states and 176 transitions. Second operand has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 20 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:34:29,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:34:29,853 INFO L93 Difference]: Finished difference Result 161 states and 178 transitions. [2024-11-09 05:34:29,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 05:34:29,854 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 20 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-09 05:34:29,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:34:29,855 INFO L225 Difference]: With dead ends: 161 [2024-11-09 05:34:29,855 INFO L226 Difference]: Without dead ends: 161 [2024-11-09 05:34:29,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=162, Invalid=1028, Unknown=0, NotChecked=0, Total=1190 [2024-11-09 05:34:29,856 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 102 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 05:34:29,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 270 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 05:34:29,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-09 05:34:29,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 149. [2024-11-09 05:34:29,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 135 states have (on average 1.237037037037037) internal successors, (167), 148 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:34:29,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 167 transitions. [2024-11-09 05:34:29,860 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 167 transitions. Word has length 34 [2024-11-09 05:34:29,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:34:29,861 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 167 transitions. [2024-11-09 05:34:29,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 20 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:34:29,861 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 167 transitions. [2024-11-09 05:34:29,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 05:34:29,862 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:34:29,862 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:34:29,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-09 05:34:29,862 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 05:34:29,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:34:29,863 INFO L85 PathProgramCache]: Analyzing trace with hash -2012467816, now seen corresponding path program 1 times [2024-11-09 05:34:29,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:34:29,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681815239] [2024-11-09 05:34:29,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:34:29,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:34:29,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:34:31,509 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:34:31,510 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:34:31,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681815239] [2024-11-09 05:34:31,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681815239] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:34:31,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735039337] [2024-11-09 05:34:31,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:34:31,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:34:31,510 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974817c-a19b-4c9e-b20c-7222b090b3e9/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:34:31,512 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974817c-a19b-4c9e-b20c-7222b090b3e9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:34:31,513 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974817c-a19b-4c9e-b20c-7222b090b3e9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 05:34:31,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:34:31,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-11-09 05:34:31,706 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:34:31,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 05:34:31,764 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 05:34:31,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-09 05:34:31,975 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-09 05:34:31,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-09 05:34:32,094 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 05:34:32,108 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 05:34:32,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 05:34:32,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 05:34:32,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-09 05:34:32,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-09 05:34:32,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:34:32,647 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:34:32,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 44 [2024-11-09 05:34:32,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2024-11-09 05:34:33,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:34:33,885 INFO L349 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2024-11-09 05:34:33,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 51 [2024-11-09 05:34:33,893 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:34:33,894 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:34:33,937 INFO L349 Elim1Store]: treesize reduction 64, result has 27.3 percent of original size [2024-11-09 05:34:33,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 85 treesize of output 60 [2024-11-09 05:34:33,994 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:34:33,994 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:34:33,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735039337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:34:33,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 05:34:33,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [16] total 32 [2024-11-09 05:34:33,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733016745] [2024-11-09 05:34:33,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:34:33,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 05:34:33,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:34:33,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 05:34:33,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=979, Unknown=0, NotChecked=0, Total=1056 [2024-11-09 05:34:33,997 INFO L87 Difference]: Start difference. First operand 149 states and 167 transitions. Second operand has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:34:35,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:34:35,927 INFO L93 Difference]: Finished difference Result 209 states and 230 transitions. [2024-11-09 05:34:35,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 05:34:35,927 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-09 05:34:35,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:34:35,928 INFO L225 Difference]: With dead ends: 209 [2024-11-09 05:34:35,928 INFO L226 Difference]: Without dead ends: 203 [2024-11-09 05:34:35,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=163, Invalid=1907, Unknown=0, NotChecked=0, Total=2070 [2024-11-09 05:34:35,929 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 107 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 05:34:35,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 531 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 05:34:35,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-09 05:34:35,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 152. [2024-11-09 05:34:35,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 138 states have (on average 1.2318840579710144) internal successors, (170), 151 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:34:35,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 170 transitions. [2024-11-09 05:34:35,933 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 170 transitions. Word has length 35 [2024-11-09 05:34:35,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:34:35,934 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 170 transitions. [2024-11-09 05:34:35,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:34:35,934 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 170 transitions. [2024-11-09 05:34:35,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 05:34:35,935 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:34:35,935 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:34:35,962 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974817c-a19b-4c9e-b20c-7222b090b3e9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 05:34:36,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974817c-a19b-4c9e-b20c-7222b090b3e9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-11-09 05:34:36,136 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 05:34:36,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:34:36,136 INFO L85 PathProgramCache]: Analyzing trace with hash -335393195, now seen corresponding path program 3 times [2024-11-09 05:34:36,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:34:36,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330482009] [2024-11-09 05:34:36,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:34:36,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:34:36,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:34:37,505 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:34:37,506 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:34:37,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330482009] [2024-11-09 05:34:37,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330482009] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:34:37,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210083843] [2024-11-09 05:34:37,506 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 05:34:37,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:34:37,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974817c-a19b-4c9e-b20c-7222b090b3e9/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:34:37,513 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974817c-a19b-4c9e-b20c-7222b090b3e9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:34:37,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c974817c-a19b-4c9e-b20c-7222b090b3e9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 05:34:37,820 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 05:34:37,820 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 05:34:37,823 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-09 05:34:37,828 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:34:37,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 05:34:37,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 05:34:37,858 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 05:34:37,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 05:34:37,918 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 [2024-11-09 05:34:37,928 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 [2024-11-09 05:34:38,083 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:34:38,083 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 62 treesize of output 57 [2024-11-09 05:34:38,088 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 30 treesize of output 13 [2024-11-09 05:34:38,251 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:34:38,252 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 62 treesize of output 57 [2024-11-09 05:34:38,257 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 30 treesize of output 13 [2024-11-09 05:34:38,424 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:34:38,424 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 62 treesize of output 57 [2024-11-09 05:34:38,429 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 30 treesize of output 13 [2024-11-09 05:34:38,598 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:34:38,598 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 62 treesize of output 57 [2024-11-09 05:34:38,608 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 30 treesize of output 13 [2024-11-09 05:34:38,789 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:34:38,790 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 62 treesize of output 57 [2024-11-09 05:34:38,795 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 43 treesize of output 24 [2024-11-09 05:34:39,045 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:34:39,046 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 62 treesize of output 57 [2024-11-09 05:34:39,056 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 43 treesize of output 24 [2024-11-09 05:34:39,165 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 31 treesize of output 13 [2024-11-09 05:34:39,172 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 32 treesize of output 14 [2024-11-09 05:34:39,235 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:34:39,235 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:34:40,171 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_create_data_~counter~0#1_70| Int)) (or (forall ((v_ArrVal_1633 (Array Int Int))) (let ((.cse0 (* |v_ULTIMATE.start_create_data_~counter~0#1_70| 4)) (.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1633))) (or (forall ((v_ArrVal_1635 (Array Int Int)) (v_ArrVal_1634 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1634))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse1 (store .cse5 .cse4 v_ArrVal_1635))) (or (< (+ .cse0 (select (select .cse1 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 4) 0) (forall ((v_ArrVal_1637 (Array Int Int)) (v_ArrVal_1636 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store .cse1 (select (select (store .cse3 .cse4 v_ArrVal_1636) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_1637) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 8)))))))) (< (+ .cse0 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) 0)))) (< (+ |c_ULTIMATE.start_create_data_~counter~0#1| 1) |v_ULTIMATE.start_create_data_~counter~0#1_70|))) (forall ((v_ArrVal_1637 (Array Int Int)) (v_ArrVal_1636 (Array Int Int)) (v_ArrVal_1635 (Array Int Int)) (v_ArrVal_1634 (Array Int Int)) (v_ArrVal_1633 (Array Int Int)) (v_ArrVal_1638 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1634))) (let ((.cse12 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1633)) (.cse11 (select (select .cse10 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse7 (store .cse12 .cse11 v_ArrVal_1635)) (.cse6 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4))) (or (let ((.cse9 (store .cse10 .cse11 v_ArrVal_1636))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (< (+ .cse6 (select (select (store .cse7 .cse8 v_ArrVal_1637) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 15) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_1638) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))))) (< (+ .cse6 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 8) 0) (< (+ .cse6 4 (select (select .cse12 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) 0)))))))) is different from false [2024-11-09 05:34:40,818 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_1637 (Array Int Int)) (v_ArrVal_1636 (Array Int Int)) (v_ArrVal_1635 (Array Int Int)) (v_ArrVal_1634 (Array Int Int)) (v_ArrVal_1633 (Array Int Int)) (v_ArrVal_1632 (Array Int Int)) (v_ArrVal_1631 (Array Int Int)) (v_ArrVal_1638 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1632))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse6 (store .cse9 .cse8 v_ArrVal_1634))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1631) .cse8 v_ArrVal_1633)) (.cse7 (select (select .cse6 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (store .cse3 .cse7 v_ArrVal_1635))) (or (< (+ .cse0 (select (select .cse1 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 12) 0) (< (+ .cse0 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 8) 0) (let ((.cse5 (store .cse6 .cse7 v_ArrVal_1636))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (< (+ 19 .cse0 (select (select (store .cse1 .cse4 v_ArrVal_1637) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1638) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))))))))) (forall ((v_ArrVal_1637 (Array Int Int)) (v_ArrVal_1636 (Array Int Int)) (v_ArrVal_1635 (Array Int Int)) (v_ArrVal_1634 (Array Int Int)) (v_ArrVal_1633 (Array Int Int)) (v_ArrVal_1632 (Array Int Int)) (v_ArrVal_1631 (Array Int Int)) (|v_ULTIMATE.start_create_data_~counter~0#1_70| Int)) (let ((.cse16 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1632))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse12 (store .cse16 .cse15 v_ArrVal_1634))) (let ((.cse14 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1631) .cse15 v_ArrVal_1633)) (.cse13 (select (select .cse12 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse10 (* |v_ULTIMATE.start_create_data_~counter~0#1_70| 4)) (.cse11 (store .cse14 .cse13 v_ArrVal_1635))) (or (< (+ 2 |c_ULTIMATE.start_create_data_~counter~0#1|) |v_ULTIMATE.start_create_data_~counter~0#1_70|) (< 0 (+ .cse10 9 (select (select (store .cse11 (select (select (store .cse12 .cse13 v_ArrVal_1636) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_1637) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (< (+ .cse10 (select (select .cse14 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) 0) (< (+ .cse10 (select (select .cse11 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 4) 0)))))))))) is different from false [2024-11-09 05:34:40,893 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1637 (Array Int Int)) (v_ArrVal_1636 (Array Int Int)) (v_ArrVal_1635 (Array Int Int)) (v_ArrVal_1634 (Array Int Int)) (v_ArrVal_1633 (Array Int Int)) (v_ArrVal_1632 (Array Int Int)) (v_ArrVal_1631 (Array Int Int)) (|v_ULTIMATE.start_create_data_~counter~0#1_70| Int)) (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_1632))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (let ((.cse3 (store .cse8 .cse7 v_ArrVal_1634))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_1631) .cse7 v_ArrVal_1633)) (.cse4 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (let ((.cse0 (store .cse5 .cse4 v_ArrVal_1635)) (.cse2 (* |v_ULTIMATE.start_create_data_~counter~0#1_70| 4))) (or (< (+ 2 |c_ULTIMATE.start_create_data_~counter~0#1|) |v_ULTIMATE.start_create_data_~counter~0#1_70|) (< (+ (select (select .cse0 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 4) 0) (< 0 (+ (select (select (store .cse0 (select (select (store .cse3 .cse4 v_ArrVal_1636) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) v_ArrVal_1637) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 9)) (< (+ (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2) 0)))))))) (forall ((v_ArrVal_1637 (Array Int Int)) (v_ArrVal_1636 (Array Int Int)) (v_ArrVal_1635 (Array Int Int)) (v_ArrVal_1634 (Array Int Int)) (v_ArrVal_1633 (Array Int Int)) (v_ArrVal_1632 (Array Int Int)) (v_ArrVal_1631 (Array Int Int)) (v_ArrVal_1638 (Array Int Int))) (let ((.cse17 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_1632))) (let ((.cse16 (select (select .cse17 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (let ((.cse13 (store .cse17 .cse16 v_ArrVal_1634))) (let ((.cse15 (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_1631) .cse16 v_ArrVal_1633)) (.cse14 (select (select .cse13 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (let ((.cse9 (store .cse15 .cse14 v_ArrVal_1635)) (.cse11 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4))) (or (let ((.cse12 (store .cse13 .cse14 v_ArrVal_1636))) (let ((.cse10 (select (select .cse12 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (< (+ 19 (select (select (store .cse9 .cse10 v_ArrVal_1637) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse11) (select |c_#length| (select (select (store .cse12 .cse10 v_ArrVal_1638) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))))) (< (+ (select (select .cse9 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse11 12) 0) (< (+ (select (select .cse15 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse11 8) 0))))))))))) is different from false [2024-11-09 05:34:41,177 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_1637 (Array Int Int)) (v_ArrVal_1636 (Array Int Int)) (v_ArrVal_1635 (Array Int Int)) (v_ArrVal_1634 (Array Int Int)) (v_ArrVal_1633 (Array Int Int)) (v_ArrVal_1632 (Array Int Int)) (v_ArrVal_1631 (Array Int Int)) (v_ArrVal_1630 (Array Int Int)) (|v_ULTIMATE.start_create_data_~counter~0#1_70| Int) (v_ArrVal_1629 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1630))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_1632))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (let ((.cse2 (store .cse8 .cse7 v_ArrVal_1634))) (let ((.cse5 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1629) .cse6 v_ArrVal_1631) .cse7 v_ArrVal_1633)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (let ((.cse1 (store .cse5 .cse3 v_ArrVal_1635)) (.cse0 (* |v_ULTIMATE.start_create_data_~counter~0#1_70| 4))) (or (< 0 (+ .cse0 9 (select (select (store .cse1 (select (select (store .cse2 .cse3 v_ArrVal_1636) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) v_ArrVal_1637) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (< (+ .cse0 (select (select .cse1 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) 4) 0) (< (+ 3 |c_ULTIMATE.start_create_data_~counter~0#1|) |v_ULTIMATE.start_create_data_~counter~0#1_70|) (< (+ (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) .cse0) 0)))))))))) (forall ((v_ArrVal_1637 (Array Int Int)) (v_ArrVal_1636 (Array Int Int)) (v_ArrVal_1635 (Array Int Int)) (v_ArrVal_1634 (Array Int Int)) (v_ArrVal_1633 (Array Int Int)) (v_ArrVal_1632 (Array Int Int)) (v_ArrVal_1631 (Array Int Int)) (v_ArrVal_1630 (Array Int Int)) (v_ArrVal_1629 (Array Int Int)) (v_ArrVal_1638 (Array Int Int))) (let ((.cse20 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1630))) (let ((.cse17 (select (select .cse20 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (let ((.cse19 (store .cse20 .cse17 v_ArrVal_1632))) (let ((.cse18 (select (select .cse19 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (let ((.cse15 (store .cse19 .cse18 v_ArrVal_1634))) (let ((.cse10 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1629) .cse17 v_ArrVal_1631) .cse18 v_ArrVal_1633)) (.cse16 (select (select .cse15 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (let ((.cse11 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse12 (store .cse10 .cse16 v_ArrVal_1635))) (or (< (+ (select (select .cse10 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) .cse11 12) 0) (let ((.cse14 (store .cse15 .cse16 v_ArrVal_1636))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (< (+ 23 .cse11 (select (select (store .cse12 .cse13 v_ArrVal_1637) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse14 .cse13 v_ArrVal_1638) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))))) (< (+ .cse11 16 (select (select .cse12 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)) 0)))))))))))) is different from false [2024-11-09 05:34:41,306 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1637 (Array Int Int)) (v_ArrVal_1636 (Array Int Int)) (v_ArrVal_1635 (Array Int Int)) (v_ArrVal_1634 (Array Int Int)) (v_ArrVal_1633 (Array Int Int)) (v_ArrVal_1632 (Array Int Int)) (v_ArrVal_1631 (Array Int Int)) (v_ArrVal_1630 (Array Int Int)) (v_ArrVal_1629 (Array Int Int)) (v_ArrVal_1638 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_1630))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_1632))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse5 (store .cse11 .cse10 v_ArrVal_1634))) (let ((.cse7 (store (store (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_1629) .cse9 v_ArrVal_1631) .cse10 v_ArrVal_1633)) (.cse6 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse1 (store .cse7 .cse6 v_ArrVal_1635)) (.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4))) (or (< (+ .cse0 16 (select (select .cse1 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) 0) (let ((.cse4 (store .cse5 .cse6 v_ArrVal_1636))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (< (+ 23 .cse0 (select (select (store .cse1 .cse3 v_ArrVal_1637) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_1638) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))))) (< (+ (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse0 12) 0)))))))))) (forall ((v_ArrVal_1637 (Array Int Int)) (v_ArrVal_1636 (Array Int Int)) (v_ArrVal_1635 (Array Int Int)) (v_ArrVal_1634 (Array Int Int)) (v_ArrVal_1633 (Array Int Int)) (v_ArrVal_1632 (Array Int Int)) (v_ArrVal_1631 (Array Int Int)) (v_ArrVal_1630 (Array Int Int)) (|v_ULTIMATE.start_create_data_~counter~0#1_70| Int) (v_ArrVal_1629 (Array Int Int))) (let ((.cse21 (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_1630))) (let ((.cse18 (select (select .cse21 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse20 (store .cse21 .cse18 v_ArrVal_1632))) (let ((.cse19 (select (select .cse20 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse15 (store .cse20 .cse19 v_ArrVal_1634))) (let ((.cse17 (store (store (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_1629) .cse18 v_ArrVal_1631) .cse19 v_ArrVal_1633)) (.cse16 (select (select .cse15 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse13 (* |v_ULTIMATE.start_create_data_~counter~0#1_70| 4)) (.cse14 (store .cse17 .cse16 v_ArrVal_1635))) (or (< (+ 3 |c_ULTIMATE.start_create_data_~counter~0#1|) |v_ULTIMATE.start_create_data_~counter~0#1_70|) (< 0 (+ .cse13 9 (select (select (store .cse14 (select (select (store .cse15 .cse16 v_ArrVal_1636) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_1637) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (< (+ .cse13 (select (select .cse17 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) 0) (< (+ .cse13 (select (select .cse14 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 4) 0))))))))))))) is different from false [2024-11-09 05:34:41,738 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_1637 (Array Int Int)) (v_ArrVal_1636 (Array Int Int)) (v_ArrVal_1635 (Array Int Int)) (v_ArrVal_1634 (Array Int Int)) (v_ArrVal_1633 (Array Int Int)) (v_ArrVal_1632 (Array Int Int)) (v_ArrVal_1631 (Array Int Int)) (v_ArrVal_1630 (Array Int Int)) (v_ArrVal_1629 (Array Int Int)) (v_ArrVal_1628 (Array Int Int)) (v_ArrVal_1627 (Array Int Int)) (v_ArrVal_1638 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1628))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_1630))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_1632))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse6 (store .cse11 .cse10 v_ArrVal_1634))) (let ((.cse3 (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1627) .cse8 v_ArrVal_1629) .cse9 v_ArrVal_1631) .cse10 v_ArrVal_1633)) (.cse7 (select (select .cse6 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (store .cse3 .cse7 v_ArrVal_1635))) (or (< (+ .cse0 20 (select (select .cse1 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) 0) (< (+ .cse0 16 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) 0) (let ((.cse5 (store .cse6 .cse7 v_ArrVal_1636))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (< (+ .cse0 (select (select (store .cse1 .cse4 v_ArrVal_1637) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 27) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1638) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))))))))))))) (forall ((v_ArrVal_1637 (Array Int Int)) (v_ArrVal_1636 (Array Int Int)) (v_ArrVal_1635 (Array Int Int)) (v_ArrVal_1634 (Array Int Int)) (v_ArrVal_1633 (Array Int Int)) (v_ArrVal_1632 (Array Int Int)) (v_ArrVal_1631 (Array Int Int)) (v_ArrVal_1630 (Array Int Int)) (|v_ULTIMATE.start_create_data_~counter~0#1_70| Int) (v_ArrVal_1629 (Array Int Int)) (v_ArrVal_1628 (Array Int Int)) (v_ArrVal_1627 (Array Int Int))) (let ((.cse24 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1628))) (let ((.cse19 (select (select .cse24 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse23 (store .cse24 .cse19 v_ArrVal_1630))) (let ((.cse20 (select (select .cse23 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse22 (store .cse23 .cse20 v_ArrVal_1632))) (let ((.cse21 (select (select .cse22 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse16 (store .cse22 .cse21 v_ArrVal_1634))) (let ((.cse18 (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1627) .cse19 v_ArrVal_1629) .cse20 v_ArrVal_1631) .cse21 v_ArrVal_1633)) (.cse17 (select (select .cse16 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse14 (* |v_ULTIMATE.start_create_data_~counter~0#1_70| 4)) (.cse15 (store .cse18 .cse17 v_ArrVal_1635))) (or (< 0 (+ .cse14 9 (select (select (store .cse15 (select (select (store .cse16 .cse17 v_ArrVal_1636) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_1637) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (< (+ |c_ULTIMATE.start_create_data_~counter~0#1| 4) |v_ULTIMATE.start_create_data_~counter~0#1_70|) (< (+ .cse14 (select (select .cse18 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) 0) (< (+ .cse14 (select (select .cse15 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 4) 0)))))))))))))) is different from false [2024-11-09 05:34:43,829 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1637 (Array Int Int)) (v_ArrVal_1636 (Array Int Int)) (v_ArrVal_1635 (Array Int Int)) (v_ArrVal_1634 (Array Int Int)) (v_ArrVal_1633 (Array Int Int)) (v_ArrVal_1632 (Array Int Int)) (v_ArrVal_1631 (Array Int Int)) (v_ArrVal_1630 (Array Int Int)) (v_ArrVal_1629 (Array Int Int)) (v_ArrVal_1628 (Array Int Int)) (v_ArrVal_1627 (Array Int Int)) (v_ArrVal_1638 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_1628))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_1630))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_1632))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse6 (store .cse12 .cse11 v_ArrVal_1634))) (let ((.cse3 (store (store (store (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_1627) .cse9 v_ArrVal_1629) .cse10 v_ArrVal_1631) .cse11 v_ArrVal_1633)) (.cse7 (select (select .cse6 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (store .cse3 .cse7 v_ArrVal_1635))) (or (< (+ .cse0 (select (select .cse1 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 20) 0) (< (+ .cse0 16 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) 0) (let ((.cse5 (store .cse6 .cse7 v_ArrVal_1636))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (< (+ .cse0 (select (select (store .cse1 .cse4 v_ArrVal_1637) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 27) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1638) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))))))))))))) (forall ((v_ArrVal_1637 (Array Int Int)) (v_ArrVal_1636 (Array Int Int)) (v_ArrVal_1635 (Array Int Int)) (v_ArrVal_1634 (Array Int Int)) (v_ArrVal_1633 (Array Int Int)) (v_ArrVal_1632 (Array Int Int)) (v_ArrVal_1631 (Array Int Int)) (v_ArrVal_1630 (Array Int Int)) (|v_ULTIMATE.start_create_data_~counter~0#1_70| Int) (v_ArrVal_1629 (Array Int Int)) (v_ArrVal_1628 (Array Int Int)) (v_ArrVal_1627 (Array Int Int))) (let ((.cse25 (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_1628))) (let ((.cse20 (select (select .cse25 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse24 (store .cse25 .cse20 v_ArrVal_1630))) (let ((.cse21 (select (select .cse24 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse23 (store .cse24 .cse21 v_ArrVal_1632))) (let ((.cse22 (select (select .cse23 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse18 (store .cse23 .cse22 v_ArrVal_1634))) (let ((.cse16 (store (store (store (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_1627) .cse20 v_ArrVal_1629) .cse21 v_ArrVal_1631) .cse22 v_ArrVal_1633)) (.cse19 (select (select .cse18 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse15 (* |v_ULTIMATE.start_create_data_~counter~0#1_70| 4)) (.cse17 (store .cse16 .cse19 v_ArrVal_1635))) (or (< (+ .cse15 (select (select .cse16 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) 0) (< (+ |c_ULTIMATE.start_create_data_~counter~0#1| 4) |v_ULTIMATE.start_create_data_~counter~0#1_70|) (< (+ .cse15 (select (select .cse17 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 4) 0) (< 0 (+ .cse15 9 (select (select (store .cse17 (select (select (store .cse18 .cse19 v_ArrVal_1636) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_1637) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))))))))))))))))) is different from false [2024-11-09 05:34:44,024 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:34:44,025 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 3204 treesize of output 3155 [2024-11-09 05:34:44,039 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:34:44,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 3144 treesize of output 1775