./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/bin/utaipan-verify-sOmjnqqW8E --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 2fe3fcfd23f0db0414af322b91d2d32e3943484ebce4a900c0ef2633a5499508 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 23:31:38,370 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 23:31:38,465 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-13 23:31:38,471 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 23:31:38,471 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 23:31:38,504 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 23:31:38,505 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 23:31:38,505 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 23:31:38,505 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 23:31:38,506 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 23:31:38,506 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-13 23:31:38,506 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-13 23:31:38,506 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-13 23:31:38,506 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-13 23:31:38,506 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-13 23:31:38,507 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-13 23:31:38,507 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-13 23:31:38,507 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-13 23:31:38,507 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-13 23:31:38,507 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-13 23:31:38,507 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-13 23:31:38,508 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-13 23:31:38,508 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 23:31:38,508 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 23:31:38,508 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 23:31:38,509 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 23:31:38,509 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 23:31:38,509 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 23:31:38,509 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 23:31:38,509 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 23:31:38,509 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 23:31:38,509 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 23:31:38,510 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 23:31:38,510 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 23:31:38,510 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 23:31:38,510 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 23:31:38,510 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 23:31:38,510 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 23:31:38,510 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 23:31:38,510 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 23:31:38,510 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 23:31:38,510 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 23:31:38,511 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 23:31:38,511 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 23:31:38,511 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-13 23:31:38,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 23:31:38,511 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 23:31:38,512 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-13 23:31:38,512 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 23:31:38,512 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/bin/utaipan-verify-sOmjnqqW8E 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 -> 2fe3fcfd23f0db0414af322b91d2d32e3943484ebce4a900c0ef2633a5499508 [2024-11-13 23:31:38,826 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 23:31:38,835 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 23:31:38,837 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 23:31:38,839 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 23:31:38,839 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 23:31:38,841 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i Unable to find full path for "g++" [2024-11-13 23:31:40,845 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 23:31:41,211 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 23:31:41,212 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i [2024-11-13 23:31:41,226 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/bin/utaipan-verify-sOmjnqqW8E/data/a23296acb/715fd1921b3d4b21aee0bef0c414b6d1/FLAGf7f8e98d2 [2024-11-13 23:31:41,246 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/bin/utaipan-verify-sOmjnqqW8E/data/a23296acb/715fd1921b3d4b21aee0bef0c414b6d1 [2024-11-13 23:31:41,249 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 23:31:41,251 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 23:31:41,252 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 23:31:41,252 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 23:31:41,257 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 23:31:41,258 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 11:31:41" (1/1) ... [2024-11-13 23:31:41,259 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3978e517 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:31:41, skipping insertion in model container [2024-11-13 23:31:41,259 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 11:31:41" (1/1) ... [2024-11-13 23:31:41,298 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 23:31:41,644 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-13 23:31:41,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 23:31:41,670 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 23:31:41,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 23:31:41,742 INFO L204 MainTranslator]: Completed translation [2024-11-13 23:31:41,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:31:41 WrapperNode [2024-11-13 23:31:41,743 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 23:31:41,744 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 23:31:41,744 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 23:31:41,744 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 23:31:41,751 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:31:41" (1/1) ... [2024-11-13 23:31:41,762 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:31:41" (1/1) ... [2024-11-13 23:31:41,788 INFO L138 Inliner]: procedures = 126, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 117 [2024-11-13 23:31:41,790 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 23:31:41,791 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 23:31:41,791 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 23:31:41,791 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 23:31:41,799 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:31:41" (1/1) ... [2024-11-13 23:31:41,799 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:31:41" (1/1) ... [2024-11-13 23:31:41,802 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:31:41" (1/1) ... [2024-11-13 23:31:41,805 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:31:41" (1/1) ... [2024-11-13 23:31:41,815 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:31:41" (1/1) ... [2024-11-13 23:31:41,818 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:31:41" (1/1) ... [2024-11-13 23:31:41,819 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:31:41" (1/1) ... [2024-11-13 23:31:41,821 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:31:41" (1/1) ... [2024-11-13 23:31:41,823 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 23:31:41,824 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 23:31:41,824 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 23:31:41,824 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 23:31:41,826 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:31:41" (1/1) ... [2024-11-13 23:31:41,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 23:31:41,851 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:31:41,864 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-13 23:31:41,868 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-13 23:31:41,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-13 23:31:41,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 23:31:41,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 23:31:41,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 23:31:41,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-13 23:31:41,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-13 23:31:41,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 23:31:41,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-13 23:31:41,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 23:31:41,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 23:31:41,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 23:31:41,998 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 23:31:42,000 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 23:31:42,433 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2024-11-13 23:31:42,433 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 23:31:42,508 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 23:31:42,508 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-13 23:31:42,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:31:42 BoogieIcfgContainer [2024-11-13 23:31:42,510 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 23:31:42,513 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 23:31:42,513 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 23:31:42,519 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 23:31:42,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 11:31:41" (1/3) ... [2024-11-13 23:31:42,520 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@963895a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 11:31:42, skipping insertion in model container [2024-11-13 23:31:42,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:31:41" (2/3) ... [2024-11-13 23:31:42,521 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@963895a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 11:31:42, skipping insertion in model container [2024-11-13 23:31:42,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:31:42" (3/3) ... [2024-11-13 23:31:42,523 INFO L112 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04-2.i [2024-11-13 23:31:42,540 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 23:31:42,542 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG optional_data_creation_test04-2.i that has 1 procedures, 88 locations, 1 initial locations, 3 loop locations, and 46 error locations. [2024-11-13 23:31:42,597 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 23:31:42,614 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;@2676a75, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 23:31:42,614 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2024-11-13 23:31:42,619 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 41 states have (on average 2.341463414634146) internal successors, (96), 87 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:31:42,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-13 23:31:42,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:31:42,627 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-13 23:31:42,628 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-13 23:31:42,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:31:42,634 INFO L85 PathProgramCache]: Analyzing trace with hash 180862, now seen corresponding path program 1 times [2024-11-13 23:31:42,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:31:42,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742183253] [2024-11-13 23:31:42,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:31:42,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:31:42,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:31:42,988 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-13 23:31:42,989 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:31:42,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742183253] [2024-11-13 23:31:42,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742183253] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:31:42,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:31:42,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 23:31:42,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58201935] [2024-11-13 23:31:42,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:31:43,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 23:31:43,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:31:43,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 23:31:43,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 23:31:43,042 INFO L87 Difference]: Start difference. First operand has 88 states, 41 states have (on average 2.341463414634146) internal successors, (96), 87 states have internal predecessors, (96), 0 states have call successors, (0), 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-13 23:31:43,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:31:43,246 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2024-11-13 23:31:43,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 23:31:43,249 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-13 23:31:43,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:31:43,257 INFO L225 Difference]: With dead ends: 91 [2024-11-13 23:31:43,257 INFO L226 Difference]: Without dead ends: 90 [2024-11-13 23:31:43,259 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-13 23:31:43,263 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 99 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:31:43,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 72 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 23:31:43,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-13 23:31:43,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 84. [2024-11-13 23:31:43,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 43 states have (on average 2.116279069767442) internal successors, (91), 83 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:31:43,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2024-11-13 23:31:43,305 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 3 [2024-11-13 23:31:43,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:31:43,305 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2024-11-13 23:31:43,306 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-13 23:31:43,306 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2024-11-13 23:31:43,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-13 23:31:43,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:31:43,306 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-13 23:31:43,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 23:31:43,307 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-13 23:31:43,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:31:43,308 INFO L85 PathProgramCache]: Analyzing trace with hash 180863, now seen corresponding path program 1 times [2024-11-13 23:31:43,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:31:43,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551148107] [2024-11-13 23:31:43,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:31:43,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:31:43,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:31:43,556 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-13 23:31:43,556 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:31:43,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551148107] [2024-11-13 23:31:43,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551148107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:31:43,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:31:43,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 23:31:43,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222826483] [2024-11-13 23:31:43,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:31:43,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 23:31:43,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:31:43,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 23:31:43,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 23:31:43,559 INFO L87 Difference]: Start difference. First operand 84 states and 91 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-13 23:31:43,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:31:43,838 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2024-11-13 23:31:43,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 23:31:43,839 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-13 23:31:43,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:31:43,840 INFO L225 Difference]: With dead ends: 127 [2024-11-13 23:31:43,841 INFO L226 Difference]: Without dead ends: 127 [2024-11-13 23:31:43,842 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-13 23:31:43,843 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 84 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:31:43,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 81 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 23:31:43,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-13 23:31:43,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 95. [2024-11-13 23:31:43,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 55 states have (on average 2.0) 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-13 23:31:43,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 110 transitions. [2024-11-13 23:31:43,852 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 110 transitions. Word has length 3 [2024-11-13 23:31:43,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:31:43,852 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 110 transitions. [2024-11-13 23:31:43,852 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-13 23:31:43,852 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 110 transitions. [2024-11-13 23:31:43,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-13 23:31:43,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:31:43,853 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-13 23:31:43,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 23:31:43,853 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-13 23:31:43,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:31:43,854 INFO L85 PathProgramCache]: Analyzing trace with hash 5606702, now seen corresponding path program 1 times [2024-11-13 23:31:43,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:31:43,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054092258] [2024-11-13 23:31:43,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:31:43,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:31:43,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:31:43,958 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-13 23:31:43,959 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:31:43,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054092258] [2024-11-13 23:31:43,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054092258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:31:43,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:31:43,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 23:31:43,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443792038] [2024-11-13 23:31:43,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:31:43,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 23:31:43,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:31:43,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 23:31:43,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 23:31:43,961 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-13 23:31:44,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:31:44,079 INFO L93 Difference]: Finished difference Result 93 states and 107 transitions. [2024-11-13 23:31:44,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 23:31:44,081 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-13 23:31:44,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:31:44,081 INFO L225 Difference]: With dead ends: 93 [2024-11-13 23:31:44,082 INFO L226 Difference]: Without dead ends: 93 [2024-11-13 23:31:44,082 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-13 23:31:44,083 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 24 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 23:31:44,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 92 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 23:31:44,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-13 23:31:44,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-13 23:31:44,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 55 states have (on average 1.9454545454545455) 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-13 23:31:44,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 107 transitions. [2024-11-13 23:31:44,101 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 107 transitions. Word has length 4 [2024-11-13 23:31:44,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:31:44,101 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 107 transitions. [2024-11-13 23:31:44,101 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-13 23:31:44,101 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 107 transitions. [2024-11-13 23:31:44,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-13 23:31:44,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:31:44,102 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-13 23:31:44,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 23:31:44,102 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-13 23:31:44,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:31:44,103 INFO L85 PathProgramCache]: Analyzing trace with hash 5606703, now seen corresponding path program 1 times [2024-11-13 23:31:44,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:31:44,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634687618] [2024-11-13 23:31:44,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:31:44,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:31:44,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:31:44,280 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-13 23:31:44,281 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:31:44,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634687618] [2024-11-13 23:31:44,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634687618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:31:44,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:31:44,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 23:31:44,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793506252] [2024-11-13 23:31:44,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:31:44,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 23:31:44,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:31:44,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 23:31:44,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 23:31:44,283 INFO L87 Difference]: Start difference. First operand 93 states and 107 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-13 23:31:44,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:31:44,378 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2024-11-13 23:31:44,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 23:31:44,379 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-13 23:31:44,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:31:44,381 INFO L225 Difference]: With dead ends: 91 [2024-11-13 23:31:44,381 INFO L226 Difference]: Without dead ends: 91 [2024-11-13 23:31:44,381 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-13 23:31:44,382 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 24 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 23:31:44,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 96 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 23:31:44,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-13 23:31:44,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-13 23:31:44,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 55 states have (on average 1.8909090909090909) internal successors, (104), 90 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:31:44,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions. [2024-11-13 23:31:44,391 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 4 [2024-11-13 23:31:44,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:31:44,391 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 104 transitions. [2024-11-13 23:31:44,391 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-13 23:31:44,391 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2024-11-13 23:31:44,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-13 23:31:44,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:31:44,392 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:31:44,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 23:31:44,392 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 23:31:44,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:31:44,393 INFO L85 PathProgramCache]: Analyzing trace with hash -470068013, now seen corresponding path program 1 times [2024-11-13 23:31:44,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:31:44,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227644273] [2024-11-13 23:31:44,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:31:44,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:31:44,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:31:44,551 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-13 23:31:44,552 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:31:44,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227644273] [2024-11-13 23:31:44,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227644273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:31:44,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:31:44,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 23:31:44,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094322158] [2024-11-13 23:31:44,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:31:44,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 23:31:44,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:31:44,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 23:31:44,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 23:31:44,554 INFO L87 Difference]: Start difference. First operand 91 states and 104 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-13 23:31:44,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:31:44,661 INFO L93 Difference]: Finished difference Result 87 states and 100 transitions. [2024-11-13 23:31:44,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 23:31:44,661 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-13 23:31:44,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:31:44,662 INFO L225 Difference]: With dead ends: 87 [2024-11-13 23:31:44,662 INFO L226 Difference]: Without dead ends: 87 [2024-11-13 23:31:44,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 23:31:44,663 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 10 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 23:31:44,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 92 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 23:31:44,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-13 23:31:44,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-13 23:31:44,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 55 states have (on average 1.8181818181818181) internal successors, (100), 86 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:31:44,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 100 transitions. [2024-11-13 23:31:44,679 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 100 transitions. Word has length 7 [2024-11-13 23:31:44,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:31:44,679 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 100 transitions. [2024-11-13 23:31:44,679 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-13 23:31:44,679 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 100 transitions. [2024-11-13 23:31:44,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-13 23:31:44,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:31:44,680 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:31:44,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 23:31:44,680 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 23:31:44,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:31:44,681 INFO L85 PathProgramCache]: Analyzing trace with hash -470068012, now seen corresponding path program 1 times [2024-11-13 23:31:44,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:31:44,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310778111] [2024-11-13 23:31:44,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:31:44,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:31:44,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:31:44,887 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-13 23:31:44,887 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:31:44,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310778111] [2024-11-13 23:31:44,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310778111] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:31:44,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:31:44,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 23:31:44,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709734281] [2024-11-13 23:31:44,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:31:44,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 23:31:44,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:31:44,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 23:31:44,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 23:31:44,892 INFO L87 Difference]: Start difference. First operand 87 states and 100 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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-13 23:31:45,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:31:45,037 INFO L93 Difference]: Finished difference Result 83 states and 96 transitions. [2024-11-13 23:31:45,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 23:31:45,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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-13 23:31:45,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:31:45,040 INFO L225 Difference]: With dead ends: 83 [2024-11-13 23:31:45,040 INFO L226 Difference]: Without dead ends: 83 [2024-11-13 23:31:45,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 23:31:45,041 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 10 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 23:31:45,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 117 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 23:31:45,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-13 23:31:45,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-13 23:31:45,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 55 states have (on average 1.7454545454545454) internal successors, (96), 82 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:31:45,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 96 transitions. [2024-11-13 23:31:45,059 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 96 transitions. Word has length 7 [2024-11-13 23:31:45,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:31:45,059 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 96 transitions. [2024-11-13 23:31:45,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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-13 23:31:45,060 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 96 transitions. [2024-11-13 23:31:45,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 23:31:45,060 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:31:45,061 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:31:45,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 23:31:45,061 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-13 23:31:45,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:31:45,062 INFO L85 PathProgramCache]: Analyzing trace with hash 2096354479, now seen corresponding path program 1 times [2024-11-13 23:31:45,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:31:45,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314011503] [2024-11-13 23:31:45,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:31:45,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:31:45,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:31:45,312 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-13 23:31:45,312 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:31:45,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314011503] [2024-11-13 23:31:45,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314011503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:31:45,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:31:45,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 23:31:45,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632260407] [2024-11-13 23:31:45,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:31:45,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 23:31:45,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:31:45,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 23:31:45,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:31:45,314 INFO L87 Difference]: Start difference. First operand 83 states and 96 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:31:45,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:31:45,505 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2024-11-13 23:31:45,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 23:31:45,505 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-13 23:31:45,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:31:45,506 INFO L225 Difference]: With dead ends: 89 [2024-11-13 23:31:45,506 INFO L226 Difference]: Without dead ends: 89 [2024-11-13 23:31:45,506 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-13 23:31:45,507 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 4 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:31:45,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 171 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 23:31:45,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-13 23:31:45,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2024-11-13 23:31:45,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 85 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-13 23:31:45,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 101 transitions. [2024-11-13 23:31:45,513 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 101 transitions. Word has length 10 [2024-11-13 23:31:45,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:31:45,513 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 101 transitions. [2024-11-13 23:31:45,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:31:45,513 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 101 transitions. [2024-11-13 23:31:45,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 23:31:45,514 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:31:45,514 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:31:45,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 23:31:45,514 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-13 23:31:45,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:31:45,515 INFO L85 PathProgramCache]: Analyzing trace with hash 2096354480, now seen corresponding path program 1 times [2024-11-13 23:31:45,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:31:45,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914007218] [2024-11-13 23:31:45,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:31:45,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:31:45,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:31:45,872 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-13 23:31:45,873 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:31:45,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914007218] [2024-11-13 23:31:45,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914007218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:31:45,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:31:45,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 23:31:45,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715567207] [2024-11-13 23:31:45,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:31:45,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 23:31:45,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:31:45,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 23:31:45,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:31:45,874 INFO L87 Difference]: Start difference. First operand 86 states and 101 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:31:46,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:31:46,098 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2024-11-13 23:31:46,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 23:31:46,099 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-13 23:31:46,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:31:46,100 INFO L225 Difference]: With dead ends: 86 [2024-11-13 23:31:46,100 INFO L226 Difference]: Without dead ends: 86 [2024-11-13 23:31:46,100 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-13 23:31:46,101 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 1 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:31:46,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 178 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 23:31:46,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-13 23:31:46,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-13 23:31:46,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 58 states have (on average 1.706896551724138) internal successors, (99), 85 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-13 23:31:46,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 99 transitions. [2024-11-13 23:31:46,114 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 99 transitions. Word has length 10 [2024-11-13 23:31:46,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:31:46,114 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 99 transitions. [2024-11-13 23:31:46,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:31:46,114 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2024-11-13 23:31:46,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 23:31:46,115 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:31:46,115 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:31:46,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 23:31:46,115 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-13 23:31:46,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:31:46,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1388722595, now seen corresponding path program 1 times [2024-11-13 23:31:46,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:31:46,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148423673] [2024-11-13 23:31:46,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:31:46,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:31:46,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:31:46,463 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-13 23:31:46,464 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:31:46,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148423673] [2024-11-13 23:31:46,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148423673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:31:46,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:31:46,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 23:31:46,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214216853] [2024-11-13 23:31:46,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:31:46,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 23:31:46,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:31:46,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 23:31:46,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-13 23:31:46,469 INFO L87 Difference]: Start difference. First operand 86 states and 99 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 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-13 23:31:46,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:31:46,649 INFO L93 Difference]: Finished difference Result 85 states and 98 transitions. [2024-11-13 23:31:46,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 23:31:46,650 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 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-13 23:31:46,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:31:46,650 INFO L225 Difference]: With dead ends: 85 [2024-11-13 23:31:46,650 INFO L226 Difference]: Without dead ends: 85 [2024-11-13 23:31:46,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-11-13 23:31:46,651 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 87 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 23:31:46,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 110 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 23:31:46,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-13 23:31:46,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2024-11-13 23:31:46,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 55 states have (on average 1.7272727272727273) internal successors, (95), 81 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-13 23:31:46,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 95 transitions. [2024-11-13 23:31:46,658 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 95 transitions. Word has length 12 [2024-11-13 23:31:46,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:31:46,659 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 95 transitions. [2024-11-13 23:31:46,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 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-13 23:31:46,659 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 95 transitions. [2024-11-13 23:31:46,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 23:31:46,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:31:46,659 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:31:46,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 23:31:46,660 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-13 23:31:46,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:31:46,660 INFO L85 PathProgramCache]: Analyzing trace with hash -347614495, now seen corresponding path program 1 times [2024-11-13 23:31:46,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:31:46,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806537453] [2024-11-13 23:31:46,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:31:46,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:31:46,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:31:46,829 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-13 23:31:46,829 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:31:46,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806537453] [2024-11-13 23:31:46,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806537453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:31:46,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:31:46,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 23:31:46,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059682818] [2024-11-13 23:31:46,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:31:46,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 23:31:46,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:31:46,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 23:31:46,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:31:46,831 INFO L87 Difference]: Start difference. First operand 82 states and 95 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-13 23:31:46,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:31:46,982 INFO L93 Difference]: Finished difference Result 117 states and 130 transitions. [2024-11-13 23:31:46,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 23:31:46,982 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-13 23:31:46,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:31:46,983 INFO L225 Difference]: With dead ends: 117 [2024-11-13 23:31:46,983 INFO L226 Difference]: Without dead ends: 117 [2024-11-13 23:31:46,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-13 23:31:46,984 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 56 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 23:31:46,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 177 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 23:31:46,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-13 23:31:46,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 82. [2024-11-13 23:31:46,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 55 states have (on average 1.709090909090909) internal successors, (94), 81 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-13 23:31:46,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 94 transitions. [2024-11-13 23:31:46,990 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 94 transitions. Word has length 13 [2024-11-13 23:31:46,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:31:46,990 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 94 transitions. [2024-11-13 23:31:46,990 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-13 23:31:46,991 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 94 transitions. [2024-11-13 23:31:46,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 23:31:46,991 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:31:46,991 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:31:46,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 23:31:46,991 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-13 23:31:46,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:31:46,992 INFO L85 PathProgramCache]: Analyzing trace with hash -347614523, now seen corresponding path program 1 times [2024-11-13 23:31:46,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:31:46,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135009050] [2024-11-13 23:31:46,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:31:46,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:31:47,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:31:47,161 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-13 23:31:47,161 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:31:47,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135009050] [2024-11-13 23:31:47,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135009050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:31:47,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:31:47,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 23:31:47,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367087915] [2024-11-13 23:31:47,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:31:47,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 23:31:47,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:31:47,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 23:31:47,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 23:31:47,164 INFO L87 Difference]: Start difference. First operand 82 states and 94 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-13 23:31:47,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:31:47,370 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2024-11-13 23:31:47,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 23:31:47,371 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-13 23:31:47,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:31:47,371 INFO L225 Difference]: With dead ends: 113 [2024-11-13 23:31:47,372 INFO L226 Difference]: Without dead ends: 113 [2024-11-13 23:31:47,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-13 23:31:47,373 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 48 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:31:47,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 155 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 23:31:47,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-13 23:31:47,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 82. [2024-11-13 23:31:47,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 55 states have (on average 1.690909090909091) internal successors, (93), 81 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-13 23:31:47,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2024-11-13 23:31:47,381 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 13 [2024-11-13 23:31:47,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:31:47,381 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2024-11-13 23:31:47,381 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-13 23:31:47,381 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2024-11-13 23:31:47,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 23:31:47,381 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:31:47,381 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:31:47,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 23:31:47,382 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-13 23:31:47,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:31:47,382 INFO L85 PathProgramCache]: Analyzing trace with hash -347614522, now seen corresponding path program 1 times [2024-11-13 23:31:47,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:31:47,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496422865] [2024-11-13 23:31:47,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:31:47,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:31:47,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:31:47,606 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-13 23:31:47,606 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:31:47,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496422865] [2024-11-13 23:31:47,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496422865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:31:47,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:31:47,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 23:31:47,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925948202] [2024-11-13 23:31:47,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:31:47,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 23:31:47,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:31:47,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 23:31:47,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:31:47,608 INFO L87 Difference]: Start difference. First operand 82 states and 93 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-13 23:31:47,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:31:47,793 INFO L93 Difference]: Finished difference Result 130 states and 148 transitions. [2024-11-13 23:31:47,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 23:31:47,793 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-13 23:31:47,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:31:47,794 INFO L225 Difference]: With dead ends: 130 [2024-11-13 23:31:47,794 INFO L226 Difference]: Without dead ends: 130 [2024-11-13 23:31:47,794 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-13 23:31:47,794 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 42 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 23:31:47,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 157 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 23:31:47,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-13 23:31:47,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 92. [2024-11-13 23:31:47,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 65 states have (on average 1.6) internal successors, (104), 91 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:31:47,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 104 transitions. [2024-11-13 23:31:47,798 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 104 transitions. Word has length 13 [2024-11-13 23:31:47,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:31:47,798 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 104 transitions. [2024-11-13 23:31:47,798 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-13 23:31:47,798 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2024-11-13 23:31:47,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 23:31:47,799 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:31:47,799 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:31:47,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 23:31:47,799 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 23:31:47,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:31:47,799 INFO L85 PathProgramCache]: Analyzing trace with hash -619645143, now seen corresponding path program 1 times [2024-11-13 23:31:47,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:31:47,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37536342] [2024-11-13 23:31:47,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:31:47,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:31:47,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:31:48,040 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:31:48,040 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:31:48,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37536342] [2024-11-13 23:31:48,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37536342] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:31:48,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838324082] [2024-11-13 23:31:48,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:31:48,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:31:48,041 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:31:48,045 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:31:48,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 23:31:48,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:31:48,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-13 23:31:48,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:31:48,202 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-13 23:31:48,222 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 23:31:48,222 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-13 23:31:48,244 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-13 23:31:48,302 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 23:31:48,303 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-13 23:31:48,330 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-13 23:31:48,334 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:31:48,334 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:31:48,367 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-13 23:31:48,367 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-13 23:31:48,458 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:31:48,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838324082] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 23:31:48,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1659725490] [2024-11-13 23:31:48,477 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2024-11-13 23:31:48,477 INFO L166 IcfgInterpreter]: Building call graph [2024-11-13 23:31:48,481 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-13 23:31:48,486 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-13 23:31:48,486 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-13 23:31:50,579 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-13 23:31:52,755 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2491#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (exists ((|v_ULTIMATE.start_create_data_#t~mem7#1.base_23| Int)) (not (= (select |#valid| |v_ULTIMATE.start_create_data_#t~mem7#1.base_23|) 1))) (= |ULTIMATE.start_append_~pointerToList#1.offset| 0) (= |ULTIMATE.start_create_data_~data~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#list~0#1.base|) (<= 2 |ULTIMATE.start_append_~pointerToList#1.base|) (<= 0 |ULTIMATE.start_create_data_~counter~0#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-13 23:31:52,755 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-13 23:31:52,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 23:31:52,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-11-13 23:31:52,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197051361] [2024-11-13 23:31:52,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 23:31:52,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 23:31:52,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:31:52,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 23:31:52,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=440, Unknown=2, NotChecked=0, Total=506 [2024-11-13 23:31:52,757 INFO L87 Difference]: Start difference. First operand 92 states and 104 transitions. Second operand has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:31:53,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:31:53,082 INFO L93 Difference]: Finished difference Result 91 states and 103 transitions. [2024-11-13 23:31:53,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 23:31:53,083 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-13 23:31:53,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:31:53,083 INFO L225 Difference]: With dead ends: 91 [2024-11-13 23:31:53,083 INFO L226 Difference]: Without dead ends: 91 [2024-11-13 23:31:53,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=90, Invalid=558, Unknown=2, NotChecked=0, Total=650 [2024-11-13 23:31:53,084 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 28 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:31:53,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 385 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 23:31:53,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-13 23:31:53,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-13 23:31:53,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 65 states have (on average 1.5846153846153845) internal successors, (103), 90 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-13 23:31:53,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2024-11-13 23:31:53,089 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 103 transitions. Word has length 13 [2024-11-13 23:31:53,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:31:53,089 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 103 transitions. [2024-11-13 23:31:53,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:31:53,090 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2024-11-13 23:31:53,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 23:31:53,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:31:53,090 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:31:53,112 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 23:31:53,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:31:53,295 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 23:31:53,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:31:53,295 INFO L85 PathProgramCache]: Analyzing trace with hash -619645142, now seen corresponding path program 1 times [2024-11-13 23:31:53,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:31:53,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247626324] [2024-11-13 23:31:53,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:31:53,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:31:53,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:31:53,694 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:31:53,695 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:31:53,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247626324] [2024-11-13 23:31:53,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247626324] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:31:53,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424665348] [2024-11-13 23:31:53,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:31:53,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:31:53,695 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:31:53,697 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:31:53,699 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 23:31:53,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:31:53,801 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-13 23:31:53,804 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:31:53,809 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-13 23:31:53,831 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 23:31:53,832 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-13 23:31:53,841 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-13 23:31:53,874 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-13 23:31:53,882 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-13 23:31:54,013 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 23:31:54,014 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-13 23:31:54,022 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-13 23:31:54,081 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-13 23:31:54,091 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-13 23:31:54,115 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:31:54,115 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:31:54,218 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse0 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_295 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_295) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) .cse1 4))) (forall ((v_ArrVal_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_295) |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_296) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0)))))) is different from false [2024-11-13 23:31:54,237 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_295 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_295) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 4))) (forall ((v_ArrVal_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int))) (<= (+ .cse0 8 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_295) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_296) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))))))) is different from false [2024-11-13 23:31:54,265 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:31:54,265 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-13 23:31:54,271 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-13 23:31:54,292 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:31:54,292 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-13 23:31:54,300 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:31:54,301 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-13 23:31:54,305 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:31:54,307 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-13 23:31:54,311 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:31:54,314 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-13 23:31:54,372 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-13 23:31:54,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424665348] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 23:31:54,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1399210205] [2024-11-13 23:31:54,374 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2024-11-13 23:31:54,375 INFO L166 IcfgInterpreter]: Building call graph [2024-11-13 23:31:54,375 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-13 23:31:54,376 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-13 23:31:54,376 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-13 23:31:55,606 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-13 23:32:09,966 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2780#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_append_~pointerToList#1.offset| 0) (exists ((|v_ULTIMATE.start_create_data_#t~mem7#1.offset_27| Int) (|v_ULTIMATE.start_create_data_#t~mem7#1.base_31| Int) (|v_ULTIMATE.start_create_data_~counter~0#1_37| Int)) (and (<= 1 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_main_~#list~0#1.base|) (<= 0 |v_ULTIMATE.start_create_data_~counter~0#1_37|) (<= 2 |ULTIMATE.start_append_~pointerToList#1.base|) (or (< (+ (* |v_ULTIMATE.start_create_data_~counter~0#1_37| 4) |v_ULTIMATE.start_create_data_#t~mem7#1.offset_27|) 0) (< (select |#length| |v_ULTIMATE.start_create_data_#t~mem7#1.base_31|) (+ (* |v_ULTIMATE.start_create_data_~counter~0#1_37| 4) |v_ULTIMATE.start_create_data_#t~mem7#1.offset_27| 4))) (<= |ULTIMATE.start_create_data_#t~nondet8#1| 2147483647) (<= 0 (+ |ULTIMATE.start_create_data_#t~nondet8#1| 2147483648)))) (= |ULTIMATE.start_create_data_~data~0#1.offset| 0) (= |ULTIMATE.start_append_~node~0#1.offset| 0))' at error location [2024-11-13 23:32:09,966 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-13 23:32:09,966 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 23:32:09,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2024-11-13 23:32:09,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978964536] [2024-11-13 23:32:09,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 23:32:09,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-13 23:32:09,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:32:09,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-13 23:32:09,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=622, Unknown=7, NotChecked=102, Total=812 [2024-11-13 23:32:09,970 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. Second operand has 19 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 19 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-13 23:32:10,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:32:10,531 INFO L93 Difference]: Finished difference Result 94 states and 106 transitions. [2024-11-13 23:32:10,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 23:32:10,532 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 19 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 13 [2024-11-13 23:32:10,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:32:10,533 INFO L225 Difference]: With dead ends: 94 [2024-11-13 23:32:10,533 INFO L226 Difference]: Without dead ends: 94 [2024-11-13 23:32:10,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=125, Invalid=868, Unknown=7, NotChecked=122, Total=1122 [2024-11-13 23:32:10,534 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 33 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 23:32:10,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 503 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 378 Invalid, 0 Unknown, 83 Unchecked, 0.3s Time] [2024-11-13 23:32:10,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-13 23:32:10,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-13 23:32:10,537 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-13 23:32:10,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 106 transitions. [2024-11-13 23:32:10,537 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 106 transitions. Word has length 13 [2024-11-13 23:32:10,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:32:10,538 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 106 transitions. [2024-11-13 23:32:10,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 19 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-13 23:32:10,538 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 106 transitions. [2024-11-13 23:32:10,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 23:32:10,538 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:32:10,538 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:32:10,559 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 23:32:10,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-13 23:32:10,742 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 23:32:10,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:32:10,743 INFO L85 PathProgramCache]: Analyzing trace with hash 949965618, now seen corresponding path program 1 times [2024-11-13 23:32:10,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:32:10,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348425303] [2024-11-13 23:32:10,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:32:10,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:32:10,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:32:10,815 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-13 23:32:10,815 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:32:10,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348425303] [2024-11-13 23:32:10,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348425303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:32:10,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:32:10,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 23:32:10,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532881921] [2024-11-13 23:32:10,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:32:10,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 23:32:10,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:32:10,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 23:32:10,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:32:10,817 INFO L87 Difference]: Start difference. First operand 94 states and 106 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-13 23:32:10,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:32:10,954 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2024-11-13 23:32:10,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 23:32:10,955 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-13 23:32:10,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:32:10,955 INFO L225 Difference]: With dead ends: 105 [2024-11-13 23:32:10,955 INFO L226 Difference]: Without dead ends: 105 [2024-11-13 23:32:10,955 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-13 23:32:10,956 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 30 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 23:32:10,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 127 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 23:32:10,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-13 23:32:10,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2024-11-13 23:32:10,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.5294117647058822) internal successors, (104), 92 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:32:10,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 104 transitions. [2024-11-13 23:32:10,959 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 104 transitions. Word has length 15 [2024-11-13 23:32:10,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:32:10,959 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 104 transitions. [2024-11-13 23:32:10,959 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-13 23:32:10,959 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 104 transitions. [2024-11-13 23:32:10,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 23:32:10,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:32:10,960 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:32:10,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 23:32:10,960 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 23:32:10,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:32:10,961 INFO L85 PathProgramCache]: Analyzing trace with hash 949965619, now seen corresponding path program 1 times [2024-11-13 23:32:10,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:32:10,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001909430] [2024-11-13 23:32:10,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:32:10,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:32:10,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:32:11,144 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-13 23:32:11,145 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:32:11,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001909430] [2024-11-13 23:32:11,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001909430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:32:11,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:32:11,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 23:32:11,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628309662] [2024-11-13 23:32:11,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:32:11,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 23:32:11,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:32:11,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 23:32:11,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-13 23:32:11,146 INFO L87 Difference]: Start difference. First operand 93 states and 104 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:32:11,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:32:11,352 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2024-11-13 23:32:11,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 23:32:11,353 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-13 23:32:11,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:32:11,353 INFO L225 Difference]: With dead ends: 122 [2024-11-13 23:32:11,353 INFO L226 Difference]: Without dead ends: 122 [2024-11-13 23:32:11,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-13 23:32:11,354 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 81 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:32:11,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 229 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 23:32:11,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-13 23:32:11,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 93. [2024-11-13 23:32:11,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.5147058823529411) internal successors, (103), 92 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-13 23:32:11,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2024-11-13 23:32:11,357 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 15 [2024-11-13 23:32:11,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:32:11,357 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2024-11-13 23:32:11,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:32:11,358 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2024-11-13 23:32:11,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 23:32:11,359 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:32:11,359 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:32:11,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-13 23:32:11,359 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 23:32:11,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:32:11,361 INFO L85 PathProgramCache]: Analyzing trace with hash -75494800, now seen corresponding path program 2 times [2024-11-13 23:32:11,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:32:11,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648431004] [2024-11-13 23:32:11,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:32:11,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:32:11,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:32:11,837 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:32:11,837 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:32:11,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648431004] [2024-11-13 23:32:11,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648431004] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:32:11,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132108904] [2024-11-13 23:32:11,837 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 23:32:11,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:32:11,838 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:32:11,839 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:32:11,842 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 23:32:11,968 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-13 23:32:11,968 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 23:32:11,971 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-13 23:32:11,973 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:32:11,978 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-13 23:32:11,988 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-13 23:32:11,998 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 23:32:11,998 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-13 23:32:12,033 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-13 23:32:12,038 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-13 23:32:12,124 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 23:32:12,124 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-13 23:32:12,129 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-13 23:32:12,222 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 23:32:12,223 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-13 23:32:12,228 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-13 23:32:12,276 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-13 23:32:12,289 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-13 23:32:12,320 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:32:12,320 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:32:12,391 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_412 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_412) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_413 (Array Int Int)) (v_ArrVal_412 (Array Int Int))) (<= (+ .cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_412) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_413) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))) is different from false [2024-11-13 23:32:12,407 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_413 (Array Int Int)) (v_ArrVal_412 (Array Int Int))) (<= (+ .cse0 8 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_412) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_413) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (forall ((v_ArrVal_412 (Array Int Int))) (<= 0 (+ .cse0 4 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_412) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))))))) is different from false [2024-11-13 23:32:12,450 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_413 (Array Int Int)) (v_ArrVal_410 (Array Int Int)) (v_ArrVal_412 (Array Int Int)) (v_ArrVal_411 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_411))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (<= (+ .cse0 12 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_410) .cse1 v_ArrVal_412) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_413) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))) (forall ((v_ArrVal_410 (Array Int Int)) (v_ArrVal_412 (Array Int Int)) (v_ArrVal_411 (Array Int Int))) (<= 0 (+ .cse0 8 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_410) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_411) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_412) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))) is different from false [2024-11-13 23:32:12,473 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (.cse3 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4))) (and (forall ((v_ArrVal_413 (Array Int Int)) (v_ArrVal_410 (Array Int Int)) (v_ArrVal_412 (Array Int Int)) (v_ArrVal_411 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_411))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_410) .cse1 v_ArrVal_412) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse3 12) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_413) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))) (forall ((v_ArrVal_410 (Array Int Int)) (v_ArrVal_412 (Array Int Int)) (v_ArrVal_411 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_410) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_411) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_412) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse3 8)))))) is different from false [2024-11-13 23:32:12,500 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:32:12,500 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 89 treesize of output 90 [2024-11-13 23:32:12,508 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:32:12,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 60 [2024-11-13 23:32:12,518 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 754 treesize of output 640 [2024-11-13 23:32:12,541 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 415 treesize of output 385 [2024-11-13 23:32:12,549 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 132 treesize of output 100 [2024-11-13 23:32:12,556 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 77 treesize of output 73 [2024-11-13 23:32:12,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 84 [2024-11-13 23:32:12,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2024-11-13 23:32:12,597 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:32:12,598 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 46 treesize of output 47 [2024-11-13 23:32:12,605 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:32:12,606 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 36 treesize of output 37 [2024-11-13 23:32:12,609 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:32:12,611 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 34 treesize of output 22 [2024-11-13 23:32:12,614 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:32:12,616 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 22 treesize of output 10 [2024-11-13 23:32:12,669 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2024-11-13 23:32:12,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132108904] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 23:32:12,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [243323225] [2024-11-13 23:32:12,672 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2024-11-13 23:32:12,672 INFO L166 IcfgInterpreter]: Building call graph [2024-11-13 23:32:12,672 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-13 23:32:12,672 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-13 23:32:12,672 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-13 23:32:13,695 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-13 23:32:15,428 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3536#(exists ((|v_ULTIMATE.start_create_data_#t~mem7#1.offset_35| Int) (|v_ULTIMATE.start_create_data_#t~mem7#1.base_41| Int) (|v_ULTIMATE.start_create_data_~counter~0#1_47| Int)) (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|) (or (< (+ (* |v_ULTIMATE.start_create_data_~counter~0#1_47| 4) |v_ULTIMATE.start_create_data_#t~mem7#1.offset_35|) 0) (< (select |#length| |v_ULTIMATE.start_create_data_#t~mem7#1.base_41|) (+ (* |v_ULTIMATE.start_create_data_~counter~0#1_47| 4) |v_ULTIMATE.start_create_data_#t~mem7#1.offset_35| 4))) (<= 2 |ULTIMATE.start_append_~pointerToList#1.base|) (<= 0 |v_ULTIMATE.start_create_data_~counter~0#1_47|) (= |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-13 23:32:15,428 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-13 23:32:15,428 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 23:32:15,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2024-11-13 23:32:15,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297154718] [2024-11-13 23:32:15,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 23:32:15,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-13 23:32:15,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:32:15,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-13 23:32:15,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=837, Unknown=4, NotChecked=244, Total=1190 [2024-11-13 23:32:15,430 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand has 25 states, 24 states have (on average 1.625) internal successors, (39), 25 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:32:16,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:32:16,241 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2024-11-13 23:32:16,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 23:32:16,241 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.625) internal successors, (39), 25 states have internal predecessors, (39), 0 states have call successors, (0), 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 16 [2024-11-13 23:32:16,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:32:16,242 INFO L225 Difference]: With dead ends: 96 [2024-11-13 23:32:16,242 INFO L226 Difference]: Without dead ends: 96 [2024-11-13 23:32:16,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=167, Invalid=1251, Unknown=4, NotChecked=300, Total=1722 [2024-11-13 23:32:16,243 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 39 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 178 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 23:32:16,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 709 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 554 Invalid, 0 Unknown, 178 Unchecked, 0.5s Time] [2024-11-13 23:32:16,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-13 23:32:16,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-13 23:32:16,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 71 states have (on average 1.4929577464788732) internal successors, (106), 95 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-13 23:32:16,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2024-11-13 23:32:16,246 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 16 [2024-11-13 23:32:16,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:32:16,246 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2024-11-13 23:32:16,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.625) internal successors, (39), 25 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:32:16,247 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2024-11-13 23:32:16,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 23:32:16,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:32:16,247 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:32:16,267 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 23:32:16,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-13 23:32:16,451 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 23:32:16,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:32:16,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1911018965, now seen corresponding path program 1 times [2024-11-13 23:32:16,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:32:16,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697828014] [2024-11-13 23:32:16,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:32:16,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:32:16,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:32:16,838 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-13 23:32:16,838 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:32:16,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697828014] [2024-11-13 23:32:16,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697828014] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:32:16,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:32:16,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 23:32:16,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950379773] [2024-11-13 23:32:16,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:32:16,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 23:32:16,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:32:16,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 23:32:16,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-13 23:32:16,839 INFO L87 Difference]: Start difference. First operand 96 states and 106 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-13 23:32:17,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:32:17,303 INFO L93 Difference]: Finished difference Result 125 states and 138 transitions. [2024-11-13 23:32:17,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 23:32:17,304 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-13 23:32:17,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:32:17,305 INFO L225 Difference]: With dead ends: 125 [2024-11-13 23:32:17,305 INFO L226 Difference]: Without dead ends: 125 [2024-11-13 23:32:17,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2024-11-13 23:32:17,306 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 102 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 23:32:17,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 244 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 23:32:17,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-13 23:32:17,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 107. [2024-11-13 23:32:17,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 82 states have (on average 1.4390243902439024) internal successors, (118), 106 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:32:17,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 118 transitions. [2024-11-13 23:32:17,309 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 118 transitions. Word has length 17 [2024-11-13 23:32:17,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:32:17,310 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 118 transitions. [2024-11-13 23:32:17,310 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-13 23:32:17,310 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions. [2024-11-13 23:32:17,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 23:32:17,310 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:32:17,310 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-13 23:32:17,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-13 23:32:17,311 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 23:32:17,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:32:17,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1756745000, now seen corresponding path program 1 times [2024-11-13 23:32:17,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:32:17,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574392405] [2024-11-13 23:32:17,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:32:17,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:32:17,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:32:17,412 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-13 23:32:17,412 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:32:17,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574392405] [2024-11-13 23:32:17,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574392405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:32:17,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:32:17,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 23:32:17,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912338484] [2024-11-13 23:32:17,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:32:17,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 23:32:17,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:32:17,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 23:32:17,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:32:17,415 INFO L87 Difference]: Start difference. First operand 107 states and 118 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-13 23:32:17,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:32:17,529 INFO L93 Difference]: Finished difference Result 135 states and 150 transitions. [2024-11-13 23:32:17,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 23:32:17,530 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-13 23:32:17,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:32:17,532 INFO L225 Difference]: With dead ends: 135 [2024-11-13 23:32:17,532 INFO L226 Difference]: Without dead ends: 135 [2024-11-13 23:32:17,532 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-13 23:32:17,532 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 43 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 23:32:17,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 170 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 23:32:17,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-13 23:32:17,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 119. [2024-11-13 23:32:17,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 94 states have (on average 1.5212765957446808) internal successors, (143), 118 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:32:17,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 143 transitions. [2024-11-13 23:32:17,537 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 143 transitions. Word has length 19 [2024-11-13 23:32:17,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:32:17,538 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 143 transitions. [2024-11-13 23:32:17,538 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-13 23:32:17,538 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 143 transitions. [2024-11-13 23:32:17,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 23:32:17,538 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:32:17,538 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:32:17,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-13 23:32:17,539 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 23:32:17,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:32:17,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1500768618, now seen corresponding path program 3 times [2024-11-13 23:32:17,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:32:17,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458719209] [2024-11-13 23:32:17,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:32:17,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:32:17,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:32:18,145 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:32:18,145 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:32:18,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458719209] [2024-11-13 23:32:18,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458719209] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:32:18,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847152254] [2024-11-13 23:32:18,146 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-13 23:32:18,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:32:18,146 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:32:18,148 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:32:18,150 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 23:32:18,271 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-13 23:32:18,271 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 23:32:18,273 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-13 23:32:18,275 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:32:18,278 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-13 23:32:18,291 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 23:32:18,291 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-13 23:32:18,298 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-13 23:32:18,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-13 23:32:18,321 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-13 23:32:18,396 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 23:32:18,396 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-13 23:32:18,403 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-13 23:32:18,496 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 23:32:18,496 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-13 23:32:18,501 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-13 23:32:18,611 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 23:32:18,612 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-13 23:32:18,615 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-13 23:32:18,663 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-13 23:32:18,667 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-13 23:32:18,689 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:32:18,689 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:32:18,756 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_544 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (<= (+ .cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_543) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_544) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (forall ((v_ArrVal_543 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_543) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) 4))))) is different from false [2024-11-13 23:32:18,771 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (.cse2 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4))) (and (forall ((v_ArrVal_544 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_543) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_544) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (forall ((v_ArrVal_543 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_543) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 4)))))) is different from false [2024-11-13 23:32:18,797 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_541) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_542) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) v_ArrVal_543) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) 8))) (forall ((v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (v_ArrVal_544 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_542))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (<= (+ .cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_541) .cse2 v_ArrVal_543) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_544) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))))) is different from false [2024-11-13 23:32:18,815 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse2 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (and (forall ((v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_541) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_542) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) v_ArrVal_543) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 8))) (forall ((v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (v_ArrVal_544 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_542))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_541) .cse3 v_ArrVal_543) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 12) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_544) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))))))))) is different from false [2024-11-13 23:32:18,849 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse3 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_539 (Array Int Int)) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (<= 0 (+ .cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_540))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_539) .cse1 v_ArrVal_541) (select (select (store .cse2 .cse1 v_ArrVal_542) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) v_ArrVal_543))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) 12))) (forall ((v_ArrVal_539 (Array Int Int)) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (v_ArrVal_544 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_540))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_542))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (<= (+ .cse0 16 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_539) .cse4 v_ArrVal_541) .cse5 v_ArrVal_543) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_544) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))))))))) is different from false [2024-11-13 23:32:19,055 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:32:19,056 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 177 treesize of output 178 [2024-11-13 23:32:19,064 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:32:19,064 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 167 treesize of output 108 [2024-11-13 23:32:19,076 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 64606 treesize of output 55732 [2024-11-13 23:32:19,697 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 5793 treesize of output 5607 [2024-11-13 23:32:19,721 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 831 treesize of output 715 [2024-11-13 23:32:19,730 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 715 treesize of output 671 [2024-11-13 23:32:19,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 671 treesize of output 635 [2024-11-13 23:32:19,757 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 635 treesize of output 531 [2024-11-13 23:32:19,765 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 531 treesize of output 495 [2024-11-13 23:32:19,778 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 463 treesize of output 447 [2024-11-13 23:32:19,899 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:32:19,900 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 90 treesize of output 91 [2024-11-13 23:32:19,908 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:32:19,908 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 80 treesize of output 61 [2024-11-13 23:32:19,911 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:32:19,914 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 85 treesize of output 55 [2024-11-13 23:32:19,917 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:32:19,919 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 22 treesize of output 10 [2024-11-13 23:32:19,986 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2024-11-13 23:32:19,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847152254] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 23:32:19,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [337110414] [2024-11-13 23:32:19,988 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2024-11-13 23:32:19,988 INFO L166 IcfgInterpreter]: Building call graph [2024-11-13 23:32:19,989 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-13 23:32:19,989 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-13 23:32:19,989 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-13 23:32:21,006 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-13 23:32:22,805 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4413#(exists ((|v_ULTIMATE.start_create_data_#t~mem7#1.offset_44| Int) (|v_ULTIMATE.start_create_data_#t~mem7#1.base_53| Int) (|v_ULTIMATE.start_create_data_~counter~0#1_59| Int)) (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|) (<= 0 |v_ULTIMATE.start_create_data_~counter~0#1_59|) (<= 2 |ULTIMATE.start_append_~pointerToList#1.base|) (= |ULTIMATE.start_append_~node~0#1.offset| 0) (or (< (select |#length| |v_ULTIMATE.start_create_data_#t~mem7#1.base_53|) (+ (* |v_ULTIMATE.start_create_data_~counter~0#1_59| 4) |v_ULTIMATE.start_create_data_#t~mem7#1.offset_44| 4)) (< (+ (* |v_ULTIMATE.start_create_data_~counter~0#1_59| 4) |v_ULTIMATE.start_create_data_#t~mem7#1.offset_44|) 0)) (<= |ULTIMATE.start_create_data_#t~nondet8#1| 2147483647) (<= 0 (+ |ULTIMATE.start_create_data_#t~nondet8#1| 2147483648))))' at error location [2024-11-13 23:32:22,805 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-13 23:32:22,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 23:32:22,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2024-11-13 23:32:22,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164287504] [2024-11-13 23:32:22,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 23:32:22,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-13 23:32:22,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:32:22,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-13 23:32:22,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1002, Unknown=9, NotChecked=340, Total=1482 [2024-11-13 23:32:22,807 INFO L87 Difference]: Start difference. First operand 119 states and 143 transitions. Second operand has 29 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 29 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:32:25,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 23:32:26,250 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (<= 0 (+ .cse0 .cse1)) (forall ((v_ArrVal_544 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (<= (+ .cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_543) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_544) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (forall ((v_ArrVal_539 (Array Int Int)) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (<= 0 (+ .cse0 (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_540))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_539) .cse3 v_ArrVal_541) (select (select (store .cse4 .cse3 v_ArrVal_542) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_543))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 12))) (forall ((v_ArrVal_539 (Array Int Int)) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (v_ArrVal_544 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_540))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_542))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (<= (+ .cse0 16 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_539) .cse5 v_ArrVal_541) .cse6 v_ArrVal_543) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_544) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_539 (Array Int Int)) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (v_ArrVal_544 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_540))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_542))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (<= (+ .cse0 (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse9 v_ArrVal_539) .cse10 v_ArrVal_541) .cse11 v_ArrVal_543) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 16) (select |c_#length| (select (select (store .cse12 .cse11 v_ArrVal_544) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))))) (<= (+ .cse0 |c_ULTIMATE.start_create_data_#t~mem7#1.offset| 4) (select |c_#length| |c_ULTIMATE.start_create_data_#t~mem7#1.base|)) (<= 0 (+ .cse0 |c_ULTIMATE.start_create_data_#t~mem7#1.offset|)) (forall ((v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_541) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_542) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_543) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 8))) (= (select |c_#valid| |c_ULTIMATE.start_create_data_~data~0#1.base|) 1) (forall ((v_ArrVal_543 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_543) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 4))) (forall ((v_ArrVal_539 (Array Int Int)) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (<= 0 (+ .cse0 (select (select (let ((.cse15 (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_540))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| .cse9 v_ArrVal_539) .cse14 v_ArrVal_541) (select (select (store .cse15 .cse14 v_ArrVal_542) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_543))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 12))) (forall ((v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (v_ArrVal_544 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (let ((.cse17 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_542))) (let ((.cse16 (select (select .cse17 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (<= (+ .cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_541) .cse16 v_ArrVal_543) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse17 .cse16 v_ArrVal_544) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))) (<= (+ .cse0 .cse1 4) (select |c_#length| .cse9))))) is different from false [2024-11-13 23:32:26,397 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (<= 0 (+ .cse0 .cse1)) (forall ((v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_541) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_542) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) v_ArrVal_543) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) .cse0 8))) (forall ((v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (v_ArrVal_544 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_542))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_541) .cse4 v_ArrVal_543) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) .cse0 12) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_544) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))))) (forall ((v_ArrVal_544 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_543) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) .cse0 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_544) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))) (forall ((v_ArrVal_543 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_543) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) .cse0 4))) (<= (+ .cse0 .cse1 4) (select |c_#length| .cse2))))) is different from false [2024-11-13 23:32:26,537 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_544 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (<= (+ .cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_543) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_544) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (<= (+ .cse0 |c_ULTIMATE.start_create_data_#t~mem7#1.offset| 4) (select |c_#length| |c_ULTIMATE.start_create_data_#t~mem7#1.base|)) (<= 0 (+ .cse0 |c_ULTIMATE.start_create_data_#t~mem7#1.offset|)) (forall ((v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_541) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_542) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) v_ArrVal_543) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) 8))) (forall ((v_ArrVal_543 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_543) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (v_ArrVal_544 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_542))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (<= (+ .cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_541) .cse2 v_ArrVal_543) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_544) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))))) is different from false [2024-11-13 23:32:26,595 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (<= 0 (+ .cse0 .cse1)) (forall ((v_ArrVal_544 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_543) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) .cse0 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_544) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))) (forall ((v_ArrVal_543 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_543) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) .cse0 4))) (<= (+ .cse0 .cse1 4) (select |c_#length| .cse2))))) is different from false [2024-11-13 23:32:27,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:32:27,201 INFO L93 Difference]: Finished difference Result 136 states and 164 transitions. [2024-11-13 23:32:27,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-13 23:32:27,202 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 29 states have internal predecessors, (45), 0 states have call successors, (0), 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-13 23:32:27,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:32:27,203 INFO L225 Difference]: With dead ends: 136 [2024-11-13 23:32:27,203 INFO L226 Difference]: Without dead ends: 136 [2024-11-13 23:32:27,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=255, Invalid=1827, Unknown=24, NotChecked=864, Total=2970 [2024-11-13 23:32:27,204 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 30 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 1054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 473 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-13 23:32:27,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 708 Invalid, 1054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 575 Invalid, 2 Unknown, 473 Unchecked, 3.3s Time] [2024-11-13 23:32:27,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-13 23:32:27,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2024-11-13 23:32:27,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 109 states have (on average 1.4862385321100917) internal successors, (162), 133 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-13 23:32:27,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 162 transitions. [2024-11-13 23:32:27,209 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 162 transitions. Word has length 19 [2024-11-13 23:32:27,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:32:27,209 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 162 transitions. [2024-11-13 23:32:27,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 29 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:32:27,209 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 162 transitions. [2024-11-13 23:32:27,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 23:32:27,210 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:32:27,210 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-13 23:32:27,231 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-13 23:32:27,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:32:27,411 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 23:32:27,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:32:27,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1375479681, now seen corresponding path program 1 times [2024-11-13 23:32:27,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:32:27,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688094714] [2024-11-13 23:32:27,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:32:27,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:32:27,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:32:27,611 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-13 23:32:27,611 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:32:27,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688094714] [2024-11-13 23:32:27,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688094714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:32:27,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:32:27,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 23:32:27,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244001641] [2024-11-13 23:32:27,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:32:27,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 23:32:27,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:32:27,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 23:32:27,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:32:27,613 INFO L87 Difference]: Start difference. First operand 134 states and 162 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-13 23:32:28,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:32:28,146 INFO L93 Difference]: Finished difference Result 149 states and 168 transitions. [2024-11-13 23:32:28,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 23:32:28,147 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-13 23:32:28,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:32:28,148 INFO L225 Difference]: With dead ends: 149 [2024-11-13 23:32:28,148 INFO L226 Difference]: Without dead ends: 149 [2024-11-13 23:32:28,148 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-13 23:32:28,149 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 43 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 23:32:28,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 138 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 23:32:28,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-13 23:32:28,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 135. [2024-11-13 23:32:28,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 110 states have (on average 1.481818181818182) internal successors, (163), 134 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:32:28,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 163 transitions. [2024-11-13 23:32:28,159 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 163 transitions. Word has length 20 [2024-11-13 23:32:28,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:32:28,159 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 163 transitions. [2024-11-13 23:32:28,159 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-13 23:32:28,159 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 163 transitions. [2024-11-13 23:32:28,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 23:32:28,160 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:32:28,160 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-13 23:32:28,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-13 23:32:28,160 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 23:32:28,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:32:28,160 INFO L85 PathProgramCache]: Analyzing trace with hash 309803018, now seen corresponding path program 1 times [2024-11-13 23:32:28,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:32:28,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136663256] [2024-11-13 23:32:28,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:32:28,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:32:28,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:32:28,279 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-13 23:32:28,279 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:32:28,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136663256] [2024-11-13 23:32:28,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136663256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:32:28,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:32:28,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 23:32:28,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939316088] [2024-11-13 23:32:28,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:32:28,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 23:32:28,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:32:28,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 23:32:28,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:32:28,281 INFO L87 Difference]: Start difference. First operand 135 states and 163 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-13 23:32:28,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:32:28,804 INFO L93 Difference]: Finished difference Result 151 states and 182 transitions. [2024-11-13 23:32:28,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 23:32:28,804 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-13 23:32:28,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:32:28,805 INFO L225 Difference]: With dead ends: 151 [2024-11-13 23:32:28,805 INFO L226 Difference]: Without dead ends: 151 [2024-11-13 23:32:28,805 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-13 23:32:28,807 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 26 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 23:32:28,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 127 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 23:32:28,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-13 23:32:28,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 140. [2024-11-13 23:32:28,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 115 states have (on average 1.4782608695652173) internal successors, (170), 139 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-13 23:32:28,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 170 transitions. [2024-11-13 23:32:28,812 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 170 transitions. Word has length 21 [2024-11-13 23:32:28,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:32:28,812 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 170 transitions. [2024-11-13 23:32:28,812 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-13 23:32:28,813 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 170 transitions. [2024-11-13 23:32:28,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 23:32:28,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:32:28,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-13 23:32:28,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-13 23:32:28,813 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 23:32:28,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:32:28,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1275196869, now seen corresponding path program 1 times [2024-11-13 23:32:28,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:32:28,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085554815] [2024-11-13 23:32:28,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:32:28,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:32:28,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:32:29,647 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-13 23:32:29,648 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:32:29,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085554815] [2024-11-13 23:32:29,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085554815] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:32:29,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:32:29,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 23:32:29,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536721177] [2024-11-13 23:32:29,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:32:29,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 23:32:29,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:32:29,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 23:32:29,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-13 23:32:29,651 INFO L87 Difference]: Start difference. First operand 140 states and 170 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-13 23:32:31,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:32:31,132 INFO L93 Difference]: Finished difference Result 163 states and 185 transitions. [2024-11-13 23:32:31,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 23:32:31,133 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-13 23:32:31,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:32:31,134 INFO L225 Difference]: With dead ends: 163 [2024-11-13 23:32:31,134 INFO L226 Difference]: Without dead ends: 163 [2024-11-13 23:32:31,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2024-11-13 23:32:31,135 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 128 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-13 23:32:31,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 215 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-13 23:32:31,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-13 23:32:31,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 145. [2024-11-13 23:32:31,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 121 states have (on average 1.462809917355372) internal successors, (177), 144 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-13 23:32:31,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 177 transitions. [2024-11-13 23:32:31,149 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 177 transitions. Word has length 21 [2024-11-13 23:32:31,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:32:31,149 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 177 transitions. [2024-11-13 23:32:31,149 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-13 23:32:31,149 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 177 transitions. [2024-11-13 23:32:31,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 23:32:31,150 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:32:31,150 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-13 23:32:31,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-13 23:32:31,150 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 23:32:31,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:32:31,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1275196868, now seen corresponding path program 1 times [2024-11-13 23:32:31,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:32:31,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124311885] [2024-11-13 23:32:31,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:32:31,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:32:31,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:32:32,162 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-13 23:32:32,163 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:32:32,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124311885] [2024-11-13 23:32:32,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124311885] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:32:32,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:32:32,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 23:32:32,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036456041] [2024-11-13 23:32:32,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:32:32,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 23:32:32,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:32:32,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 23:32:32,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-13 23:32:32,167 INFO L87 Difference]: Start difference. First operand 145 states and 177 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-13 23:32:33,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:32:33,935 INFO L93 Difference]: Finished difference Result 183 states and 219 transitions. [2024-11-13 23:32:33,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 23:32:33,935 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-13 23:32:33,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:32:33,936 INFO L225 Difference]: With dead ends: 183 [2024-11-13 23:32:33,936 INFO L226 Difference]: Without dead ends: 183 [2024-11-13 23:32:33,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2024-11-13 23:32:33,937 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 124 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:32:33,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 243 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-13 23:32:33,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-13 23:32:33,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 156. [2024-11-13 23:32:33,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 132 states have (on average 1.4621212121212122) internal successors, (193), 155 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:32:33,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 193 transitions. [2024-11-13 23:32:33,943 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 193 transitions. Word has length 21 [2024-11-13 23:32:33,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:32:33,943 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 193 transitions. [2024-11-13 23:32:33,943 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-13 23:32:33,943 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 193 transitions. [2024-11-13 23:32:33,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 23:32:33,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:32:33,944 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-13 23:32:33,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-13 23:32:33,944 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 23:32:33,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:32:33,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1013959138, now seen corresponding path program 1 times [2024-11-13 23:32:33,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:32:33,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150611976] [2024-11-13 23:32:33,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:32:33,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:32:33,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:32:34,309 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-13 23:32:34,309 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:32:34,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150611976] [2024-11-13 23:32:34,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150611976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:32:34,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:32:34,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 23:32:34,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869564674] [2024-11-13 23:32:34,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:32:34,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 23:32:34,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:32:34,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 23:32:34,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 23:32:34,311 INFO L87 Difference]: Start difference. First operand 156 states and 193 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-13 23:32:34,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:32:34,957 INFO L93 Difference]: Finished difference Result 168 states and 196 transitions. [2024-11-13 23:32:34,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 23:32:34,957 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-13 23:32:34,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:32:34,958 INFO L225 Difference]: With dead ends: 168 [2024-11-13 23:32:34,958 INFO L226 Difference]: Without dead ends: 168 [2024-11-13 23:32:34,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-13 23:32:34,959 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 91 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 23:32:34,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 138 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 23:32:34,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-13 23:32:34,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 158. [2024-11-13 23:32:34,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 134 states have (on average 1.462686567164179) internal successors, (196), 157 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:32:34,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 196 transitions. [2024-11-13 23:32:34,965 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 196 transitions. Word has length 22 [2024-11-13 23:32:34,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:32:34,965 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 196 transitions. [2024-11-13 23:32:34,965 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-13 23:32:34,965 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 196 transitions. [2024-11-13 23:32:34,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 23:32:34,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:32:34,966 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-13 23:32:34,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-13 23:32:34,969 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 23:32:34,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:32:34,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1013959139, now seen corresponding path program 1 times [2024-11-13 23:32:34,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:32:34,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55739867] [2024-11-13 23:32:34,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:32:34,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:32:34,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:32:35,073 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-13 23:32:35,073 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:32:35,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55739867] [2024-11-13 23:32:35,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55739867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:32:35,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:32:35,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 23:32:35,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701949430] [2024-11-13 23:32:35,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:32:35,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 23:32:35,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:32:35,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 23:32:35,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 23:32:35,075 INFO L87 Difference]: Start difference. First operand 158 states and 196 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-13 23:32:35,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:32:35,239 INFO L93 Difference]: Finished difference Result 153 states and 188 transitions. [2024-11-13 23:32:35,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 23:32:35,239 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-13 23:32:35,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:32:35,240 INFO L225 Difference]: With dead ends: 153 [2024-11-13 23:32:35,240 INFO L226 Difference]: Without dead ends: 153 [2024-11-13 23:32:35,240 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-13 23:32:35,241 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 89 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 36 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.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:32:35,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 36 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 23:32:35,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-13 23:32:35,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2024-11-13 23:32:35,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 134 states have (on average 1.4029850746268657) internal successors, (188), 152 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:32:35,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 188 transitions. [2024-11-13 23:32:35,247 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 188 transitions. Word has length 22 [2024-11-13 23:32:35,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:32:35,247 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 188 transitions. [2024-11-13 23:32:35,247 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-13 23:32:35,247 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 188 transitions. [2024-11-13 23:32:35,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-13 23:32:35,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:32:35,249 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-13 23:32:35,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-13 23:32:35,249 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 23:32:35,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:32:35,249 INFO L85 PathProgramCache]: Analyzing trace with hash -404100800, now seen corresponding path program 1 times [2024-11-13 23:32:35,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:32:35,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510900314] [2024-11-13 23:32:35,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:32:35,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:32:35,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:32:36,115 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-13 23:32:36,116 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:32:36,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510900314] [2024-11-13 23:32:36,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510900314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:32:36,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:32:36,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 23:32:36,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234542205] [2024-11-13 23:32:36,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:32:36,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 23:32:36,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:32:36,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 23:32:36,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-13 23:32:36,117 INFO L87 Difference]: Start difference. First operand 153 states and 188 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-13 23:32:37,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:32:37,922 INFO L93 Difference]: Finished difference Result 176 states and 199 transitions. [2024-11-13 23:32:37,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 23:32:37,923 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-13 23:32:37,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:32:37,924 INFO L225 Difference]: With dead ends: 176 [2024-11-13 23:32:37,924 INFO L226 Difference]: Without dead ends: 176 [2024-11-13 23:32:37,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2024-11-13 23:32:37,925 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 132 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:32:37,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 192 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-13 23:32:37,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-13 23:32:37,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 153. [2024-11-13 23:32:37,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 134 states have (on average 1.3880597014925373) internal successors, (186), 152 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:32:37,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 186 transitions. [2024-11-13 23:32:37,930 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 186 transitions. Word has length 24 [2024-11-13 23:32:37,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:32:37,930 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 186 transitions. [2024-11-13 23:32:37,930 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-13 23:32:37,930 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 186 transitions. [2024-11-13 23:32:37,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-13 23:32:37,931 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:32:37,931 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-13 23:32:37,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-13 23:32:37,931 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 23:32:37,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:32:37,931 INFO L85 PathProgramCache]: Analyzing trace with hash -404111785, now seen corresponding path program 1 times [2024-11-13 23:32:37,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:32:37,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805449032] [2024-11-13 23:32:37,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:32:37,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:32:37,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:32:39,502 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-13 23:32:39,503 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:32:39,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805449032] [2024-11-13 23:32:39,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805449032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:32:39,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:32:39,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-13 23:32:39,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427135391] [2024-11-13 23:32:39,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:32:39,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-13 23:32:39,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:32:39,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-13 23:32:39,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-13 23:32:39,505 INFO L87 Difference]: Start difference. First operand 153 states and 186 transitions. Second operand has 16 states, 15 states have (on average 1.6) internal successors, (24), 15 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-13 23:32:41,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:32:41,861 INFO L93 Difference]: Finished difference Result 178 states and 208 transitions. [2024-11-13 23:32:41,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 23:32:41,861 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.6) internal successors, (24), 15 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-13 23:32:41,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:32:41,862 INFO L225 Difference]: With dead ends: 178 [2024-11-13 23:32:41,862 INFO L226 Difference]: Without dead ends: 178 [2024-11-13 23:32:41,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=122, Invalid=634, Unknown=0, NotChecked=0, Total=756 [2024-11-13 23:32:41,863 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 127 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-13 23:32:41,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 401 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-13 23:32:41,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-13 23:32:41,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 153. [2024-11-13 23:32:41,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 134 states have (on average 1.3805970149253732) internal successors, (185), 152 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:32:41,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 185 transitions. [2024-11-13 23:32:41,868 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 185 transitions. Word has length 24 [2024-11-13 23:32:41,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:32:41,868 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 185 transitions. [2024-11-13 23:32:41,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.6) internal successors, (24), 15 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-13 23:32:41,868 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 185 transitions. [2024-11-13 23:32:41,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 23:32:41,869 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:32:41,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] [2024-11-13 23:32:41,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-13 23:32:41,869 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 23:32:41,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:32:41,870 INFO L85 PathProgramCache]: Analyzing trace with hash 357436700, now seen corresponding path program 1 times [2024-11-13 23:32:41,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:32:41,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100766129] [2024-11-13 23:32:41,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:32:41,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:32:41,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:32:43,817 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-13 23:32:43,817 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:32:43,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100766129] [2024-11-13 23:32:43,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100766129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:32:43,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:32:43,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-13 23:32:43,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230644557] [2024-11-13 23:32:43,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:32:43,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-13 23:32:43,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:32:43,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-13 23:32:43,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2024-11-13 23:32:43,819 INFO L87 Difference]: Start difference. First operand 153 states and 185 transitions. Second operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 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-13 23:32:46,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:32:46,495 INFO L93 Difference]: Finished difference Result 215 states and 254 transitions. [2024-11-13 23:32:46,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 23:32:46,496 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 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-13 23:32:46,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:32:46,497 INFO L225 Difference]: With dead ends: 215 [2024-11-13 23:32:46,497 INFO L226 Difference]: Without dead ends: 213 [2024-11-13 23:32:46,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=148, Invalid=844, Unknown=0, NotChecked=0, Total=992 [2024-11-13 23:32:46,498 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 73 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-13 23:32:46,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 488 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-13 23:32:46,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-13 23:32:46,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 178. [2024-11-13 23:32:46,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 159 states have (on average 1.3522012578616351) internal successors, (215), 177 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:32:46,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 215 transitions. [2024-11-13 23:32:46,504 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 215 transitions. Word has length 25 [2024-11-13 23:32:46,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:32:46,504 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 215 transitions. [2024-11-13 23:32:46,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 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-13 23:32:46,505 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 215 transitions. [2024-11-13 23:32:46,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-13 23:32:46,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:32:46,505 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-13 23:32:46,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-13 23:32:46,506 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 23:32:46,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:32:46,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1968178858, now seen corresponding path program 1 times [2024-11-13 23:32:46,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:32:46,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505440992] [2024-11-13 23:32:46,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:32:46,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:32:46,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:32:47,016 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-13 23:32:47,016 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:32:47,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505440992] [2024-11-13 23:32:47,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505440992] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:32:47,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105497158] [2024-11-13 23:32:47,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:32:47,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:32:47,017 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:32:47,019 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:32:47,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 23:32:47,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:32:47,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-13 23:32:47,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:32:47,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:32:47,380 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-13 23:32:47,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:32:47,482 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-13 23:32:47,554 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-13 23:32:47,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 15 [2024-11-13 23:32:48,451 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:32:48,451 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-13 23:32:48,461 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-13 23:32:49,037 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-13 23:32:49,037 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-13 23:32:49,037 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:32:49,519 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-13 23:32:49,843 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_878 (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_878))) (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 (= (store (store |c_#valid| .cse0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|) (= .cse0 0)))) is different from false [2024-11-13 23:32:49,991 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_878 (Array Int Int)) (|v_ULTIMATE.start_append_~node~0#1.base_20| Int) (|ULTIMATE.start_append_~pointerToList#1.offset| Int) (v_ArrVal_876 Int)) (let ((.cse0 (select (store (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_append_~node~0#1.base_20| v_ArrVal_878) |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)) (= (store (store (store |c_#valid| |v_ULTIMATE.start_append_~node~0#1.base_20| v_ArrVal_876) .cse0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|) (= .cse0 0)))) is different from false [2024-11-13 23:32:49,995 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-13 23:32:49,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105497158] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 23:32:49,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1648075617] [2024-11-13 23:32:49,997 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2024-11-13 23:32:49,997 INFO L166 IcfgInterpreter]: Building call graph [2024-11-13 23:32:49,997 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-13 23:32:49,997 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-13 23:32:49,997 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-13 23:32:50,883 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-13 23:33:41,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1648075617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:33:41,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-13 23:33:41,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [6, 9, 10] total 43 [2024-11-13 23:33:41,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167662432] [2024-11-13 23:33:41,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:33:41,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-13 23:33:41,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:33:41,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-13 23:33:41,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=1466, Unknown=12, NotChecked=246, Total=1980 [2024-11-13 23:33:41,019 INFO L87 Difference]: Start difference. First operand 178 states and 215 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-13 23:33:42,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:33:46,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:33:52,852 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-13 23:33:55,148 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-13 23:33:57,368 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-13 23:34:00,941 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-13 23:34:03,393 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-13 23:34:08,650 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-13 23:34:16,208 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-13 23:34:20,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:34:20,796 INFO L93 Difference]: Finished difference Result 204 states and 242 transitions. [2024-11-13 23:34:20,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-13 23:34:20,797 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-13 23:34:20,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:34:20,798 INFO L225 Difference]: With dead ends: 204 [2024-11-13 23:34:20,798 INFO L226 Difference]: Without dead ends: 187 [2024-11-13 23:34:20,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 36 SyntacticMatches, 6 SemanticMatches, 46 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 706 ImplicationChecksByTransitivity, 66.7s TimeCoverageRelationStatistics Valid=296, Invalid=1680, Unknown=16, NotChecked=264, Total=2256 [2024-11-13 23:34:20,799 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 7 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 892 mSolverCounterSat, 2 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 892 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.7s IncrementalHoareTripleChecker+Time [2024-11-13 23:34:20,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 228 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 892 Invalid, 8 Unknown, 0 Unchecked, 24.7s Time] [2024-11-13 23:34:20,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-13 23:34:20,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2024-11-13 23:34:20,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 167 states have (on average 1.341317365269461) internal successors, (224), 185 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:34:20,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 224 transitions. [2024-11-13 23:34:20,806 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 224 transitions. Word has length 26 [2024-11-13 23:34:20,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:34:20,806 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 224 transitions. [2024-11-13 23:34:20,806 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-13 23:34:20,806 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 224 transitions. [2024-11-13 23:34:20,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 23:34:20,807 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:34:20,807 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-13 23:34:20,826 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 23:34:21,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:34:21,008 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 23:34:21,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:34:21,008 INFO L85 PathProgramCache]: Analyzing trace with hash 226554849, now seen corresponding path program 1 times [2024-11-13 23:34:21,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:34:21,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500419087] [2024-11-13 23:34:21,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:34:21,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:34:21,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:34:21,399 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-13 23:34:21,399 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:34:21,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500419087] [2024-11-13 23:34:21,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500419087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:34:21,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:34:21,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 23:34:21,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470712441] [2024-11-13 23:34:21,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:34:21,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 23:34:21,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:34:21,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 23:34:21,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-13 23:34:21,401 INFO L87 Difference]: Start difference. First operand 186 states and 224 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-13 23:34:22,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:34:22,086 INFO L93 Difference]: Finished difference Result 192 states and 228 transitions. [2024-11-13 23:34:22,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 23:34:22,086 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-13 23:34:22,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:34:22,087 INFO L225 Difference]: With dead ends: 192 [2024-11-13 23:34:22,087 INFO L226 Difference]: Without dead ends: 192 [2024-11-13 23:34:22,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-13 23:34:22,088 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 181 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 23:34:22,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 74 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 23:34:22,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-13 23:34:22,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 190. [2024-11-13 23:34:22,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 171 states have (on average 1.3333333333333333) internal successors, (228), 189 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:34:22,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 228 transitions. [2024-11-13 23:34:22,096 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 228 transitions. Word has length 27 [2024-11-13 23:34:22,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:34:22,096 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 228 transitions. [2024-11-13 23:34:22,096 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-13 23:34:22,097 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 228 transitions. [2024-11-13 23:34:22,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-13 23:34:22,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:34:22,097 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:34:22,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-13 23:34:22,098 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 23:34:22,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:34:22,098 INFO L85 PathProgramCache]: Analyzing trace with hash -89954549, now seen corresponding path program 1 times [2024-11-13 23:34:22,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:34:22,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623534872] [2024-11-13 23:34:22,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:34:22,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:34:22,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:34:22,367 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:34:22,367 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:34:22,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623534872] [2024-11-13 23:34:22,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623534872] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:34:22,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60467596] [2024-11-13 23:34:22,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:34:22,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:34:22,368 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:34:22,370 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:34:22,373 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 23:34:22,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:34:22,551 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 23:34:22,552 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:34:22,672 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:34:22,672 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:34:23,018 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:34:23,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60467596] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 23:34:23,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1720417579] [2024-11-13 23:34:23,020 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2024-11-13 23:34:23,020 INFO L166 IcfgInterpreter]: Building call graph [2024-11-13 23:34:23,021 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-13 23:34:23,021 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-13 23:34:23,021 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-13 23:34:23,835 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-13 23:34:31,910 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '9027#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#list~0#1.base|)) (exists ((|v_#memory_int_107| (Array Int (Array Int Int))) (|v_#memory_int_108| (Array Int (Array Int Int))) (|v_#memory_int_106| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_138| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_137| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_136| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_131| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_132| (Array Int (Array Int Int))) (|v_ULTIMATE.start_append_~pointerToList#1.base_17| Int)) (and (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_17|) 0))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_138| |v_ULTIMATE.start_append_~pointerToList#1.base_17| (store (select |v_#memory_$Pointer$.base_138| |v_ULTIMATE.start_append_~pointerToList#1.base_17|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_17|) 0)))) (= (select |#valid| (select (select |v_#memory_$Pointer$.base_138| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_17|) 0)) 0)) 1) (= |#memory_int| (store |v_#memory_int_108| |v_ULTIMATE.start_append_~pointerToList#1.base_17| (store (select |v_#memory_int_108| |v_ULTIMATE.start_append_~pointerToList#1.base_17|) 0 (select (select |#memory_int| |v_ULTIMATE.start_append_~pointerToList#1.base_17|) 0)))) (<= 4 (select |#length| (select (select |v_#memory_$Pointer$.base_138| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_17|) 0)) 0))) (<= 0 (+ 2147483648 (select (select |v_#memory_int_107| (select (select |v_#memory_$Pointer$.base_138| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_17|) 0)) 0)) 0))) (= (store |v_#memory_$Pointer$.offset_131| (select (select |v_#memory_$Pointer$.base_138| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_17|) 0)) 0) (store (select |v_#memory_$Pointer$.offset_131| (select (select |v_#memory_$Pointer$.base_138| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_17|) 0)) 0)) 0 (select (select |v_#memory_$Pointer$.offset_132| (select (select |v_#memory_$Pointer$.base_138| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_17|) 0)) 0)) 0))) |v_#memory_$Pointer$.offset_132|) (= (store |v_#memory_int_107| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_17|) 0) (store (select |v_#memory_int_107| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_17|) 0)) 0 (select (select |v_#memory_int_108| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_17|) 0)) 0))) |v_#memory_int_108|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_17|) 0)) 1) (= (store |v_#memory_$Pointer$.base_136| (select (select |v_#memory_$Pointer$.base_138| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_17|) 0)) 0) (store (select |v_#memory_$Pointer$.base_136| (select (select |v_#memory_$Pointer$.base_138| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_17|) 0)) 0)) 0 (select (select |v_#memory_$Pointer$.base_137| (select (select |v_#memory_$Pointer$.base_138| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_17|) 0)) 0)) 0))) |v_#memory_$Pointer$.base_137|) (= (store |v_#memory_$Pointer$.base_137| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_17|) 0) (store (select |v_#memory_$Pointer$.base_137| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_17|) 0)) 0 (select (select |v_#memory_$Pointer$.base_138| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_17|) 0)) 0))) |v_#memory_$Pointer$.base_138|) (<= (select (select |v_#memory_int_107| (select (select |v_#memory_$Pointer$.base_138| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_17|) 0)) 0)) 0) 2147483647) (= |v_#memory_int_107| (store |v_#memory_int_106| (select (select |v_#memory_$Pointer$.base_138| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_17|) 0)) 0) (store (select |v_#memory_int_106| (select (select |v_#memory_$Pointer$.base_138| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_17|) 0)) 0)) 0 (select (select |v_#memory_int_107| (select (select |v_#memory_$Pointer$.base_138| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_17|) 0)) 0)) 0)))) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_132| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_17|) 0) (store (select |v_#memory_$Pointer$.offset_132| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_17|) 0)) 0 0)) |v_ULTIMATE.start_append_~pointerToList#1.base_17| (store (select (store |v_#memory_$Pointer$.offset_132| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_17|) 0) (store (select |v_#memory_$Pointer$.offset_132| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_17|) 0)) 0 0)) |v_ULTIMATE.start_append_~pointerToList#1.base_17|) 0 0))) (<= 2 |v_ULTIMATE.start_append_~pointerToList#1.base_17|) (<= 4 (select |#length| |v_ULTIMATE.start_append_~pointerToList#1.base_17|)) (= (select |#valid| |v_ULTIMATE.start_append_~pointerToList#1.base_17|) 1))) (<= 2 |ULTIMATE.start_main_~#list~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1) (or (< (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) 0) 4) 0) (< (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) 0) 8))) (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) 0) 0))))' at error location [2024-11-13 23:34:31,910 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-13 23:34:31,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 23:34:31,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-13 23:34:31,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935045166] [2024-11-13 23:34:31,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 23:34:31,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 23:34:31,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:34:31,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 23:34:31,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=861, Unknown=0, NotChecked=0, Total=992 [2024-11-13 23:34:31,912 INFO L87 Difference]: Start difference. First operand 190 states and 228 transitions. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:34:32,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:34:32,186 INFO L93 Difference]: Finished difference Result 194 states and 229 transitions. [2024-11-13 23:34:32,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 23:34:32,186 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 0 states have call successors, (0), 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-13 23:34:32,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:34:32,187 INFO L225 Difference]: With dead ends: 194 [2024-11-13 23:34:32,187 INFO L226 Difference]: Without dead ends: 194 [2024-11-13 23:34:32,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 61 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=131, Invalid=861, Unknown=0, NotChecked=0, Total=992 [2024-11-13 23:34:32,188 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 4 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 23:34:32,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 256 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 23:34:32,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-13 23:34:32,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2024-11-13 23:34:32,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 175 states have (on average 1.3085714285714285) internal successors, (229), 193 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:34:32,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 229 transitions. [2024-11-13 23:34:32,199 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 229 transitions. Word has length 30 [2024-11-13 23:34:32,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:34:32,200 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 229 transitions. [2024-11-13 23:34:32,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:34:32,200 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 229 transitions. [2024-11-13 23:34:32,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-13 23:34:32,201 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:34:32,201 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-13 23:34:32,223 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-13 23:34:32,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:34:32,402 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 23:34:32,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:34:32,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1107481786, now seen corresponding path program 1 times [2024-11-13 23:34:32,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:34:32,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523724694] [2024-11-13 23:34:32,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:34:32,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:34:32,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:34:33,472 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-13 23:34:33,472 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:34:33,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523724694] [2024-11-13 23:34:33,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523724694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:34:33,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:34:33,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-13 23:34:33,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016212891] [2024-11-13 23:34:33,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:34:33,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 23:34:33,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:34:33,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 23:34:33,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-13 23:34:33,474 INFO L87 Difference]: Start difference. First operand 194 states and 229 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-13 23:34:34,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:34:34,634 INFO L93 Difference]: Finished difference Result 217 states and 244 transitions. [2024-11-13 23:34:34,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 23:34:34,634 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-13 23:34:34,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:34:34,636 INFO L225 Difference]: With dead ends: 217 [2024-11-13 23:34:34,636 INFO L226 Difference]: Without dead ends: 211 [2024-11-13 23:34:34,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2024-11-13 23:34:34,637 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 81 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-13 23:34:34,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 333 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-13 23:34:34,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-13 23:34:34,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2024-11-13 23:34:34,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 175 states have (on average 1.2914285714285714) internal successors, (226), 193 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:34:34,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 226 transitions. [2024-11-13 23:34:34,643 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 226 transitions. Word has length 30 [2024-11-13 23:34:34,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:34:34,643 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 226 transitions. [2024-11-13 23:34:34,644 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-13 23:34:34,644 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 226 transitions. [2024-11-13 23:34:34,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-13 23:34:34,644 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:34:34,644 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-13 23:34:34,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-13 23:34:34,645 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 23:34:34,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:34:34,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1901988872, now seen corresponding path program 1 times [2024-11-13 23:34:34,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:34:34,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668965849] [2024-11-13 23:34:34,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:34:34,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:34:34,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:34:36,121 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-13 23:34:36,122 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:34:36,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668965849] [2024-11-13 23:34:36,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668965849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:34:36,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:34:36,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-13 23:34:36,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656390449] [2024-11-13 23:34:36,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:34:36,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 23:34:36,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:34:36,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 23:34:36,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-13 23:34:36,123 INFO L87 Difference]: Start difference. First operand 194 states and 226 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-13 23:34:37,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:34:37,827 INFO L93 Difference]: Finished difference Result 210 states and 235 transitions. [2024-11-13 23:34:37,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 23:34:37,827 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-13 23:34:37,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:34:37,828 INFO L225 Difference]: With dead ends: 210 [2024-11-13 23:34:37,828 INFO L226 Difference]: Without dead ends: 210 [2024-11-13 23:34:37,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2024-11-13 23:34:37,829 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 76 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-13 23:34:37,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 232 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-13 23:34:37,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-13 23:34:37,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 196. [2024-11-13 23:34:37,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 177 states have (on average 1.2881355932203389) internal successors, (228), 195 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:34:37,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 228 transitions. [2024-11-13 23:34:37,835 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 228 transitions. Word has length 30 [2024-11-13 23:34:37,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:34:37,836 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 228 transitions. [2024-11-13 23:34:37,836 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-13 23:34:37,836 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 228 transitions. [2024-11-13 23:34:37,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-13 23:34:37,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:34:37,837 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-13 23:34:37,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-13 23:34:37,837 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 23:34:37,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:34:37,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1167886940, now seen corresponding path program 1 times [2024-11-13 23:34:37,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:34:37,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273747192] [2024-11-13 23:34:37,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:34:37,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:34:37,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:34:38,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-13 23:34:38,168 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:34:38,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273747192] [2024-11-13 23:34:38,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273747192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:34:38,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:34:38,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 23:34:38,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399133306] [2024-11-13 23:34:38,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:34:38,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 23:34:38,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:34:38,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 23:34:38,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 23:34:38,171 INFO L87 Difference]: Start difference. First operand 196 states and 228 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-13 23:34:38,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:34:38,708 INFO L93 Difference]: Finished difference Result 211 states and 232 transitions. [2024-11-13 23:34:38,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 23:34:38,709 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-13 23:34:38,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:34:38,710 INFO L225 Difference]: With dead ends: 211 [2024-11-13 23:34:38,710 INFO L226 Difference]: Without dead ends: 211 [2024-11-13 23:34:38,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-13 23:34:38,711 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 107 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 23:34:38,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 155 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 23:34:38,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-13 23:34:38,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 193. [2024-11-13 23:34:38,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 174 states have (on average 1.2988505747126438) internal successors, (226), 192 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:34:38,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 226 transitions. [2024-11-13 23:34:38,717 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 226 transitions. Word has length 31 [2024-11-13 23:34:38,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:34:38,717 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 226 transitions. [2024-11-13 23:34:38,717 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-13 23:34:38,718 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 226 transitions. [2024-11-13 23:34:38,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-13 23:34:38,718 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:34:38,718 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-13 23:34:38,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-13 23:34:38,719 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-13 23:34:38,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:34:38,719 INFO L85 PathProgramCache]: Analyzing trace with hash -151477994, now seen corresponding path program 1 times [2024-11-13 23:34:38,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:34:38,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106851571] [2024-11-13 23:34:38,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:34:38,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:34:38,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:34:41,056 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-13 23:34:41,056 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:34:41,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106851571] [2024-11-13 23:34:41,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106851571] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:34:41,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103456363] [2024-11-13 23:34:41,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:34:41,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:34:41,056 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:34:41,058 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:34:41,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 23:34:41,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:34:41,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-13 23:34:41,236 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:34:41,698 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-13 23:34:41,840 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 23:34:41,841 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-13 23:34:42,206 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:34:42,207 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-13 23:34:42,564 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-13 23:34:42,785 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-13 23:34:43,703 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-13 23:34:44,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:34:44,189 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:34:44,207 INFO L349 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2024-11-13 23:34:44,207 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-13 23:34:44,441 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:34:44,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-13 23:34:44,448 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-13 23:34:44,448 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:34:44,892 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-13 23:34:47,113 INFO L349 Elim1Store]: treesize reduction 364, result has 41.6 percent of original size [2024-11-13 23:34:47,114 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 6955 treesize of output 3302 [2024-11-13 23:34:48,266 INFO L349 Elim1Store]: treesize reduction 169, result has 44.8 percent of original size [2024-11-13 23:34:48,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 2233 treesize of output 2222 [2024-11-13 23:34:48,791 INFO L349 Elim1Store]: treesize reduction 8, result has 92.1 percent of original size [2024-11-13 23:34:48,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 2157 treesize of output 2110 [2024-11-13 23:34:59,461 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 15 treesize of output 11 [2024-11-13 23:35:02,460 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 23:35:02,460 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 15 treesize of output 11 [2024-11-13 23:35:02,802 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-13 23:35:04,433 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-13 23:35:05,018 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2024-11-13 23:35:05,018 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 31 treesize of output 33 [2024-11-13 23:35:10,668 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 23:35:10,669 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 119 treesize of output 113 [2024-11-13 23:35:11,326 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 23:35:11,327 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 1 [2024-11-13 23:35:12,286 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 85 treesize of output 79 [2024-11-13 23:35:12,694 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 15 treesize of output 11 [2024-11-13 23:35:14,358 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 585 treesize of output 571 [2024-11-13 23:35:14,897 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-13 23:35:15,038 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 221 treesize of output 215 [2024-11-13 23:35:15,378 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 45 treesize of output 39 [2024-11-13 23:35:16,108 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-13 23:35:16,185 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-13 23:35:16,688 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-13 23:35:18,082 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-13 23:35:18,110 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-13 23:35:18,149 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-13 23:35:19,114 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-13 23:35:19,455 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-13 23:35:19,886 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-13 23:35:21,214 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-13 23:35:21,258 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-13 23:35:21,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-13 23:35:21,653 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 23:35:21,653 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 336 treesize of output 1 [2024-11-13 23:35:21,676 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-13 23:35:21,692 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-13 23:35:21,787 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 23:35:21,788 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 168 treesize of output 1 [2024-11-13 23:35:28,342 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 519 treesize of output 507 [2024-11-13 23:35:29,676 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2024-11-13 23:35:29,677 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 477 treesize of output 471 [2024-11-13 23:35:30,953 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-13 23:35:30,953 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 347 treesize of output 340 [2024-11-13 23:35:31,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:35:31,487 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 53 treesize of output 49 [2024-11-13 23:35:31,589 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:35:31,589 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 19 treesize of output 23 [2024-11-13 23:35:31,759 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-13 23:35:32,002 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2024-11-13 23:35:32,002 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 164 treesize of output 1 [2024-11-13 23:35:32,861 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 15 treesize of output 11 [2024-11-13 23:35:33,029 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 134 treesize of output 128 [2024-11-13 23:35:33,525 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-13 23:35:33,553 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-13 23:35:33,600 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 204 treesize of output 194 [2024-11-13 23:35:34,017 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 208 treesize of output 200 [2024-11-13 23:35:38,543 INFO L349 Elim1Store]: treesize reduction 24, result has 51.0 percent of original size [2024-11-13 23:35:38,544 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 96 treesize of output 106 [2024-11-13 23:35:39,013 INFO L349 Elim1Store]: treesize reduction 13, result has 73.5 percent of original size [2024-11-13 23:35:39,013 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 351 treesize of output 358 [2024-11-13 23:35:41,756 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:35:41,765 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:35:41,767 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:35:41,795 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:35:41,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2024-11-13 23:35:41,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:35:41,995 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 109 treesize of output 121 [2024-11-13 23:35:42,329 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:35:42,335 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-13 23:35:42,493 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:35:42,503 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:35:42,538 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-13 23:35:42,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 68 treesize of output 1 [2024-11-13 23:35:42,971 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2024-11-13 23:35:42,972 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 244 treesize of output 1 [2024-11-13 23:35:43,400 INFO L349 Elim1Store]: treesize reduction 24, result has 51.0 percent of original size [2024-11-13 23:35:43,400 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 187 treesize of output 195 [2024-11-13 23:35:47,184 INFO L349 Elim1Store]: treesize reduction 8, result has 89.0 percent of original size [2024-11-13 23:35:47,184 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 1252 treesize of output 1208 [2024-11-13 23:35:47,665 INFO L349 Elim1Store]: treesize reduction 8, result has 89.0 percent of original size [2024-11-13 23:35:47,666 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 1210 treesize of output 1164 [2024-11-13 23:36:28,560 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:36:28,561 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 134 treesize of output 136 [2024-11-13 23:36:28,726 INFO L349 Elim1Store]: treesize reduction 16, result has 61.0 percent of original size [2024-11-13 23:36:28,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 148 treesize of output 152 [2024-11-13 23:36:30,566 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:36:30,566 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 66 treesize of output 68 [2024-11-13 23:36:31,058 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-13 23:36:31,118 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-13 23:36:31,168 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:36:31,168 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-13 23:36:31,425 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:36:31,425 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 307 treesize of output 315 [2024-11-13 23:36:35,831 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:36:35,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 162 treesize of output 580 [2024-11-13 23:38:58,613 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-13 23:38:58,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103456363] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 23:38:58,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1230493725] [2024-11-13 23:38:58,615 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2024-11-13 23:38:58,615 INFO L166 IcfgInterpreter]: Building call graph [2024-11-13 23:38:58,616 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-13 23:38:58,616 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-13 23:38:58,616 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-13 23:39:03,788 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-13 23:39:47,050 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '10965#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_main_old_#valid#1_11| (Array Int Int))) (not (= |v_ULTIMATE.start_main_old_#valid#1_11| |#valid|))) (exists ((|v_#valid_141| (Array Int Int)) (|v_ULTIMATE.start_main_~#list~0#1.base_30| Int)) (and (= (store |v_#valid_141| |v_ULTIMATE.start_main_~#list~0#1.base_30| 0) |#valid|) (<= 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|)) (= (select |v_#valid_141| |v_ULTIMATE.start_main_~#list~0#1.base_30|) 1) (or (and (exists ((|v_ULTIMATE.start_create_data_#t~nondet3#1_25| Int)) (and (<= |v_ULTIMATE.start_create_data_#t~nondet3#1_25| 2147483647) (not (= |v_ULTIMATE.start_create_data_#t~nondet3#1_25| 0)) (<= 0 (+ |v_ULTIMATE.start_create_data_#t~nondet3#1_25| 2147483648)))) (exists ((|v_#memory_$Pointer$.offset_148| (Array Int (Array Int Int))) (|v_ULTIMATE.start_append_~pointerToList#1.base_24| Int) (|v_#memory_int_123| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_158| (Array Int (Array Int Int))) (|v_#memory_int_124| (Array Int (Array Int Int)))) (and (= |v_#memory_int_124| (store |v_#memory_int_123| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_24|) 0) (store (select |v_#memory_int_123| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_24|) 0)) 0 (select (select |v_#memory_int_124| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_24|) 0)) 0)))) (<= 2 |v_ULTIMATE.start_append_~pointerToList#1.base_24|) (= |#memory_int| (store |v_#memory_int_124| |v_ULTIMATE.start_append_~pointerToList#1.base_24| (store (select |v_#memory_int_124| |v_ULTIMATE.start_append_~pointerToList#1.base_24|) 0 (select (select |#memory_int| |v_ULTIMATE.start_append_~pointerToList#1.base_24|) 0)))) (= |#memory_$Pointer$.base| (store (store |v_#memory_$Pointer$.base_158| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_24|) 0) (store (select |v_#memory_$Pointer$.base_158| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_24|) 0)) 0 0)) |v_ULTIMATE.start_append_~pointerToList#1.base_24| (store (select (store |v_#memory_$Pointer$.base_158| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_24|) 0) (store (select |v_#memory_$Pointer$.base_158| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_24|) 0)) 0 0)) |v_ULTIMATE.start_append_~pointerToList#1.base_24|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_24|) 0)))) (= (select |v_#valid_141| |v_ULTIMATE.start_append_~pointerToList#1.base_24|) 1) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_148| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_24|) 0) (store (select |v_#memory_$Pointer$.offset_148| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_24|) 0)) 0 0)) |v_ULTIMATE.start_append_~pointerToList#1.base_24| (store (select (store |v_#memory_$Pointer$.offset_148| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_24|) 0) (store (select |v_#memory_$Pointer$.offset_148| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_24|) 0)) 0 0)) |v_ULTIMATE.start_append_~pointerToList#1.base_24|) 0 0))) (= (select |v_#valid_141| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_24|) 0)) 1) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_24|) 0))) (<= 4 (select |#length| |v_ULTIMATE.start_append_~pointerToList#1.base_24|))))) (and (exists ((|v_ULTIMATE.start_main_#t~mem18#1.base_25| Int) (|v_#memory_$Pointer$.base_162| (Array Int (Array Int Int))) (|v_#valid_140| (Array Int Int)) (|v_#memory_$Pointer$.offset_152| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~mem18#1.offset_24| Int)) (and (= (select (select |v_#memory_$Pointer$.base_162| (select (select |v_#memory_$Pointer$.base_162| |v_ULTIMATE.start_main_~#list~0#1.base_30|) 0)) 0) 0) (<= (+ (select (select |v_#memory_$Pointer$.base_162| |v_ULTIMATE.start_main_~#list~0#1.base_30|) 0) 1) |#StackHeapBarrier|) (<= (+ |v_ULTIMATE.start_main_#t~mem18#1.offset_24| 8) (select |#length| |v_ULTIMATE.start_main_#t~mem18#1.base_25|)) (= (select (select |v_#memory_$Pointer$.offset_152| |v_ULTIMATE.start_main_~#list~0#1.base_30|) 0) 0) (= (select |v_#valid_140| |v_ULTIMATE.start_main_#t~mem18#1.base_25|) 1) (<= 4 (select |#length| (select (select |v_#memory_$Pointer$.base_162| |v_ULTIMATE.start_main_~#list~0#1.base_30|) 0))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_162| |v_ULTIMATE.start_main_~#list~0#1.base_30| (store (select |v_#memory_$Pointer$.base_162| |v_ULTIMATE.start_main_~#list~0#1.base_30|) 0 (select (select |v_#memory_$Pointer$.base_162| |v_ULTIMATE.start_main_#t~mem18#1.base_25|) (+ |v_ULTIMATE.start_main_#t~mem18#1.offset_24| 4))))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_152| |v_ULTIMATE.start_main_~#list~0#1.base_30| (store (select |v_#memory_$Pointer$.offset_152| |v_ULTIMATE.start_main_~#list~0#1.base_30|) 0 (select (select |v_#memory_$Pointer$.offset_152| |v_ULTIMATE.start_main_#t~mem18#1.base_25|) (+ |v_ULTIMATE.start_main_#t~mem18#1.offset_24| 4))))) (= (select |v_#valid_140| (select (select |v_#memory_$Pointer$.base_162| |v_ULTIMATE.start_main_~#list~0#1.base_30|) 0)) 1) (= (select (select |v_#memory_$Pointer$.offset_152| (select (select |v_#memory_$Pointer$.base_162| |v_ULTIMATE.start_main_~#list~0#1.base_30|) 0)) 0) 0) (= (store |v_#valid_140| (select (select |v_#memory_$Pointer$.base_162| |v_ULTIMATE.start_main_~#list~0#1.base_30|) 0) 0) |v_#valid_141|) (<= 0 (+ |v_ULTIMATE.start_main_#t~mem18#1.offset_24| 4)))) (exists ((|v_#memory_int_127| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_127| |v_ULTIMATE.start_main_~#list~0#1.base_30| (store (select |v_#memory_int_127| |v_ULTIMATE.start_main_~#list~0#1.base_30|) 0 (select (select |#memory_int| |v_ULTIMATE.start_main_~#list~0#1.base_30|) 0))))))) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~#list~0#1.base_30|) 0) 0))) (= |ULTIMATE.start_main_#res#1| 0))' at error location [2024-11-13 23:39:47,051 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-13 23:39:47,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 23:39:47,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 41 [2024-11-13 23:39:47,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297757491] [2024-11-13 23:39:47,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 23:39:47,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-13 23:39:47,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:39:47,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-13 23:39:47,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=3858, Unknown=27, NotChecked=0, Total=4160 [2024-11-13 23:39:47,054 INFO L87 Difference]: Start difference. First operand 193 states and 226 transitions. Second operand has 42 states, 42 states have (on average 2.1904761904761907) internal successors, (92), 41 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:39:56,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:39:56,712 INFO L93 Difference]: Finished difference Result 280 states and 314 transitions. [2024-11-13 23:39:56,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-13 23:39:56,713 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.1904761904761907) internal successors, (92), 41 states have internal predecessors, (92), 0 states have call successors, (0), 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-13 23:39:56,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:39:56,714 INFO L225 Difference]: With dead ends: 280 [2024-11-13 23:39:56,714 INFO L226 Difference]: Without dead ends: 280 [2024-11-13 23:39:56,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2127 ImplicationChecksByTransitivity, 52.7s TimeCoverageRelationStatistics Valid=673, Invalid=6782, Unknown=27, NotChecked=0, Total=7482 [2024-11-13 23:39:56,717 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 450 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 1486 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 1515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-11-13 23:39:56,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 760 Invalid, 1515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1486 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-11-13 23:39:56,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-11-13 23:39:56,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 201. [2024-11-13 23:39:56,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 182 states have (on average 1.2857142857142858) internal successors, (234), 200 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:39:56,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 234 transitions. [2024-11-13 23:39:56,724 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 234 transitions. Word has length 34 [2024-11-13 23:39:56,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:39:56,725 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 234 transitions. [2024-11-13 23:39:56,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.1904761904761907) internal successors, (92), 41 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:39:56,725 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 234 transitions. [2024-11-13 23:39:56,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-13 23:39:56,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:39:56,726 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-13 23:39:56,749 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-13 23:39:56,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:39:56,927 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-13 23:39:56,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:39:56,927 INFO L85 PathProgramCache]: Analyzing trace with hash -151478022, now seen corresponding path program 1 times [2024-11-13 23:39:56,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:39:56,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278831646] [2024-11-13 23:39:56,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:39:56,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:39:56,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:39:59,170 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-13 23:39:59,170 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:39:59,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278831646] [2024-11-13 23:39:59,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278831646] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:39:59,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268387967] [2024-11-13 23:39:59,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:39:59,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:39:59,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:39:59,173 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:39:59,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 23:39:59,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:39:59,350 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-13 23:39:59,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:39:59,467 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-13 23:39:59,958 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-13 23:40:00,216 INFO L349 Elim1Store]: treesize reduction 64, result has 29.7 percent of original size [2024-11-13 23:40:00,216 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-13 23:40:00,652 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-13 23:40:01,038 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-13 23:40:01,297 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-13 23:40:02,129 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-13 23:40:02,607 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-11-13 23:40:02,607 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-13 23:40:02,813 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:40:02,813 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-13 23:40:03,111 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-13 23:40:03,202 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-13 23:40:03,203 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:40:03,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-13 23:40:06,810 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-13 23:40:08,310 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-13 23:40:08,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268387967] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 23:40:08,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [7362435] [2024-11-13 23:40:08,312 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2024-11-13 23:40:08,312 INFO L166 IcfgInterpreter]: Building call graph [2024-11-13 23:40:08,313 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-13 23:40:08,313 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-13 23:40:08,313 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-13 23:40:17,314 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-13 23:41:03,141 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '11756#(and (exists ((|v_ULTIMATE.start_main_#t~mem18#1.base_31| Int)) (not (= (select |#valid| |v_ULTIMATE.start_main_#t~mem18#1.base_31|) 1))) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#list~0#1.base|))' at error location [2024-11-13 23:41:03,142 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-13 23:41:03,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 23:41:03,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 44 [2024-11-13 23:41:03,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261544186] [2024-11-13 23:41:03,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 23:41:03,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-13 23:41:03,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:41:03,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-13 23:41:03,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=3955, Unknown=23, NotChecked=0, Total=4290 [2024-11-13 23:41:03,145 INFO L87 Difference]: Start difference. First operand 201 states and 234 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-13 23:41:10,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:41:10,962 INFO L93 Difference]: Finished difference Result 261 states and 294 transitions. [2024-11-13 23:41:10,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-13 23:41:10,963 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-13 23:41:10,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:41:10,964 INFO L225 Difference]: With dead ends: 261 [2024-11-13 23:41:10,965 INFO L226 Difference]: Without dead ends: 261 [2024-11-13 23:41:10,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2117 ImplicationChecksByTransitivity, 56.3s TimeCoverageRelationStatistics Valid=661, Invalid=6456, Unknown=23, NotChecked=0, Total=7140 [2024-11-13 23:41:10,967 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 348 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 1459 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 1515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-13 23:41:10,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 760 Invalid, 1515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1459 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-11-13 23:41:10,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-11-13 23:41:10,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 203. [2024-11-13 23:41:10,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 184 states have (on average 1.2880434782608696) internal successors, (237), 202 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:41:10,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 237 transitions. [2024-11-13 23:41:10,973 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 237 transitions. Word has length 34 [2024-11-13 23:41:10,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:41:10,974 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 237 transitions. [2024-11-13 23:41:10,974 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-13 23:41:10,974 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 237 transitions. [2024-11-13 23:41:10,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-13 23:41:10,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:41:10,974 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-13 23:41:10,999 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-13 23:41:11,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:41:11,175 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-13 23:41:11,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:41:11,175 INFO L85 PathProgramCache]: Analyzing trace with hash -151478021, now seen corresponding path program 1 times [2024-11-13 23:41:11,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:41:11,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985844956] [2024-11-13 23:41:11,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:41:11,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:41:11,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:41:13,899 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-13 23:41:13,899 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:41:13,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985844956] [2024-11-13 23:41:13,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985844956] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:41:13,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056223915] [2024-11-13 23:41:13,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:41:13,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:41:13,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:41:13,901 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:41:13,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 23:41:14,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:41:14,093 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 86 conjuncts are in the unsatisfiable core [2024-11-13 23:41:14,098 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:41:14,211 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-13 23:41:14,246 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-13 23:41:14,641 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-13 23:41:14,655 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-13 23:41:14,886 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-13 23:41:14,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2024-11-13 23:41:14,928 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-13 23:41:14,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 15 treesize of output 15 [2024-11-13 23:41:15,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:41:15,370 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-13 23:41:15,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:41:15,432 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2024-11-13 23:41:15,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:41:15,841 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-13 23:41:15,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:41:15,875 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-13 23:41:16,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:41:16,123 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-13 23:41:16,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:41:16,159 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-13 23:41:17,644 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:41:17,644 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 69 treesize of output 39 [2024-11-13 23:41:17,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:41:17,657 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-13 23:41:17,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:41:17,997 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-13 23:41:18,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:41:18,015 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-13 23:41:18,149 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-13 23:41:18,150 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:41:19,647 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (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 .cse3 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (and (forall ((v_ArrVal_1489 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~pointerToList#1.base| v_ArrVal_1489))) (or (< 0 (+ 5 (select (select .cse0 .cse1) 4))) (not (= (select (select .cse0 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 0))))) (forall ((v_ArrVal_1489 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~pointerToList#1.base| v_ArrVal_1489))) (or (< (+ 7 (select (select .cse2 .cse1) 4)) (select |c_#length| (select (select .cse3 .cse1) 4))) (not (= (select (select .cse2 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 0)))))))) is different from false [2024-11-13 23:41:22,268 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (+ |c_ULTIMATE.start_append_~node~0#1.offset| 4))) (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~node~0#1.base|) .cse8 |c_ULTIMATE.start_append_#t~mem14#1.base|)) (.cse3 (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~node~0#1.base|) .cse8 |c_ULTIMATE.start_append_#t~mem14#1.offset|))) (and (forall ((v_ArrVal_1489 (Array Int Int)) (|ULTIMATE.start_append_#t~ret15#1.base| Int) (|ULTIMATE.start_append_#t~ret15#1.offset| Int)) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~node~0#1.base| (store .cse3 |c_ULTIMATE.start_append_~node~0#1.offset| |ULTIMATE.start_append_#t~ret15#1.offset|)) |c_ULTIMATE.start_append_~pointerToList#1.base| v_ArrVal_1489))) (or (< 0 (+ (select (select .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~node~0#1.base| (store .cse2 |c_ULTIMATE.start_append_~node~0#1.offset| |ULTIMATE.start_append_#t~ret15#1.base|)))) (store .cse1 |c_ULTIMATE.start_append_~pointerToList#1.base| (store (select .cse1 |c_ULTIMATE.start_append_~pointerToList#1.base|) |c_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|)) 4) 5)) (not (= (select (select .cse0 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 0))))) (forall ((v_ArrVal_1489 (Array Int Int)) (|ULTIMATE.start_append_#t~ret15#1.base| Int) (|ULTIMATE.start_append_#t~ret15#1.offset| Int)) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~node~0#1.base| (store .cse3 |c_ULTIMATE.start_append_~node~0#1.offset| |ULTIMATE.start_append_#t~ret15#1.offset|)) |c_ULTIMATE.start_append_~pointerToList#1.base| v_ArrVal_1489))) (or (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~node~0#1.base| (store .cse2 |c_ULTIMATE.start_append_~node~0#1.offset| |ULTIMATE.start_append_#t~ret15#1.base|)))) (store .cse7 |c_ULTIMATE.start_append_~pointerToList#1.base| (store (select .cse7 |c_ULTIMATE.start_append_~pointerToList#1.base|) |c_ULTIMATE.start_append_~pointerToList#1.offset| |c_ULTIMATE.start_append_~node~0#1.base|))))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (< (+ 7 (select (select .cse4 .cse5) 4)) (select |c_#length| (select (select .cse6 .cse5) 4))))) (not (= (select (select .cse4 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 0)))))))) is different from false [2024-11-13 23:41:23,913 INFO L349 Elim1Store]: treesize reduction 249, result has 34.6 percent of original size [2024-11-13 23:41:23,914 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-13 23:41:24,195 INFO L349 Elim1Store]: treesize reduction 11, result has 80.4 percent of original size [2024-11-13 23:41:24,195 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 270 treesize of output 274 [2024-11-13 23:41:24,250 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:41:24,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 72 [2024-11-13 23:41:24,826 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:41:24,826 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-13 23:41:25,198 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:41:25,199 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 107 treesize of output 103 [2024-11-13 23:41:25,524 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-13 23:41:26,648 INFO L349 Elim1Store]: treesize reduction 493, result has 33.2 percent of original size [2024-11-13 23:41:26,649 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-13 23:41:26,974 INFO L349 Elim1Store]: treesize reduction 40, result has 50.0 percent of original size [2024-11-13 23:41:26,974 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 724 treesize of output 707 [2024-11-13 23:41:27,098 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:41:27,098 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 230 treesize of output 232 [2024-11-13 23:41:27,152 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:41:27,153 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-13 23:41:27,258 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-13 23:41:27,534 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-13 23:41:27,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:41:27,832 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-13 23:41:28,206 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2024-11-13 23:41:28,207 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-13 23:41:28,500 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 23:41:28,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 13 [2024-11-13 23:41:28,725 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2024-11-13 23:41:28,725 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-13 23:41:28,916 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:41:28,916 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 103 treesize of output 111 [2024-11-13 23:41:29,099 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:41:29,099 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 158 treesize of output 168 [2024-11-13 23:41:29,258 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:41:29,258 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 44 treesize of output 46 [2024-11-13 23:41:31,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-13 23:41:31,618 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-13 23:41:31,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056223915] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 23:41:31,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [896381573] [2024-11-13 23:41:31,620 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2024-11-13 23:41:31,620 INFO L166 IcfgInterpreter]: Building call graph [2024-11-13 23:41:31,620 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-13 23:41:31,621 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-13 23:41:31,621 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-13 23:41:40,788 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-13 23:42:15,138 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '12524#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#list~0#1.base|))' at error location [2024-11-13 23:42:15,138 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-13 23:42:15,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 23:42:15,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 44 [2024-11-13 23:42:15,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888724611] [2024-11-13 23:42:15,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 23:42:15,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-13 23:42:15,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:42:15,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-13 23:42:15,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=3781, Unknown=27, NotChecked=250, Total=4290 [2024-11-13 23:42:15,141 INFO L87 Difference]: Start difference. First operand 203 states and 237 transitions. Second operand has 46 states, 45 states have (on average 2.2666666666666666) internal successors, (102), 45 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:42:26,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:42:26,781 INFO L93 Difference]: Finished difference Result 275 states and 311 transitions. [2024-11-13 23:42:26,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-13 23:42:26,783 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.2666666666666666) internal successors, (102), 45 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-13 23:42:26,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:42:26,784 INFO L225 Difference]: With dead ends: 275 [2024-11-13 23:42:26,784 INFO L226 Difference]: Without dead ends: 275 [2024-11-13 23:42:26,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 85 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1938 ImplicationChecksByTransitivity, 47.2s TimeCoverageRelationStatistics Valid=638, Invalid=6483, Unknown=27, NotChecked=334, Total=7482 [2024-11-13 23:42:26,786 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 360 mSDsluCounter, 1022 mSDsCounter, 0 mSdLazyCounter, 2022 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 2413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 2022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 354 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2024-11-13 23:42:26,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 1068 Invalid, 2413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 2022 Invalid, 0 Unknown, 354 Unchecked, 7.0s Time] [2024-11-13 23:42:26,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-13 23:42:26,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 203. [2024-11-13 23:42:26,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 184 states have (on average 1.2771739130434783) internal successors, (235), 202 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:42:26,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 235 transitions. [2024-11-13 23:42:26,791 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 235 transitions. Word has length 34 [2024-11-13 23:42:26,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:42:26,791 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 235 transitions. [2024-11-13 23:42:26,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.2666666666666666) internal successors, (102), 45 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:42:26,792 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 235 transitions. [2024-11-13 23:42:26,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-13 23:42:26,792 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:42:26,792 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:42:26,816 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-13 23:42:26,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:42:26,993 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 23:42:26,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:42:26,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1061631056, now seen corresponding path program 4 times [2024-11-13 23:42:26,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:42:26,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645517061] [2024-11-13 23:42:26,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:42:26,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:42:27,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:42:29,972 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:42:29,972 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:42:29,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645517061] [2024-11-13 23:42:29,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645517061] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:42:29,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189254356] [2024-11-13 23:42:29,972 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-13 23:42:29,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:42:29,972 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:42:29,974 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:42:29,975 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1b4257-cc14-426b-9c1a-2ce7b67ac433/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-13 23:42:30,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:42:30,177 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-11-13 23:42:30,182 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:42:30,189 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-13 23:42:30,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-13 23:42:30,236 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 23:42:30,237 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-13 23:42:30,278 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-13 23:42:30,292 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-13 23:42:30,540 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 23:42:30,540 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-13 23:42:30,549 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-13 23:42:30,960 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 23:42:30,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-13 23:42:30,969 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-13 23:42:31,369 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 23:42:31,369 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-13 23:42:31,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 23:42:31,810 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 23:42:31,810 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-13 23:42:31,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 23:42:32,258 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 23:42:32,259 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-13 23:42:32,279 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-13 23:42:32,703 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 23:42:32,703 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-13 23:42:32,717 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-13 23:42:33,170 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 23:42:33,170 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-13 23:42:33,178 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-13 23:42:33,642 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 23:42:33,642 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-13 23:42:33,650 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-13 23:42:33,896 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-13 23:42:33,909 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-13 23:42:34,070 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:42:34,070 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:42:34,721 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (.cse2 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4))) (and (forall ((v_ArrVal_1651 (Array Int Int)) (v_ArrVal_1650 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1651) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1650) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (forall ((v_ArrVal_1651 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1651) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 4)))))) is different from false [2024-11-13 23:42:34,768 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_1648 (Array Int Int)) (v_ArrVal_1651 (Array Int Int)) (v_ArrVal_1650 (Array Int Int)) (v_ArrVal_1649 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1648))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (<= (+ .cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1649) .cse1 v_ArrVal_1651) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1650) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1648 (Array Int Int)) (v_ArrVal_1651 (Array Int Int)) (v_ArrVal_1649 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1649) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1648) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_1651) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 8))))) is different from false [2024-11-13 23:42:34,797 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse2 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1648 (Array Int Int)) (v_ArrVal_1651 (Array Int Int)) (v_ArrVal_1649 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1649) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1648) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) v_ArrVal_1651) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 8))) (forall ((v_ArrVal_1648 (Array Int Int)) (v_ArrVal_1651 (Array Int Int)) (v_ArrVal_1650 (Array Int Int)) (v_ArrVal_1649 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1648))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1649) .cse3 v_ArrVal_1651) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 12) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_1650) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))))))))) is different from false [2024-11-13 23:42:34,859 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_1648 (Array Int Int)) (v_ArrVal_1647 (Array Int Int)) (v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1651 (Array Int Int)) (v_ArrVal_1649 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1646))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1647) .cse0 v_ArrVal_1649) (select (select (store .cse1 .cse0 v_ArrVal_1648) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_1651))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse3 12))) (forall ((v_ArrVal_1648 (Array Int Int)) (v_ArrVal_1647 (Array Int Int)) (v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1651 (Array Int Int)) (v_ArrVal_1650 (Array Int Int)) (v_ArrVal_1649 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1646))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_1648))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1647) .cse4 v_ArrVal_1649) .cse5 v_ArrVal_1651) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse3 16) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_1650) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))))))) is different from false [2024-11-13 23:42:35,331 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse3 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_1648 (Array Int Int)) (v_ArrVal_1647 (Array Int Int)) (v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1651 (Array Int Int)) (v_ArrVal_1649 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1644))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_1646))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1645) .cse0 v_ArrVal_1647) .cse1 v_ArrVal_1649) (select (select (store .cse2 .cse1 v_ArrVal_1648) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) v_ArrVal_1651))))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) .cse5 16))) (forall ((v_ArrVal_1648 (Array Int Int)) (v_ArrVal_1647 (Array Int Int)) (v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1651 (Array Int Int)) (v_ArrVal_1650 (Array Int Int)) (v_ArrVal_1649 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1644))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_1646))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_1648))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1645) .cse6 v_ArrVal_1647) .cse7 v_ArrVal_1649) .cse8 v_ArrVal_1651) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) .cse5 20) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_1650) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))))))))))) is different from false [2024-11-13 23:42:41,197 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse5 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_1648 (Array Int Int)) (v_ArrVal_1647 (Array Int Int)) (v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int)) (v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1651 (Array Int Int)) (v_ArrVal_1649 (Array Int Int))) (<= 0 (+ .cse0 20 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1643))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_1644))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_1646))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1642) .cse1 v_ArrVal_1645) .cse2 v_ArrVal_1647) .cse3 v_ArrVal_1649) (select (select (store .cse4 .cse3 v_ArrVal_1648) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5) v_ArrVal_1651))))))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5)))) (forall ((v_ArrVal_1648 (Array Int Int)) (v_ArrVal_1647 (Array Int Int)) (v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int)) (v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1651 (Array Int Int)) (v_ArrVal_1650 (Array Int Int)) (v_ArrVal_1649 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1643))) (let ((.cse8 (select (select .cse15 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse14 (store .cse15 .cse8 v_ArrVal_1644))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_1646))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_1648))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (<= (+ .cse0 (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1642) .cse8 v_ArrVal_1645) .cse9 v_ArrVal_1647) .cse10 v_ArrVal_1649) .cse11 v_ArrVal_1651) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5) 24) (select |c_#length| (select (select (store .cse12 .cse11 v_ArrVal_1650) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5)))))))))))))) is different from false [2024-11-13 23:42:44,218 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (and (forall ((v_ArrVal_1648 (Array Int Int)) (v_ArrVal_1647 (Array Int Int)) (v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int)) (v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1651 (Array Int Int)) (v_ArrVal_1650 (Array Int Int)) (v_ArrVal_1649 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1643))) (let ((.cse2 (select (select .cse10 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse9 (store .cse10 .cse2 v_ArrVal_1644))) (let ((.cse3 (select (select .cse9 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse8 (store .cse9 .cse3 v_ArrVal_1646))) (let ((.cse4 (select (select .cse8 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse7 (store .cse8 .cse4 v_ArrVal_1648))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (<= (+ .cse0 (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1642) .cse2 v_ArrVal_1645) .cse3 v_ArrVal_1647) .cse4 v_ArrVal_1649) .cse5 v_ArrVal_1651) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6) 24) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_1650) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6)))))))))))) (forall ((v_ArrVal_1648 (Array Int Int)) (v_ArrVal_1647 (Array Int Int)) (v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int)) (v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1651 (Array Int Int)) (v_ArrVal_1649 (Array Int Int))) (<= 0 (+ .cse0 (select (select (let ((.cse16 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1643))) (let ((.cse11 (select (select .cse16 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse15 (store .cse16 .cse11 v_ArrVal_1644))) (let ((.cse12 (select (select .cse15 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse14 (store .cse15 .cse12 v_ArrVal_1646))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1642) .cse11 v_ArrVal_1645) .cse12 v_ArrVal_1647) .cse13 v_ArrVal_1649) (select (select (store .cse14 .cse13 v_ArrVal_1648) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6) v_ArrVal_1651))))))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6) 20)))))) is different from false [2024-11-13 23:42:46,544 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse6 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_1648 (Array Int Int)) (v_ArrVal_1647 (Array Int Int)) (v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int)) (v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1641 (Array Int Int)) (v_ArrVal_1640 (Array Int Int)) (v_ArrVal_1651 (Array Int Int)) (v_ArrVal_1649 (Array Int Int))) (<= 0 (+ .cse0 (select (select (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1640))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse8 (store .cse9 .cse1 v_ArrVal_1643))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_1644))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse5 (store .cse7 .cse3 v_ArrVal_1646))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1641) .cse1 v_ArrVal_1642) .cse2 v_ArrVal_1645) .cse3 v_ArrVal_1647) .cse4 v_ArrVal_1649) (select (select (store .cse5 .cse4 v_ArrVal_1648) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6) v_ArrVal_1651))))))))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6) 24))) (forall ((v_ArrVal_1648 (Array Int Int)) (v_ArrVal_1647 (Array Int Int)) (v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int)) (v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1641 (Array Int Int)) (v_ArrVal_1640 (Array Int Int)) (v_ArrVal_1651 (Array Int Int)) (v_ArrVal_1650 (Array Int Int)) (v_ArrVal_1649 (Array Int Int))) (let ((.cse19 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1640))) (let ((.cse10 (select (select .cse19 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse18 (store .cse19 .cse10 v_ArrVal_1643))) (let ((.cse11 (select (select .cse18 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse17 (store .cse18 .cse11 v_ArrVal_1644))) (let ((.cse12 (select (select .cse17 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse16 (store .cse17 .cse12 v_ArrVal_1646))) (let ((.cse13 (select (select .cse16 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse15 (store .cse16 .cse13 v_ArrVal_1648))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (<= (+ .cse0 28 (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1641) .cse10 v_ArrVal_1642) .cse11 v_ArrVal_1645) .cse12 v_ArrVal_1647) .cse13 v_ArrVal_1649) .cse14 v_ArrVal_1651) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6)) (select |c_#length| (select (select (store .cse15 .cse14 v_ArrVal_1650) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6)))))))))))))))) is different from false [2024-11-13 23:42:48,934 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6)) (.cse7 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4))) (and (forall ((v_ArrVal_1648 (Array Int Int)) (v_ArrVal_1647 (Array Int Int)) (v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int)) (v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1641 (Array Int Int)) (v_ArrVal_1640 (Array Int Int)) (v_ArrVal_1651 (Array Int Int)) (v_ArrVal_1650 (Array Int Int)) (v_ArrVal_1649 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1640))) (let ((.cse1 (select (select .cse12 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse11 (store .cse12 .cse1 v_ArrVal_1643))) (let ((.cse2 (select (select .cse11 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse10 (store .cse11 .cse2 v_ArrVal_1644))) (let ((.cse3 (select (select .cse10 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse9 (store .cse10 .cse3 v_ArrVal_1646))) (let ((.cse4 (select (select .cse9 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse8 (store .cse9 .cse4 v_ArrVal_1648))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (<= (+ (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1641) .cse1 v_ArrVal_1642) .cse2 v_ArrVal_1645) .cse3 v_ArrVal_1647) .cse4 v_ArrVal_1649) .cse5 v_ArrVal_1651) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6) .cse7 28) (select |c_#length| (select (select (store .cse8 .cse5 v_ArrVal_1650) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6)))))))))))))) (forall ((v_ArrVal_1648 (Array Int Int)) (v_ArrVal_1647 (Array Int Int)) (v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int)) (v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1641 (Array Int Int)) (v_ArrVal_1640 (Array Int Int)) (v_ArrVal_1651 (Array Int Int)) (v_ArrVal_1649 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse20 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1640))) (let ((.cse13 (select (select .cse20 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse19 (store .cse20 .cse13 v_ArrVal_1643))) (let ((.cse14 (select (select .cse19 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse18 (store .cse19 .cse14 v_ArrVal_1644))) (let ((.cse15 (select (select .cse18 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse17 (store .cse18 .cse15 v_ArrVal_1646))) (let ((.cse16 (select (select .cse17 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (store (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1641) .cse13 v_ArrVal_1642) .cse14 v_ArrVal_1645) .cse15 v_ArrVal_1647) .cse16 v_ArrVal_1649) (select (select (store .cse17 .cse16 v_ArrVal_1648) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6) v_ArrVal_1651))))))))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6) .cse7 24)))))) is different from false [2024-11-13 23:42:51,274 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse7 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_1648 (Array Int Int)) (v_ArrVal_1647 (Array Int Int)) (v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int)) (v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1641 (Array Int Int)) (v_ArrVal_1640 (Array Int Int)) (v_ArrVal_1651 (Array Int Int)) (v_ArrVal_1650 (Array Int Int)) (v_ArrVal_1639 (Array Int Int)) (v_ArrVal_1638 (Array Int Int)) (v_ArrVal_1649 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1638))) (let ((.cse1 (select (select .cse13 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7))) (let ((.cse12 (store .cse13 .cse1 v_ArrVal_1640))) (let ((.cse2 (select (select .cse12 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7))) (let ((.cse11 (store .cse12 .cse2 v_ArrVal_1643))) (let ((.cse3 (select (select .cse11 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7))) (let ((.cse10 (store .cse11 .cse3 v_ArrVal_1644))) (let ((.cse4 (select (select .cse10 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7))) (let ((.cse9 (store .cse10 .cse4 v_ArrVal_1646))) (let ((.cse5 (select (select .cse9 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7))) (let ((.cse8 (store .cse9 .cse5 v_ArrVal_1648))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7))) (<= (+ 32 .cse0 (select (select (store (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1639) .cse1 v_ArrVal_1641) .cse2 v_ArrVal_1642) .cse3 v_ArrVal_1645) .cse4 v_ArrVal_1647) .cse5 v_ArrVal_1649) .cse6 v_ArrVal_1651) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7)) (select |c_#length| (select (select (store .cse8 .cse6 v_ArrVal_1650) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7)))))))))))))))) (forall ((v_ArrVal_1648 (Array Int Int)) (v_ArrVal_1647 (Array Int Int)) (v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int)) (v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1641 (Array Int Int)) (v_ArrVal_1640 (Array Int Int)) (v_ArrVal_1651 (Array Int Int)) (v_ArrVal_1639 (Array Int Int)) (v_ArrVal_1638 (Array Int Int)) (v_ArrVal_1649 (Array Int Int))) (<= 0 (+ .cse0 (select (select (let ((.cse23 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1638))) (let ((.cse14 (select (select .cse23 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7))) (let ((.cse22 (store .cse23 .cse14 v_ArrVal_1640))) (let ((.cse15 (select (select .cse22 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7))) (let ((.cse21 (store .cse22 .cse15 v_ArrVal_1643))) (let ((.cse16 (select (select .cse21 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7))) (let ((.cse20 (store .cse21 .cse16 v_ArrVal_1644))) (let ((.cse17 (select (select .cse20 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7))) (let ((.cse19 (store .cse20 .cse17 v_ArrVal_1646))) (let ((.cse18 (select (select .cse19 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7))) (store (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1639) .cse14 v_ArrVal_1641) .cse15 v_ArrVal_1642) .cse16 v_ArrVal_1645) .cse17 v_ArrVal_1647) .cse18 v_ArrVal_1649) (select (select (store .cse19 .cse18 v_ArrVal_1648) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7) v_ArrVal_1651))))))))))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7) 28))))) is different from false [2024-11-13 23:42:53,701 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (and (forall ((v_ArrVal_1648 (Array Int Int)) (v_ArrVal_1647 (Array Int Int)) (v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int)) (v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1641 (Array Int Int)) (v_ArrVal_1640 (Array Int Int)) (v_ArrVal_1651 (Array Int Int)) (v_ArrVal_1639 (Array Int Int)) (v_ArrVal_1638 (Array Int Int)) (v_ArrVal_1649 (Array Int Int))) (<= 0 (+ .cse0 28 (select (select (let ((.cse12 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1638))) (let ((.cse2 (select (select .cse12 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse11 (store .cse12 .cse2 v_ArrVal_1640))) (let ((.cse3 (select (select .cse11 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse10 (store .cse11 .cse3 v_ArrVal_1643))) (let ((.cse4 (select (select .cse10 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse9 (store .cse10 .cse4 v_ArrVal_1644))) (let ((.cse5 (select (select .cse9 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse7 (store .cse9 .cse5 v_ArrVal_1646))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (store (store (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1639) .cse2 v_ArrVal_1641) .cse3 v_ArrVal_1642) .cse4 v_ArrVal_1645) .cse5 v_ArrVal_1647) .cse6 v_ArrVal_1649) (select (select (store .cse7 .cse6 v_ArrVal_1648) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8) v_ArrVal_1651))))))))))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8)))) (forall ((v_ArrVal_1648 (Array Int Int)) (v_ArrVal_1647 (Array Int Int)) (v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int)) (v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1641 (Array Int Int)) (v_ArrVal_1640 (Array Int Int)) (v_ArrVal_1651 (Array Int Int)) (v_ArrVal_1650 (Array Int Int)) (v_ArrVal_1639 (Array Int Int)) (v_ArrVal_1638 (Array Int Int)) (v_ArrVal_1649 (Array Int Int))) (let ((.cse24 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1638))) (let ((.cse13 (select (select .cse24 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse23 (store .cse24 .cse13 v_ArrVal_1640))) (let ((.cse14 (select (select .cse23 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse22 (store .cse23 .cse14 v_ArrVal_1643))) (let ((.cse15 (select (select .cse22 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse21 (store .cse22 .cse15 v_ArrVal_1644))) (let ((.cse16 (select (select .cse21 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse20 (store .cse21 .cse16 v_ArrVal_1646))) (let ((.cse17 (select (select .cse20 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse19 (store .cse20 .cse17 v_ArrVal_1648))) (let ((.cse18 (select (select .cse19 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (<= (+ 32 .cse0 (select (select (store (store (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1639) .cse13 v_ArrVal_1641) .cse14 v_ArrVal_1642) .cse15 v_ArrVal_1645) .cse16 v_ArrVal_1647) .cse17 v_ArrVal_1649) .cse18 v_ArrVal_1651) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8)) (select |c_#length| (select (select (store .cse19 .cse18 v_ArrVal_1650) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))))))))))))))))))) is different from false [2024-11-13 23:42:56,446 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse8 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_1637 (Array Int Int)) (v_ArrVal_1648 (Array Int Int)) (v_ArrVal_1636 (Array Int Int)) (v_ArrVal_1647 (Array Int Int)) (v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int)) (v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1641 (Array Int Int)) (v_ArrVal_1640 (Array Int Int)) (v_ArrVal_1651 (Array Int Int)) (v_ArrVal_1650 (Array Int Int)) (v_ArrVal_1639 (Array Int Int)) (v_ArrVal_1638 (Array Int Int)) (v_ArrVal_1649 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1636))) (let ((.cse1 (select (select .cse15 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse14 (store .cse15 .cse1 v_ArrVal_1638))) (let ((.cse2 (select (select .cse14 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse13 (store .cse14 .cse2 v_ArrVal_1640))) (let ((.cse3 (select (select .cse13 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse12 (store .cse13 .cse3 v_ArrVal_1643))) (let ((.cse4 (select (select .cse12 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse11 (store .cse12 .cse4 v_ArrVal_1644))) (let ((.cse5 (select (select .cse11 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse10 (store .cse11 .cse5 v_ArrVal_1646))) (let ((.cse6 (select (select .cse10 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse9 (store .cse10 .cse6 v_ArrVal_1648))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (<= (+ .cse0 36 (select (select (store (store (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1637) .cse1 v_ArrVal_1639) .cse2 v_ArrVal_1641) .cse3 v_ArrVal_1642) .cse4 v_ArrVal_1645) .cse5 v_ArrVal_1647) .cse6 v_ArrVal_1649) .cse7 v_ArrVal_1651) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8)) (select |c_#length| (select (select (store .cse9 .cse7 v_ArrVal_1650) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8)))))))))))))))))) (forall ((v_ArrVal_1637 (Array Int Int)) (v_ArrVal_1648 (Array Int Int)) (v_ArrVal_1636 (Array Int Int)) (v_ArrVal_1647 (Array Int Int)) (v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int)) (v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1641 (Array Int Int)) (v_ArrVal_1640 (Array Int Int)) (v_ArrVal_1651 (Array Int Int)) (v_ArrVal_1639 (Array Int Int)) (v_ArrVal_1638 (Array Int Int)) (v_ArrVal_1649 (Array Int Int))) (<= 0 (+ 32 .cse0 (select (select (let ((.cse27 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1636))) (let ((.cse16 (select (select .cse27 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse26 (store .cse27 .cse16 v_ArrVal_1638))) (let ((.cse17 (select (select .cse26 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse25 (store .cse26 .cse17 v_ArrVal_1640))) (let ((.cse18 (select (select .cse25 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse24 (store .cse25 .cse18 v_ArrVal_1643))) (let ((.cse19 (select (select .cse24 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse23 (store .cse24 .cse19 v_ArrVal_1644))) (let ((.cse20 (select (select .cse23 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse22 (store .cse23 .cse20 v_ArrVal_1646))) (let ((.cse21 (select (select .cse22 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (store (store (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1637) .cse16 v_ArrVal_1639) .cse17 v_ArrVal_1641) .cse18 v_ArrVal_1642) .cse19 v_ArrVal_1645) .cse20 v_ArrVal_1647) .cse21 v_ArrVal_1649) (select (select (store .cse22 .cse21 v_ArrVal_1648) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8) v_ArrVal_1651))))))))))))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8)))))) is different from false [2024-11-13 23:42:59,169 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse14 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (and (forall ((v_ArrVal_1637 (Array Int Int)) (v_ArrVal_1648 (Array Int Int)) (v_ArrVal_1636 (Array Int Int)) (v_ArrVal_1647 (Array Int Int)) (v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int)) (v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1641 (Array Int Int)) (v_ArrVal_1640 (Array Int Int)) (v_ArrVal_1651 (Array Int Int)) (v_ArrVal_1639 (Array Int Int)) (v_ArrVal_1638 (Array Int Int)) (v_ArrVal_1649 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse13 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1636))) (let ((.cse1 (select (select .cse13 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse12 (store .cse13 .cse1 v_ArrVal_1638))) (let ((.cse2 (select (select .cse12 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse11 (store .cse12 .cse2 v_ArrVal_1640))) (let ((.cse3 (select (select .cse11 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse10 (store .cse11 .cse3 v_ArrVal_1643))) (let ((.cse4 (select (select .cse10 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse9 (store .cse10 .cse4 v_ArrVal_1644))) (let ((.cse5 (select (select .cse9 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse7 (store .cse9 .cse5 v_ArrVal_1646))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (store (store (store (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1637) .cse1 v_ArrVal_1639) .cse2 v_ArrVal_1641) .cse3 v_ArrVal_1642) .cse4 v_ArrVal_1645) .cse5 v_ArrVal_1647) .cse6 v_ArrVal_1649) (select (select (store .cse7 .cse6 v_ArrVal_1648) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8) v_ArrVal_1651))))))))))))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8) 32 .cse14))) (forall ((v_ArrVal_1637 (Array Int Int)) (v_ArrVal_1648 (Array Int Int)) (v_ArrVal_1636 (Array Int Int)) (v_ArrVal_1647 (Array Int Int)) (v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int)) (v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1641 (Array Int Int)) (v_ArrVal_1640 (Array Int Int)) (v_ArrVal_1651 (Array Int Int)) (v_ArrVal_1650 (Array Int Int)) (v_ArrVal_1639 (Array Int Int)) (v_ArrVal_1638 (Array Int Int)) (v_ArrVal_1649 (Array Int Int))) (let ((.cse28 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1636))) (let ((.cse15 (select (select .cse28 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse27 (store .cse28 .cse15 v_ArrVal_1638))) (let ((.cse16 (select (select .cse27 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse26 (store .cse27 .cse16 v_ArrVal_1640))) (let ((.cse17 (select (select .cse26 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse25 (store .cse26 .cse17 v_ArrVal_1643))) (let ((.cse18 (select (select .cse25 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse24 (store .cse25 .cse18 v_ArrVal_1644))) (let ((.cse19 (select (select .cse24 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse23 (store .cse24 .cse19 v_ArrVal_1646))) (let ((.cse20 (select (select .cse23 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse22 (store .cse23 .cse20 v_ArrVal_1648))) (let ((.cse21 (select (select .cse22 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (<= (+ (select (select (store (store (store (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1637) .cse15 v_ArrVal_1639) .cse16 v_ArrVal_1641) .cse17 v_ArrVal_1642) .cse18 v_ArrVal_1645) .cse19 v_ArrVal_1647) .cse20 v_ArrVal_1649) .cse21 v_ArrVal_1651) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8) .cse14 36) (select |c_#length| (select (select (store .cse22 .cse21 v_ArrVal_1650) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))))))))))))))))))))) is different from false [2024-11-13 23:42:59,251 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:42:59,252 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 2818 treesize of output 2819 [2024-11-13 23:42:59,281 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:42:59,281 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 2808 treesize of output 1549