./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstpncpy-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstpncpy-alloca-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash ddb0eb207fb72f46b2f9a0f11e334a77be9b4b455314fd1b26a90347e4178746 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 05:48:13,960 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 05:48:14,025 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf [2024-11-09 05:48:14,031 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 05:48:14,031 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 05:48:14,057 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 05:48:14,057 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 05:48:14,058 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 05:48:14,059 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 05:48:14,059 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 05:48:14,059 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 05:48:14,060 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 05:48:14,060 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 05:48:14,061 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 05:48:14,061 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 05:48:14,061 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 05:48:14,062 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 05:48:14,062 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 05:48:14,062 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 05:48:14,063 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 05:48:14,064 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 05:48:14,064 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 05:48:14,065 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 05:48:14,066 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 05:48:14,066 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 05:48:14,067 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 05:48:14,067 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 05:48:14,067 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 05:48:14,068 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 05:48:14,068 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 05:48:14,069 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 05:48:14,069 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 05:48:14,069 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 05:48:14,070 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 05:48:14,070 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 05:48:14,070 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 05:48:14,071 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 05:48:14,071 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 05:48:14,072 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:48:14,072 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 05:48:14,072 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 05:48:14,077 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 05:48:14,077 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 05:48:14,077 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 05:48:14,078 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 05:48:14,078 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 05:48:14,078 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ddb0eb207fb72f46b2f9a0f11e334a77be9b4b455314fd1b26a90347e4178746 [2024-11-09 05:48:14,357 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 05:48:14,383 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 05:48:14,386 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 05:48:14,388 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 05:48:14,390 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 05:48:14,391 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstpncpy-alloca-2.i Unable to find full path for "g++" [2024-11-09 05:48:16,583 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 05:48:16,888 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 05:48:16,888 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/sv-benchmarks/c/termination-memory-alloca/openbsd_cstpncpy-alloca-2.i [2024-11-09 05:48:16,910 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje/data/132383264/8f2187f57b8c4449bed8d034de371d0e/FLAG9bb135a2d [2024-11-09 05:48:16,933 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje/data/132383264/8f2187f57b8c4449bed8d034de371d0e [2024-11-09 05:48:16,937 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 05:48:16,939 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 05:48:16,940 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 05:48:16,941 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 05:48:16,948 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 05:48:16,951 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:48:16" (1/1) ... [2024-11-09 05:48:16,952 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a91ab32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:48:16, skipping insertion in model container [2024-11-09 05:48:16,953 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:48:16" (1/1) ... [2024-11-09 05:48:17,022 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 05:48:17,442 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 05:48:17,443 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 05:48:17,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:48:17,470 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 05:48:17,557 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:48:17,598 INFO L204 MainTranslator]: Completed translation [2024-11-09 05:48:17,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:48:17 WrapperNode [2024-11-09 05:48:17,599 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 05:48:17,602 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 05:48:17,602 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 05:48:17,603 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 05:48:17,613 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:48:17" (1/1) ... [2024-11-09 05:48:17,628 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:48:17" (1/1) ... [2024-11-09 05:48:17,655 INFO L138 Inliner]: procedures = 111, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 75 [2024-11-09 05:48:17,659 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 05:48:17,660 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 05:48:17,660 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 05:48:17,660 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 05:48:17,672 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:48:17" (1/1) ... [2024-11-09 05:48:17,673 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:48:17" (1/1) ... [2024-11-09 05:48:17,677 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:48:17" (1/1) ... [2024-11-09 05:48:17,678 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:48:17" (1/1) ... [2024-11-09 05:48:17,686 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:48:17" (1/1) ... [2024-11-09 05:48:17,691 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:48:17" (1/1) ... [2024-11-09 05:48:17,693 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:48:17" (1/1) ... [2024-11-09 05:48:17,694 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:48:17" (1/1) ... [2024-11-09 05:48:17,697 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 05:48:17,698 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 05:48:17,699 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 05:48:17,699 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 05:48:17,700 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:48:17" (1/1) ... [2024-11-09 05:48:17,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:48:17,730 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:48:17,747 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 05:48:17,750 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 05:48:17,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 05:48:17,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 05:48:17,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 05:48:17,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 05:48:17,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 05:48:17,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 05:48:17,934 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 05:48:17,936 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 05:48:18,264 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-11-09 05:48:18,264 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 05:48:18,352 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 05:48:18,352 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 05:48:18,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:48:18 BoogieIcfgContainer [2024-11-09 05:48:18,353 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 05:48:18,357 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 05:48:18,357 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 05:48:18,362 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 05:48:18,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 05:48:16" (1/3) ... [2024-11-09 05:48:18,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@287a6a88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:48:18, skipping insertion in model container [2024-11-09 05:48:18,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:48:17" (2/3) ... [2024-11-09 05:48:18,366 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@287a6a88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:48:18, skipping insertion in model container [2024-11-09 05:48:18,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:48:18" (3/3) ... [2024-11-09 05:48:18,368 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstpncpy-alloca-2.i [2024-11-09 05:48:18,394 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 05:48:18,394 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2024-11-09 05:48:18,459 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 05:48:18,469 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;@7940fa6c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 05:48:18,469 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-11-09 05:48:18,475 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:48:18,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-09 05:48:18,483 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:48:18,484 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-11-09 05:48:18,485 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 05:48:18,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:48:18,495 INFO L85 PathProgramCache]: Analyzing trace with hash 3458, now seen corresponding path program 1 times [2024-11-09 05:48:18,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:48:18,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147496735] [2024-11-09 05:48:18,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:48:18,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:48:18,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:48:18,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:48:18,974 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:48:18,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147496735] [2024-11-09 05:48:18,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147496735] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:48:18,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:48:18,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 05:48:18,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776247959] [2024-11-09 05:48:18,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:48:18,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:48:18,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:48:19,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:48:19,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:48:19,018 INFO L87 Difference]: Start difference. First operand has 24 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:48:19,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:48:19,076 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2024-11-09 05:48:19,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:48:19,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-11-09 05:48:19,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:48:19,090 INFO L225 Difference]: With dead ends: 23 [2024-11-09 05:48:19,090 INFO L226 Difference]: Without dead ends: 22 [2024-11-09 05:48:19,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:48:19,097 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 05:48:19,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 05:48:19,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-09 05:48:19,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-09 05:48:19,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:48:19,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2024-11-09 05:48:19,141 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 2 [2024-11-09 05:48:19,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:48:19,143 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2024-11-09 05:48:19,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:48:19,146 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2024-11-09 05:48:19,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-09 05:48:19,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:48:19,147 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-11-09 05:48:19,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 05:48:19,148 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 05:48:19,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:48:19,149 INFO L85 PathProgramCache]: Analyzing trace with hash 3459, now seen corresponding path program 1 times [2024-11-09 05:48:19,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:48:19,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692045361] [2024-11-09 05:48:19,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:48:19,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:48:19,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:48:19,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:48:19,503 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:48:19,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692045361] [2024-11-09 05:48:19,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692045361] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:48:19,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:48:19,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 05:48:19,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011058953] [2024-11-09 05:48:19,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:48:19,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:48:19,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:48:19,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:48:19,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:48:19,508 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:48:19,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:48:19,541 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2024-11-09 05:48:19,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:48:19,542 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-11-09 05:48:19,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:48:19,543 INFO L225 Difference]: With dead ends: 21 [2024-11-09 05:48:19,543 INFO L226 Difference]: Without dead ends: 21 [2024-11-09 05:48:19,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:48:19,545 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 05:48:19,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 05:48:19,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-09 05:48:19,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-09 05:48:19,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:48:19,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2024-11-09 05:48:19,551 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 2 [2024-11-09 05:48:19,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:48:19,551 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2024-11-09 05:48:19,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:48:19,552 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2024-11-09 05:48:19,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 05:48:19,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:48:19,553 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 05:48:19,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 05:48:19,554 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 05:48:19,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:48:19,555 INFO L85 PathProgramCache]: Analyzing trace with hash 104677759, now seen corresponding path program 1 times [2024-11-09 05:48:19,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:48:19,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470355254] [2024-11-09 05:48:19,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:48:19,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:48:19,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:48:19,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:48:19,700 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:48:19,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470355254] [2024-11-09 05:48:19,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470355254] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:48:19,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:48:19,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:48:19,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770242253] [2024-11-09 05:48:19,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:48:19,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:48:19,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:48:19,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:48:19,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:48:19,707 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:48:19,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:48:19,816 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2024-11-09 05:48:19,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 05:48:19,819 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-09 05:48:19,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:48:19,820 INFO L225 Difference]: With dead ends: 21 [2024-11-09 05:48:19,822 INFO L226 Difference]: Without dead ends: 21 [2024-11-09 05:48:19,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:48:19,824 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 16 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:48:19,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 32 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:48:19,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-09 05:48:19,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2024-11-09 05:48:19,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:48:19,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2024-11-09 05:48:19,835 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 5 [2024-11-09 05:48:19,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:48:19,836 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2024-11-09 05:48:19,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:48:19,837 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2024-11-09 05:48:19,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 05:48:19,837 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:48:19,837 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 05:48:19,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 05:48:19,838 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 05:48:19,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:48:19,839 INFO L85 PathProgramCache]: Analyzing trace with hash 104677760, now seen corresponding path program 1 times [2024-11-09 05:48:19,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:48:19,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047942060] [2024-11-09 05:48:19,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:48:19,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:48:19,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:48:20,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:48:20,224 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:48:20,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047942060] [2024-11-09 05:48:20,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047942060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:48:20,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:48:20,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:48:20,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431868320] [2024-11-09 05:48:20,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:48:20,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:48:20,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:48:20,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:48:20,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:48:20,229 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 6 states, 5 states have (on average 1.0) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:48:20,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:48:20,321 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2024-11-09 05:48:20,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:48:20,322 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.0) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-09 05:48:20,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:48:20,322 INFO L225 Difference]: With dead ends: 23 [2024-11-09 05:48:20,322 INFO L226 Difference]: Without dead ends: 23 [2024-11-09 05:48:20,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:48:20,324 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 1 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:48:20,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 61 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:48:20,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-09 05:48:20,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2024-11-09 05:48:20,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.5625) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:48:20,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2024-11-09 05:48:20,332 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 5 [2024-11-09 05:48:20,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:48:20,332 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2024-11-09 05:48:20,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.0) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:48:20,333 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2024-11-09 05:48:20,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 05:48:20,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:48:20,333 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 05:48:20,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 05:48:20,334 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 05:48:20,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:48:20,335 INFO L85 PathProgramCache]: Analyzing trace with hash 104718720, now seen corresponding path program 1 times [2024-11-09 05:48:20,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:48:20,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497180123] [2024-11-09 05:48:20,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:48:20,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:48:20,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:48:20,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:48:20,531 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:48:20,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497180123] [2024-11-09 05:48:20,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497180123] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:48:20,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:48:20,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:48:20,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65587011] [2024-11-09 05:48:20,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:48:20,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:48:20,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:48:20,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:48:20,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:48:20,536 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:48:20,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:48:20,568 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2024-11-09 05:48:20,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:48:20,573 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-09 05:48:20,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:48:20,574 INFO L225 Difference]: With dead ends: 27 [2024-11-09 05:48:20,574 INFO L226 Difference]: Without dead ends: 27 [2024-11-09 05:48:20,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:48:20,576 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 7 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 05:48:20,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 48 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 05:48:20,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-09 05:48:20,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2024-11-09 05:48:20,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.5) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:48:20,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2024-11-09 05:48:20,584 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 5 [2024-11-09 05:48:20,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:48:20,584 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2024-11-09 05:48:20,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:48:20,587 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2024-11-09 05:48:20,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 05:48:20,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:48:20,588 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 05:48:20,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 05:48:20,588 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 05:48:20,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:48:20,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1049956766, now seen corresponding path program 1 times [2024-11-09 05:48:20,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:48:20,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344719468] [2024-11-09 05:48:20,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:48:20,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:48:20,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:48:20,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:48:20,981 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:48:20,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344719468] [2024-11-09 05:48:20,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344719468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:48:20,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:48:20,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:48:20,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735532503] [2024-11-09 05:48:20,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:48:20,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:48:20,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:48:20,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:48:20,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:48:20,986 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:48:21,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:48:21,075 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2024-11-09 05:48:21,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:48:21,077 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-11-09 05:48:21,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:48:21,078 INFO L225 Difference]: With dead ends: 23 [2024-11-09 05:48:21,078 INFO L226 Difference]: Without dead ends: 23 [2024-11-09 05:48:21,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:48:21,080 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:48:21,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:48:21,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-09 05:48:21,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-09 05:48:21,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:48:21,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2024-11-09 05:48:21,086 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 6 [2024-11-09 05:48:21,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:48:21,086 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2024-11-09 05:48:21,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:48:21,089 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2024-11-09 05:48:21,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 05:48:21,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:48:21,090 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 05:48:21,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 05:48:21,091 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 05:48:21,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:48:21,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1049956767, now seen corresponding path program 1 times [2024-11-09 05:48:21,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:48:21,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799800683] [2024-11-09 05:48:21,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:48:21,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:48:21,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:48:21,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:48:21,273 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:48:21,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799800683] [2024-11-09 05:48:21,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799800683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:48:21,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:48:21,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:48:21,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167108374] [2024-11-09 05:48:21,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:48:21,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:48:21,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:48:21,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:48:21,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:48:21,276 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:48:21,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:48:21,352 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2024-11-09 05:48:21,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:48:21,353 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-11-09 05:48:21,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:48:21,354 INFO L225 Difference]: With dead ends: 22 [2024-11-09 05:48:21,354 INFO L226 Difference]: Without dead ends: 22 [2024-11-09 05:48:21,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-09 05:48:21,355 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 29 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:48:21,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 23 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:48:21,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-09 05:48:21,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-09 05:48:21,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:48:21,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2024-11-09 05:48:21,361 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 6 [2024-11-09 05:48:21,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:48:21,361 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2024-11-09 05:48:21,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:48:21,362 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2024-11-09 05:48:21,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 05:48:21,362 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:48:21,362 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:48:21,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 05:48:21,364 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 05:48:21,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:48:21,364 INFO L85 PathProgramCache]: Analyzing trace with hash 463290182, now seen corresponding path program 1 times [2024-11-09 05:48:21,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:48:21,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185556457] [2024-11-09 05:48:21,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:48:21,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:48:21,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:48:21,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:48:21,451 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:48:21,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185556457] [2024-11-09 05:48:21,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185556457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:48:21,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:48:21,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:48:21,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643086419] [2024-11-09 05:48:21,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:48:21,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:48:21,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:48:21,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:48:21,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:48:21,453 INFO L87 Difference]: Start difference. First operand 22 states and 24 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-09 05:48:21,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:48:21,524 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2024-11-09 05:48:21,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:48:21,525 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-09 05:48:21,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:48:21,527 INFO L225 Difference]: With dead ends: 21 [2024-11-09 05:48:21,527 INFO L226 Difference]: Without dead ends: 21 [2024-11-09 05:48:21,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:48:21,529 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 05:48:21,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 25 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 05:48:21,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-09 05:48:21,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-09 05:48:21,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 20 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:48:21,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2024-11-09 05:48:21,534 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 10 [2024-11-09 05:48:21,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:48:21,535 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2024-11-09 05:48:21,535 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-09 05:48:21,535 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2024-11-09 05:48:21,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 05:48:21,536 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:48:21,536 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:48:21,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 05:48:21,536 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 05:48:21,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:48:21,537 INFO L85 PathProgramCache]: Analyzing trace with hash 463290183, now seen corresponding path program 1 times [2024-11-09 05:48:21,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:48:21,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122757871] [2024-11-09 05:48:21,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:48:21,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:48:21,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:48:22,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:48:22,108 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:48:22,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122757871] [2024-11-09 05:48:22,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122757871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:48:22,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:48:22,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 05:48:22,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861223285] [2024-11-09 05:48:22,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:48:22,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 05:48:22,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:48:22,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 05:48:22,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 05:48:22,114 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:48:22,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:48:22,329 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2024-11-09 05:48:22,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 05:48:22,329 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-09 05:48:22,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:48:22,330 INFO L225 Difference]: With dead ends: 25 [2024-11-09 05:48:22,330 INFO L226 Difference]: Without dead ends: 25 [2024-11-09 05:48:22,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-09 05:48:22,331 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:48:22,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:48:22,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-09 05:48:22,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-09 05:48:22,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.380952380952381) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:48:22,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2024-11-09 05:48:22,335 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 10 [2024-11-09 05:48:22,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:48:22,336 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-11-09 05:48:22,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:48:22,337 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2024-11-09 05:48:22,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 05:48:22,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:48:22,338 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:48:22,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 05:48:22,338 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 05:48:22,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:48:22,339 INFO L85 PathProgramCache]: Analyzing trace with hash 463813352, now seen corresponding path program 1 times [2024-11-09 05:48:22,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:48:22,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677112108] [2024-11-09 05:48:22,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:48:22,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:48:22,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:48:22,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:48:22,804 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:48:22,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677112108] [2024-11-09 05:48:22,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677112108] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:48:22,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437221167] [2024-11-09 05:48:22,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:48:22,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:48:22,805 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:48:22,807 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:48:22,812 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 05:48:22,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:48:22,920 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 05:48:22,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:48:23,061 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 14 treesize of output 10 [2024-11-09 05:48:23,457 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:48:23,457 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 20 treesize of output 17 [2024-11-09 05:48:23,671 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:48:23,671 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:48:24,101 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 15 treesize of output 13 [2024-11-09 05:48:24,112 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 20 treesize of output 16 [2024-11-09 05:48:24,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 05:48:24,148 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:48:24,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437221167] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:48:24,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [131997980] [2024-11-09 05:48:24,172 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2024-11-09 05:48:24,172 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:48:24,177 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:48:24,184 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:48:24,185 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:48:25,330 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:48:26,424 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '566#(and (<= 1 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_cstpncpy_~s~0#1.base|) (<= 2 |ULTIMATE.start_main_#t~malloc10#1.base|) (<= 1 |ULTIMATE.start_cstpncpy_~d~0#1.offset|) (<= 2 |ULTIMATE.start_cstpncpy_~dst#1.base|) (<= 2 |ULTIMATE.start_main_#t~malloc11#1.base|) (<= 0 |ULTIMATE.start_cstpncpy_#t~post2#1.offset|) (<= 2 |ULTIMATE.start_cstpncpy_~d~0#1.base|) (<= 1 |ULTIMATE.start_cstpncpy_~s~0#1.offset|) (<= 2 |ULTIMATE.start_cstpncpy_#t~post2#1.base|))' at error location [2024-11-09 05:48:26,424 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:48:26,425 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:48:26,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2024-11-09 05:48:26,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64728709] [2024-11-09 05:48:26,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:48:26,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 05:48:26,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:48:26,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 05:48:26,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=722, Unknown=0, NotChecked=0, Total=812 [2024-11-09 05:48:26,428 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 22 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:48:26,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:48:26,864 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2024-11-09 05:48:26,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 05:48:26,865 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-09 05:48:26,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:48:26,865 INFO L225 Difference]: With dead ends: 29 [2024-11-09 05:48:26,865 INFO L226 Difference]: Without dead ends: 29 [2024-11-09 05:48:26,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=110, Invalid=882, Unknown=0, NotChecked=0, Total=992 [2024-11-09 05:48:26,867 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 4 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:48:26,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 111 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 05:48:26,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-09 05:48:26,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2024-11-09 05:48:26,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.375) internal successors, (33), 27 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:48:26,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2024-11-09 05:48:26,871 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 10 [2024-11-09 05:48:26,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:48:26,872 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2024-11-09 05:48:26,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:48:26,872 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2024-11-09 05:48:26,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 05:48:26,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:48:26,873 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:48:26,897 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 05:48:27,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-09 05:48:27,074 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 05:48:27,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:48:27,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1493287572, now seen corresponding path program 1 times [2024-11-09 05:48:27,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:48:27,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688603832] [2024-11-09 05:48:27,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:48:27,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:48:27,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:48:27,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:48:27,232 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:48:27,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688603832] [2024-11-09 05:48:27,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688603832] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:48:27,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:48:27,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:48:27,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945089572] [2024-11-09 05:48:27,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:48:27,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:48:27,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:48:27,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:48:27,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:48:27,235 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:48:27,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:48:27,256 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2024-11-09 05:48:27,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:48:27,257 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-09 05:48:27,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:48:27,257 INFO L225 Difference]: With dead ends: 27 [2024-11-09 05:48:27,258 INFO L226 Difference]: Without dead ends: 24 [2024-11-09 05:48:27,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:48:27,259 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 9 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 05:48:27,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 26 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 05:48:27,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-09 05:48:27,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-09 05:48:27,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:48:27,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2024-11-09 05:48:27,263 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 11 [2024-11-09 05:48:27,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:48:27,263 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2024-11-09 05:48:27,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:48:27,264 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2024-11-09 05:48:27,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 05:48:27,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:48:27,264 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:48:27,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 05:48:27,265 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 05:48:27,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:48:27,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1493311994, now seen corresponding path program 1 times [2024-11-09 05:48:27,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:48:27,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663283603] [2024-11-09 05:48:27,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:48:27,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:48:27,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:48:27,944 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:48:27,944 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:48:27,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663283603] [2024-11-09 05:48:27,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663283603] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:48:27,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263698080] [2024-11-09 05:48:27,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:48:27,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:48:27,945 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:48:27,947 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:48:27,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 05:48:28,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:48:28,055 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-09 05:48:28,060 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:48:28,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:48:28,087 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 13 treesize of output 7 [2024-11-09 05:48:28,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-09 05:48:28,562 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:48:28,563 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:48:29,029 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:48:29,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263698080] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:48:29,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1929087364] [2024-11-09 05:48:29,032 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2024-11-09 05:48:29,035 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:48:29,035 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:48:29,035 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:48:29,036 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:48:29,804 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:48:30,921 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '777#(and (<= 1 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_cstpncpy_~s~0#1.base|) (<= 2 |ULTIMATE.start_main_#t~malloc10#1.base|) (<= 1 |ULTIMATE.start_cstpncpy_~d~0#1.offset|) (<= 2 |ULTIMATE.start_cstpncpy_~dst#1.base|) (<= 2 |ULTIMATE.start_main_#t~malloc11#1.base|) (<= 2 |ULTIMATE.start_cstpncpy_~d~0#1.base|) (<= 1 |ULTIMATE.start_cstpncpy_~s~0#1.offset|))' at error location [2024-11-09 05:48:30,922 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:48:30,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:48:30,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2024-11-09 05:48:30,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100878069] [2024-11-09 05:48:30,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:48:30,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 05:48:30,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:48:30,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 05:48:30,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1002, Unknown=0, NotChecked=0, Total=1122 [2024-11-09 05:48:30,926 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:48:31,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:48:31,343 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2024-11-09 05:48:31,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 05:48:31,344 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-09 05:48:31,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:48:31,345 INFO L225 Difference]: With dead ends: 25 [2024-11-09 05:48:31,345 INFO L226 Difference]: Without dead ends: 25 [2024-11-09 05:48:31,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=138, Invalid=1122, Unknown=0, NotChecked=0, Total=1260 [2024-11-09 05:48:31,346 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 1 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:48:31,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 13 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 05:48:31,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-09 05:48:31,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-09 05:48:31,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:48:31,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2024-11-09 05:48:31,350 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 11 [2024-11-09 05:48:31,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:48:31,350 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2024-11-09 05:48:31,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:48:31,351 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2024-11-09 05:48:31,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 05:48:31,351 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:48:31,351 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:48:31,376 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 05:48:31,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-09 05:48:31,558 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 05:48:31,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:48:31,559 INFO L85 PathProgramCache]: Analyzing trace with hash -2147068283, now seen corresponding path program 1 times [2024-11-09 05:48:31,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:48:31,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836313330] [2024-11-09 05:48:31,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:48:31,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:48:31,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:48:32,272 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:48:32,272 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:48:32,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836313330] [2024-11-09 05:48:32,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836313330] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:48:32,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98594333] [2024-11-09 05:48:32,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:48:32,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:48:32,273 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:48:32,275 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:48:32,277 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 05:48:32,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:48:32,402 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-09 05:48:32,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:48:32,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:48:32,419 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 13 treesize of output 7 [2024-11-09 05:48:32,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-09 05:48:32,897 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:48:32,897 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:48:33,652 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:48:33,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98594333] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:48:33,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1329695442] [2024-11-09 05:48:33,655 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2024-11-09 05:48:33,655 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:48:33,655 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:48:33,656 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:48:33,656 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:48:35,301 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:48:38,194 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '942#(and (<= 1 |#StackHeapBarrier|) (<= (+ (select |#length| |ULTIMATE.start_cstpncpy_~d~0#1.base|) 1) |ULTIMATE.start_cstpncpy_~d~0#1.offset|) (<= 2 |ULTIMATE.start_cstpncpy_~s~0#1.base|) (<= 2 |ULTIMATE.start_main_#t~malloc10#1.base|) (exists ((|v_ULTIMATE.start_cstpncpy_#t~pre5#1_21| Int)) (not (= (mod |v_ULTIMATE.start_cstpncpy_#t~pre5#1_21| 18446744073709551616) 0))) (<= 2 |ULTIMATE.start_cstpncpy_~d~0#1.offset|) (<= 2 |ULTIMATE.start_cstpncpy_~dst#1.base|) (<= 2 |ULTIMATE.start_main_#t~malloc11#1.base|) (= |ULTIMATE.start_cstpncpy_~dst#1.offset| 0) (= |ULTIMATE.start_cstpncpy_~s~0#1.offset| 1) (<= 2 |ULTIMATE.start_cstpncpy_~d~0#1.base|))' at error location [2024-11-09 05:48:38,194 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:48:38,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:48:38,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2024-11-09 05:48:38,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718936195] [2024-11-09 05:48:38,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:48:38,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-09 05:48:38,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:48:38,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-09 05:48:38,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1391, Unknown=0, NotChecked=0, Total=1560 [2024-11-09 05:48:38,198 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 31 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:48:39,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:48:39,286 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2024-11-09 05:48:39,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 05:48:39,286 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-09 05:48:39,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:48:39,287 INFO L225 Difference]: With dead ends: 31 [2024-11-09 05:48:39,287 INFO L226 Difference]: Without dead ends: 22 [2024-11-09 05:48:39,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 765 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=312, Invalid=2444, Unknown=0, NotChecked=0, Total=2756 [2024-11-09 05:48:39,289 INFO L432 NwaCegarLoop]: 1 mSDtfsCounter, 19 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:48:39,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 14 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 05:48:39,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-09 05:48:39,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-09 05:48:39,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:48:39,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2024-11-09 05:48:39,292 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 13 [2024-11-09 05:48:39,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:48:39,293 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2024-11-09 05:48:39,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:48:39,293 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2024-11-09 05:48:39,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 05:48:39,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:48:39,294 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:48:39,314 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 05:48:39,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-09 05:48:39,495 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 05:48:39,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:48:39,496 INFO L85 PathProgramCache]: Analyzing trace with hash -423565601, now seen corresponding path program 1 times [2024-11-09 05:48:39,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:48:39,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151189598] [2024-11-09 05:48:39,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:48:39,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:48:39,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:48:40,112 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:48:40,112 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:48:40,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151189598] [2024-11-09 05:48:40,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151189598] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:48:40,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212709193] [2024-11-09 05:48:40,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:48:40,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:48:40,113 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:48:40,114 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:48:40,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 05:48:40,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:48:40,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-09 05:48:40,301 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:48:40,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:48:40,313 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 13 treesize of output 7 [2024-11-09 05:48:40,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-09 05:48:40,759 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:48:40,760 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:48:41,451 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:48:41,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212709193] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:48:41,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [732499219] [2024-11-09 05:48:41,467 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2024-11-09 05:48:41,467 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:48:41,468 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:48:41,468 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:48:41,468 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:48:42,037 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:48:43,495 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1145#(and (<= 1 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_cstpncpy_~s~0#1.base|) (exists ((|v_#memory_int_40| (Array Int (Array Int Int))) (|v_ULTIMATE.start_cstpncpy_#t~post2#1.base_40| Int) (|v_ULTIMATE.start_cstpncpy_#t~post2#1.offset_42| Int)) (and (<= (+ |v_ULTIMATE.start_cstpncpy_#t~post2#1.offset_42| 1) (select |#length| |v_ULTIMATE.start_cstpncpy_#t~post2#1.base_40|)) (<= 0 |v_ULTIMATE.start_cstpncpy_#t~post2#1.offset_42|) (= |#memory_int| (store |v_#memory_int_40| |v_ULTIMATE.start_cstpncpy_#t~post2#1.base_40| (store (select |v_#memory_int_40| |v_ULTIMATE.start_cstpncpy_#t~post2#1.base_40|) |v_ULTIMATE.start_cstpncpy_#t~post2#1.offset_42| 0))) (<= 2 |v_ULTIMATE.start_cstpncpy_#t~post2#1.base_40|) (= (select |#valid| |v_ULTIMATE.start_cstpncpy_#t~post2#1.base_40|) 1))) (<= 2 |ULTIMATE.start_main_#t~malloc10#1.base|) (<= (select |#length| |ULTIMATE.start_cstpncpy_~d~0#1.base|) (+ |ULTIMATE.start_cstpncpy_~dst#1.offset| 1)) (<= 0 |ULTIMATE.start_cstpncpy_~dst#1.offset|) (<= 2 |ULTIMATE.start_main_#t~malloc11#1.base|) (not (= (mod |ULTIMATE.start_cstpncpy_~n#1| 18446744073709551616) 0)) (= |ULTIMATE.start_cstpncpy_~d~0#1.base| |ULTIMATE.start_cstpncpy_~dst#1.base|) (<= 2 |ULTIMATE.start_cstpncpy_~d~0#1.base|) (<= 1 |ULTIMATE.start_cstpncpy_~s~0#1.offset|) (= |ULTIMATE.start_cstpncpy_~d~0#1.offset| (+ 2 |ULTIMATE.start_cstpncpy_~dst#1.offset|)))' at error location [2024-11-09 05:48:43,495 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:48:43,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:48:43,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2024-11-09 05:48:43,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276979294] [2024-11-09 05:48:43,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:48:43,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-09 05:48:43,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:48:43,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-09 05:48:43,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1573, Unknown=0, NotChecked=0, Total=1722 [2024-11-09 05:48:43,498 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:48:45,968 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 [] [2024-11-09 05:48:47,973 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 [] [2024-11-09 05:48:48,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:48:48,369 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2024-11-09 05:48:48,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 05:48:48,369 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-09 05:48:48,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:48:48,370 INFO L225 Difference]: With dead ends: 25 [2024-11-09 05:48:48,370 INFO L226 Difference]: Without dead ends: 19 [2024-11-09 05:48:48,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 723 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=259, Invalid=2497, Unknown=0, NotChecked=0, Total=2756 [2024-11-09 05:48:48,372 INFO L432 NwaCegarLoop]: 1 mSDtfsCounter, 14 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 17 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:48:48,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 17 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 267 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2024-11-09 05:48:48,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-09 05:48:48,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2024-11-09 05:48:48,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:48:48,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2024-11-09 05:48:48,375 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2024-11-09 05:48:48,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:48:48,375 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2024-11-09 05:48:48,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:48:48,376 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2024-11-09 05:48:48,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 05:48:48,376 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:48:48,376 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1] [2024-11-09 05:48:48,398 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 05:48:48,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-09 05:48:48,580 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 05:48:48,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:48:48,580 INFO L85 PathProgramCache]: Analyzing trace with hash -423042432, now seen corresponding path program 2 times [2024-11-09 05:48:48,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:48:48,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454960002] [2024-11-09 05:48:48,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:48:48,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:48:48,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:48:49,478 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-09 05:48:49,479 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:48:49,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454960002] [2024-11-09 05:48:49,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454960002] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:48:49,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320530157] [2024-11-09 05:48:49,479 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 05:48:49,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:48:49,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:48:49,481 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:48:49,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 05:48:49,573 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-09 05:48:49,574 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 05:48:49,576 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-09 05:48:49,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:48:49,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-09 05:48:49,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 05:48:49,928 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 25 treesize of output 18 [2024-11-09 05:48:50,198 INFO L349 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2024-11-09 05:48:50,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 23 [2024-11-09 05:48:50,369 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-09 05:48:50,370 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:48:51,132 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:48:51,133 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 2 case distinctions, treesize of input 37 treesize of output 36 [2024-11-09 05:48:51,165 INFO L349 Elim1Store]: treesize reduction 17, result has 54.1 percent of original size [2024-11-09 05:48:51,165 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 2 case distinctions, treesize of input 26 treesize of output 31 [2024-11-09 05:48:51,176 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:48:51,191 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:48:51,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 35 [2024-11-09 05:48:51,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2024-11-09 05:48:51,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 05:48:51,333 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-09 05:48:51,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320530157] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:48:51,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1460367801] [2024-11-09 05:48:51,336 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2024-11-09 05:48:51,338 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:48:51,338 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:48:51,338 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:48:51,339 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:48:52,076 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:48:53,164 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1221#true' at error location [2024-11-09 05:48:53,165 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:48:53,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:48:53,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 32 [2024-11-09 05:48:53,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490001075] [2024-11-09 05:48:53,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:48:53,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-09 05:48:53,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:48:53,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-09 05:48:53,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1413, Unknown=16, NotChecked=0, Total=1560 [2024-11-09 05:48:53,167 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 34 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 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-09 05:48:53,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:48:53,853 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2024-11-09 05:48:53,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 05:48:53,854 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 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 15 [2024-11-09 05:48:53,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:48:53,854 INFO L225 Difference]: With dead ends: 22 [2024-11-09 05:48:53,855 INFO L226 Difference]: Without dead ends: 22 [2024-11-09 05:48:53,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=184, Invalid=1962, Unknown=16, NotChecked=0, Total=2162 [2024-11-09 05:48:53,856 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:48:53,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 05:48:53,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-09 05:48:53,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-09 05:48:53,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:48:53,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2024-11-09 05:48:53,859 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 15 [2024-11-09 05:48:53,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:48:53,859 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2024-11-09 05:48:53,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 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-09 05:48:53,859 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2024-11-09 05:48:53,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 05:48:53,860 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:48:53,860 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1] [2024-11-09 05:48:53,880 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 05:48:54,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-09 05:48:54,064 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 05:48:54,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:48:54,064 INFO L85 PathProgramCache]: Analyzing trace with hash -229413534, now seen corresponding path program 2 times [2024-11-09 05:48:54,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:48:54,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478945446] [2024-11-09 05:48:54,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:48:54,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:48:54,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:48:54,639 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:48:54,639 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:48:54,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478945446] [2024-11-09 05:48:54,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478945446] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:48:54,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84945173] [2024-11-09 05:48:54,639 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 05:48:54,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:48:54,640 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:48:54,641 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:48:54,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 05:48:54,788 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-09 05:48:54,788 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 05:48:54,790 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-09 05:48:54,792 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:48:54,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:48:54,804 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 13 treesize of output 7 [2024-11-09 05:48:54,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-09 05:48:55,277 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:48:55,278 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:48:55,910 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:48:55,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84945173] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:48:55,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1820646244] [2024-11-09 05:48:55,912 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2024-11-09 05:48:55,913 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:48:55,913 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:48:55,913 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:48:55,913 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:48:56,313 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:48:57,316 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1526#(and (<= 1 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_cstpncpy_~s~0#1.base|) (<= 2 |ULTIMATE.start_main_#t~malloc10#1.base|) (<= 1 |ULTIMATE.start_cstpncpy_~d~0#1.offset|) (<= 2 |ULTIMATE.start_cstpncpy_~dst#1.base|) (<= 2 |ULTIMATE.start_main_#t~malloc11#1.base|) (<= 2 |ULTIMATE.start_cstpncpy_~d~0#1.base|) (<= 1 |ULTIMATE.start_cstpncpy_~s~0#1.offset|))' at error location [2024-11-09 05:48:57,316 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:48:57,316 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:48:57,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 31 [2024-11-09 05:48:57,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382917325] [2024-11-09 05:48:57,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:48:57,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-09 05:48:57,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:48:57,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-09 05:48:57,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1492, Unknown=1, NotChecked=0, Total=1640 [2024-11-09 05:48:57,318 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 33 states, 32 states have (on average 1.5) internal successors, (48), 32 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-09 05:48:58,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:48:58,139 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2024-11-09 05:48:58,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 05:48:58,140 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.5) internal successors, (48), 32 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 16 [2024-11-09 05:48:58,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:48:58,140 INFO L225 Difference]: With dead ends: 22 [2024-11-09 05:48:58,141 INFO L226 Difference]: Without dead ends: 22 [2024-11-09 05:48:58,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=279, Invalid=2582, Unknown=1, NotChecked=0, Total=2862 [2024-11-09 05:48:58,142 INFO L432 NwaCegarLoop]: 0 mSDtfsCounter, 14 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:48:58,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 0 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 05:48:58,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-09 05:48:58,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2024-11-09 05:48:58,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:48:58,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2024-11-09 05:48:58,145 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 16 [2024-11-09 05:48:58,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:48:58,145 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2024-11-09 05:48:58,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.5) internal successors, (48), 32 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-09 05:48:58,145 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2024-11-09 05:48:58,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 05:48:58,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:48:58,146 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1] [2024-11-09 05:48:58,160 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 05:48:58,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-09 05:48:58,347 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 05:48:58,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:48:58,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1774831128, now seen corresponding path program 3 times [2024-11-09 05:48:58,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:48:58,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401084474] [2024-11-09 05:48:58,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:48:58,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:48:58,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:48:59,280 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:48:59,281 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:48:59,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401084474] [2024-11-09 05:48:59,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401084474] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:48:59,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840972957] [2024-11-09 05:48:59,281 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 05:48:59,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:48:59,282 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:48:59,284 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:48:59,286 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 05:48:59,395 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 05:48:59,395 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 05:48:59,402 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 90 conjuncts are in the unsatisfiable core [2024-11-09 05:48:59,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:48:59,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-09 05:48:59,423 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 13 treesize of output 1 [2024-11-09 05:48:59,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 05:48:59,798 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 05:48:59,798 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 1 case distinctions, treesize of input 32 treesize of output 23 [2024-11-09 05:49:00,134 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 33 treesize of output 24 [2024-11-09 05:49:00,410 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2024-11-09 05:49:00,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2024-11-09 05:49:00,573 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:49:00,574 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:49:01,870 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:49:01,871 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 2 case distinctions, treesize of input 170 treesize of output 165 [2024-11-09 05:49:01,918 INFO L349 Elim1Store]: treesize reduction 31, result has 53.0 percent of original size [2024-11-09 05:49:01,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 61 treesize of output 77 [2024-11-09 05:49:01,932 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:49:01,947 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:49:01,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 52 [2024-11-09 05:49:01,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 05:49:02,135 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:49:02,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840972957] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:49:02,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [230055675] [2024-11-09 05:49:02,137 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2024-11-09 05:49:02,137 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:49:02,137 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:49:02,138 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:49:02,138 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:49:02,701 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:49:03,906 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1762#(and (<= 1 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_cstpncpy_~s~0#1.base|) (<= 2 |ULTIMATE.start_main_#t~malloc10#1.base|) (<= 1 |ULTIMATE.start_cstpncpy_~d~0#1.offset|) (<= 2 |ULTIMATE.start_cstpncpy_~dst#1.base|) (<= 2 |ULTIMATE.start_main_#t~malloc11#1.base|) (<= 0 |ULTIMATE.start_cstpncpy_#t~post2#1.offset|) (<= 2 |ULTIMATE.start_cstpncpy_~d~0#1.base|) (<= 1 |ULTIMATE.start_cstpncpy_~s~0#1.offset|) (<= 2 |ULTIMATE.start_cstpncpy_#t~post2#1.base|))' at error location [2024-11-09 05:49:03,906 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:49:03,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:49:03,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 43 [2024-11-09 05:49:03,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039716756] [2024-11-09 05:49:03,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:49:03,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-09 05:49:03,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:49:03,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-09 05:49:03,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=2453, Unknown=13, NotChecked=0, Total=2652 [2024-11-09 05:49:03,913 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 45 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 44 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:49:05,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:49:05,531 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2024-11-09 05:49:05,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 05:49:05,531 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 44 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-09 05:49:05,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:49:05,532 INFO L225 Difference]: With dead ends: 31 [2024-11-09 05:49:05,532 INFO L226 Difference]: Without dead ends: 31 [2024-11-09 05:49:05,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 807 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=332, Invalid=4211, Unknown=13, NotChecked=0, Total=4556 [2024-11-09 05:49:05,534 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 05:49:05,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 05:49:05,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-09 05:49:05,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-09 05:49:05,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:49:05,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2024-11-09 05:49:05,537 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 20 [2024-11-09 05:49:05,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:49:05,538 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2024-11-09 05:49:05,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 44 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:49:05,538 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2024-11-09 05:49:05,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 05:49:05,539 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:49:05,539 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 1, 1, 1, 1] [2024-11-09 05:49:05,561 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 05:49:05,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-09 05:49:05,740 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 05:49:05,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:49:05,740 INFO L85 PathProgramCache]: Analyzing trace with hash -355174168, now seen corresponding path program 4 times [2024-11-09 05:49:05,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:49:05,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541577377] [2024-11-09 05:49:05,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:49:05,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:49:05,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:49:07,160 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:49:07,160 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:49:07,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541577377] [2024-11-09 05:49:07,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541577377] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:49:07,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359826513] [2024-11-09 05:49:07,161 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-09 05:49:07,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:49:07,161 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:49:07,162 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:49:07,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 05:49:07,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:49:07,269 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 103 conjuncts are in the unsatisfiable core [2024-11-09 05:49:07,273 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:49:07,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-09 05:49:07,318 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 14 treesize of output 10 [2024-11-09 05:49:07,673 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 28 treesize of output 21 [2024-11-09 05:49:08,337 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 38 treesize of output 29 [2024-11-09 05:49:09,158 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 48 treesize of output 37 [2024-11-09 05:49:10,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 45 [2024-11-09 05:49:10,731 INFO L349 Elim1Store]: treesize reduction 16, result has 70.9 percent of original size [2024-11-09 05:49:10,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 60 treesize of output 61 [2024-11-09 05:49:11,123 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:49:11,124 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:49:14,925 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:49:14,925 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 2 case distinctions, treesize of input 106 treesize of output 72 [2024-11-09 05:49:14,957 INFO L349 Elim1Store]: treesize reduction 25, result has 44.4 percent of original size [2024-11-09 05:49:14,957 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 2 case distinctions, treesize of input 34 treesize of output 39 [2024-11-09 05:49:14,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:49:14,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 119 treesize of output 132 [2024-11-09 05:49:15,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 05:49:15,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 05:49:15,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 11 treesize of output 7 [2024-11-09 05:49:15,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-09 05:49:15,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 05:49:15,289 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:49:15,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359826513] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:49:15,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1159894771] [2024-11-09 05:49:15,291 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2024-11-09 05:49:15,291 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:49:15,291 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:49:15,291 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:49:15,291 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:49:15,739 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:49:17,227 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1863#true' at error location [2024-11-09 05:49:17,227 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:49:17,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:49:17,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23, 23] total 65 [2024-11-09 05:49:17,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420314489] [2024-11-09 05:49:17,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:49:17,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2024-11-09 05:49:17,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:49:17,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2024-11-09 05:49:17,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=4904, Unknown=55, NotChecked=0, Total=5256 [2024-11-09 05:49:17,231 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand has 67 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 66 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:49:24,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:49:24,459 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2024-11-09 05:49:24,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-09 05:49:24,460 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 66 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-09 05:49:24,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:49:24,460 INFO L225 Difference]: With dead ends: 51 [2024-11-09 05:49:24,460 INFO L226 Difference]: Without dead ends: 51 [2024-11-09 05:49:24,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1826 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=641, Invalid=10199, Unknown=80, NotChecked=0, Total=10920 [2024-11-09 05:49:24,463 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 1000 mSolverCounterSat, 4 mSolverCounterUnsat, 20 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 1024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1000 IncrementalHoareTripleChecker+Invalid, 20 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 05:49:24,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 198 Invalid, 1024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1000 Invalid, 20 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 05:49:24,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-09 05:49:24,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-09 05:49:24,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:49:24,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2024-11-09 05:49:24,470 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 30 [2024-11-09 05:49:24,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:49:24,471 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2024-11-09 05:49:24,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 66 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:49:24,471 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2024-11-09 05:49:24,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 05:49:24,472 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:49:24,472 INFO L215 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 9, 1, 1, 1, 1] [2024-11-09 05:49:24,495 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 05:49:24,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-09 05:49:24,673 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 05:49:24,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:49:24,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1475917544, now seen corresponding path program 5 times [2024-11-09 05:49:24,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:49:24,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319453758] [2024-11-09 05:49:24,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:49:24,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:49:24,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:49:28,064 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:49:28,064 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:49:28,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319453758] [2024-11-09 05:49:28,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319453758] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:49:28,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121079987] [2024-11-09 05:49:28,065 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 05:49:28,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:49:28,066 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:49:28,068 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:49:28,070 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 05:49:28,538 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2024-11-09 05:49:28,539 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 05:49:28,549 WARN L253 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 210 conjuncts are in the unsatisfiable core [2024-11-09 05:49:28,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:49:28,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 05:49:28,574 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 13 treesize of output 1 [2024-11-09 05:49:28,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-09 05:49:28,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 05:49:29,200 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 25 treesize of output 18 [2024-11-09 05:49:29,787 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 33 treesize of output 24 [2024-11-09 05:49:30,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 30 [2024-11-09 05:49:31,220 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 49 treesize of output 36 [2024-11-09 05:49:32,076 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 57 treesize of output 42 [2024-11-09 05:49:33,064 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 65 treesize of output 48 [2024-11-09 05:49:34,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 54 [2024-11-09 05:49:35,080 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 81 treesize of output 60 [2024-11-09 05:49:36,227 INFO L349 Elim1Store]: treesize reduction 32, result has 83.8 percent of original size [2024-11-09 05:49:36,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 21 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 24 case distinctions, treesize of input 83 treesize of output 203 [2024-11-09 05:49:36,587 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-09 05:49:36,645 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-09 05:49:37,270 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:49:37,270 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:49:43,253 WARN L851 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| Int) (v_ArrVal_328 (Array Int Int)) (|v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112| Int) (v_ArrVal_329 (Array Int Int))) (or (< (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112|) (< (+ |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| 1) (select |c_#length| |c_ULTIMATE.start_cstpncpy_~s~0#1.base|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_328) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112|) 0) (< (+ |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112| 1) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110|) (< |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| 0) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_329) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110|) 0))) (forall ((v_ArrVal_327 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_327) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0)) is different from false [2024-11-09 05:49:44,952 WARN L851 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_326 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_326) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) (forall ((v_ArrVal_328 (Array Int Int)) (|v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| Int) (|v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112| Int) (v_ArrVal_329 (Array Int Int))) (or (< (+ |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| 1) (select |c_#length| |c_ULTIMATE.start_cstpncpy_~s~0#1.base|)) (< (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112|) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_328) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112|) 0) (< (+ |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112| 1) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110|) (< |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| 0) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_329) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110|) 0))) (forall ((v_ArrVal_327 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_327) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0)) is different from false [2024-11-09 05:49:47,592 WARN L851 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| Int) (v_ArrVal_328 (Array Int Int)) (|v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112| Int) (v_ArrVal_329 (Array Int Int))) (or (< (+ |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| 1) (select |c_#length| |c_ULTIMATE.start_cstpncpy_~s~0#1.base|)) (< (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 4) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112|) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_328) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112|) 0) (< (+ |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112| 1) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110|) (< |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| 0) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_329) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110|) 0))) (forall ((v_ArrVal_325 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_325) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) (forall ((v_ArrVal_326 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_326) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) (forall ((v_ArrVal_327 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_327) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0)) is different from false [2024-11-09 05:49:55,777 WARN L851 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_328 (Array Int Int)) (|v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| Int) (|v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112| Int) (v_ArrVal_329 (Array Int Int))) (or (< (+ |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| 1) (select |c_#length| |c_ULTIMATE.start_cstpncpy_~s~0#1.base|)) (< (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 5) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112|) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_328) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112|) 0) (< (+ |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112| 1) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110|) (< |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| 0) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_329) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110|) 0))) (forall ((v_ArrVal_325 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_325) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) (forall ((v_ArrVal_324 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_324) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) (forall ((v_ArrVal_327 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_327) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 4)) 0)) (forall ((v_ArrVal_326 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_326) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0)) is different from false [2024-11-09 05:50:19,038 WARN L851 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_328 (Array Int Int)) (|v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| Int) (|v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112| Int) (v_ArrVal_329 (Array Int Int))) (or (< (+ |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| 1) (select |c_#length| |c_ULTIMATE.start_cstpncpy_~s~0#1.base|)) (< (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 6) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112|) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_328) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112|) 0) (< (+ |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112| 1) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110|) (< |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| 0) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_329) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110|) 0))) (forall ((v_ArrVal_326 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_326) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 4)) 0)) (forall ((v_ArrVal_325 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_325) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) (forall ((v_ArrVal_323 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_323) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) (forall ((v_ArrVal_327 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_327) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 5)) 0)) (forall ((v_ArrVal_324 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_324) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0)) is different from false [2024-11-09 05:51:06,509 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:51:06,510 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 2 case distinctions, treesize of input 194 treesize of output 116 [2024-11-09 05:51:06,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 205 treesize of output 187 [2024-11-09 05:51:06,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 05:51:06,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 05:51:06,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 05:51:06,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 7 treesize of output 3 [2024-11-09 05:51:06,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 05:51:06,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 05:51:06,794 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:51:06,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 21 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 194 treesize of output 308 [2024-11-09 05:51:06,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-09 05:51:06,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-09 05:51:07,763 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-09 05:51:07,780 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-09 05:51:08,162 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 125 refuted. 8 times theorem prover too weak. 0 trivial. 65 not checked. [2024-11-09 05:51:08,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121079987] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:51:08,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1494261435] [2024-11-09 05:51:08,164 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2024-11-09 05:51:08,164 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:51:08,164 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:51:08,164 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:51:08,164 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:51:08,775 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:51:11,674 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2276#true' at error location [2024-11-09 05:51:11,674 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:51:11,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:51:11,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 39, 39] total 109 [2024-11-09 05:51:11,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813570289] [2024-11-09 05:51:11,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:51:11,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 111 states [2024-11-09 05:51:11,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:51:11,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2024-11-09 05:51:11,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=701, Invalid=11492, Unknown=259, NotChecked=1120, Total=13572 [2024-11-09 05:51:11,681 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand has 111 states, 110 states have (on average 1.3636363636363635) internal successors, (150), 110 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:51:32,143 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post3#1.base|))) (let ((.cse6 (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 5)) (.cse10 (select |c_#length| |c_ULTIMATE.start_cstpncpy_#t~post3#1.base|)) (.cse11 (+ |c_ULTIMATE.start_cstpncpy_#t~post3#1.offset| 1)) (.cse3 (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) (.cse7 (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 4)) (.cse5 (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) (.cse2 (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) (.cse4 (select |c_#length| |c_ULTIMATE.start_cstpncpy_~s~0#1.base|)) (.cse8 (= (select .cse0 |c_ULTIMATE.start_cstpncpy_#t~post3#1.offset|) 0))) (and (not (= (select .cse0 6) 0)) (= |c_ULTIMATE.start_cstpncpy_#t~post3#1.base| |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (<= 9 |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|) (or (forall ((v_ArrVal_326 (Array Int Int)) (v_ArrVal_325 (Array Int Int)) (|v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| Int) (v_ArrVal_328 (Array Int Int)) (v_ArrVal_327 (Array Int Int)) (|v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112| Int) (v_ArrVal_329 (Array Int Int)) (v_ArrVal_324 (Array Int Int)) (v_ArrVal_323 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post2#1.base| v_ArrVal_323))) (or (= (select (select .cse1 |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0) (= (select (select (store .cse1 |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_324) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) .cse2) 0) (= (select (select (store .cse1 |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_329) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110|) 0) (= (select (select (store .cse1 |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_328) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112|) 0) (= (select (select (store .cse1 |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_326) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) .cse3) 0) (< (+ |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| 1) .cse4) (= (select (select (store .cse1 |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_325) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) .cse5) 0) (< .cse6 |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112|) (< (+ |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112| 1) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110|) (< |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| 0) (= (select (select (store .cse1 |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_327) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) .cse7) 0)))) .cse8) (or .cse8 (forall ((v_ArrVal_326 (Array Int Int)) (v_ArrVal_325 (Array Int Int)) (|v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| Int) (v_ArrVal_328 (Array Int Int)) (v_ArrVal_327 (Array Int Int)) (|v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112| Int) (v_ArrVal_329 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post2#1.base| v_ArrVal_325))) (or (= (select (select (store .cse9 |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_328) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112|) 0) (< (+ |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| 1) .cse4) (< .cse3 |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112|) (= (select (select (store .cse9 |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_329) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110|) 0) (= (select (select (store .cse9 |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_327) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) .cse5) 0) (= (select (select .cse9 |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0) (< (+ |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112| 1) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110|) (< |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| 0) (= (select (select (store .cse9 |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_326) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) .cse2) 0))))) (or (< |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| .cse4) (< .cse10 .cse11) .cse8) (or (forall ((|v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| Int) (v_ArrVal_328 (Array Int Int)) (|v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112| Int) (v_ArrVal_329 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post2#1.base| v_ArrVal_328))) (or (< |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112|) (< (+ |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| 1) .cse4) (= (select (select (store .cse12 |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_329) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110|) 0) (= (select (select .cse12 |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112|) 0) (< (+ |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112| 1) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110|) (< |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| 0)))) .cse8) (or (forall ((|v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| Int) (v_ArrVal_328 (Array Int Int)) (v_ArrVal_327 (Array Int Int)) (|v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112| Int) (v_ArrVal_329 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post2#1.base| v_ArrVal_327))) (or (= (select (select (store .cse13 |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_328) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112|) 0) (< (+ |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| 1) .cse4) (< .cse2 |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112|) (= (select (select .cse13 |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0) (= 0 (select (select (store .cse13 |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_329) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110|)) (< (+ |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112| 1) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110|) (< |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| 0)))) .cse8) (exists ((|v_ULTIMATE.start_main_~length~0#1_68| Int)) (and (= (select .cse0 (+ (- 1) |v_ULTIMATE.start_main_~length~0#1_68|)) 0) (<= 1 |v_ULTIMATE.start_main_~length~0#1_68|) (<= |v_ULTIMATE.start_main_~length~0#1_68| .cse10))) (not (= (select .cse0 5) 0)) (<= .cse11 .cse10) (or (forall ((v_ArrVal_326 (Array Int Int)) (v_ArrVal_325 (Array Int Int)) (|v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| Int) (v_ArrVal_328 (Array Int Int)) (v_ArrVal_327 (Array Int Int)) (|v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112| Int) (v_ArrVal_329 (Array Int Int)) (v_ArrVal_321 (Array Int Int)) (v_ArrVal_324 (Array Int Int)) (v_ArrVal_323 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post2#1.base| v_ArrVal_321))) (or (= (select (select (store .cse14 |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_324) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) .cse5) 0) (< (+ |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| 1) .cse4) (< (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 6) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112|) (= (select (select (store .cse14 |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_329) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110|) 0) (= (select (select (store .cse14 |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_326) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) .cse7) 0) (= (select (select (store .cse14 |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_323) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) .cse2) 0) (< (+ |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112| 1) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110|) (= (select (select (store .cse14 |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_325) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) .cse3) 0) (< |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| 0) (= (select (select .cse14 |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0) (= (select (select (store .cse14 |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_327) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) .cse6) 0) (= (select (select (store .cse14 |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_328) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112|) 0)))) .cse8) (<= 8 .cse10) (not (= (select .cse0 3) 0)) (exists ((|v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_106| Int)) (and (not (= (select .cse0 |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_106|) 0)) (<= |c_ULTIMATE.start_cstpncpy_#t~post3#1.offset| (+ |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_106| 1)) (<= |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_106| 7))) (= |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| .cse11) (or .cse8 (forall ((|v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| Int) (v_ArrVal_329 (Array Int Int))) (or (< (+ |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| 1) .cse4) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post2#1.base| v_ArrVal_329) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110|) 0) (< |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110|) (< |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| 0)))) (not (= (select .cse0 2) 0)) (or (forall ((v_ArrVal_326 (Array Int Int)) (v_ArrVal_325 (Array Int Int)) (|v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| Int) (v_ArrVal_328 (Array Int Int)) (v_ArrVal_327 (Array Int Int)) (|v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112| Int) (v_ArrVal_329 (Array Int Int)) (v_ArrVal_324 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post2#1.base| v_ArrVal_324))) (or (= (select (select (store .cse15 |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_327) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) .cse3) 0) (= (select (select (store .cse15 |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_328) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112|) 0) (= (select (select (store .cse15 |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_326) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) .cse5) 0) (< (+ |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| 1) .cse4) (= (select (select .cse15 |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0) (= (select (select (store .cse15 |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_325) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) .cse2) 0) (= (select (select (store .cse15 |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_329) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110|) 0) (< .cse7 |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112|) (< (+ |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112| 1) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110|) (< |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| 0)))) .cse8) (not (= (select .cse0 4) 0)) (<= |c_ULTIMATE.start_cstpncpy_#t~post3#1.offset| 9) (<= 1 |c_ULTIMATE.start_cstpncpy_#t~post3#1.offset|) (not (= (select .cse0 1) 0)) (not (= (select .cse0 0) 0)) (or (forall ((v_ArrVal_326 (Array Int Int)) (v_ArrVal_328 (Array Int Int)) (|v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| Int) (v_ArrVal_327 (Array Int Int)) (|v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112| Int) (v_ArrVal_329 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post2#1.base| v_ArrVal_326))) (or (= (select (select .cse16 |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0) (< .cse5 |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112|) (= (select (select (store .cse16 |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_329) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110|) 0) (= (select (select (store .cse16 |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_327) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) .cse2) 0) (< (+ |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| 1) .cse4) (< (+ |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112| 1) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110|) (= 0 (select (select (store .cse16 |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_328) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112|)) (< |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| 0)))) .cse8)))) is different from true [2024-11-09 05:51:38,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 05:51:41,595 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~s~0#1.base|)) (.cse12 (= |c_ULTIMATE.start_cstpncpy_#t~mem4#1| 0)) (.cse29 (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) (.cse31 (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 4)) (.cse8 (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) (.cse30 (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) (.cse7 (select |c_#length| |c_ULTIMATE.start_cstpncpy_~s~0#1.base|)) (.cse32 (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 5))) (let ((.cse0 (forall ((v_ArrVal_328 (Array Int Int)) (|v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| Int) (|v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112| Int) (v_ArrVal_329 (Array Int Int))) (or (< (+ |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| 1) .cse7) (< .cse32 |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112|) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_328) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112|) 0) (< (+ |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112| 1) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110|) (< |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| 0) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_329) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110|) 0)))) (.cse1 (forall ((v_ArrVal_325 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_325) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) .cse30) 0))) (.cse2 (forall ((v_ArrVal_324 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_324) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) .cse8) 0))) (.cse3 (forall ((v_ArrVal_327 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_327) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) .cse31) 0))) (.cse4 (forall ((v_ArrVal_326 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_326) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) .cse29) 0))) (.cse14 (forall ((v_ArrVal_328 (Array Int Int)) (|v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| Int) (|v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112| Int) (v_ArrVal_329 (Array Int Int))) (or (< (+ |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| 1) .cse7) (< (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 6) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112|) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_328) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112|) 0) (< (+ |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112| 1) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110|) (< |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| 0) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_329) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110|) 0)))) (.cse15 (forall ((v_ArrVal_326 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_326) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) .cse31) 0))) (.cse16 (forall ((v_ArrVal_325 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_325) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) .cse29) 0))) (.cse17 (forall ((v_ArrVal_323 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_323) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) .cse8) 0))) (.cse18 (forall ((v_ArrVal_327 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_327) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) .cse32) 0))) (.cse19 (forall ((v_ArrVal_324 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_324) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) .cse30) 0))) (.cse6 (<= .cse8 .cse7)) (.cse23 (<= |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 9)) (.cse24 (<= 8 .cse7)) (.cse11 (forall ((|v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| Int) (v_ArrVal_328 (Array Int Int)) (|v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112| Int) (v_ArrVal_329 (Array Int Int))) (or (< .cse30 |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112|) (< (+ |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| 1) .cse7) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_328) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112|) 0) (< (+ |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112| 1) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110|) (< |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| 0) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_329) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110|) 0)))) (.cse13 (forall ((v_ArrVal_327 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_327) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) .cse8) 0))) (.cse20 (forall ((v_ArrVal_326 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_326) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) .cse8) 0))) (.cse21 (forall ((v_ArrVal_328 (Array Int Int)) (|v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| Int) (|v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112| Int) (v_ArrVal_329 (Array Int Int))) (or (< (+ |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| 1) .cse7) (< .cse29 |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112|) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_328) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112|) 0) (< (+ |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112| 1) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110|) (< |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| 0) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_329) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110|) 0)))) (.cse22 (forall ((v_ArrVal_327 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_327) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) .cse30) 0))) (.cse9 (not .cse12)) (.cse25 (forall ((|v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| Int) (v_ArrVal_328 (Array Int Int)) (|v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112| Int) (v_ArrVal_329 (Array Int Int))) (or (< (+ |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| 1) .cse7) (< .cse31 |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112|) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_328) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112|) 0) (< (+ |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112| 1) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110|) (< |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| 0) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_329) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110|) 0)))) (.cse26 (forall ((v_ArrVal_325 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_325) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) .cse8) 0))) (.cse27 (forall ((v_ArrVal_326 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_326) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) .cse30) 0))) (.cse28 (forall ((v_ArrVal_327 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_327) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) .cse29)))) (.cse5 (= (select .cse10 |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) .cse6 (<= 9 |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|) (or (forall ((|v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| Int) (v_ArrVal_328 (Array Int Int)) (|v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112| Int) (v_ArrVal_329 (Array Int Int))) (or (< (+ |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| 1) .cse7) (< .cse8 |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112|) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_328) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112|) 0) (< (+ |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112| 1) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110|) (< |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| 0) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_329) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110|) 0))) .cse5) (or (not (= |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 7)) .cse9) (forall ((|v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| Int)) (or (= (select .cse10 |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110|) 0) (< (+ |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| 1) .cse7) (< |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110|) (< |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| 0))) (or .cse11 .cse12 .cse13 .cse5) (or .cse14 .cse15 .cse16 .cse17 .cse18 .cse12 .cse19 .cse5) (or .cse20 .cse21 .cse12 .cse22 .cse5) (or .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5) (<= 1 |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|) (or .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse5) (or (and (not (= |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 4)) (<= |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| .cse7) (not (= |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) (not (= |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) (not (= |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 6)) .cse23 .cse12 (not (= |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2))) (and .cse6 .cse23 .cse24 .cse9)) .cse23 .cse24 (or .cse11 .cse13 .cse5) (or .cse25 .cse26 .cse27 .cse28 .cse5) (or .cse20 .cse21 .cse22 .cse5) (or (not (= |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 5)) .cse9) (forall ((|v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| Int) (|v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112| Int) (v_ArrVal_329 (Array Int Int))) (or (< |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112|) (< (+ |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| 1) .cse7) (= (select .cse10 |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112|) 0) (< (+ |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_112| 1) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110|) (< |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110| 0) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_329) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |v_ULTIMATE.start_cstpncpy_#t~post3#1.offset_110|) 0))) (or .cse25 .cse26 .cse27 .cse12 .cse28 .cse5)))) is different from false [2024-11-09 05:51:48,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 05:51:53,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 05:52:05,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 05:52:19,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 05:52:21,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 05:52:38,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 05:52:41,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 05:52:57,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 05:53:10,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 05:53:12,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 05:53:24,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 05:53:41,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:53:41,998 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2024-11-09 05:53:41,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2024-11-09 05:53:41,998 INFO L78 Accepts]: Start accepts. Automaton has has 111 states, 110 states have (on average 1.3636363636363635) internal successors, (150), 110 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-09 05:53:41,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:53:41,999 INFO L225 Difference]: With dead ends: 96 [2024-11-09 05:53:41,999 INFO L226 Difference]: Without dead ends: 96 [2024-11-09 05:53:42,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 5080 ImplicationChecksByTransitivity, 209.1s TimeCoverageRelationStatistics Valid=1804, Invalid=29549, Unknown=537, NotChecked=2520, Total=34410 [2024-11-09 05:53:42,007 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 11 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 2375 mSolverCounterSat, 26 mSolverCounterUnsat, 128 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 3082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 2375 IncrementalHoareTripleChecker+Invalid, 128 IncrementalHoareTripleChecker+Unknown, 553 IncrementalHoareTripleChecker+Unchecked, 38.5s IncrementalHoareTripleChecker+Time [2024-11-09 05:53:42,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 557 Invalid, 3082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 2375 Invalid, 128 Unknown, 553 Unchecked, 38.5s Time] [2024-11-09 05:53:42,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-09 05:53:42,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-09 05:53:42,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.0105263157894737) internal successors, (96), 95 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-09 05:53:42,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2024-11-09 05:53:42,013 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 50 [2024-11-09 05:53:42,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:53:42,014 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2024-11-09 05:53:42,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 111 states, 110 states have (on average 1.3636363636363635) internal successors, (150), 110 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:53:42,014 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2024-11-09 05:53:42,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 05:53:42,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:53:42,017 INFO L215 NwaCegarLoop]: trace histogram [19, 18, 18, 18, 18, 1, 1, 1, 1] [2024-11-09 05:53:42,041 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-09 05:53:42,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:53:42,221 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 05:53:42,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:53:42,222 INFO L85 PathProgramCache]: Analyzing trace with hash 375974528, now seen corresponding path program 6 times [2024-11-09 05:53:42,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:53:42,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206380950] [2024-11-09 05:53:42,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:53:42,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:53:42,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:53:53,445 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:53:53,445 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:53:53,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206380950] [2024-11-09 05:53:53,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206380950] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:53:53,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179996967] [2024-11-09 05:53:53,445 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 05:53:53,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:53:53,446 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:53:53,458 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:53:53,460 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ed83de-a5d4-4d6c-a8b7-13197aaac97e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 05:53:55,641 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 05:53:55,642 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 05:53:55,652 WARN L253 TraceCheckSpWp]: Trace formula consists of 734 conjuncts, 398 conjuncts are in the unsatisfiable core [2024-11-09 05:53:55,663 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:53:55,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-09 05:53:55,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 05:53:56,764 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 25 treesize of output 18 [2024-11-09 05:53:57,839 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 33 treesize of output 24 [2024-11-09 05:53:59,024 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 41 treesize of output 30 [2024-11-09 05:54:00,477 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 49 treesize of output 36 [2024-11-09 05:54:01,908 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 57 treesize of output 42 [2024-11-09 05:54:03,452 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 65 treesize of output 48 [2024-11-09 05:54:05,035 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 73 treesize of output 54 [2024-11-09 05:54:06,858 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 81 treesize of output 60 [2024-11-09 05:54:08,785 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 89 treesize of output 66 [2024-11-09 05:54:10,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 97 treesize of output 72 [2024-11-09 05:54:13,051 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 105 treesize of output 78 [2024-11-09 05:54:15,381 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 113 treesize of output 84 [2024-11-09 05:54:18,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 90 [2024-11-09 05:54:20,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 129 treesize of output 96 [2024-11-09 05:54:23,687 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 137 treesize of output 102 [2024-11-09 05:54:26,695 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 145 treesize of output 108 [2024-11-09 05:54:29,817 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 153 treesize of output 114 [2024-11-09 05:54:32,468 INFO L349 Elim1Store]: treesize reduction 68, result has 53.1 percent of original size [2024-11-09 05:54:32,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 19 select indices, 19 select index equivalence classes, 153 disjoint index pairs (out of 171 index pairs), introduced 19 new quantified variables, introduced 18 case distinctions, treesize of input 153 treesize of output 151 [2024-11-09 05:54:32,479 WARN L672 sPolynomialRelations]: Constructing 262144(two to the power of 18 dual juncts. [2024-11-09 05:54:46,980 WARN L672 sPolynomialRelations]: Constructing 131072(two to the power of 17 dual juncts. [2024-11-09 05:54:54,802 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:54:54,802 INFO L311 TraceCheckSpWp]: Computing backward predicates...