./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8393723b 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_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8e0bd33ffca0122f84e298c52bb9fdae01e72661c94f68aaa49ed0f187d88b87 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-19 08:01:46,581 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 08:01:46,584 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 08:01:46,623 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 08:01:46,624 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 08:01:46,628 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 08:01:46,630 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 08:01:46,635 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 08:01:46,637 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 08:01:46,640 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 08:01:46,641 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 08:01:46,644 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 08:01:46,645 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 08:01:46,650 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 08:01:46,651 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 08:01:46,652 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 08:01:46,654 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 08:01:46,655 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 08:01:46,657 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 08:01:46,660 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 08:01:46,663 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 08:01:46,664 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 08:01:46,667 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 08:01:46,668 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 08:01:46,674 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 08:01:46,677 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 08:01:46,678 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 08:01:46,680 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 08:01:46,681 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 08:01:46,682 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 08:01:46,682 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 08:01:46,683 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 08:01:46,684 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 08:01:46,686 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 08:01:46,687 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 08:01:46,687 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 08:01:46,688 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 08:01:46,688 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 08:01:46,688 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 08:01:46,689 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 08:01:46,690 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 08:01:46,690 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-19 08:01:46,731 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 08:01:46,731 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 08:01:46,732 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 08:01:46,732 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 08:01:46,733 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 08:01:46,733 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 08:01:46,733 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 08:01:46,734 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 08:01:46,734 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 08:01:46,734 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 08:01:46,735 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 08:01:46,735 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 08:01:46,736 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 08:01:46,736 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 08:01:46,736 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 08:01:46,736 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 08:01:46,736 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 08:01:46,737 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 08:01:46,737 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-19 08:01:46,738 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-19 08:01:46,738 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 08:01:46,738 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 08:01:46,738 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-19 08:01:46,738 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 08:01:46,740 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 08:01:46,741 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 08:01:46,741 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-19 08:01:46,741 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-19 08:01:46,741 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-19 08:01:46,742 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 08:01:46,742 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-19 08:01:46,742 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 08:01:46,742 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 08:01:46,742 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 08:01:46,743 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 08:01:46,743 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 08:01:46,743 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 08:01:46,743 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 08:01:46,744 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 08:01:46,744 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 08:01:46,744 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 08:01:46,744 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 08:01:46,744 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/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_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8e0bd33ffca0122f84e298c52bb9fdae01e72661c94f68aaa49ed0f187d88b87 [2022-11-19 08:01:47,011 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 08:01:47,033 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 08:01:47,036 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 08:01:47,037 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 08:01:47,038 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 08:01:47,039 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-19 08:01:47,133 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/data/0d2d6f7f3/453cfd36775743818c1295b2b29b88e8/FLAGb94938a7e [2022-11-19 08:01:47,599 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 08:01:47,599 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-19 08:01:47,631 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/data/0d2d6f7f3/453cfd36775743818c1295b2b29b88e8/FLAGb94938a7e [2022-11-19 08:01:47,916 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/data/0d2d6f7f3/453cfd36775743818c1295b2b29b88e8 [2022-11-19 08:01:47,920 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 08:01:47,923 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 08:01:47,926 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 08:01:47,927 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 08:01:47,930 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 08:01:47,931 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:01:47" (1/1) ... [2022-11-19 08:01:47,933 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77b4b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:47, skipping insertion in model container [2022-11-19 08:01:47,934 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:01:47" (1/1) ... [2022-11-19 08:01:47,942 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 08:01:47,999 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 08:01:48,177 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-11-19 08:01:48,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 08:01:48,514 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 08:01:48,527 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-11-19 08:01:48,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 08:01:48,646 INFO L208 MainTranslator]: Completed translation [2022-11-19 08:01:48,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:48 WrapperNode [2022-11-19 08:01:48,647 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 08:01:48,647 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 08:01:48,648 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 08:01:48,648 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 08:01:48,655 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:48" (1/1) ... [2022-11-19 08:01:48,683 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:48" (1/1) ... [2022-11-19 08:01:48,721 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2022-11-19 08:01:48,722 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 08:01:48,723 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 08:01:48,723 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 08:01:48,723 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 08:01:48,738 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:48" (1/1) ... [2022-11-19 08:01:48,739 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:48" (1/1) ... [2022-11-19 08:01:48,752 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:48" (1/1) ... [2022-11-19 08:01:48,752 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:48" (1/1) ... [2022-11-19 08:01:48,760 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:48" (1/1) ... [2022-11-19 08:01:48,762 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:48" (1/1) ... [2022-11-19 08:01:48,764 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:48" (1/1) ... [2022-11-19 08:01:48,782 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:48" (1/1) ... [2022-11-19 08:01:48,796 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 08:01:48,797 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 08:01:48,797 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 08:01:48,797 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 08:01:48,801 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:48" (1/1) ... [2022-11-19 08:01:48,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 08:01:48,827 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:01:48,840 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 08:01:48,849 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 08:01:48,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-19 08:01:48,882 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-19 08:01:48,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 08:01:48,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-19 08:01:48,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 08:01:48,882 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-19 08:01:48,882 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-19 08:01:48,882 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-19 08:01:48,882 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-19 08:01:48,883 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-19 08:01:48,883 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-19 08:01:48,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-19 08:01:48,883 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-19 08:01:48,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 08:01:48,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 08:01:48,884 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-19 08:01:49,024 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 08:01:49,026 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 08:01:49,610 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 08:01:49,804 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 08:01:49,804 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-19 08:01:49,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:01:49 BoogieIcfgContainer [2022-11-19 08:01:49,809 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 08:01:49,813 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 08:01:49,814 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 08:01:49,817 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 08:01:49,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:01:47" (1/3) ... [2022-11-19 08:01:49,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18d374d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:01:49, skipping insertion in model container [2022-11-19 08:01:49,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:48" (2/3) ... [2022-11-19 08:01:49,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18d374d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:01:49, skipping insertion in model container [2022-11-19 08:01:49,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:01:49" (3/3) ... [2022-11-19 08:01:49,821 INFO L112 eAbstractionObserver]: Analyzing ICFG safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-19 08:01:49,840 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 08:01:49,840 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-19 08:01:49,840 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-19 08:01:49,907 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-19 08:01:49,956 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-19 08:01:49,975 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 124 transitions, 263 flow [2022-11-19 08:01:49,984 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 124 transitions, 263 flow [2022-11-19 08:01:49,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 124 transitions, 263 flow [2022-11-19 08:01:50,063 INFO L130 PetriNetUnfolder]: 2/121 cut-off events. [2022-11-19 08:01:50,063 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-19 08:01:50,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 121 events. 2/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2022-11-19 08:01:50,076 INFO L119 LiptonReduction]: Number of co-enabled transitions 2264 [2022-11-19 08:01:56,235 INFO L134 LiptonReduction]: Checked pairs total: 5902 [2022-11-19 08:01:56,235 INFO L136 LiptonReduction]: Total number of compositions: 119 [2022-11-19 08:01:56,248 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 35 transitions, 85 flow [2022-11-19 08:01:56,330 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1028 states, 1017 states have (on average 3.3235004916420845) internal successors, (3380), 1027 states have internal predecessors, (3380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:01:56,349 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 08:01:56,363 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@57b33dce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 08:01:56,364 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-19 08:01:56,368 INFO L276 IsEmpty]: Start isEmpty. Operand has 1028 states, 1017 states have (on average 3.3235004916420845) internal successors, (3380), 1027 states have internal predecessors, (3380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:01:56,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-19 08:01:56,374 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:01:56,374 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-19 08:01:56,376 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:01:56,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:01:56,385 INFO L85 PathProgramCache]: Analyzing trace with hash 593, now seen corresponding path program 1 times [2022-11-19 08:01:56,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:01:56,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107380346] [2022-11-19 08:01:56,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:01:56,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:01:56,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:01:56,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:01:56,492 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:01:56,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107380346] [2022-11-19 08:01:56,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107380346] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:01:56,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:01:56,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-19 08:01:56,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453613777] [2022-11-19 08:01:56,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:01:56,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-19 08:01:56,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:01:56,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-19 08:01:56,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-19 08:01:56,528 INFO L87 Difference]: Start difference. First operand has 1028 states, 1017 states have (on average 3.3235004916420845) internal successors, (3380), 1027 states have internal predecessors, (3380), 0 states have call successors, (0), 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 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:01:56,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:01:56,641 INFO L93 Difference]: Finished difference Result 970 states and 3096 transitions. [2022-11-19 08:01:56,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-19 08:01:56,644 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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 1 [2022-11-19 08:01:56,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:01:56,666 INFO L225 Difference]: With dead ends: 970 [2022-11-19 08:01:56,666 INFO L226 Difference]: Without dead ends: 970 [2022-11-19 08:01:56,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-19 08:01:56,670 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:01:56,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:01:56,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2022-11-19 08:01:56,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 970. [2022-11-19 08:01:56,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 965 states have (on average 3.2082901554404146) internal successors, (3096), 969 states have internal predecessors, (3096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:01:56,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 3096 transitions. [2022-11-19 08:01:56,793 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 3096 transitions. Word has length 1 [2022-11-19 08:01:56,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:01:56,794 INFO L495 AbstractCegarLoop]: Abstraction has 970 states and 3096 transitions. [2022-11-19 08:01:56,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:01:56,794 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 3096 transitions. [2022-11-19 08:01:56,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-19 08:01:56,795 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:01:56,795 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:01:56,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-19 08:01:56,796 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:01:56,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:01:56,797 INFO L85 PathProgramCache]: Analyzing trace with hash -854440776, now seen corresponding path program 1 times [2022-11-19 08:01:56,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:01:56,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863494181] [2022-11-19 08:01:56,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:01:56,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:01:56,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:01:57,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:01:57,205 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:01:57,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863494181] [2022-11-19 08:01:57,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863494181] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:01:57,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:01:57,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 08:01:57,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67775541] [2022-11-19 08:01:57,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:01:57,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:01:57,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:01:57,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:01:57,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:01:57,209 INFO L87 Difference]: Start difference. First operand 970 states and 3096 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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) [2022-11-19 08:01:57,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:01:57,313 INFO L93 Difference]: Finished difference Result 802 states and 2518 transitions. [2022-11-19 08:01:57,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:01:57,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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 [2022-11-19 08:01:57,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:01:57,321 INFO L225 Difference]: With dead ends: 802 [2022-11-19 08:01:57,321 INFO L226 Difference]: Without dead ends: 778 [2022-11-19 08:01:57,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:01:57,324 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 8 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:01:57,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:01:57,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2022-11-19 08:01:57,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 778. [2022-11-19 08:01:57,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 776 states have (on average 3.1649484536082473) internal successors, (2456), 777 states have internal predecessors, (2456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:01:57,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 2456 transitions. [2022-11-19 08:01:57,355 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 2456 transitions. Word has length 7 [2022-11-19 08:01:57,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:01:57,356 INFO L495 AbstractCegarLoop]: Abstraction has 778 states and 2456 transitions. [2022-11-19 08:01:57,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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) [2022-11-19 08:01:57,356 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 2456 transitions. [2022-11-19 08:01:57,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-19 08:01:57,358 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:01:57,358 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:01:57,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-19 08:01:57,359 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:01:57,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:01:57,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1628444087, now seen corresponding path program 1 times [2022-11-19 08:01:57,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:01:57,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713356062] [2022-11-19 08:01:57,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:01:57,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:01:57,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:01:57,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:01:57,932 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:01:57,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713356062] [2022-11-19 08:01:57,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713356062] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:01:57,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:01:57,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:01:57,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720291837] [2022-11-19 08:01:57,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:01:57,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 08:01:57,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:01:57,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 08:01:57,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:01:57,935 INFO L87 Difference]: Start difference. First operand 778 states and 2456 transitions. Second operand has 5 states, 4 states have (on average 2.5) 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) [2022-11-19 08:01:58,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:01:58,379 INFO L93 Difference]: Finished difference Result 934 states and 2873 transitions. [2022-11-19 08:01:58,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 08:01:58,379 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) 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 10 [2022-11-19 08:01:58,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:01:58,385 INFO L225 Difference]: With dead ends: 934 [2022-11-19 08:01:58,386 INFO L226 Difference]: Without dead ends: 934 [2022-11-19 08:01:58,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-19 08:01:58,387 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 45 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 08:01:58,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 5 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 08:01:58,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2022-11-19 08:01:58,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 790. [2022-11-19 08:01:58,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 790 states, 788 states have (on average 3.1434010152284264) internal successors, (2477), 789 states have internal predecessors, (2477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:01:58,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 2477 transitions. [2022-11-19 08:01:58,417 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 2477 transitions. Word has length 10 [2022-11-19 08:01:58,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:01:58,417 INFO L495 AbstractCegarLoop]: Abstraction has 790 states and 2477 transitions. [2022-11-19 08:01:58,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) 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) [2022-11-19 08:01:58,417 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 2477 transitions. [2022-11-19 08:01:58,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-19 08:01:58,419 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:01:58,419 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:01:58,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-19 08:01:58,419 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:01:58,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:01:58,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1628444099, now seen corresponding path program 1 times [2022-11-19 08:01:58,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:01:58,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088297909] [2022-11-19 08:01:58,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:01:58,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:01:58,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:01:58,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:01:58,946 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:01:58,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088297909] [2022-11-19 08:01:58,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088297909] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:01:58,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:01:58,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 08:01:58,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131270941] [2022-11-19 08:01:58,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:01:58,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 08:01:58,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:01:58,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 08:01:58,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-19 08:01:58,949 INFO L87 Difference]: Start difference. First operand 790 states and 2477 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:01:59,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:01:59,199 INFO L93 Difference]: Finished difference Result 1090 states and 3290 transitions. [2022-11-19 08:01:59,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 08:01:59,199 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-19 08:01:59,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:01:59,205 INFO L225 Difference]: With dead ends: 1090 [2022-11-19 08:01:59,205 INFO L226 Difference]: Without dead ends: 970 [2022-11-19 08:01:59,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-19 08:01:59,206 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 36 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:01:59,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 5 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 08:01:59,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2022-11-19 08:01:59,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 910. [2022-11-19 08:01:59,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 910 states, 908 states have (on average 3.0825991189427313) internal successors, (2799), 909 states have internal predecessors, (2799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:01:59,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 2799 transitions. [2022-11-19 08:01:59,239 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 2799 transitions. Word has length 10 [2022-11-19 08:01:59,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:01:59,239 INFO L495 AbstractCegarLoop]: Abstraction has 910 states and 2799 transitions. [2022-11-19 08:01:59,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:01:59,240 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 2799 transitions. [2022-11-19 08:01:59,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-19 08:01:59,242 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:01:59,243 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:01:59,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-19 08:01:59,243 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:01:59,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:01:59,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1304232627, now seen corresponding path program 1 times [2022-11-19 08:01:59,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:01:59,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020732947] [2022-11-19 08:01:59,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:01:59,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:01:59,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:01:59,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:01:59,620 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:01:59,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020732947] [2022-11-19 08:01:59,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020732947] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:01:59,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:01:59,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 08:01:59,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700504916] [2022-11-19 08:01:59,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:01:59,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:01:59,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:01:59,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:01:59,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:01:59,629 INFO L87 Difference]: Start difference. First operand 910 states and 2799 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:01:59,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:01:59,767 INFO L93 Difference]: Finished difference Result 1066 states and 3176 transitions. [2022-11-19 08:01:59,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 08:01:59,768 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-19 08:01:59,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:01:59,774 INFO L225 Difference]: With dead ends: 1066 [2022-11-19 08:01:59,774 INFO L226 Difference]: Without dead ends: 1006 [2022-11-19 08:01:59,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:01:59,776 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 21 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:01:59,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 3 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:01:59,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2022-11-19 08:01:59,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 916. [2022-11-19 08:01:59,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 916 states, 914 states have (on average 3.073304157549234) internal successors, (2809), 915 states have internal predecessors, (2809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:01:59,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 2809 transitions. [2022-11-19 08:01:59,813 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 2809 transitions. Word has length 13 [2022-11-19 08:01:59,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:01:59,814 INFO L495 AbstractCegarLoop]: Abstraction has 916 states and 2809 transitions. [2022-11-19 08:01:59,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:01:59,814 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 2809 transitions. [2022-11-19 08:01:59,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-19 08:01:59,820 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:01:59,820 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:01:59,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-19 08:01:59,821 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:01:59,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:01:59,822 INFO L85 PathProgramCache]: Analyzing trace with hash 484484233, now seen corresponding path program 1 times [2022-11-19 08:01:59,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:01:59,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673580710] [2022-11-19 08:01:59,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:01:59,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:01:59,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:02:01,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:02:01,043 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:02:01,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673580710] [2022-11-19 08:02:01,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673580710] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:02:01,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:02:01,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-19 08:02:01,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607850733] [2022-11-19 08:02:01,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:02:01,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-19 08:02:01,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:02:01,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-19 08:02:01,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-19 08:02:01,046 INFO L87 Difference]: Start difference. First operand 916 states and 2809 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:01,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:02:01,296 INFO L93 Difference]: Finished difference Result 866 states and 2585 transitions. [2022-11-19 08:02:01,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 08:02:01,297 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-19 08:02:01,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:02:01,301 INFO L225 Difference]: With dead ends: 866 [2022-11-19 08:02:01,302 INFO L226 Difference]: Without dead ends: 806 [2022-11-19 08:02:01,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-19 08:02:01,303 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 27 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:02:01,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 5 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 08:02:01,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2022-11-19 08:02:01,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 538. [2022-11-19 08:02:01,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 537 states have (on average 2.996275605214153) internal successors, (1609), 537 states have internal predecessors, (1609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:01,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 1609 transitions. [2022-11-19 08:02:01,322 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 1609 transitions. Word has length 13 [2022-11-19 08:02:01,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:02:01,323 INFO L495 AbstractCegarLoop]: Abstraction has 538 states and 1609 transitions. [2022-11-19 08:02:01,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:01,323 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 1609 transitions. [2022-11-19 08:02:01,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-19 08:02:01,324 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:02:01,325 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:02:01,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-19 08:02:01,325 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:02:01,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:02:01,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1776505607, now seen corresponding path program 1 times [2022-11-19 08:02:01,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:02:01,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627879773] [2022-11-19 08:02:01,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:02:01,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:02:01,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:02:02,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:02:02,500 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:02:02,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627879773] [2022-11-19 08:02:02,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627879773] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:02:02,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:02:02,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 08:02:02,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833533793] [2022-11-19 08:02:02,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:02:02,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 08:02:02,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:02:02,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 08:02:02,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-19 08:02:02,502 INFO L87 Difference]: Start difference. First operand 538 states and 1609 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:02,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:02:02,763 INFO L93 Difference]: Finished difference Result 603 states and 1765 transitions. [2022-11-19 08:02:02,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 08:02:02,764 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-11-19 08:02:02,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:02:02,767 INFO L225 Difference]: With dead ends: 603 [2022-11-19 08:02:02,767 INFO L226 Difference]: Without dead ends: 558 [2022-11-19 08:02:02,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-19 08:02:02,768 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 41 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:02:02,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 7 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 08:02:02,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2022-11-19 08:02:02,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 558. [2022-11-19 08:02:02,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 557 states have (on average 2.9802513464991023) internal successors, (1660), 557 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:02,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 1660 transitions. [2022-11-19 08:02:02,792 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 1660 transitions. Word has length 14 [2022-11-19 08:02:02,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:02:02,792 INFO L495 AbstractCegarLoop]: Abstraction has 558 states and 1660 transitions. [2022-11-19 08:02:02,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:02,793 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 1660 transitions. [2022-11-19 08:02:02,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-19 08:02:02,794 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:02:02,794 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:02:02,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-19 08:02:02,796 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:02:02,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:02:02,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1783641359, now seen corresponding path program 2 times [2022-11-19 08:02:02,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:02:02,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683553860] [2022-11-19 08:02:02,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:02:02,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:02:02,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:02:03,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:02:03,936 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:02:03,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683553860] [2022-11-19 08:02:03,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683553860] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:02:03,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:02:03,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 08:02:03,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150229029] [2022-11-19 08:02:03,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:02:03,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 08:02:03,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:02:03,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 08:02:03,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-19 08:02:03,939 INFO L87 Difference]: Start difference. First operand 558 states and 1660 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:04,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:02:04,293 INFO L93 Difference]: Finished difference Result 816 states and 2397 transitions. [2022-11-19 08:02:04,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-19 08:02:04,294 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-11-19 08:02:04,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:02:04,298 INFO L225 Difference]: With dead ends: 816 [2022-11-19 08:02:04,298 INFO L226 Difference]: Without dead ends: 744 [2022-11-19 08:02:04,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-19 08:02:04,300 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 54 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 08:02:04,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 10 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 08:02:04,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2022-11-19 08:02:04,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 716. [2022-11-19 08:02:04,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 715 states have (on average 3.0013986013986016) internal successors, (2146), 715 states have internal predecessors, (2146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:04,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 2146 transitions. [2022-11-19 08:02:04,326 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 2146 transitions. Word has length 14 [2022-11-19 08:02:04,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:02:04,327 INFO L495 AbstractCegarLoop]: Abstraction has 716 states and 2146 transitions. [2022-11-19 08:02:04,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:04,327 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 2146 transitions. [2022-11-19 08:02:04,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-19 08:02:04,329 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:02:04,329 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:02:04,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-19 08:02:04,329 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:02:04,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:02:04,330 INFO L85 PathProgramCache]: Analyzing trace with hash -823575871, now seen corresponding path program 1 times [2022-11-19 08:02:04,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:02:04,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439508052] [2022-11-19 08:02:04,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:02:04,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:02:04,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:02:05,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:02:05,058 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:02:05,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439508052] [2022-11-19 08:02:05,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439508052] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:02:05,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:02:05,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-19 08:02:05,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281621457] [2022-11-19 08:02:05,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:02:05,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-19 08:02:05,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:02:05,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-19 08:02:05,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-11-19 08:02:05,060 INFO L87 Difference]: Start difference. First operand 716 states and 2146 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:05,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:02:05,539 INFO L93 Difference]: Finished difference Result 1172 states and 3452 transitions. [2022-11-19 08:02:05,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-19 08:02:05,540 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-19 08:02:05,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:02:05,542 INFO L225 Difference]: With dead ends: 1172 [2022-11-19 08:02:05,543 INFO L226 Difference]: Without dead ends: 684 [2022-11-19 08:02:05,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2022-11-19 08:02:05,544 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 74 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 08:02:05,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 2 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-19 08:02:05,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2022-11-19 08:02:05,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 582. [2022-11-19 08:02:05,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 581 states have (on average 2.8881239242685024) internal successors, (1678), 581 states have internal predecessors, (1678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:05,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 1678 transitions. [2022-11-19 08:02:05,563 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 1678 transitions. Word has length 15 [2022-11-19 08:02:05,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:02:05,563 INFO L495 AbstractCegarLoop]: Abstraction has 582 states and 1678 transitions. [2022-11-19 08:02:05,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:05,564 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 1678 transitions. [2022-11-19 08:02:05,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-19 08:02:05,565 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:02:05,566 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:02:05,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-19 08:02:05,566 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:02:05,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:02:05,567 INFO L85 PathProgramCache]: Analyzing trace with hash 2037699218, now seen corresponding path program 1 times [2022-11-19 08:02:05,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:02:05,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275064177] [2022-11-19 08:02:05,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:02:05,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:02:05,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:02:06,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:02:06,754 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:02:06,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275064177] [2022-11-19 08:02:06,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275064177] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:02:06,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:02:06,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-19 08:02:06,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941286056] [2022-11-19 08:02:06,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:02:06,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-19 08:02:06,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:02:06,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-19 08:02:06,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-19 08:02:06,756 INFO L87 Difference]: Start difference. First operand 582 states and 1678 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:07,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:02:07,309 INFO L93 Difference]: Finished difference Result 1004 states and 2798 transitions. [2022-11-19 08:02:07,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-19 08:02:07,310 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-19 08:02:07,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:02:07,314 INFO L225 Difference]: With dead ends: 1004 [2022-11-19 08:02:07,314 INFO L226 Difference]: Without dead ends: 714 [2022-11-19 08:02:07,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-11-19 08:02:07,314 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 51 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 08:02:07,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 13 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-19 08:02:07,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2022-11-19 08:02:07,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 496. [2022-11-19 08:02:07,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 495 states have (on average 2.7595959595959596) internal successors, (1366), 495 states have internal predecessors, (1366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:07,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 1366 transitions. [2022-11-19 08:02:07,331 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 1366 transitions. Word has length 15 [2022-11-19 08:02:07,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:02:07,332 INFO L495 AbstractCegarLoop]: Abstraction has 496 states and 1366 transitions. [2022-11-19 08:02:07,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:07,334 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 1366 transitions. [2022-11-19 08:02:07,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-19 08:02:07,335 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:02:07,336 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:02:07,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-19 08:02:07,336 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:02:07,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:02:07,337 INFO L85 PathProgramCache]: Analyzing trace with hash -541763999, now seen corresponding path program 1 times [2022-11-19 08:02:07,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:02:07,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80588316] [2022-11-19 08:02:07,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:02:07,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:02:07,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:02:09,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:02:09,076 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:02:09,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80588316] [2022-11-19 08:02:09,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80588316] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:02:09,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:02:09,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-19 08:02:09,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223072350] [2022-11-19 08:02:09,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:02:09,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-19 08:02:09,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:02:09,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-19 08:02:09,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-19 08:02:09,078 INFO L87 Difference]: Start difference. First operand 496 states and 1366 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:09,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:02:09,446 INFO L93 Difference]: Finished difference Result 514 states and 1393 transitions. [2022-11-19 08:02:09,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 08:02:09,447 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-19 08:02:09,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:02:09,449 INFO L225 Difference]: With dead ends: 514 [2022-11-19 08:02:09,449 INFO L226 Difference]: Without dead ends: 484 [2022-11-19 08:02:09,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-19 08:02:09,450 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 23 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 08:02:09,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 11 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 08:02:09,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2022-11-19 08:02:09,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 464. [2022-11-19 08:02:09,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 463 states have (on average 2.7667386609071274) internal successors, (1281), 463 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:09,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 1281 transitions. [2022-11-19 08:02:09,465 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 1281 transitions. Word has length 15 [2022-11-19 08:02:09,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:02:09,466 INFO L495 AbstractCegarLoop]: Abstraction has 464 states and 1281 transitions. [2022-11-19 08:02:09,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:09,466 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 1281 transitions. [2022-11-19 08:02:09,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-19 08:02:09,467 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:02:09,468 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:02:09,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-19 08:02:09,469 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:02:09,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:02:09,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1255904962, now seen corresponding path program 1 times [2022-11-19 08:02:09,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:02:09,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390346298] [2022-11-19 08:02:09,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:02:09,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:02:09,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:02:11,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:02:11,089 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:02:11,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390346298] [2022-11-19 08:02:11,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390346298] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:02:11,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:02:11,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-19 08:02:11,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363732777] [2022-11-19 08:02:11,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:02:11,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-19 08:02:11,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:02:11,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-19 08:02:11,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-19 08:02:11,090 INFO L87 Difference]: Start difference. First operand 464 states and 1281 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:11,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:02:11,930 INFO L93 Difference]: Finished difference Result 838 states and 2249 transitions. [2022-11-19 08:02:11,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-19 08:02:11,931 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-19 08:02:11,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:02:11,933 INFO L225 Difference]: With dead ends: 838 [2022-11-19 08:02:11,934 INFO L226 Difference]: Without dead ends: 505 [2022-11-19 08:02:11,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-11-19 08:02:11,934 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 52 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 08:02:11,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 14 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-19 08:02:11,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-11-19 08:02:11,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 356. [2022-11-19 08:02:11,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 355 states have (on average 2.5859154929577466) internal successors, (918), 355 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:11,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 918 transitions. [2022-11-19 08:02:11,947 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 918 transitions. Word has length 16 [2022-11-19 08:02:11,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:02:11,947 INFO L495 AbstractCegarLoop]: Abstraction has 356 states and 918 transitions. [2022-11-19 08:02:11,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:11,948 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 918 transitions. [2022-11-19 08:02:11,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-19 08:02:11,949 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:02:11,949 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:02:11,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-19 08:02:11,949 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:02:11,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:02:11,950 INFO L85 PathProgramCache]: Analyzing trace with hash 2117622568, now seen corresponding path program 2 times [2022-11-19 08:02:11,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:02:11,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567303954] [2022-11-19 08:02:11,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:02:11,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:02:12,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:02:13,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:02:13,054 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:02:13,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567303954] [2022-11-19 08:02:13,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567303954] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:02:13,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:02:13,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-19 08:02:13,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132709059] [2022-11-19 08:02:13,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:02:13,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-19 08:02:13,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:02:13,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-19 08:02:13,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-19 08:02:13,056 INFO L87 Difference]: Start difference. First operand 356 states and 918 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:13,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:02:13,990 INFO L93 Difference]: Finished difference Result 615 states and 1552 transitions. [2022-11-19 08:02:13,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-19 08:02:13,991 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-19 08:02:13,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:02:13,993 INFO L225 Difference]: With dead ends: 615 [2022-11-19 08:02:13,993 INFO L226 Difference]: Without dead ends: 452 [2022-11-19 08:02:13,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2022-11-19 08:02:13,994 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 77 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-19 08:02:13,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 18 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-19 08:02:13,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2022-11-19 08:02:14,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 390. [2022-11-19 08:02:14,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 389 states have (on average 2.55012853470437) internal successors, (992), 389 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:14,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 992 transitions. [2022-11-19 08:02:14,007 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 992 transitions. Word has length 16 [2022-11-19 08:02:14,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:02:14,007 INFO L495 AbstractCegarLoop]: Abstraction has 390 states and 992 transitions. [2022-11-19 08:02:14,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:14,007 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 992 transitions. [2022-11-19 08:02:14,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-19 08:02:14,008 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:02:14,009 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:02:14,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-19 08:02:14,009 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:02:14,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:02:14,010 INFO L85 PathProgramCache]: Analyzing trace with hash -327323628, now seen corresponding path program 3 times [2022-11-19 08:02:14,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:02:14,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435846404] [2022-11-19 08:02:14,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:02:14,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:02:14,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:02:14,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:02:14,797 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:02:14,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435846404] [2022-11-19 08:02:14,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435846404] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:02:14,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:02:14,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-19 08:02:14,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238703621] [2022-11-19 08:02:14,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:02:14,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-19 08:02:14,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:02:14,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-19 08:02:14,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-19 08:02:14,799 INFO L87 Difference]: Start difference. First operand 390 states and 992 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:15,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:02:15,717 INFO L93 Difference]: Finished difference Result 568 states and 1417 transitions. [2022-11-19 08:02:15,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-19 08:02:15,718 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-19 08:02:15,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:02:15,720 INFO L225 Difference]: With dead ends: 568 [2022-11-19 08:02:15,720 INFO L226 Difference]: Without dead ends: 375 [2022-11-19 08:02:15,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2022-11-19 08:02:15,721 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 69 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-19 08:02:15,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 12 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-19 08:02:15,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2022-11-19 08:02:15,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 353. [2022-11-19 08:02:15,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 352 states have (on average 2.522727272727273) internal successors, (888), 352 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:15,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 888 transitions. [2022-11-19 08:02:15,732 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 888 transitions. Word has length 16 [2022-11-19 08:02:15,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:02:15,732 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 888 transitions. [2022-11-19 08:02:15,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:15,733 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 888 transitions. [2022-11-19 08:02:15,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-19 08:02:15,734 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:02:15,734 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:02:15,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-19 08:02:15,734 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:02:15,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:02:15,735 INFO L85 PathProgramCache]: Analyzing trace with hash 385145648, now seen corresponding path program 4 times [2022-11-19 08:02:15,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:02:15,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155910668] [2022-11-19 08:02:15,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:02:15,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:02:15,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:02:16,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:02:16,244 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:02:16,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155910668] [2022-11-19 08:02:16,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155910668] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:02:16,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:02:16,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 08:02:16,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403403780] [2022-11-19 08:02:16,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:02:16,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 08:02:16,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:02:16,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 08:02:16,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-19 08:02:16,246 INFO L87 Difference]: Start difference. First operand 353 states and 888 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:16,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:02:16,553 INFO L93 Difference]: Finished difference Result 426 states and 1047 transitions. [2022-11-19 08:02:16,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-19 08:02:16,554 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-19 08:02:16,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:02:16,556 INFO L225 Difference]: With dead ends: 426 [2022-11-19 08:02:16,556 INFO L226 Difference]: Without dead ends: 372 [2022-11-19 08:02:16,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-11-19 08:02:16,557 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 72 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:02:16,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 9 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 08:02:16,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2022-11-19 08:02:16,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 355. [2022-11-19 08:02:16,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 354 states have (on average 2.519774011299435) internal successors, (892), 354 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:16,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 892 transitions. [2022-11-19 08:02:16,573 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 892 transitions. Word has length 16 [2022-11-19 08:02:16,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:02:16,573 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 892 transitions. [2022-11-19 08:02:16,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:16,574 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 892 transitions. [2022-11-19 08:02:16,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-19 08:02:16,575 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:02:16,575 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:02:16,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-19 08:02:16,576 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:02:16,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:02:16,576 INFO L85 PathProgramCache]: Analyzing trace with hash -2059800548, now seen corresponding path program 5 times [2022-11-19 08:02:16,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:02:16,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749457920] [2022-11-19 08:02:16,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:02:16,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:02:16,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:02:17,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:02:17,637 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:02:17,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749457920] [2022-11-19 08:02:17,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749457920] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:02:17,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:02:17,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-19 08:02:17,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056585633] [2022-11-19 08:02:17,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:02:17,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-19 08:02:17,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:02:17,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-19 08:02:17,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-19 08:02:17,639 INFO L87 Difference]: Start difference. First operand 355 states and 892 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:18,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:02:18,510 INFO L93 Difference]: Finished difference Result 522 states and 1301 transitions. [2022-11-19 08:02:18,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-19 08:02:18,511 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-19 08:02:18,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:02:18,513 INFO L225 Difference]: With dead ends: 522 [2022-11-19 08:02:18,513 INFO L226 Difference]: Without dead ends: 354 [2022-11-19 08:02:18,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2022-11-19 08:02:18,514 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 77 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-19 08:02:18,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 15 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-19 08:02:18,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2022-11-19 08:02:18,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 277. [2022-11-19 08:02:18,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 2.528985507246377) internal successors, (698), 276 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:18,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 698 transitions. [2022-11-19 08:02:18,524 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 698 transitions. Word has length 16 [2022-11-19 08:02:18,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:02:18,525 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 698 transitions. [2022-11-19 08:02:18,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:18,525 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 698 transitions. [2022-11-19 08:02:18,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-19 08:02:18,526 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:02:18,526 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:02:18,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-19 08:02:18,526 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:02:18,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:02:18,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1184162757, now seen corresponding path program 1 times [2022-11-19 08:02:18,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:02:18,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067575892] [2022-11-19 08:02:18,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:02:18,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:02:18,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:02:18,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:02:18,739 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:02:18,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067575892] [2022-11-19 08:02:18,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067575892] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:02:18,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:02:18,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:02:18,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250045374] [2022-11-19 08:02:18,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:02:18,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:02:18,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:02:18,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:02:18,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:02:18,741 INFO L87 Difference]: Start difference. First operand 277 states and 698 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:18,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:02:18,842 INFO L93 Difference]: Finished difference Result 258 states and 571 transitions. [2022-11-19 08:02:18,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 08:02:18,843 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-19 08:02:18,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:02:18,844 INFO L225 Difference]: With dead ends: 258 [2022-11-19 08:02:18,844 INFO L226 Difference]: Without dead ends: 183 [2022-11-19 08:02:18,844 INFO L412 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 [2022-11-19 08:02:18,845 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 37 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:02:18,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 3 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:02:18,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-11-19 08:02:18,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2022-11-19 08:02:18,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 182 states have (on average 2.131868131868132) internal successors, (388), 182 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:18,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 388 transitions. [2022-11-19 08:02:18,850 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 388 transitions. Word has length 17 [2022-11-19 08:02:18,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:02:18,851 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 388 transitions. [2022-11-19 08:02:18,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:18,851 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 388 transitions. [2022-11-19 08:02:18,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-19 08:02:18,852 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:02:18,852 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:02:18,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-19 08:02:18,852 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:02:18,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:02:18,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1385241011, now seen corresponding path program 1 times [2022-11-19 08:02:18,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:02:18,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989136240] [2022-11-19 08:02:18,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:02:18,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:02:18,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:02:19,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:02:19,059 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:02:19,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989136240] [2022-11-19 08:02:19,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989136240] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:02:19,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:02:19,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 08:02:19,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767175788] [2022-11-19 08:02:19,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:02:19,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 08:02:19,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:02:19,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 08:02:19,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:02:19,062 INFO L87 Difference]: Start difference. First operand 183 states and 388 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:19,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:02:19,173 INFO L93 Difference]: Finished difference Result 151 states and 284 transitions. [2022-11-19 08:02:19,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 08:02:19,173 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-19 08:02:19,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:02:19,174 INFO L225 Difference]: With dead ends: 151 [2022-11-19 08:02:19,174 INFO L226 Difference]: Without dead ends: 119 [2022-11-19 08:02:19,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-19 08:02:19,175 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 66 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:02:19,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 2 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:02:19,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-19 08:02:19,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2022-11-19 08:02:19,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.8305084745762712) internal successors, (216), 118 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:19,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 216 transitions. [2022-11-19 08:02:19,178 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 216 transitions. Word has length 18 [2022-11-19 08:02:19,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:02:19,178 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 216 transitions. [2022-11-19 08:02:19,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:19,179 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 216 transitions. [2022-11-19 08:02:19,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-19 08:02:19,182 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:02:19,182 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:02:19,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-19 08:02:19,182 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:02:19,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:02:19,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1679669250, now seen corresponding path program 1 times [2022-11-19 08:02:19,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:02:19,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707217990] [2022-11-19 08:02:19,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:02:19,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:02:19,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:02:19,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:02:19,456 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:02:19,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707217990] [2022-11-19 08:02:19,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707217990] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:02:19,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:02:19,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 08:02:19,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979543659] [2022-11-19 08:02:19,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:02:19,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 08:02:19,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:02:19,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 08:02:19,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-19 08:02:19,459 INFO L87 Difference]: Start difference. First operand 119 states and 216 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:19,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:02:19,575 INFO L93 Difference]: Finished difference Result 103 states and 183 transitions. [2022-11-19 08:02:19,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 08:02:19,576 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-19 08:02:19,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:02:19,577 INFO L225 Difference]: With dead ends: 103 [2022-11-19 08:02:19,577 INFO L226 Difference]: Without dead ends: 53 [2022-11-19 08:02:19,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-11-19 08:02:19,577 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 68 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:02:19,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 2 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:02:19,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-19 08:02:19,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-11-19 08:02:19,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.6538461538461537) internal successors, (86), 52 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:19,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 86 transitions. [2022-11-19 08:02:19,580 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 86 transitions. Word has length 20 [2022-11-19 08:02:19,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:02:19,580 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 86 transitions. [2022-11-19 08:02:19,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:19,580 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 86 transitions. [2022-11-19 08:02:19,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 08:02:19,580 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:02:19,580 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:02:19,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-19 08:02:19,581 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:02:19,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:02:19,581 INFO L85 PathProgramCache]: Analyzing trace with hash -426246031, now seen corresponding path program 1 times [2022-11-19 08:02:19,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:02:19,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133528624] [2022-11-19 08:02:19,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:02:19,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:02:19,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:02:21,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:02:21,036 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:02:21,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133528624] [2022-11-19 08:02:21,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133528624] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:02:21,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:02:21,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-19 08:02:21,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658627883] [2022-11-19 08:02:21,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:02:21,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-19 08:02:21,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:02:21,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-19 08:02:21,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-19 08:02:21,038 INFO L87 Difference]: Start difference. First operand 53 states and 86 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:21,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:02:21,402 INFO L93 Difference]: Finished difference Result 74 states and 122 transitions. [2022-11-19 08:02:21,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-19 08:02:21,403 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-19 08:02:21,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:02:21,403 INFO L225 Difference]: With dead ends: 74 [2022-11-19 08:02:21,403 INFO L226 Difference]: Without dead ends: 44 [2022-11-19 08:02:21,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-11-19 08:02:21,404 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 60 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:02:21,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 8 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 08:02:21,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-19 08:02:21,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-11-19 08:02:21,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.5813953488372092) internal successors, (68), 43 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:21,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 68 transitions. [2022-11-19 08:02:21,407 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 68 transitions. Word has length 22 [2022-11-19 08:02:21,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:02:21,407 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 68 transitions. [2022-11-19 08:02:21,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:21,408 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 68 transitions. [2022-11-19 08:02:21,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 08:02:21,408 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:02:21,408 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:02:21,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-19 08:02:21,409 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:02:21,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:02:21,409 INFO L85 PathProgramCache]: Analyzing trace with hash 340172125, now seen corresponding path program 2 times [2022-11-19 08:02:21,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:02:21,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253247103] [2022-11-19 08:02:21,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:02:21,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:02:21,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:02:22,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:02:22,009 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:02:22,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253247103] [2022-11-19 08:02:22,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253247103] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:02:22,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:02:22,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-19 08:02:22,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54138611] [2022-11-19 08:02:22,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:02:22,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-19 08:02:22,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:02:22,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-19 08:02:22,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-19 08:02:22,011 INFO L87 Difference]: Start difference. First operand 44 states and 68 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:22,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:02:22,199 INFO L93 Difference]: Finished difference Result 69 states and 110 transitions. [2022-11-19 08:02:22,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 08:02:22,199 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-19 08:02:22,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:02:22,200 INFO L225 Difference]: With dead ends: 69 [2022-11-19 08:02:22,200 INFO L226 Difference]: Without dead ends: 38 [2022-11-19 08:02:22,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-11-19 08:02:22,201 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 49 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:02:22,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 8 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:02:22,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-19 08:02:22,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-11-19 08:02:22,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 37 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:22,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 56 transitions. [2022-11-19 08:02:22,203 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 56 transitions. Word has length 22 [2022-11-19 08:02:22,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:02:22,203 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 56 transitions. [2022-11-19 08:02:22,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:22,203 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 56 transitions. [2022-11-19 08:02:22,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 08:02:22,203 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:02:22,203 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:02:22,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-19 08:02:22,204 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:02:22,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:02:22,204 INFO L85 PathProgramCache]: Analyzing trace with hash -152692199, now seen corresponding path program 3 times [2022-11-19 08:02:22,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:02:22,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980465397] [2022-11-19 08:02:22,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:02:22,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:02:22,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 08:02:22,258 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-19 08:02:22,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 08:02:22,367 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-19 08:02:22,367 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-19 08:02:22,369 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-11-19 08:02:22,371 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-11-19 08:02:22,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-19 08:02:22,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-11-19 08:02:22,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-11-19 08:02:22,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-19 08:02:22,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-19 08:02:22,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-19 08:02:22,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-11-19 08:02:22,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-11-19 08:02:22,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-11-19 08:02:22,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-11-19 08:02:22,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-19 08:02:22,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-19 08:02:22,379 INFO L444 BasicCegarLoop]: Path program histogram: [5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:02:22,385 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-19 08:02:22,385 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-19 08:02:22,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 08:02:22 BasicIcfg [2022-11-19 08:02:22,473 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-19 08:02:22,474 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-19 08:02:22,474 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-19 08:02:22,474 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-19 08:02:22,475 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:01:49" (3/4) ... [2022-11-19 08:02:22,496 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-19 08:02:22,496 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-19 08:02:22,496 INFO L158 Benchmark]: Toolchain (without parser) took 34573.71ms. Allocated memory was 113.2MB in the beginning and 482.3MB in the end (delta: 369.1MB). Free memory was 80.1MB in the beginning and 448.7MB in the end (delta: -368.7MB). Peak memory consumption was 288.7MB. Max. memory is 16.1GB. [2022-11-19 08:02:22,497 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 79.7MB. Free memory is still 33.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 08:02:22,497 INFO L158 Benchmark]: CACSL2BoogieTranslator took 720.43ms. Allocated memory is still 113.2MB. Free memory was 79.7MB in the beginning and 73.5MB in the end (delta: 6.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-19 08:02:22,497 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.54ms. Allocated memory is still 113.2MB. Free memory was 73.1MB in the beginning and 70.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 08:02:22,498 INFO L158 Benchmark]: Boogie Preprocessor took 73.65ms. Allocated memory is still 113.2MB. Free memory was 70.4MB in the beginning and 68.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 08:02:22,498 INFO L158 Benchmark]: RCFGBuilder took 1012.85ms. Allocated memory is still 113.2MB. Free memory was 68.4MB in the beginning and 60.5MB in the end (delta: 7.9MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. [2022-11-19 08:02:22,498 INFO L158 Benchmark]: TraceAbstraction took 32660.09ms. Allocated memory was 113.2MB in the beginning and 482.3MB in the end (delta: 369.1MB). Free memory was 59.9MB in the beginning and 163.9MB in the end (delta: -104.0MB). Peak memory consumption was 268.2MB. Max. memory is 16.1GB. [2022-11-19 08:02:22,499 INFO L158 Benchmark]: Witness Printer took 22.16ms. Allocated memory is still 482.3MB. Free memory was 163.9MB in the beginning and 448.7MB in the end (delta: -284.9MB). Peak memory consumption was 2.4MB. Max. memory is 16.1GB. [2022-11-19 08:02:22,500 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 79.7MB. Free memory is still 33.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 720.43ms. Allocated memory is still 113.2MB. Free memory was 79.7MB in the beginning and 73.5MB in the end (delta: 6.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.54ms. Allocated memory is still 113.2MB. Free memory was 73.1MB in the beginning and 70.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.65ms. Allocated memory is still 113.2MB. Free memory was 70.4MB in the beginning and 68.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1012.85ms. Allocated memory is still 113.2MB. Free memory was 68.4MB in the beginning and 60.5MB in the end (delta: 7.9MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. * TraceAbstraction took 32660.09ms. Allocated memory was 113.2MB in the beginning and 482.3MB in the end (delta: 369.1MB). Free memory was 59.9MB in the beginning and 163.9MB in the end (delta: -104.0MB). Peak memory consumption was 268.2MB. Max. memory is 16.1GB. * Witness Printer took 22.16ms. Allocated memory is still 482.3MB. Free memory was 163.9MB in the beginning and 448.7MB in the end (delta: -284.9MB). Peak memory consumption was 2.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.3s, 132 PlacesBefore, 44 PlacesAfterwards, 124 TransitionsBefore, 35 TransitionsAfterwards, 2264 CoEnabledTransitionPairs, 7 FixpointIterations, 45 TrivialSequentialCompositions, 63 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 119 TotalNumberOfCompositions, 5902 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2738, independent: 2570, independent conditional: 0, independent unconditional: 2570, dependent: 168, dependent conditional: 0, dependent unconditional: 168, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1507, independent: 1441, independent conditional: 0, independent unconditional: 1441, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1507, independent: 1411, independent conditional: 0, independent unconditional: 1411, dependent: 96, dependent conditional: 0, dependent unconditional: 96, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 96, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 897, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 854, dependent conditional: 0, dependent unconditional: 854, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2738, independent: 1129, independent conditional: 0, independent unconditional: 1129, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 1507, unknown conditional: 0, unknown unconditional: 1507] , Statistics on independence cache: Total cache size (in pairs): 158, Positive cache size: 127, Positive conditional cache size: 0, Positive unconditional cache size: 127, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L719] 0 _Bool x$flush_delayed; [L730] 0 int *x$read_delayed_var; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L720] 0 int x$mem_tmp; [L712] 0 int __unbuffered_p0_EAX = 0; [L724] 0 _Bool x$r_buff0_thd3; [L722] 0 _Bool x$r_buff0_thd1; [L714] 0 int __unbuffered_p1_EAX = 0; [L723] 0 _Bool x$r_buff0_thd2; [L721] 0 _Bool x$r_buff0_thd0; [L729] 0 _Bool x$read_delayed; [L710] 0 int __unbuffered_cnt = 0; [L716] 0 _Bool main$tmp_guard1; [L734] 0 _Bool x$w_buff1_used; [L715] 0 _Bool main$tmp_guard0; [L732] 0 _Bool x$w_buff0_used; [L731] 0 int x$w_buff0; [L733] 0 int x$w_buff1; [L718] 0 int x = 0; [L726] 0 _Bool x$r_buff1_thd1; [L725] 0 _Bool x$r_buff1_thd0; [L736] 0 int y = 0; [L728] 0 _Bool x$r_buff1_thd3; [L727] 0 _Bool x$r_buff1_thd2; [L849] 0 pthread_t t2537; [L850] FCALL, FORK 0 pthread_create(&t2537, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2537, ((void *)0), P0, ((void *)0))=-1, t2537={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L851] 0 pthread_t t2538; [L852] FCALL, FORK 0 pthread_create(&t2538, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2538, ((void *)0), P1, ((void *)0))=0, t2537={5:0}, t2538={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L853] 0 pthread_t t2539; [L854] FCALL, FORK 0 pthread_create(&t2539, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2539, ((void *)0), P2, ((void *)0))=1, t2537={5:0}, t2538={6:0}, t2539={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L812] 3 x$w_buff1 = x$w_buff0 [L813] 3 x$w_buff0 = 2 [L814] 3 x$w_buff1_used = x$w_buff0_used [L815] 3 x$w_buff0_used = (_Bool)1 [L816] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L816] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L817] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L818] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L819] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L820] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L824] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=67, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L772] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=67, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=67, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 x$flush_delayed = weak$$choice2 [L785] 2 x$mem_tmp = x [L786] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = x [L794] 2 x = x$flush_delayed ? x$mem_tmp : x [L795] 2 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 3 return 0; [L798] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L799] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L800] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L801] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L802] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 2 return 0; [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537={5:0}, t2538={6:0}, t2539={3:0}, weak$$choice0=66, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L867] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L868] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L869] 0 x$flush_delayed = weak$$choice2 [L870] 0 x$mem_tmp = x [L871] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L872] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L873] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L874] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L875] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L877] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L879] 0 x = x$flush_delayed ? x$mem_tmp : x [L880] 0 x$flush_delayed = (_Bool)0 [L882] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=68, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 151 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 32.4s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1007 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1007 mSDsluCounter, 155 SdHoareTripleChecker+Invalid, 4.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 115 mSDsCounter, 383 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3322 IncrementalHoareTripleChecker+Invalid, 3705 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 383 mSolverCounterUnsat, 40 mSDtfsCounter, 3322 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 172 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1028occurred in iteration=0, InterpolantAutomatonStates: 161, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 21 MinimizatonAttempts, 1257 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 15.8s InterpolantComputationTime, 328 NumberOfCodeBlocks, 328 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 285 ConstructedInterpolants, 0 QuantifiedInterpolants, 4681 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-19 08:02:22,528 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8e0bd33ffca0122f84e298c52bb9fdae01e72661c94f68aaa49ed0f187d88b87 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-19 08:02:24,746 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 08:02:24,748 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 08:02:24,776 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 08:02:24,780 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 08:02:24,784 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 08:02:24,787 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 08:02:24,791 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 08:02:24,794 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 08:02:24,801 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 08:02:24,802 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 08:02:24,803 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 08:02:24,804 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 08:02:24,806 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 08:02:24,808 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 08:02:24,810 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 08:02:24,812 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 08:02:24,814 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 08:02:24,818 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 08:02:24,821 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 08:02:24,827 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 08:02:24,829 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 08:02:24,830 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 08:02:24,832 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 08:02:24,836 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 08:02:24,840 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 08:02:24,841 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 08:02:24,842 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 08:02:24,844 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 08:02:24,845 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 08:02:24,845 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 08:02:24,846 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 08:02:24,847 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 08:02:24,849 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 08:02:24,850 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 08:02:24,850 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 08:02:24,851 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 08:02:24,851 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 08:02:24,851 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 08:02:24,853 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 08:02:24,854 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 08:02:24,859 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-19 08:02:24,892 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 08:02:24,892 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 08:02:24,893 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 08:02:24,894 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 08:02:24,895 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 08:02:24,895 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 08:02:24,895 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 08:02:24,895 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 08:02:24,896 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 08:02:24,896 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 08:02:24,897 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 08:02:24,897 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 08:02:24,899 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-19 08:02:24,899 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-19 08:02:24,899 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 08:02:24,900 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 08:02:24,900 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-19 08:02:24,900 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 08:02:24,900 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 08:02:24,901 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 08:02:24,901 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-19 08:02:24,901 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-19 08:02:24,902 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-19 08:02:24,902 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 08:02:24,902 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-19 08:02:24,902 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-19 08:02:24,903 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-19 08:02:24,903 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 08:02:24,903 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 08:02:24,903 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 08:02:24,904 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-19 08:02:24,904 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 08:02:24,905 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 08:02:24,905 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 08:02:24,905 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 08:02:24,906 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-19 08:02:24,906 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-19 08:02:24,906 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 08:02:24,907 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-19 08:02:24,907 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/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_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8e0bd33ffca0122f84e298c52bb9fdae01e72661c94f68aaa49ed0f187d88b87 [2022-11-19 08:02:25,328 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 08:02:25,355 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 08:02:25,358 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 08:02:25,359 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 08:02:25,360 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 08:02:25,361 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-19 08:02:25,427 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/data/f9fb5f798/9bf6148f17d4408d89bb4af0f5fcd6fc/FLAG173b5b687 [2022-11-19 08:02:25,980 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 08:02:25,986 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-19 08:02:26,004 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/data/f9fb5f798/9bf6148f17d4408d89bb4af0f5fcd6fc/FLAG173b5b687 [2022-11-19 08:02:26,287 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/data/f9fb5f798/9bf6148f17d4408d89bb4af0f5fcd6fc [2022-11-19 08:02:26,290 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 08:02:26,292 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 08:02:26,297 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 08:02:26,297 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 08:02:26,301 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 08:02:26,302 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:02:26" (1/1) ... [2022-11-19 08:02:26,303 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1be5c637 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:26, skipping insertion in model container [2022-11-19 08:02:26,303 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:02:26" (1/1) ... [2022-11-19 08:02:26,310 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 08:02:26,374 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 08:02:26,635 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-11-19 08:02:26,901 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 08:02:26,914 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 08:02:26,932 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-11-19 08:02:26,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 08:02:27,022 INFO L208 MainTranslator]: Completed translation [2022-11-19 08:02:27,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:27 WrapperNode [2022-11-19 08:02:27,023 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 08:02:27,024 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 08:02:27,024 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 08:02:27,024 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 08:02:27,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:27" (1/1) ... [2022-11-19 08:02:27,070 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:27" (1/1) ... [2022-11-19 08:02:27,096 INFO L138 Inliner]: procedures = 179, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2022-11-19 08:02:27,096 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 08:02:27,097 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 08:02:27,097 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 08:02:27,098 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 08:02:27,107 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:27" (1/1) ... [2022-11-19 08:02:27,107 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:27" (1/1) ... [2022-11-19 08:02:27,112 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:27" (1/1) ... [2022-11-19 08:02:27,112 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:27" (1/1) ... [2022-11-19 08:02:27,126 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:27" (1/1) ... [2022-11-19 08:02:27,128 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:27" (1/1) ... [2022-11-19 08:02:27,131 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:27" (1/1) ... [2022-11-19 08:02:27,133 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:27" (1/1) ... [2022-11-19 08:02:27,137 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 08:02:27,142 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 08:02:27,142 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 08:02:27,142 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 08:02:27,143 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:27" (1/1) ... [2022-11-19 08:02:27,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 08:02:27,162 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:02:27,173 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 08:02:27,176 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 08:02:27,214 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-19 08:02:27,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 08:02:27,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-19 08:02:27,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 08:02:27,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-19 08:02:27,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-19 08:02:27,215 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-19 08:02:27,216 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-19 08:02:27,216 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-19 08:02:27,216 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-19 08:02:27,216 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-19 08:02:27,216 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-19 08:02:27,217 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-19 08:02:27,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 08:02:27,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 08:02:27,218 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-19 08:02:27,403 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 08:02:27,406 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 08:02:27,981 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 08:02:28,232 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 08:02:28,232 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-19 08:02:28,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:02:28 BoogieIcfgContainer [2022-11-19 08:02:28,235 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 08:02:28,238 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 08:02:28,239 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 08:02:28,241 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 08:02:28,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:02:26" (1/3) ... [2022-11-19 08:02:28,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48b4e8b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:02:28, skipping insertion in model container [2022-11-19 08:02:28,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:27" (2/3) ... [2022-11-19 08:02:28,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48b4e8b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:02:28, skipping insertion in model container [2022-11-19 08:02:28,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:02:28" (3/3) ... [2022-11-19 08:02:28,246 INFO L112 eAbstractionObserver]: Analyzing ICFG safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-19 08:02:28,264 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 08:02:28,264 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-19 08:02:28,264 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-19 08:02:28,375 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-19 08:02:28,419 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-19 08:02:28,438 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 125 transitions, 265 flow [2022-11-19 08:02:28,442 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 125 transitions, 265 flow [2022-11-19 08:02:28,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 125 transitions, 265 flow [2022-11-19 08:02:28,533 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2022-11-19 08:02:28,540 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-19 08:02:28,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2022-11-19 08:02:28,550 INFO L119 LiptonReduction]: Number of co-enabled transitions 2264 [2022-11-19 08:02:37,440 INFO L134 LiptonReduction]: Checked pairs total: 5468 [2022-11-19 08:02:37,440 INFO L136 LiptonReduction]: Total number of compositions: 124 [2022-11-19 08:02:37,447 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 35 transitions, 85 flow [2022-11-19 08:02:37,545 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1028 states, 1017 states have (on average 3.3235004916420845) internal successors, (3380), 1027 states have internal predecessors, (3380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:37,562 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 08:02:37,568 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1f149247, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 08:02:37,569 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-19 08:02:37,574 INFO L276 IsEmpty]: Start isEmpty. Operand has 1028 states, 1017 states have (on average 3.3235004916420845) internal successors, (3380), 1027 states have internal predecessors, (3380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:37,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-19 08:02:37,579 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:02:37,580 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-19 08:02:37,580 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:02:37,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:02:37,585 INFO L85 PathProgramCache]: Analyzing trace with hash 600, now seen corresponding path program 1 times [2022-11-19 08:02:37,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:02:37,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1675589974] [2022-11-19 08:02:37,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:02:37,598 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 08:02:37,598 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:02:37,605 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 08:02:37,608 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-19 08:02:37,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:02:37,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-19 08:02:37,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:02:37,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:02:37,705 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:02:37,705 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:02:37,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1675589974] [2022-11-19 08:02:37,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1675589974] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:02:37,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:02:37,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-19 08:02:37,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39371348] [2022-11-19 08:02:37,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:02:37,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-19 08:02:37,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:02:37,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-19 08:02:37,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-19 08:02:37,740 INFO L87 Difference]: Start difference. First operand has 1028 states, 1017 states have (on average 3.3235004916420845) internal successors, (3380), 1027 states have internal predecessors, (3380), 0 states have call successors, (0), 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 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:37,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:02:37,949 INFO L93 Difference]: Finished difference Result 970 states and 3096 transitions. [2022-11-19 08:02:37,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-19 08:02:37,971 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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 1 [2022-11-19 08:02:37,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:02:37,999 INFO L225 Difference]: With dead ends: 970 [2022-11-19 08:02:38,000 INFO L226 Difference]: Without dead ends: 970 [2022-11-19 08:02:38,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-19 08:02:38,012 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:02:38,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:02:38,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2022-11-19 08:02:38,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 970. [2022-11-19 08:02:38,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 965 states have (on average 3.2082901554404146) internal successors, (3096), 969 states have internal predecessors, (3096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:38,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 3096 transitions. [2022-11-19 08:02:38,164 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 3096 transitions. Word has length 1 [2022-11-19 08:02:38,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:02:38,164 INFO L495 AbstractCegarLoop]: Abstraction has 970 states and 3096 transitions. [2022-11-19 08:02:38,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:38,173 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 3096 transitions. [2022-11-19 08:02:38,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-19 08:02:38,174 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:02:38,174 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:02:38,183 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-19 08:02:38,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 08:02:38,378 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:02:38,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:02:38,379 INFO L85 PathProgramCache]: Analyzing trace with hash 2012554046, now seen corresponding path program 1 times [2022-11-19 08:02:38,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:02:38,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1749887210] [2022-11-19 08:02:38,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:02:38,380 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 08:02:38,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:02:38,382 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 08:02:38,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-19 08:02:38,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:02:38,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 08:02:38,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:02:38,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:02:38,514 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:02:38,515 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:02:38,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1749887210] [2022-11-19 08:02:38,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1749887210] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:02:38,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:02:38,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 08:02:38,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992778127] [2022-11-19 08:02:38,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:02:38,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:02:38,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:02:38,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:02:38,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:02:38,518 INFO L87 Difference]: Start difference. First operand 970 states and 3096 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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) [2022-11-19 08:02:38,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:02:38,638 INFO L93 Difference]: Finished difference Result 802 states and 2518 transitions. [2022-11-19 08:02:38,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:02:38,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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 [2022-11-19 08:02:38,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:02:38,648 INFO L225 Difference]: With dead ends: 802 [2022-11-19 08:02:38,648 INFO L226 Difference]: Without dead ends: 778 [2022-11-19 08:02:38,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:02:38,650 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 8 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:02:38,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:02:38,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2022-11-19 08:02:38,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 778. [2022-11-19 08:02:38,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 776 states have (on average 3.1649484536082473) internal successors, (2456), 777 states have internal predecessors, (2456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:38,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 2456 transitions. [2022-11-19 08:02:38,684 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 2456 transitions. Word has length 7 [2022-11-19 08:02:38,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:02:38,688 INFO L495 AbstractCegarLoop]: Abstraction has 778 states and 2456 transitions. [2022-11-19 08:02:38,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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) [2022-11-19 08:02:38,688 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 2456 transitions. [2022-11-19 08:02:38,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-19 08:02:38,691 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:02:38,691 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:02:38,704 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-19 08:02:38,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 08:02:38,902 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:02:38,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:02:38,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1743298506, now seen corresponding path program 1 times [2022-11-19 08:02:38,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:02:38,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [457574574] [2022-11-19 08:02:38,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:02:38,906 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 08:02:38,906 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:02:38,907 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 08:02:38,945 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-19 08:02:39,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:02:39,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 08:02:39,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:02:39,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:02:39,103 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:02:39,103 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:02:39,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [457574574] [2022-11-19 08:02:39,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [457574574] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:02:39,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:02:39,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:02:39,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883260063] [2022-11-19 08:02:39,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:02:39,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:02:39,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:02:39,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:02:39,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:02:39,108 INFO L87 Difference]: Start difference. First operand 778 states and 2456 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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) [2022-11-19 08:02:39,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:02:39,276 INFO L93 Difference]: Finished difference Result 598 states and 1602 transitions. [2022-11-19 08:02:39,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 08:02:39,277 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-19 08:02:39,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:02:39,280 INFO L225 Difference]: With dead ends: 598 [2022-11-19 08:02:39,280 INFO L226 Difference]: Without dead ends: 478 [2022-11-19 08:02:39,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:02:39,282 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 43 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:02:39,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 3 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:02:39,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2022-11-19 08:02:39,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 478. [2022-11-19 08:02:39,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 476 states have (on average 2.638655462184874) internal successors, (1256), 477 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:39,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 1256 transitions. [2022-11-19 08:02:39,302 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 1256 transitions. Word has length 10 [2022-11-19 08:02:39,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:02:39,302 INFO L495 AbstractCegarLoop]: Abstraction has 478 states and 1256 transitions. [2022-11-19 08:02:39,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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) [2022-11-19 08:02:39,303 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 1256 transitions. [2022-11-19 08:02:39,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-19 08:02:39,304 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:02:39,304 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:02:39,322 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-19 08:02:39,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 08:02:39,517 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:02:39,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:02:39,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1160937874, now seen corresponding path program 1 times [2022-11-19 08:02:39,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:02:39,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1106741325] [2022-11-19 08:02:39,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:02:39,519 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 08:02:39,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:02:39,522 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 08:02:39,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-19 08:02:39,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:02:39,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 08:02:39,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:02:39,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:02:39,700 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:02:39,700 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:02:39,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1106741325] [2022-11-19 08:02:39,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1106741325] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:02:39,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:02:39,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 08:02:39,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837080934] [2022-11-19 08:02:39,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:02:39,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 08:02:39,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:02:39,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 08:02:39,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:02:39,703 INFO L87 Difference]: Start difference. First operand 478 states and 1256 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:39,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:02:39,895 INFO L93 Difference]: Finished difference Result 303 states and 704 transitions. [2022-11-19 08:02:39,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 08:02:39,896 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-19 08:02:39,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:02:39,898 INFO L225 Difference]: With dead ends: 303 [2022-11-19 08:02:39,898 INFO L226 Difference]: Without dead ends: 243 [2022-11-19 08:02:39,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-19 08:02:39,899 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 68 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:02:39,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 5 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 08:02:39,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-11-19 08:02:39,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2022-11-19 08:02:39,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 241 states have (on average 2.2863070539419086) internal successors, (551), 242 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:39,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 551 transitions. [2022-11-19 08:02:39,906 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 551 transitions. Word has length 13 [2022-11-19 08:02:39,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:02:39,907 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 551 transitions. [2022-11-19 08:02:39,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:39,907 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 551 transitions. [2022-11-19 08:02:39,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-19 08:02:39,909 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:02:39,909 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:02:39,926 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-19 08:02:40,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 08:02:40,122 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:02:40,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:02:40,122 INFO L85 PathProgramCache]: Analyzing trace with hash -872040873, now seen corresponding path program 1 times [2022-11-19 08:02:40,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:02:40,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [346437588] [2022-11-19 08:02:40,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:02:40,123 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 08:02:40,124 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:02:40,124 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 08:02:40,157 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-19 08:02:40,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:02:40,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-19 08:02:40,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:02:40,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:02:40,355 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:02:40,355 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:02:40,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [346437588] [2022-11-19 08:02:40,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [346437588] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:02:40,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:02:40,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 08:02:40,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214371428] [2022-11-19 08:02:40,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:02:40,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 08:02:40,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:02:40,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 08:02:40,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-19 08:02:40,358 INFO L87 Difference]: Start difference. First operand 243 states and 551 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:40,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:02:40,637 INFO L93 Difference]: Finished difference Result 196 states and 455 transitions. [2022-11-19 08:02:40,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 08:02:40,638 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-19 08:02:40,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:02:40,639 INFO L225 Difference]: With dead ends: 196 [2022-11-19 08:02:40,639 INFO L226 Difference]: Without dead ends: 183 [2022-11-19 08:02:40,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-19 08:02:40,640 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 76 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:02:40,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 9 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 08:02:40,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-11-19 08:02:40,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2022-11-19 08:02:40,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 181 states have (on average 2.3812154696132595) internal successors, (431), 182 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:40,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 431 transitions. [2022-11-19 08:02:40,646 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 431 transitions. Word has length 17 [2022-11-19 08:02:40,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:02:40,646 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 431 transitions. [2022-11-19 08:02:40,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:40,647 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 431 transitions. [2022-11-19 08:02:40,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 08:02:40,647 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:02:40,648 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:02:40,666 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-19 08:02:40,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 08:02:40,860 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:02:40,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:02:40,860 INFO L85 PathProgramCache]: Analyzing trace with hash -924935714, now seen corresponding path program 1 times [2022-11-19 08:02:40,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:02:40,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [220477816] [2022-11-19 08:02:40,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:02:40,861 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 08:02:40,861 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:02:40,862 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 08:02:40,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-19 08:02:41,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:02:41,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 08:02:41,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:02:41,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:02:41,224 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:02:41,224 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:02:41,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [220477816] [2022-11-19 08:02:41,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [220477816] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:02:41,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:02:41,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:02:41,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517361700] [2022-11-19 08:02:41,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:02:41,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:02:41,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:02:41,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:02:41,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:02:41,228 INFO L87 Difference]: Start difference. First operand 183 states and 431 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:41,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:02:41,363 INFO L93 Difference]: Finished difference Result 241 states and 552 transitions. [2022-11-19 08:02:41,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 08:02:41,364 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-19 08:02:41,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:02:41,365 INFO L225 Difference]: With dead ends: 241 [2022-11-19 08:02:41,365 INFO L226 Difference]: Without dead ends: 241 [2022-11-19 08:02:41,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:02:41,366 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 5 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:02:41,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:02:41,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-11-19 08:02:41,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 240. [2022-11-19 08:02:41,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 238 states have (on average 2.319327731092437) internal successors, (552), 239 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:41,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 552 transitions. [2022-11-19 08:02:41,377 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 552 transitions. Word has length 22 [2022-11-19 08:02:41,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:02:41,378 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 552 transitions. [2022-11-19 08:02:41,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:41,378 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 552 transitions. [2022-11-19 08:02:41,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 08:02:41,379 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:02:41,379 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:02:41,401 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-19 08:02:41,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 08:02:41,593 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:02:41,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:02:41,593 INFO L85 PathProgramCache]: Analyzing trace with hash -924935692, now seen corresponding path program 1 times [2022-11-19 08:02:41,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:02:41,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [672120732] [2022-11-19 08:02:41,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:02:41,594 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 08:02:41,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:02:41,595 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 08:02:41,609 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-19 08:02:41,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:02:41,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-19 08:02:41,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:02:42,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:02:42,204 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:02:42,205 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:02:42,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [672120732] [2022-11-19 08:02:42,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [672120732] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:02:42,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:02:42,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:02:42,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708619443] [2022-11-19 08:02:42,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:02:42,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 08:02:42,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:02:42,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 08:02:42,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:02:42,206 INFO L87 Difference]: Start difference. First operand 240 states and 552 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:42,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:02:42,301 INFO L93 Difference]: Finished difference Result 351 states and 807 transitions. [2022-11-19 08:02:42,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 08:02:42,302 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-19 08:02:42,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:02:42,304 INFO L225 Difference]: With dead ends: 351 [2022-11-19 08:02:42,304 INFO L226 Difference]: Without dead ends: 304 [2022-11-19 08:02:42,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:02:42,305 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 8 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:02:42,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 37 Unchecked, 0.1s Time] [2022-11-19 08:02:42,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-11-19 08:02:42,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 232. [2022-11-19 08:02:42,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 230 states have (on average 2.3086956521739133) internal successors, (531), 231 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:42,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 531 transitions. [2022-11-19 08:02:42,313 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 531 transitions. Word has length 22 [2022-11-19 08:02:42,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:02:42,313 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 531 transitions. [2022-11-19 08:02:42,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:42,314 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 531 transitions. [2022-11-19 08:02:42,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 08:02:42,314 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:02:42,315 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:02:42,332 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-19 08:02:42,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 08:02:42,522 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:02:42,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:02:42,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1027448408, now seen corresponding path program 2 times [2022-11-19 08:02:42,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:02:42,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [395132781] [2022-11-19 08:02:42,523 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-19 08:02:42,523 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 08:02:42,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:02:42,524 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 08:02:42,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-19 08:02:42,775 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-19 08:02:42,775 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:02:42,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-19 08:02:42,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:02:43,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:02:43,136 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:02:43,137 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:02:43,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [395132781] [2022-11-19 08:02:43,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [395132781] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:02:43,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:02:43,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:02:43,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091042765] [2022-11-19 08:02:43,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:02:43,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 08:02:43,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:02:43,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 08:02:43,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:02:43,138 INFO L87 Difference]: Start difference. First operand 232 states and 531 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:43,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:02:43,229 INFO L93 Difference]: Finished difference Result 343 states and 786 transitions. [2022-11-19 08:02:43,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 08:02:43,230 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-19 08:02:43,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:02:43,231 INFO L225 Difference]: With dead ends: 343 [2022-11-19 08:02:43,231 INFO L226 Difference]: Without dead ends: 260 [2022-11-19 08:02:43,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:02:43,232 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 7 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:02:43,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 4 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 30 Unchecked, 0.1s Time] [2022-11-19 08:02:43,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-11-19 08:02:43,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 224. [2022-11-19 08:02:43,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 222 states have (on average 2.2972972972972974) internal successors, (510), 223 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:43,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 510 transitions. [2022-11-19 08:02:43,241 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 510 transitions. Word has length 22 [2022-11-19 08:02:43,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:02:43,241 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 510 transitions. [2022-11-19 08:02:43,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:43,242 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 510 transitions. [2022-11-19 08:02:43,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 08:02:43,243 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:02:43,243 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:02:43,257 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-19 08:02:43,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 08:02:43,456 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:02:43,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:02:43,456 INFO L85 PathProgramCache]: Analyzing trace with hash -948032504, now seen corresponding path program 3 times [2022-11-19 08:02:43,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:02:43,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [358182617] [2022-11-19 08:02:43,457 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 08:02:43,457 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 08:02:43,457 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:02:43,458 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 08:02:43,462 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-19 08:02:43,668 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-19 08:02:43,668 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:02:43,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-19 08:02:43,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:02:44,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:02:44,053 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:02:44,053 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:02:44,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [358182617] [2022-11-19 08:02:44,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [358182617] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:02:44,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:02:44,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:02:44,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445168245] [2022-11-19 08:02:44,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:02:44,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 08:02:44,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:02:44,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 08:02:44,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:02:44,055 INFO L87 Difference]: Start difference. First operand 224 states and 510 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:44,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:02:44,120 INFO L93 Difference]: Finished difference Result 335 states and 765 transitions. [2022-11-19 08:02:44,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 08:02:44,121 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-19 08:02:44,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:02:44,122 INFO L225 Difference]: With dead ends: 335 [2022-11-19 08:02:44,122 INFO L226 Difference]: Without dead ends: 216 [2022-11-19 08:02:44,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:02:44,123 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 6 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:02:44,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 33 Unchecked, 0.1s Time] [2022-11-19 08:02:44,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-11-19 08:02:44,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2022-11-19 08:02:44,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 214 states have (on average 2.2850467289719627) internal successors, (489), 215 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:44,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 489 transitions. [2022-11-19 08:02:44,131 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 489 transitions. Word has length 22 [2022-11-19 08:02:44,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:02:44,133 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 489 transitions. [2022-11-19 08:02:44,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:44,133 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 489 transitions. [2022-11-19 08:02:44,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 08:02:44,134 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:02:44,134 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:02:44,153 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-19 08:02:44,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 08:02:44,335 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:02:44,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:02:44,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1232215428, now seen corresponding path program 4 times [2022-11-19 08:02:44,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:02:44,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1177354509] [2022-11-19 08:02:44,336 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-19 08:02:44,336 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 08:02:44,336 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:02:44,337 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 08:02:44,340 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-19 08:02:44,642 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-19 08:02:44,643 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:02:44,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-19 08:02:44,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:02:45,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:02:45,021 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:02:45,021 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:02:45,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1177354509] [2022-11-19 08:02:45,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1177354509] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:02:45,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:02:45,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:02:45,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284047812] [2022-11-19 08:02:45,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:02:45,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 08:02:45,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:02:45,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 08:02:45,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:02:45,023 INFO L87 Difference]: Start difference. First operand 216 states and 489 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:45,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:02:45,078 INFO L93 Difference]: Finished difference Result 215 states and 487 transitions. [2022-11-19 08:02:45,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 08:02:45,079 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-19 08:02:45,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:02:45,080 INFO L225 Difference]: With dead ends: 215 [2022-11-19 08:02:45,080 INFO L226 Difference]: Without dead ends: 104 [2022-11-19 08:02:45,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:02:45,081 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 5 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:02:45,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 3 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 25 Unchecked, 0.1s Time] [2022-11-19 08:02:45,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-19 08:02:45,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-11-19 08:02:45,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 2.0776699029126213) internal successors, (214), 103 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:45,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 214 transitions. [2022-11-19 08:02:45,085 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 214 transitions. Word has length 22 [2022-11-19 08:02:45,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:02:45,085 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 214 transitions. [2022-11-19 08:02:45,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:45,085 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 214 transitions. [2022-11-19 08:02:45,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 08:02:45,086 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:02:45,086 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:02:45,104 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-19 08:02:45,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 08:02:45,304 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:02:45,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:02:45,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1900284392, now seen corresponding path program 2 times [2022-11-19 08:02:45,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:02:45,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1057897658] [2022-11-19 08:02:45,306 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-19 08:02:45,306 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 08:02:45,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:02:45,307 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 08:02:45,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-19 08:02:45,470 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-19 08:02:45,470 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:02:45,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-19 08:02:45,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:02:45,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:02:45,821 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:02:45,821 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:02:45,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1057897658] [2022-11-19 08:02:45,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1057897658] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:02:45,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:02:45,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 08:02:45,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548708658] [2022-11-19 08:02:45,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:02:45,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 08:02:45,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:02:45,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 08:02:45,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-19 08:02:45,823 INFO L87 Difference]: Start difference. First operand 104 states and 214 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:46,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:02:46,134 INFO L93 Difference]: Finished difference Result 213 states and 430 transitions. [2022-11-19 08:02:46,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-19 08:02:46,136 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-19 08:02:46,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:02:46,137 INFO L225 Difference]: With dead ends: 213 [2022-11-19 08:02:46,137 INFO L226 Difference]: Without dead ends: 157 [2022-11-19 08:02:46,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-11-19 08:02:46,138 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 39 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 08:02:46,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 5 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 08:02:46,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-11-19 08:02:46,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 128. [2022-11-19 08:02:46,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 2.0551181102362204) internal successors, (261), 127 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:46,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 261 transitions. [2022-11-19 08:02:46,142 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 261 transitions. Word has length 22 [2022-11-19 08:02:46,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:02:46,143 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 261 transitions. [2022-11-19 08:02:46,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:46,143 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 261 transitions. [2022-11-19 08:02:46,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 08:02:46,143 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:02:46,144 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:02:46,162 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-19 08:02:46,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 08:02:46,344 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:02:46,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:02:46,345 INFO L85 PathProgramCache]: Analyzing trace with hash -757055684, now seen corresponding path program 3 times [2022-11-19 08:02:46,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:02:46,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [756631432] [2022-11-19 08:02:46,345 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 08:02:46,345 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 08:02:46,346 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:02:46,346 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 08:02:46,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-19 08:02:46,500 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-19 08:02:46,500 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:02:46,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-19 08:02:46,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:02:46,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:02:46,840 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:02:46,840 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:02:46,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [756631432] [2022-11-19 08:02:46,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [756631432] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:02:46,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:02:46,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 08:02:46,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737282690] [2022-11-19 08:02:46,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:02:46,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 08:02:46,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:02:46,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 08:02:46,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-19 08:02:46,842 INFO L87 Difference]: Start difference. First operand 128 states and 261 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:47,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:02:47,055 INFO L93 Difference]: Finished difference Result 169 states and 339 transitions. [2022-11-19 08:02:47,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 08:02:47,055 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-19 08:02:47,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:02:47,056 INFO L225 Difference]: With dead ends: 169 [2022-11-19 08:02:47,056 INFO L226 Difference]: Without dead ends: 132 [2022-11-19 08:02:47,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-19 08:02:47,057 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 35 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:02:47,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 7 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 08:02:47,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-11-19 08:02:47,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 124. [2022-11-19 08:02:47,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 123 states have (on average 2.032520325203252) internal successors, (250), 123 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:47,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 250 transitions. [2022-11-19 08:02:47,062 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 250 transitions. Word has length 22 [2022-11-19 08:02:47,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:02:47,062 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 250 transitions. [2022-11-19 08:02:47,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:47,062 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 250 transitions. [2022-11-19 08:02:47,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 08:02:47,063 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:02:47,063 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:02:47,081 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-19 08:02:47,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 08:02:47,264 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:02:47,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:02:47,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1137150296, now seen corresponding path program 4 times [2022-11-19 08:02:47,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:02:47,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1547304330] [2022-11-19 08:02:47,265 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-19 08:02:47,265 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 08:02:47,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:02:47,266 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 08:02:47,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-19 08:02:47,446 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-19 08:02:47,446 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:02:47,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-19 08:02:47,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:02:47,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:02:47,668 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:02:47,668 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:02:47,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1547304330] [2022-11-19 08:02:47,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1547304330] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:02:47,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:02:47,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-19 08:02:47,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807519394] [2022-11-19 08:02:47,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:02:47,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-19 08:02:47,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:02:47,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-19 08:02:47,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-19 08:02:47,670 INFO L87 Difference]: Start difference. First operand 124 states and 250 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:47,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:02:47,942 INFO L93 Difference]: Finished difference Result 209 states and 411 transitions. [2022-11-19 08:02:47,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 08:02:47,942 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-19 08:02:47,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:02:47,943 INFO L225 Difference]: With dead ends: 209 [2022-11-19 08:02:47,943 INFO L226 Difference]: Without dead ends: 129 [2022-11-19 08:02:47,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-11-19 08:02:47,944 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 33 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:02:47,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 8 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 08:02:47,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-11-19 08:02:47,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 108. [2022-11-19 08:02:47,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 1.9906542056074767) internal successors, (213), 107 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:47,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 213 transitions. [2022-11-19 08:02:47,948 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 213 transitions. Word has length 22 [2022-11-19 08:02:47,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:02:47,948 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 213 transitions. [2022-11-19 08:02:47,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:47,948 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 213 transitions. [2022-11-19 08:02:47,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 08:02:47,949 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:02:47,949 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:02:47,964 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-11-19 08:02:48,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 08:02:48,160 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:02:48,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:02:48,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1007248984, now seen corresponding path program 5 times [2022-11-19 08:02:48,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:02:48,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [631313493] [2022-11-19 08:02:48,160 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-19 08:02:48,161 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 08:02:48,161 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:02:48,162 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 08:02:48,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-11-19 08:02:48,309 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-19 08:02:48,309 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:02:48,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-19 08:02:48,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:02:48,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:02:48,879 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:02:48,880 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:02:48,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [631313493] [2022-11-19 08:02:48,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [631313493] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:02:48,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:02:48,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-19 08:02:48,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995852647] [2022-11-19 08:02:48,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:02:48,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-19 08:02:48,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:02:48,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-19 08:02:48,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-19 08:02:48,882 INFO L87 Difference]: Start difference. First operand 108 states and 213 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:49,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:02:49,393 INFO L93 Difference]: Finished difference Result 137 states and 263 transitions. [2022-11-19 08:02:49,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-19 08:02:49,394 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-19 08:02:49,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:02:49,394 INFO L225 Difference]: With dead ends: 137 [2022-11-19 08:02:49,395 INFO L226 Difference]: Without dead ends: 110 [2022-11-19 08:02:49,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2022-11-19 08:02:49,395 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 34 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 08:02:49,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 13 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 08:02:49,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-11-19 08:02:49,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 104. [2022-11-19 08:02:49,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.970873786407767) internal successors, (203), 103 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:49,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 203 transitions. [2022-11-19 08:02:49,399 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 203 transitions. Word has length 22 [2022-11-19 08:02:49,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:02:49,399 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 203 transitions. [2022-11-19 08:02:49,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:49,399 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 203 transitions. [2022-11-19 08:02:49,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 08:02:49,400 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:02:49,400 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:02:49,419 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-11-19 08:02:49,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 08:02:49,600 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:02:49,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:02:49,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1143360834, now seen corresponding path program 6 times [2022-11-19 08:02:49,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:02:49,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [764922269] [2022-11-19 08:02:49,601 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-19 08:02:49,601 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 08:02:49,602 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:02:49,602 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 08:02:49,605 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-11-19 08:02:49,750 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-11-19 08:02:49,750 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:02:49,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-19 08:02:49,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:02:50,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:02:50,056 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:02:50,056 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:02:50,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [764922269] [2022-11-19 08:02:50,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [764922269] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:02:50,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:02:50,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-19 08:02:50,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117317062] [2022-11-19 08:02:50,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:02:50,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-19 08:02:50,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:02:50,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-19 08:02:50,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-19 08:02:50,059 INFO L87 Difference]: Start difference. First operand 104 states and 203 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:50,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:02:50,344 INFO L93 Difference]: Finished difference Result 131 states and 252 transitions. [2022-11-19 08:02:50,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-19 08:02:50,345 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-19 08:02:50,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:02:50,345 INFO L225 Difference]: With dead ends: 131 [2022-11-19 08:02:50,345 INFO L226 Difference]: Without dead ends: 84 [2022-11-19 08:02:50,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-11-19 08:02:50,346 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 26 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:02:50,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 5 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 08:02:50,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-19 08:02:50,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2022-11-19 08:02:50,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.825) internal successors, (146), 80 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:50,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 146 transitions. [2022-11-19 08:02:50,349 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 146 transitions. Word has length 22 [2022-11-19 08:02:50,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:02:50,349 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 146 transitions. [2022-11-19 08:02:50,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:02:50,349 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 146 transitions. [2022-11-19 08:02:50,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 08:02:50,350 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:02:50,350 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:02:50,368 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-11-19 08:02:50,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 08:02:50,550 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:02:50,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:02:50,551 INFO L85 PathProgramCache]: Analyzing trace with hash -17116866, now seen corresponding path program 7 times [2022-11-19 08:02:50,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:02:50,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1865292736] [2022-11-19 08:02:50,551 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-19 08:02:50,552 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 08:02:50,552 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:02:50,553 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 08:02:50,589 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-11-19 08:02:50,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 08:02:50,754 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-19 08:02:50,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 08:02:50,900 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2022-11-19 08:02:50,900 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-19 08:02:50,901 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-11-19 08:02:50,903 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-11-19 08:02:50,903 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-19 08:02:50,904 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-11-19 08:02:50,904 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-11-19 08:02:50,904 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-19 08:02:50,904 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-19 08:02:50,904 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-19 08:02:50,904 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-11-19 08:02:50,905 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-11-19 08:02:50,905 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-11-19 08:02:50,905 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-11-19 08:02:50,905 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-19 08:02:50,919 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-11-19 08:02:51,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 08:02:51,120 INFO L444 BasicCegarLoop]: Path program histogram: [7, 4, 1, 1, 1, 1, 1] [2022-11-19 08:02:51,125 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-19 08:02:51,125 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-19 08:02:51,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 08:02:51 BasicIcfg [2022-11-19 08:02:51,199 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-19 08:02:51,199 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-19 08:02:51,199 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-19 08:02:51,200 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-19 08:02:51,200 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:02:28" (3/4) ... [2022-11-19 08:02:51,207 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-19 08:02:51,208 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-19 08:02:51,208 INFO L158 Benchmark]: Toolchain (without parser) took 24916.09ms. Allocated memory was 58.7MB in the beginning and 176.2MB in the end (delta: 117.4MB). Free memory was 36.0MB in the beginning and 127.5MB in the end (delta: -91.5MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. [2022-11-19 08:02:51,208 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 58.7MB. Free memory was 40.9MB in the beginning and 40.8MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 08:02:51,209 INFO L158 Benchmark]: CACSL2BoogieTranslator took 726.40ms. Allocated memory is still 58.7MB. Free memory was 35.9MB in the beginning and 26.9MB in the end (delta: 9.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-19 08:02:51,209 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.18ms. Allocated memory was 58.7MB in the beginning and 79.7MB in the end (delta: 21.0MB). Free memory was 26.9MB in the beginning and 60.5MB in the end (delta: -33.5MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. [2022-11-19 08:02:51,209 INFO L158 Benchmark]: Boogie Preprocessor took 43.84ms. Allocated memory is still 79.7MB. Free memory was 60.5MB in the beginning and 58.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 08:02:51,210 INFO L158 Benchmark]: RCFGBuilder took 1093.17ms. Allocated memory is still 79.7MB. Free memory was 58.0MB in the beginning and 51.4MB in the end (delta: 6.6MB). Peak memory consumption was 28.4MB. Max. memory is 16.1GB. [2022-11-19 08:02:51,210 INFO L158 Benchmark]: TraceAbstraction took 22960.68ms. Allocated memory was 79.7MB in the beginning and 176.2MB in the end (delta: 96.5MB). Free memory was 50.4MB in the beginning and 127.5MB in the end (delta: -77.1MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. [2022-11-19 08:02:51,210 INFO L158 Benchmark]: Witness Printer took 8.23ms. Allocated memory is still 176.2MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 08:02:51,212 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 58.7MB. Free memory was 40.9MB in the beginning and 40.8MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 726.40ms. Allocated memory is still 58.7MB. Free memory was 35.9MB in the beginning and 26.9MB in the end (delta: 9.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.18ms. Allocated memory was 58.7MB in the beginning and 79.7MB in the end (delta: 21.0MB). Free memory was 26.9MB in the beginning and 60.5MB in the end (delta: -33.5MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.84ms. Allocated memory is still 79.7MB. Free memory was 60.5MB in the beginning and 58.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1093.17ms. Allocated memory is still 79.7MB. Free memory was 58.0MB in the beginning and 51.4MB in the end (delta: 6.6MB). Peak memory consumption was 28.4MB. Max. memory is 16.1GB. * TraceAbstraction took 22960.68ms. Allocated memory was 79.7MB in the beginning and 176.2MB in the end (delta: 96.5MB). Free memory was 50.4MB in the beginning and 127.5MB in the end (delta: -77.1MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. * Witness Printer took 8.23ms. Allocated memory is still 176.2MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.0s, 133 PlacesBefore, 44 PlacesAfterwards, 125 TransitionsBefore, 35 TransitionsAfterwards, 2264 CoEnabledTransitionPairs, 6 FixpointIterations, 50 TrivialSequentialCompositions, 63 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 124 TotalNumberOfCompositions, 5468 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2855, independent: 2709, independent conditional: 0, independent unconditional: 2709, dependent: 146, dependent conditional: 0, dependent unconditional: 146, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1588, independent: 1522, independent conditional: 0, independent unconditional: 1522, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1588, independent: 1492, independent conditional: 0, independent unconditional: 1492, dependent: 96, dependent conditional: 0, dependent unconditional: 96, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 96, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 760, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 704, dependent conditional: 0, dependent unconditional: 704, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2855, independent: 1187, independent conditional: 0, independent unconditional: 1187, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 1588, unknown conditional: 0, unknown unconditional: 1588] , Statistics on independence cache: Total cache size (in pairs): 200, Positive cache size: 169, Positive conditional cache size: 0, Positive unconditional cache size: 169, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L719] 0 _Bool x$flush_delayed; [L730] 0 int *x$read_delayed_var; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L720] 0 int x$mem_tmp; [L712] 0 int __unbuffered_p0_EAX = 0; [L724] 0 _Bool x$r_buff0_thd3; [L722] 0 _Bool x$r_buff0_thd1; [L714] 0 int __unbuffered_p1_EAX = 0; [L723] 0 _Bool x$r_buff0_thd2; [L721] 0 _Bool x$r_buff0_thd0; [L729] 0 _Bool x$read_delayed; [L710] 0 int __unbuffered_cnt = 0; [L716] 0 _Bool main$tmp_guard1; [L734] 0 _Bool x$w_buff1_used; [L715] 0 _Bool main$tmp_guard0; [L732] 0 _Bool x$w_buff0_used; [L731] 0 int x$w_buff0; [L733] 0 int x$w_buff1; [L718] 0 int x = 0; [L726] 0 _Bool x$r_buff1_thd1; [L725] 0 _Bool x$r_buff1_thd0; [L736] 0 int y = 0; [L728] 0 _Bool x$r_buff1_thd3; [L727] 0 _Bool x$r_buff1_thd2; [L849] 0 pthread_t t2537; [L850] FCALL, FORK 0 pthread_create(&t2537, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2537, ((void *)0), P0, ((void *)0))=0, t2537={-6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L851] 0 pthread_t t2538; [L852] FCALL, FORK 0 pthread_create(&t2538, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2538, ((void *)0), P1, ((void *)0))=1, t2537={-6:0}, t2538={-10:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L853] 0 pthread_t t2539; [L854] FCALL, FORK 0 pthread_create(&t2539, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2539, ((void *)0), P2, ((void *)0))=2, t2537={-6:0}, t2538={-10:0}, t2539={-2:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L812] 3 x$w_buff1 = x$w_buff0 [L813] 3 x$w_buff0 = 2 [L814] 3 x$w_buff1_used = x$w_buff0_used [L815] 3 x$w_buff0_used = (_Bool)1 [L816] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L816] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L817] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L818] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L819] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L820] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L824] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L772] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 x$flush_delayed = weak$$choice2 [L785] 2 x$mem_tmp = x [L786] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = x [L794] 2 x = x$flush_delayed ? x$mem_tmp : x [L795] 2 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 3 return 0; [L798] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L799] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L800] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L801] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L802] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 2 return 0; [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537={-6:0}, t2538={-10:0}, t2539={-2:0}, weak$$choice0=4, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L867] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L868] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L869] 0 x$flush_delayed = weak$$choice2 [L870] 0 x$mem_tmp = x [L871] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L872] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L873] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L874] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L875] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L877] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L879] 0 x = x$flush_delayed ? x$mem_tmp : x [L880] 0 x$flush_delayed = (_Bool)0 [L882] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 152 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 22.7s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 393 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 393 mSDsluCounter, 75 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 125 IncrementalHoareTripleChecker+Unchecked, 54 mSDsCounter, 87 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1522 IncrementalHoareTripleChecker+Invalid, 1734 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 87 mSolverCounterUnsat, 21 mSDtfsCounter, 1522 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 279 GetRequests, 196 SyntacticMatches, 3 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1028occurred in iteration=0, InterpolantAutomatonStates: 85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 176 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 290 NumberOfCodeBlocks, 290 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 253 ConstructedInterpolants, 62 QuantifiedInterpolants, 3854 SizeOfPredicates, 22 NumberOfNonLiveVariables, 2399 ConjunctsInSsa, 168 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-19 08:02:51,237 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37be9362-0ceb-46d8-942b-325e4010b39e/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample