./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrlcpy-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4fc63b2a 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_7327f449-f9a9-43c9-a5ee-3b3149bab75f/bin/utaipan-verify-DbMuA5NWw2/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7327f449-f9a9-43c9-a5ee-3b3149bab75f/bin/utaipan-verify-DbMuA5NWw2/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7327f449-f9a9-43c9-a5ee-3b3149bab75f/bin/utaipan-verify-DbMuA5NWw2/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7327f449-f9a9-43c9-a5ee-3b3149bab75f/bin/utaipan-verify-DbMuA5NWw2/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrlcpy-alloca-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7327f449-f9a9-43c9-a5ee-3b3149bab75f/bin/utaipan-verify-DbMuA5NWw2/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7327f449-f9a9-43c9-a5ee-3b3149bab75f/bin/utaipan-verify-DbMuA5NWw2 --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 f1ad2d5826e88851ec05294e79547a11a54665f4a2cf6f0e66f9eabed656148f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-11-02 12:25:59,987 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-02 12:26:00,071 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7327f449-f9a9-43c9-a5ee-3b3149bab75f/bin/utaipan-verify-DbMuA5NWw2/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf [2024-11-02 12:26:00,078 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-02 12:26:00,078 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-02 12:26:00,133 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-02 12:26:00,133 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-02 12:26:00,134 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-02 12:26:00,134 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-02 12:26:00,135 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-02 12:26:00,135 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-02 12:26:00,136 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-02 12:26:00,137 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-02 12:26:00,141 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-02 12:26:00,142 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-02 12:26:00,142 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-02 12:26:00,143 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-02 12:26:00,143 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-02 12:26:00,143 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-02 12:26:00,144 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-02 12:26:00,144 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-02 12:26:00,147 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-02 12:26:00,148 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-02 12:26:00,148 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-02 12:26:00,149 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-02 12:26:00,149 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-02 12:26:00,158 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-02 12:26:00,158 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-02 12:26:00,158 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-02 12:26:00,159 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-02 12:26:00,159 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-02 12:26:00,159 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-02 12:26:00,159 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-02 12:26:00,160 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-02 12:26:00,160 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-02 12:26:00,160 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-02 12:26:00,161 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-02 12:26:00,161 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-02 12:26:00,161 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-02 12:26:00,161 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-02 12:26:00,162 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-02 12:26:00,163 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-02 12:26:00,163 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-02 12:26:00,164 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-02 12:26:00,164 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-02 12:26:00,164 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-02 12:26:00,165 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_7327f449-f9a9-43c9-a5ee-3b3149bab75f/bin/utaipan-verify-DbMuA5NWw2/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_7327f449-f9a9-43c9-a5ee-3b3149bab75f/bin/utaipan-verify-DbMuA5NWw2 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 -> f1ad2d5826e88851ec05294e79547a11a54665f4a2cf6f0e66f9eabed656148f [2024-11-02 12:26:00,454 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-02 12:26:00,489 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-02 12:26:00,492 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-02 12:26:00,493 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-02 12:26:00,495 INFO L274 PluginConnector]: CDTParser initialized [2024-11-02 12:26:00,496 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7327f449-f9a9-43c9-a5ee-3b3149bab75f/bin/utaipan-verify-DbMuA5NWw2/../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrlcpy-alloca-2.i Unable to find full path for "g++" [2024-11-02 12:26:02,630 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-02 12:26:02,992 INFO L384 CDTParser]: Found 1 translation units. [2024-11-02 12:26:02,992 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7327f449-f9a9-43c9-a5ee-3b3149bab75f/sv-benchmarks/c/termination-memory-alloca/openbsd_cstrlcpy-alloca-2.i [2024-11-02 12:26:03,012 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7327f449-f9a9-43c9-a5ee-3b3149bab75f/bin/utaipan-verify-DbMuA5NWw2/data/42b23de0c/6b0dfaea3484483d8f9b4bad54f5249c/FLAGc72f27b67 [2024-11-02 12:26:03,035 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7327f449-f9a9-43c9-a5ee-3b3149bab75f/bin/utaipan-verify-DbMuA5NWw2/data/42b23de0c/6b0dfaea3484483d8f9b4bad54f5249c [2024-11-02 12:26:03,041 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-02 12:26:03,043 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-02 12:26:03,045 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-02 12:26:03,045 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-02 12:26:03,053 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-02 12:26:03,054 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 12:26:03" (1/1) ... [2024-11-02 12:26:03,056 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@268dbe43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:26:03, skipping insertion in model container [2024-11-02 12:26:03,057 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 12:26:03" (1/1) ... [2024-11-02 12:26:03,125 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-02 12:26:03,508 WARN L1053 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-02 12:26:03,509 WARN L1053 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-02 12:26:03,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-02 12:26:03,527 INFO L200 MainTranslator]: Completed pre-run [2024-11-02 12:26:03,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-02 12:26:03,640 INFO L204 MainTranslator]: Completed translation [2024-11-02 12:26:03,640 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:26:03 WrapperNode [2024-11-02 12:26:03,640 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-02 12:26:03,641 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-02 12:26:03,641 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-02 12:26:03,642 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-02 12:26:03,651 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:26:03" (1/1) ... [2024-11-02 12:26:03,670 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:26:03" (1/1) ... [2024-11-02 12:26:03,708 INFO L138 Inliner]: procedures = 111, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 79 [2024-11-02 12:26:03,709 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-02 12:26:03,709 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-02 12:26:03,712 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-02 12:26:03,712 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-02 12:26:03,722 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:26:03" (1/1) ... [2024-11-02 12:26:03,722 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:26:03" (1/1) ... [2024-11-02 12:26:03,729 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:26:03" (1/1) ... [2024-11-02 12:26:03,730 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:26:03" (1/1) ... [2024-11-02 12:26:03,736 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:26:03" (1/1) ... [2024-11-02 12:26:03,740 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:26:03" (1/1) ... [2024-11-02 12:26:03,741 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:26:03" (1/1) ... [2024-11-02 12:26:03,742 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:26:03" (1/1) ... [2024-11-02 12:26:03,744 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-02 12:26:03,745 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-02 12:26:03,745 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-02 12:26:03,745 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-02 12:26:03,746 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:26:03" (1/1) ... [2024-11-02 12:26:03,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-02 12:26:03,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7327f449-f9a9-43c9-a5ee-3b3149bab75f/bin/utaipan-verify-DbMuA5NWw2/z3 [2024-11-02 12:26:03,796 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7327f449-f9a9-43c9-a5ee-3b3149bab75f/bin/utaipan-verify-DbMuA5NWw2/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-02 12:26:03,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7327f449-f9a9-43c9-a5ee-3b3149bab75f/bin/utaipan-verify-DbMuA5NWw2/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-02 12:26:03,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-02 12:26:03,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-02 12:26:03,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-02 12:26:03,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-02 12:26:03,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-02 12:26:03,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-02 12:26:04,025 INFO L238 CfgBuilder]: Building ICFG [2024-11-02 12:26:04,028 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-02 12:26:04,387 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2024-11-02 12:26:04,388 INFO L287 CfgBuilder]: Performing block encoding [2024-11-02 12:26:04,459 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-02 12:26:04,460 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-02 12:26:04,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 12:26:04 BoogieIcfgContainer [2024-11-02 12:26:04,461 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-02 12:26:04,464 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-02 12:26:04,464 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-02 12:26:04,469 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-02 12:26:04,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 12:26:03" (1/3) ... [2024-11-02 12:26:04,471 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d6355d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 12:26:04, skipping insertion in model container [2024-11-02 12:26:04,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:26:03" (2/3) ... [2024-11-02 12:26:04,471 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d6355d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 12:26:04, skipping insertion in model container [2024-11-02 12:26:04,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 12:26:04" (3/3) ... [2024-11-02 12:26:04,473 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrlcpy-alloca-2.i [2024-11-02 12:26:04,498 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-02 12:26:04,499 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2024-11-02 12:26:04,558 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-02 12:26:04,567 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;@2fc6f30d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-02 12:26:04,568 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2024-11-02 12:26:04,574 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 17 states have (on average 2.235294117647059) 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-02 12:26:04,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-02 12:26:04,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:26:04,583 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-11-02 12:26:04,584 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-02 12:26:04,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:26:04,592 INFO L85 PathProgramCache]: Analyzing trace with hash 4016, now seen corresponding path program 1 times [2024-11-02 12:26:04,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:26:04,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321848760] [2024-11-02 12:26:04,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:26:04,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:26:04,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:26:05,113 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-02 12:26:05,114 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:26:05,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321848760] [2024-11-02 12:26:05,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321848760] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:26:05,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:26:05,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-02 12:26:05,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246973038] [2024-11-02 12:26:05,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:26:05,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 12:26:05,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:26:05,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 12:26:05,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 12:26:05,174 INFO L87 Difference]: Start difference. First operand has 31 states, 17 states have (on average 2.235294117647059) 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) 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-02 12:26:05,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:26:05,299 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2024-11-02 12:26:05,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 12:26:05,304 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-02 12:26:05,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:26:05,314 INFO L225 Difference]: With dead ends: 30 [2024-11-02 12:26:05,314 INFO L226 Difference]: Without dead ends: 29 [2024-11-02 12:26:05,317 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-02 12:26:05,326 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 3 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 12:26:05,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 46 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 12:26:05,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-02 12:26:05,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-02 12:26:05,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 2.0) internal successors, (34), 28 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:05,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2024-11-02 12:26:05,399 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 2 [2024-11-02 12:26:05,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:26:05,400 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2024-11-02 12:26:05,400 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-02 12:26:05,401 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2024-11-02 12:26:05,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-02 12:26:05,401 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:26:05,402 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-11-02 12:26:05,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-02 12:26:05,403 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-02 12:26:05,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:26:05,404 INFO L85 PathProgramCache]: Analyzing trace with hash 4017, now seen corresponding path program 1 times [2024-11-02 12:26:05,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:26:05,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307351653] [2024-11-02 12:26:05,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:26:05,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:26:05,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:26:05,804 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-02 12:26:05,804 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:26:05,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307351653] [2024-11-02 12:26:05,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307351653] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:26:05,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:26:05,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-02 12:26:05,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017050074] [2024-11-02 12:26:05,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:26:05,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 12:26:05,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:26:05,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 12:26:05,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 12:26:05,812 INFO L87 Difference]: Start difference. First operand 29 states and 34 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-02 12:26:05,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:26:05,877 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2024-11-02 12:26:05,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 12:26:05,879 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-02 12:26:05,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:26:05,880 INFO L225 Difference]: With dead ends: 28 [2024-11-02 12:26:05,880 INFO L226 Difference]: Without dead ends: 28 [2024-11-02 12:26:05,881 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-02 12:26:05,883 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 3 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 47 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.1s IncrementalHoareTripleChecker+Time [2024-11-02 12:26:05,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 47 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 12:26:05,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-02 12:26:05,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-02 12:26:05,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 17 states have (on average 1.9411764705882353) 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-02 12:26:05,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2024-11-02 12:26:05,894 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 2 [2024-11-02 12:26:05,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:26:05,895 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2024-11-02 12:26:05,895 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-02 12:26:05,896 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2024-11-02 12:26:05,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-02 12:26:05,896 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:26:05,897 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-02 12:26:05,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-02 12:26:05,898 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-02 12:26:05,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:26:05,899 INFO L85 PathProgramCache]: Analyzing trace with hash 124485, now seen corresponding path program 1 times [2024-11-02 12:26:05,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:26:05,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205155687] [2024-11-02 12:26:05,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:26:05,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:26:05,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:26:06,017 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-02 12:26:06,017 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:26:06,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205155687] [2024-11-02 12:26:06,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205155687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:26:06,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:26:06,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-02 12:26:06,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892320614] [2024-11-02 12:26:06,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:26:06,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 12:26:06,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:26:06,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 12:26:06,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 12:26:06,022 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:06,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:26:06,073 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2024-11-02 12:26:06,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 12:26:06,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-02 12:26:06,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:26:06,075 INFO L225 Difference]: With dead ends: 27 [2024-11-02 12:26:06,077 INFO L226 Difference]: Without dead ends: 27 [2024-11-02 12:26:06,078 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-02 12:26:06,079 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-02 12:26:06,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-02 12:26:06,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-02 12:26:06,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-02 12:26:06,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:06,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2024-11-02 12:26:06,089 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 3 [2024-11-02 12:26:06,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:26:06,090 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2024-11-02 12:26:06,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:06,091 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2024-11-02 12:26:06,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-02 12:26:06,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:26:06,092 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-02 12:26:06,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-02 12:26:06,093 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-02 12:26:06,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:26:06,094 INFO L85 PathProgramCache]: Analyzing trace with hash 124486, now seen corresponding path program 1 times [2024-11-02 12:26:06,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:26:06,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124805740] [2024-11-02 12:26:06,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:26:06,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:26:06,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:26:06,338 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-02 12:26:06,339 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:26:06,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124805740] [2024-11-02 12:26:06,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124805740] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:26:06,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:26:06,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-02 12:26:06,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038037222] [2024-11-02 12:26:06,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:26:06,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 12:26:06,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:26:06,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 12:26:06,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 12:26:06,345 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:06,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:26:06,389 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2024-11-02 12:26:06,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 12:26:06,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-02 12:26:06,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:26:06,390 INFO L225 Difference]: With dead ends: 26 [2024-11-02 12:26:06,390 INFO L226 Difference]: Without dead ends: 26 [2024-11-02 12:26:06,391 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-02 12:26:06,392 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-02 12:26:06,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-02 12:26:06,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-02 12:26:06,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-02 12:26:06,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 25 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-02 12:26:06,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2024-11-02 12:26:06,402 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 3 [2024-11-02 12:26:06,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:26:06,402 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2024-11-02 12:26:06,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:06,403 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2024-11-02 12:26:06,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-02 12:26:06,403 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:26:06,403 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:26:06,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-02 12:26:06,404 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-02 12:26:06,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:26:06,404 INFO L85 PathProgramCache]: Analyzing trace with hash -931511643, now seen corresponding path program 1 times [2024-11-02 12:26:06,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:26:06,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474676930] [2024-11-02 12:26:06,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:26:06,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:26:06,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:26:06,452 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-02 12:26:06,453 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:26:06,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474676930] [2024-11-02 12:26:06,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474676930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:26:06,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:26:06,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-02 12:26:06,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737842295] [2024-11-02 12:26:06,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:26:06,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 12:26:06,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:26:06,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 12:26:06,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 12:26:06,459 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:06,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:26:06,483 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2024-11-02 12:26:06,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 12:26:06,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-02 12:26:06,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:26:06,486 INFO L225 Difference]: With dead ends: 27 [2024-11-02 12:26:06,486 INFO L226 Difference]: Without dead ends: 27 [2024-11-02 12:26:06,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 12:26:06,488 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 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-02 12:26:06,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-02 12:26:06,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-02 12:26:06,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-02 12:26:06,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:06,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2024-11-02 12:26:06,496 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 7 [2024-11-02 12:26:06,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:26:06,496 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2024-11-02 12:26:06,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:06,498 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2024-11-02 12:26:06,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-02 12:26:06,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:26:06,499 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:26:06,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-02 12:26:06,500 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-02 12:26:06,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:26:06,500 INFO L85 PathProgramCache]: Analyzing trace with hash -931537741, now seen corresponding path program 1 times [2024-11-02 12:26:06,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:26:06,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117433412] [2024-11-02 12:26:06,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:26:06,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:26:06,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:26:06,565 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-02 12:26:06,566 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:26:06,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117433412] [2024-11-02 12:26:06,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117433412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:26:06,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:26:06,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-02 12:26:06,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698658316] [2024-11-02 12:26:06,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:26:06,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 12:26:06,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:26:06,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 12:26:06,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-02 12:26:06,568 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:06,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:26:06,633 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2024-11-02 12:26:06,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 12:26:06,634 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-02 12:26:06,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:26:06,634 INFO L225 Difference]: With dead ends: 32 [2024-11-02 12:26:06,635 INFO L226 Difference]: Without dead ends: 32 [2024-11-02 12:26:06,635 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-02 12:26:06,636 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 19 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 12:26:06,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 37 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 12:26:06,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-02 12:26:06,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2024-11-02 12:26:06,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 25 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-02 12:26:06,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2024-11-02 12:26:06,640 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 7 [2024-11-02 12:26:06,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:26:06,640 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2024-11-02 12:26:06,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:06,641 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2024-11-02 12:26:06,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-02 12:26:06,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:26:06,641 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:26:06,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-02 12:26:06,642 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-02 12:26:06,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:26:06,642 INFO L85 PathProgramCache]: Analyzing trace with hash -931537740, now seen corresponding path program 1 times [2024-11-02 12:26:06,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:26:06,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339156959] [2024-11-02 12:26:06,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:26:06,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:26:06,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:26:06,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 12:26:06,770 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:26:06,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339156959] [2024-11-02 12:26:06,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339156959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:26:06,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:26:06,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-02 12:26:06,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300501290] [2024-11-02 12:26:06,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:26:06,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-02 12:26:06,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:26:06,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-02 12:26:06,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-02 12:26:06,773 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:06,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:26:06,838 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2024-11-02 12:26:06,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 12:26:06,839 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-02 12:26:06,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:26:06,841 INFO L225 Difference]: With dead ends: 37 [2024-11-02 12:26:06,841 INFO L226 Difference]: Without dead ends: 37 [2024-11-02 12:26:06,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-02 12:26:06,842 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 11 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 12:26:06,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 76 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 12:26:06,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-02 12:26:06,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2024-11-02 12:26:06,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 30 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:06,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2024-11-02 12:26:06,851 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 7 [2024-11-02 12:26:06,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:26:06,851 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2024-11-02 12:26:06,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:06,852 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2024-11-02 12:26:06,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-02 12:26:06,852 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:26:06,852 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:26:06,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-02 12:26:06,853 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-02 12:26:06,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:26:06,856 INFO L85 PathProgramCache]: Analyzing trace with hash -932337068, now seen corresponding path program 1 times [2024-11-02 12:26:06,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:26:06,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298953711] [2024-11-02 12:26:06,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:26:06,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:26:06,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:26:06,950 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-02 12:26:06,951 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:26:06,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298953711] [2024-11-02 12:26:06,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298953711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:26:06,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:26:06,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-02 12:26:06,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961434780] [2024-11-02 12:26:06,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:26:06,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 12:26:06,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:26:06,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 12:26:06,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-02 12:26:06,953 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:07,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:26:07,014 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2024-11-02 12:26:07,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 12:26:07,014 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-02 12:26:07,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:26:07,015 INFO L225 Difference]: With dead ends: 30 [2024-11-02 12:26:07,015 INFO L226 Difference]: Without dead ends: 30 [2024-11-02 12:26:07,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-02 12:26:07,016 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 20 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-02 12:26:07,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 30 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-02 12:26:07,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-02 12:26:07,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-02 12:26:07,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 29 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-02 12:26:07,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-02 12:26:07,024 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 7 [2024-11-02 12:26:07,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:26:07,024 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-02 12:26:07,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:07,024 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-02 12:26:07,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-02 12:26:07,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:26:07,027 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:26:07,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-02 12:26:07,027 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-02 12:26:07,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:26:07,028 INFO L85 PathProgramCache]: Analyzing trace with hash -932337067, now seen corresponding path program 1 times [2024-11-02 12:26:07,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:26:07,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961820128] [2024-11-02 12:26:07,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:26:07,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:26:07,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:26:07,266 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-02 12:26:07,267 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:26:07,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961820128] [2024-11-02 12:26:07,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961820128] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:26:07,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:26:07,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-02 12:26:07,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486700837] [2024-11-02 12:26:07,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:26:07,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-02 12:26:07,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:26:07,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-02 12:26:07,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-02 12:26:07,269 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:07,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:26:07,340 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2024-11-02 12:26:07,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-02 12:26:07,342 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-02 12:26:07,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:26:07,343 INFO L225 Difference]: With dead ends: 33 [2024-11-02 12:26:07,343 INFO L226 Difference]: Without dead ends: 33 [2024-11-02 12:26:07,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-02 12:26:07,344 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 7 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 12:26:07,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 62 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 12:26:07,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-02 12:26:07,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2024-11-02 12:26:07,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.625) internal successors, (39), 30 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:07,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2024-11-02 12:26:07,349 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 7 [2024-11-02 12:26:07,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:26:07,349 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2024-11-02 12:26:07,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:07,350 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2024-11-02 12:26:07,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-02 12:26:07,350 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:26:07,350 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:26:07,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-02 12:26:07,350 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-02 12:26:07,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:26:07,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1187106224, now seen corresponding path program 1 times [2024-11-02 12:26:07,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:26:07,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899786979] [2024-11-02 12:26:07,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:26:07,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:26:07,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:26:07,416 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-02 12:26:07,416 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:26:07,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899786979] [2024-11-02 12:26:07,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899786979] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:26:07,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:26:07,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-02 12:26:07,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716883990] [2024-11-02 12:26:07,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:26:07,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 12:26:07,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:26:07,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 12:26:07,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-02 12:26:07,418 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:07,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:26:07,477 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2024-11-02 12:26:07,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 12:26:07,478 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2024-11-02 12:26:07,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:26:07,478 INFO L225 Difference]: With dead ends: 30 [2024-11-02 12:26:07,479 INFO L226 Difference]: Without dead ends: 30 [2024-11-02 12:26:07,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-02 12:26:07,479 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 18 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-02 12:26:07,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 30 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-02 12:26:07,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-02 12:26:07,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-02 12:26:07,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 29 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-02 12:26:07,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-02 12:26:07,486 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 8 [2024-11-02 12:26:07,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:26:07,486 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-02 12:26:07,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:07,486 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-02 12:26:07,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-02 12:26:07,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:26:07,490 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:26:07,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-02 12:26:07,491 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-02 12:26:07,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:26:07,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1187106225, now seen corresponding path program 1 times [2024-11-02 12:26:07,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:26:07,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432830770] [2024-11-02 12:26:07,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:26:07,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:26:07,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:26:07,677 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-02 12:26:07,678 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:26:07,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432830770] [2024-11-02 12:26:07,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432830770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:26:07,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:26:07,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-02 12:26:07,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167347901] [2024-11-02 12:26:07,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:26:07,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-02 12:26:07,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:26:07,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-02 12:26:07,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-02 12:26:07,679 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:07,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:26:07,750 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2024-11-02 12:26:07,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-02 12:26:07,751 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2024-11-02 12:26:07,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:26:07,751 INFO L225 Difference]: With dead ends: 33 [2024-11-02 12:26:07,751 INFO L226 Difference]: Without dead ends: 33 [2024-11-02 12:26:07,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-02 12:26:07,752 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 12:26:07,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 58 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 12:26:07,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-02 12:26:07,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2024-11-02 12:26:07,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 31 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:07,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2024-11-02 12:26:07,758 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 8 [2024-11-02 12:26:07,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:26:07,758 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2024-11-02 12:26:07,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:07,759 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2024-11-02 12:26:07,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-02 12:26:07,759 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:26:07,759 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:26:07,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-02 12:26:07,759 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-02 12:26:07,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:26:07,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1162321973, now seen corresponding path program 1 times [2024-11-02 12:26:07,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:26:07,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761973582] [2024-11-02 12:26:07,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:26:07,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:26:07,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:26:07,861 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-02 12:26:07,861 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:26:07,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761973582] [2024-11-02 12:26:07,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761973582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:26:07,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:26:07,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-02 12:26:07,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745822504] [2024-11-02 12:26:07,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:26:07,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-02 12:26:07,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:26:07,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-02 12:26:07,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-02 12:26:07,864 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:07,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:26:07,918 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2024-11-02 12:26:07,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-02 12:26:07,919 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2024-11-02 12:26:07,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:26:07,919 INFO L225 Difference]: With dead ends: 38 [2024-11-02 12:26:07,919 INFO L226 Difference]: Without dead ends: 38 [2024-11-02 12:26:07,920 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-02 12:26:07,920 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 18 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-02 12:26:07,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 47 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-02 12:26:07,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-02 12:26:07,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2024-11-02 12:26:07,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.5) internal successors, (39), 30 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:07,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2024-11-02 12:26:07,924 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 8 [2024-11-02 12:26:07,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:26:07,924 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2024-11-02 12:26:07,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:07,925 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2024-11-02 12:26:07,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-02 12:26:07,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:26:07,925 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:26:07,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-02 12:26:07,926 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-02 12:26:07,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:26:07,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1162321974, now seen corresponding path program 1 times [2024-11-02 12:26:07,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:26:07,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116857988] [2024-11-02 12:26:07,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:26:07,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:26:07,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:26:08,052 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-02 12:26:08,053 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:26:08,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116857988] [2024-11-02 12:26:08,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116857988] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:26:08,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:26:08,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-02 12:26:08,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149495811] [2024-11-02 12:26:08,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:26:08,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-02 12:26:08,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:26:08,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-02 12:26:08,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-02 12:26:08,055 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:08,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:26:08,117 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2024-11-02 12:26:08,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-02 12:26:08,118 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2024-11-02 12:26:08,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:26:08,118 INFO L225 Difference]: With dead ends: 39 [2024-11-02 12:26:08,118 INFO L226 Difference]: Without dead ends: 39 [2024-11-02 12:26:08,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-02 12:26:08,119 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 11 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 12:26:08,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 58 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 12:26:08,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-02 12:26:08,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2024-11-02 12:26:08,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 31 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:08,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2024-11-02 12:26:08,123 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 8 [2024-11-02 12:26:08,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:26:08,123 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2024-11-02 12:26:08,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:08,124 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2024-11-02 12:26:08,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-02 12:26:08,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:26:08,124 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:26:08,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-02 12:26:08,125 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-02 12:26:08,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:26:08,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1672228188, now seen corresponding path program 1 times [2024-11-02 12:26:08,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:26:08,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079785762] [2024-11-02 12:26:08,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:26:08,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:26:08,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:26:08,293 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-02 12:26:08,294 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:26:08,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079785762] [2024-11-02 12:26:08,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079785762] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:26:08,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:26:08,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-02 12:26:08,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064981015] [2024-11-02 12:26:08,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:26:08,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 12:26:08,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:26:08,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 12:26:08,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-02 12:26:08,297 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:08,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:26:08,330 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2024-11-02 12:26:08,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 12:26:08,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-02 12:26:08,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:26:08,332 INFO L225 Difference]: With dead ends: 31 [2024-11-02 12:26:08,332 INFO L226 Difference]: Without dead ends: 29 [2024-11-02 12:26:08,333 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-02 12:26:08,333 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 18 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 36 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-02 12:26:08,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 36 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-02 12:26:08,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-02 12:26:08,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2024-11-02 12:26:08,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 27 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:08,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2024-11-02 12:26:08,340 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 9 [2024-11-02 12:26:08,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:26:08,340 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2024-11-02 12:26:08,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:08,340 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2024-11-02 12:26:08,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-02 12:26:08,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:26:08,341 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:26:08,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-02 12:26:08,342 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-02 12:26:08,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:26:08,342 INFO L85 PathProgramCache]: Analyzing trace with hash 320849344, now seen corresponding path program 1 times [2024-11-02 12:26:08,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:26:08,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194998174] [2024-11-02 12:26:08,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:26:08,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:26:08,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:26:08,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-02 12:26:08,597 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:26:08,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194998174] [2024-11-02 12:26:08,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194998174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:26:08,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:26:08,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-02 12:26:08,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253650381] [2024-11-02 12:26:08,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:26:08,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-02 12:26:08,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:26:08,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-02 12:26:08,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-02 12:26:08,599 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 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-02 12:26:08,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:26:08,672 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2024-11-02 12:26:08,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 12:26:08,672 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 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 11 [2024-11-02 12:26:08,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:26:08,673 INFO L225 Difference]: With dead ends: 28 [2024-11-02 12:26:08,673 INFO L226 Difference]: Without dead ends: 28 [2024-11-02 12:26:08,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-02 12:26:08,675 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 2 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 12:26:08,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 57 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 12:26:08,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-02 12:26:08,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-02 12:26:08,679 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-02 12:26:08,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2024-11-02 12:26:08,680 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 11 [2024-11-02 12:26:08,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:26:08,684 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2024-11-02 12:26:08,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 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-02 12:26:08,684 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2024-11-02 12:26:08,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-02 12:26:08,685 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:26:08,685 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:26:08,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-02 12:26:08,685 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-02 12:26:08,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:26:08,686 INFO L85 PathProgramCache]: Analyzing trace with hash 459881538, now seen corresponding path program 1 times [2024-11-02 12:26:08,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:26:08,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410960073] [2024-11-02 12:26:08,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:26:08,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:26:08,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:26:09,084 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-02 12:26:09,085 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:26:09,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410960073] [2024-11-02 12:26:09,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410960073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:26:09,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:26:09,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-02 12:26:09,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693837220] [2024-11-02 12:26:09,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:26:09,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-02 12:26:09,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:26:09,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-02 12:26:09,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-02 12:26:09,088 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:09,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:26:09,211 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2024-11-02 12:26:09,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-02 12:26:09,212 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-02 12:26:09,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:26:09,213 INFO L225 Difference]: With dead ends: 38 [2024-11-02 12:26:09,213 INFO L226 Difference]: Without dead ends: 38 [2024-11-02 12:26:09,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-02 12:26:09,214 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 8 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 12:26:09,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 82 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 12:26:09,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-02 12:26:09,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2024-11-02 12:26:09,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.4) internal successors, (42), 33 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:09,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2024-11-02 12:26:09,218 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 12 [2024-11-02 12:26:09,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:26:09,219 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2024-11-02 12:26:09,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:09,219 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2024-11-02 12:26:09,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-02 12:26:09,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:26:09,220 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:26:09,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-02 12:26:09,221 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-02 12:26:09,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:26:09,221 INFO L85 PathProgramCache]: Analyzing trace with hash 459916359, now seen corresponding path program 1 times [2024-11-02 12:26:09,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:26:09,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611772409] [2024-11-02 12:26:09,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:26:09,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:26:09,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:26:09,683 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-02 12:26:09,683 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:26:09,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611772409] [2024-11-02 12:26:09,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611772409] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-02 12:26:09,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165278511] [2024-11-02 12:26:09,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:26:09,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-02 12:26:09,684 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7327f449-f9a9-43c9-a5ee-3b3149bab75f/bin/utaipan-verify-DbMuA5NWw2/z3 [2024-11-02 12:26:09,687 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7327f449-f9a9-43c9-a5ee-3b3149bab75f/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-02 12:26:09,688 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7327f449-f9a9-43c9-a5ee-3b3149bab75f/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-02 12:26:09,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:26:09,791 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-02 12:26:09,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 12:26:09,940 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-02 12:26:10,196 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-02 12:26:10,197 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-02 12:26:10,342 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-02 12:26:10,342 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 12:26:10,645 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-02 12:26:10,655 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-02 12:26:10,667 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-02 12:26:10,684 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-02 12:26:10,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165278511] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-02 12:26:10,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1212082005] [2024-11-02 12:26:10,703 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2024-11-02 12:26:10,704 INFO L166 IcfgInterpreter]: Building call graph [2024-11-02 12:26:10,708 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-02 12:26:10,713 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-02 12:26:10,713 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-02 12:26:13,785 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-02 12:26:17,376 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1174#(and (= |ULTIMATE.start_cstrlcpy_~d~0#1.offset| (+ |ULTIMATE.start_cstrlcpy_#t~post3#1.offset| 1)) (= |ULTIMATE.start_cstrlcpy_~src#1.offset| 0) (exists ((|v_ULTIMATE.start_cstrlcpy_#t~pre2#1_19| Int)) (and (not (= (mod |v_ULTIMATE.start_cstrlcpy_#t~pre2#1_19| 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_cstrlcpy_#t~post3#1.offset_19| Int) (|v_#memory_int_24| (Array Int (Array Int Int))) (|v_ULTIMATE.start_cstrlcpy_#t~post3#1.base_20| Int)) (and (= |#memory_int| (store |v_#memory_int_24| |v_ULTIMATE.start_cstrlcpy_#t~post3#1.base_20| (store (select |v_#memory_int_24| |v_ULTIMATE.start_cstrlcpy_#t~post3#1.base_20|) |v_ULTIMATE.start_cstrlcpy_#t~post3#1.offset_19| (select (select |#memory_int| |v_ULTIMATE.start_cstrlcpy_#t~post3#1.base_20|) |v_ULTIMATE.start_cstrlcpy_#t~post3#1.offset_19|)))) (<= 1 |ULTIMATE.start_cstrlcpy_#t~post3#1.offset|) (<= 1 |#StackHeapBarrier|) (<= 1 |ULTIMATE.start_cstrlcpy_~siz#1|) (<= 2 |ULTIMATE.start_main_#t~malloc10#1.base|) (<= 0 |v_ULTIMATE.start_cstrlcpy_#t~post3#1.offset_19|) (= (select |#valid| |v_ULTIMATE.start_cstrlcpy_#t~post3#1.base_20|) 1) (<= 2 |v_ULTIMATE.start_cstrlcpy_#t~post3#1.base_20|) (<= 2 |ULTIMATE.start_main_#t~malloc11#1.base|) (not (= (select (select |#memory_int| |v_ULTIMATE.start_cstrlcpy_#t~post3#1.base_20|) |v_ULTIMATE.start_cstrlcpy_#t~post3#1.offset_19|) 0)) (<= 2 |ULTIMATE.start_cstrlcpy_~s~0#1.offset|) (<= 2 |ULTIMATE.start_cstrlcpy_#t~post3#1.base|) (<= (+ |v_ULTIMATE.start_cstrlcpy_#t~post3#1.offset_19| 1) (select |#length| |v_ULTIMATE.start_cstrlcpy_#t~post3#1.base_20|)) (<= 2 |ULTIMATE.start_cstrlcpy_~s~0#1.base|))) (= |ULTIMATE.start_cstrlcpy_~n~0#1| |v_ULTIMATE.start_cstrlcpy_#t~pre2#1_19|))) (= |ULTIMATE.start_cstrlcpy_~d~0#1.base| |ULTIMATE.start_cstrlcpy_#t~post3#1.base|) (<= (+ (select |#length| |ULTIMATE.start_cstrlcpy_~s~0#1.base|) 1) |ULTIMATE.start_cstrlcpy_~s~0#1.offset|))' at error location [2024-11-02 12:26:17,376 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-02 12:26:17,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-02 12:26:17,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2024-11-02 12:26:17,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533020863] [2024-11-02 12:26:17,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-02 12:26:17,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-02 12:26:17,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:26:17,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-02 12:26:17,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=659, Unknown=5, NotChecked=0, Total=756 [2024-11-02 12:26:17,380 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:17,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:26:17,779 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2024-11-02 12:26:17,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-02 12:26:17,780 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-02 12:26:17,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:26:17,781 INFO L225 Difference]: With dead ends: 39 [2024-11-02 12:26:17,781 INFO L226 Difference]: Without dead ends: 39 [2024-11-02 12:26:17,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=107, Invalid=758, Unknown=5, NotChecked=0, Total=870 [2024-11-02 12:26:17,782 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 25 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-02 12:26:17,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 126 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-02 12:26:17,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-02 12:26:17,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2024-11-02 12:26:17,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 34 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:17,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2024-11-02 12:26:17,787 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 12 [2024-11-02 12:26:17,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:26:17,787 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2024-11-02 12:26:17,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:17,787 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2024-11-02 12:26:17,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-02 12:26:17,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:26:17,788 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:26:17,817 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7327f449-f9a9-43c9-a5ee-3b3149bab75f/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-02 12:26:17,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7327f449-f9a9-43c9-a5ee-3b3149bab75f/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-02 12:26:17,993 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-02 12:26:17,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:26:17,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1721795337, now seen corresponding path program 1 times [2024-11-02 12:26:17,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:26:17,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996388676] [2024-11-02 12:26:17,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:26:17,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:26:18,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:26:18,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-02 12:26:18,164 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:26:18,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996388676] [2024-11-02 12:26:18,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996388676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:26:18,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:26:18,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-02 12:26:18,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244608831] [2024-11-02 12:26:18,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:26:18,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-02 12:26:18,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:26:18,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-02 12:26:18,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-02 12:26:18,168 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:18,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:26:18,195 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2024-11-02 12:26:18,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-02 12:26:18,195 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-02 12:26:18,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:26:18,196 INFO L225 Difference]: With dead ends: 35 [2024-11-02 12:26:18,196 INFO L226 Difference]: Without dead ends: 35 [2024-11-02 12:26:18,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-02 12:26:18,197 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 8 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-02 12:26:18,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 53 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-02 12:26:18,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-02 12:26:18,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-02 12:26:18,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 34 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:18,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2024-11-02 12:26:18,204 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 13 [2024-11-02 12:26:18,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:26:18,205 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2024-11-02 12:26:18,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:18,205 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2024-11-02 12:26:18,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-02 12:26:18,205 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:26:18,206 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:26:18,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-02 12:26:18,206 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-02 12:26:18,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:26:18,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1372505220, now seen corresponding path program 1 times [2024-11-02 12:26:18,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:26:18,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204726696] [2024-11-02 12:26:18,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:26:18,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:26:18,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:26:18,708 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-02 12:26:18,708 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:26:18,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204726696] [2024-11-02 12:26:18,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204726696] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-02 12:26:18,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984295620] [2024-11-02 12:26:18,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:26:18,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-02 12:26:18,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7327f449-f9a9-43c9-a5ee-3b3149bab75f/bin/utaipan-verify-DbMuA5NWw2/z3 [2024-11-02 12:26:18,713 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7327f449-f9a9-43c9-a5ee-3b3149bab75f/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-02 12:26:18,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7327f449-f9a9-43c9-a5ee-3b3149bab75f/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-02 12:26:18,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:26:18,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-02 12:26:18,828 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 12:26:19,149 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-02 12:26:19,149 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 12:26:19,490 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 55 treesize of output 45 [2024-11-02 12:26:19,554 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-02 12:26:19,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984295620] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-02 12:26:19,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [173038812] [2024-11-02 12:26:19,557 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2024-11-02 12:26:19,557 INFO L166 IcfgInterpreter]: Building call graph [2024-11-02 12:26:19,557 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-02 12:26:19,558 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-02 12:26:19,558 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-02 12:26:21,924 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-02 12:26:24,952 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1430#(and (= |ULTIMATE.start_cstrlcpy_~src#1.offset| 0) (exists ((|v_ULTIMATE.start_cstrlcpy_#t~post3#1.offset_29| Int) (|v_ULTIMATE.start_cstrlcpy_#t~post3#1.base_29| Int)) (and (<= 2 |v_ULTIMATE.start_cstrlcpy_#t~post3#1.base_29|) (<= 1 |#StackHeapBarrier|) (<= 1 |ULTIMATE.start_cstrlcpy_~siz#1|) (<= 1 |ULTIMATE.start_cstrlcpy_~d~0#1.offset|) (<= 2 |ULTIMATE.start_main_#t~malloc10#1.base|) (<= 2 |ULTIMATE.start_main_#t~malloc11#1.base|) (<= 0 |v_ULTIMATE.start_cstrlcpy_#t~post3#1.offset_29|) (<= 2 |ULTIMATE.start_cstrlcpy_~d~0#1.base|) (<= 1 |ULTIMATE.start_cstrlcpy_~s~0#1.offset|) (<= (select |#length| |v_ULTIMATE.start_cstrlcpy_#t~post3#1.base_29|) |v_ULTIMATE.start_cstrlcpy_#t~post3#1.offset_29|) (<= 2 |ULTIMATE.start_cstrlcpy_~s~0#1.base|))))' at error location [2024-11-02 12:26:24,953 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-02 12:26:24,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-02 12:26:24,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2024-11-02 12:26:24,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460810245] [2024-11-02 12:26:24,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-02 12:26:24,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-02 12:26:24,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:26:24,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-02 12:26:24,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=822, Unknown=5, NotChecked=0, Total=930 [2024-11-02 12:26:24,957 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 22 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 21 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-02 12:26:25,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:26:25,307 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2024-11-02 12:26:25,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-02 12:26:25,308 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 21 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-02 12:26:25,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:26:25,308 INFO L225 Difference]: With dead ends: 36 [2024-11-02 12:26:25,308 INFO L226 Difference]: Without dead ends: 36 [2024-11-02 12:26:25,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=136, Invalid=1049, Unknown=5, NotChecked=0, Total=1190 [2024-11-02 12:26:25,310 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 19 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-02 12:26:25,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 127 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-02 12:26:25,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-02 12:26:25,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-02 12:26:25,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.28125) internal successors, (41), 35 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:25,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2024-11-02 12:26:25,313 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 13 [2024-11-02 12:26:25,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:26:25,313 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2024-11-02 12:26:25,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 21 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-02 12:26:25,313 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2024-11-02 12:26:25,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-02 12:26:25,314 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:26:25,314 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:26:25,337 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7327f449-f9a9-43c9-a5ee-3b3149bab75f/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-02 12:26:25,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7327f449-f9a9-43c9-a5ee-3b3149bab75f/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-02 12:26:25,515 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-02 12:26:25,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:26:25,515 INFO L85 PathProgramCache]: Analyzing trace with hash 2057581541, now seen corresponding path program 1 times [2024-11-02 12:26:25,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:26:25,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002910557] [2024-11-02 12:26:25,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:26:25,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:26:25,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:26:25,942 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-02 12:26:25,942 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:26:25,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002910557] [2024-11-02 12:26:25,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002910557] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-02 12:26:25,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15165767] [2024-11-02 12:26:25,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:26:25,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-02 12:26:25,943 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7327f449-f9a9-43c9-a5ee-3b3149bab75f/bin/utaipan-verify-DbMuA5NWw2/z3 [2024-11-02 12:26:25,945 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7327f449-f9a9-43c9-a5ee-3b3149bab75f/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-02 12:26:25,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7327f449-f9a9-43c9-a5ee-3b3149bab75f/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-02 12:26:26,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:26:26,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-02 12:26:26,027 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 12:26:26,034 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-02 12:26:26,065 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-02 12:26:26,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2024-11-02 12:26:26,376 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-02 12:26:26,377 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-02 12:26:26,501 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-02 12:26:26,501 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 12:26:26,839 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-02 12:26:26,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2024-11-02 12:26:26,859 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-02 12:26:26,860 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 37 treesize of output 34 [2024-11-02 12:26:26,879 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-02 12:26:26,895 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-02 12:26:26,972 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-02 12:26:26,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [15165767] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-02 12:26:26,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [452360906] [2024-11-02 12:26:26,974 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2024-11-02 12:26:26,975 INFO L166 IcfgInterpreter]: Building call graph [2024-11-02 12:26:26,975 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-02 12:26:26,976 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-02 12:26:26,976 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-02 12:26:27,853 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-02 12:26:30,472 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1620#(and (<= 1 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_main_#t~malloc10#1.base|) (= |ULTIMATE.start_cstrlcpy_~src#1.offset| 0) (<= 2 |ULTIMATE.start_main_#t~malloc11#1.base|) (<= 1 |ULTIMATE.start_cstrlcpy_~s~0#1.offset|) (<= (+ (select |#length| |ULTIMATE.start_cstrlcpy_~s~0#1.base|) 1) |ULTIMATE.start_cstrlcpy_~s~0#1.offset|) (<= 2 |ULTIMATE.start_cstrlcpy_~s~0#1.base|))' at error location [2024-11-02 12:26:30,473 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-02 12:26:30,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-02 12:26:30,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2024-11-02 12:26:30,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609871868] [2024-11-02 12:26:30,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-02 12:26:30,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-02 12:26:30,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:26:30,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-02 12:26:30,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1011, Unknown=9, NotChecked=0, Total=1190 [2024-11-02 12:26:30,475 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)