./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix042.oepc.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_0b774f15-71ee-4ad6-944c-1f011c22857e/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/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_0b774f15-71ee-4ad6-944c-1f011c22857e/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/bin/utaipan-I9t0OCRTmS/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix042.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/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_0b774f15-71ee-4ad6-944c-1f011c22857e/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 65b1f643bcee3322b8ab5a998e6338f6065aa9114a28902f0ff5431bd8cb45ea --- 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 07:24:44,596 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 07:24:44,598 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 07:24:44,621 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 07:24:44,624 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 07:24:44,628 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 07:24:44,631 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 07:24:44,634 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 07:24:44,638 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 07:24:44,648 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 07:24:44,650 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 07:24:44,651 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 07:24:44,652 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 07:24:44,655 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 07:24:44,657 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 07:24:44,658 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 07:24:44,661 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 07:24:44,662 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 07:24:44,664 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 07:24:44,668 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 07:24:44,671 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 07:24:44,673 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 07:24:44,675 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 07:24:44,676 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 07:24:44,682 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 07:24:44,687 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 07:24:44,687 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 07:24:44,688 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 07:24:44,689 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 07:24:44,690 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 07:24:44,691 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 07:24:44,692 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 07:24:44,694 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 07:24:44,695 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 07:24:44,697 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 07:24:44,697 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 07:24:44,698 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 07:24:44,698 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 07:24:44,698 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 07:24:44,699 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 07:24:44,699 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 07:24:44,700 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-19 07:24:44,740 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 07:24:44,743 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 07:24:44,744 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 07:24:44,744 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 07:24:44,745 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 07:24:44,745 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 07:24:44,746 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 07:24:44,746 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 07:24:44,746 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 07:24:44,746 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 07:24:44,747 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 07:24:44,748 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 07:24:44,748 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 07:24:44,748 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 07:24:44,748 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 07:24:44,749 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 07:24:44,749 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 07:24:44,749 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 07:24:44,750 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-19 07:24:44,750 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-19 07:24:44,750 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 07:24:44,750 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 07:24:44,750 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-19 07:24:44,751 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 07:24:44,751 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 07:24:44,751 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 07:24:44,751 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-19 07:24:44,752 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-19 07:24:44,752 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-19 07:24:44,752 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 07:24:44,752 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-19 07:24:44,753 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 07:24:44,753 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 07:24:44,753 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 07:24:44,753 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 07:24:44,753 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:24:44,754 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 07:24:44,754 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 07:24:44,754 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 07:24:44,754 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 07:24:44,755 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 07:24:44,755 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 07:24:44,755 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_0b774f15-71ee-4ad6-944c-1f011c22857e/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_0b774f15-71ee-4ad6-944c-1f011c22857e/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 -> 65b1f643bcee3322b8ab5a998e6338f6065aa9114a28902f0ff5431bd8cb45ea [2022-11-19 07:24:45,013 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 07:24:45,038 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 07:24:45,040 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 07:24:45,041 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 07:24:45,042 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 07:24:45,043 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/pthread-wmm/mix042.oepc.i [2022-11-19 07:24:45,098 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/bin/utaipan-I9t0OCRTmS/data/79ee105c1/0bce1328ba114bfab4661b0d53fc86d8/FLAGa64805843 [2022-11-19 07:24:45,716 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 07:24:45,727 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/sv-benchmarks/c/pthread-wmm/mix042.oepc.i [2022-11-19 07:24:45,753 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/bin/utaipan-I9t0OCRTmS/data/79ee105c1/0bce1328ba114bfab4661b0d53fc86d8/FLAGa64805843 [2022-11-19 07:24:46,002 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/bin/utaipan-I9t0OCRTmS/data/79ee105c1/0bce1328ba114bfab4661b0d53fc86d8 [2022-11-19 07:24:46,005 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 07:24:46,006 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 07:24:46,008 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 07:24:46,008 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 07:24:46,011 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 07:24:46,012 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:24:46" (1/1) ... [2022-11-19 07:24:46,014 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2831110a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:24:46, skipping insertion in model container [2022-11-19 07:24:46,015 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:24:46" (1/1) ... [2022-11-19 07:24:46,023 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 07:24:46,087 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 07:24:46,320 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_0b774f15-71ee-4ad6-944c-1f011c22857e/sv-benchmarks/c/pthread-wmm/mix042.oepc.i[945,958] [2022-11-19 07:24:46,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:24:46,623 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 07:24:46,641 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_0b774f15-71ee-4ad6-944c-1f011c22857e/sv-benchmarks/c/pthread-wmm/mix042.oepc.i[945,958] [2022-11-19 07:24:46,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:24:46,750 INFO L208 MainTranslator]: Completed translation [2022-11-19 07:24:46,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:24:46 WrapperNode [2022-11-19 07:24:46,750 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 07:24:46,751 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 07:24:46,752 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 07:24:46,752 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 07:24:46,759 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:24:46" (1/1) ... [2022-11-19 07:24:46,792 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:24:46" (1/1) ... [2022-11-19 07:24:46,841 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 130 [2022-11-19 07:24:46,844 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 07:24:46,846 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 07:24:46,846 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 07:24:46,847 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 07:24:46,856 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:24:46" (1/1) ... [2022-11-19 07:24:46,857 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:24:46" (1/1) ... [2022-11-19 07:24:46,872 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:24:46" (1/1) ... [2022-11-19 07:24:46,873 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:24:46" (1/1) ... [2022-11-19 07:24:46,884 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:24:46" (1/1) ... [2022-11-19 07:24:46,898 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:24:46" (1/1) ... [2022-11-19 07:24:46,900 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:24:46" (1/1) ... [2022-11-19 07:24:46,901 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:24:46" (1/1) ... [2022-11-19 07:24:46,904 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 07:24:46,905 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 07:24:46,912 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 07:24:46,912 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 07:24:46,913 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:24:46" (1/1) ... [2022-11-19 07:24:46,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:24:46,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:24:46,948 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 07:24:46,962 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 07:24:47,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-19 07:24:47,004 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-19 07:24:47,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 07:24:47,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-19 07:24:47,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 07:24:47,004 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-19 07:24:47,004 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-19 07:24:47,005 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-19 07:24:47,005 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-19 07:24:47,005 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-19 07:24:47,005 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-19 07:24:47,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-19 07:24:47,005 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-19 07:24:47,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 07:24:47,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 07:24:47,007 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 07:24:47,239 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 07:24:47,241 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 07:24:47,650 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 07:24:47,810 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 07:24:47,810 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-19 07:24:47,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:24:47 BoogieIcfgContainer [2022-11-19 07:24:47,812 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 07:24:47,815 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 07:24:47,815 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 07:24:47,830 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 07:24:47,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:24:46" (1/3) ... [2022-11-19 07:24:47,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f71494b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:24:47, skipping insertion in model container [2022-11-19 07:24:47,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:24:46" (2/3) ... [2022-11-19 07:24:47,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f71494b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:24:47, skipping insertion in model container [2022-11-19 07:24:47,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:24:47" (3/3) ... [2022-11-19 07:24:47,833 INFO L112 eAbstractionObserver]: Analyzing ICFG mix042.oepc.i [2022-11-19 07:24:47,849 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 07:24:47,849 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-19 07:24:47,850 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-19 07:24:47,933 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-19 07:24:47,984 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-19 07:24:48,001 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 129 transitions, 273 flow [2022-11-19 07:24:48,003 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 129 transitions, 273 flow [2022-11-19 07:24:48,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 129 transitions, 273 flow [2022-11-19 07:24:48,087 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-11-19 07:24:48,087 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-19 07:24:48,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2022-11-19 07:24:48,095 INFO L119 LiptonReduction]: Number of co-enabled transitions 2524 [2022-11-19 07:24:53,614 INFO L134 LiptonReduction]: Checked pairs total: 6752 [2022-11-19 07:24:53,614 INFO L136 LiptonReduction]: Total number of compositions: 127 [2022-11-19 07:24:53,622 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 36 transitions, 87 flow [2022-11-19 07:24:53,711 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1288 states, 1273 states have (on average 3.3747054202670856) internal successors, (4296), 1287 states have internal predecessors, (4296), 0 states have call successors, (0), 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 07:24:53,729 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 07:24:53,735 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;@4f2c6b8e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 07:24:53,735 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-19 07:24:53,741 INFO L276 IsEmpty]: Start isEmpty. Operand has 1288 states, 1273 states have (on average 3.3747054202670856) internal successors, (4296), 1287 states have internal predecessors, (4296), 0 states have call successors, (0), 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 07:24:53,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-19 07:24:53,746 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:24:53,747 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-19 07:24:53,747 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 07:24:53,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:24:53,752 INFO L85 PathProgramCache]: Analyzing trace with hash 555, now seen corresponding path program 1 times [2022-11-19 07:24:53,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:24:53,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105455153] [2022-11-19 07:24:53,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:24:53,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:24:53,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:24:53,865 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 07:24:53,866 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:24:53,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105455153] [2022-11-19 07:24:53,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105455153] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:24:53,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:24:53,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-19 07:24:53,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455340567] [2022-11-19 07:24:53,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:24:53,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-19 07:24:53,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:24:53,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-19 07:24:53,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-19 07:24:53,912 INFO L87 Difference]: Start difference. First operand has 1288 states, 1273 states have (on average 3.3747054202670856) internal successors, (4296), 1287 states have internal predecessors, (4296), 0 states have call successors, (0), 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 07:24:54,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:24:54,033 INFO L93 Difference]: Finished difference Result 1214 states and 3934 transitions. [2022-11-19 07:24:54,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-19 07:24:54,040 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 07:24:54,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:24:54,065 INFO L225 Difference]: With dead ends: 1214 [2022-11-19 07:24:54,065 INFO L226 Difference]: Without dead ends: 1214 [2022-11-19 07:24:54,066 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 07:24:54,069 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:24:54,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:24:54,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2022-11-19 07:24:54,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 1214. [2022-11-19 07:24:54,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1214 states, 1209 states have (on average 3.2539288668320925) internal successors, (3934), 1213 states have internal predecessors, (3934), 0 states have call successors, (0), 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 07:24:54,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 3934 transitions. [2022-11-19 07:24:54,187 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 3934 transitions. Word has length 1 [2022-11-19 07:24:54,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:24:54,187 INFO L495 AbstractCegarLoop]: Abstraction has 1214 states and 3934 transitions. [2022-11-19 07:24:54,188 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 07:24:54,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 3934 transitions. [2022-11-19 07:24:54,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-19 07:24:54,188 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:24:54,188 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-19 07:24:54,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-19 07:24:54,189 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 07:24:54,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:24:54,190 INFO L85 PathProgramCache]: Analyzing trace with hash 545112, now seen corresponding path program 1 times [2022-11-19 07:24:54,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:24:54,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379038438] [2022-11-19 07:24:54,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:24:54,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:24:54,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:24:54,595 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 07:24:54,595 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:24:54,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379038438] [2022-11-19 07:24:54,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379038438] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:24:54,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:24:54,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 07:24:54,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787706652] [2022-11-19 07:24:54,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:24:54,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:24:54,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:24:54,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:24:54,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:24:54,606 INFO L87 Difference]: Start difference. First operand 1214 states and 3934 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:24:54,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:24:54,710 INFO L93 Difference]: Finished difference Result 992 states and 3169 transitions. [2022-11-19 07:24:54,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:24:54,711 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-19 07:24:54,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:24:54,718 INFO L225 Difference]: With dead ends: 992 [2022-11-19 07:24:54,719 INFO L226 Difference]: Without dead ends: 962 [2022-11-19 07:24:54,720 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 07:24:54,722 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:24:54,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 6 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:24:54,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2022-11-19 07:24:54,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 962. [2022-11-19 07:24:54,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 960 states have (on average 3.21875) internal successors, (3090), 961 states have internal predecessors, (3090), 0 states have call successors, (0), 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 07:24:54,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 3090 transitions. [2022-11-19 07:24:54,796 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 3090 transitions. Word has length 3 [2022-11-19 07:24:54,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:24:54,796 INFO L495 AbstractCegarLoop]: Abstraction has 962 states and 3090 transitions. [2022-11-19 07:24:54,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:24:54,797 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 3090 transitions. [2022-11-19 07:24:54,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-19 07:24:54,799 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:24:54,800 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:24:54,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-19 07:24:54,800 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 07:24:54,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:24:54,802 INFO L85 PathProgramCache]: Analyzing trace with hash -607169659, now seen corresponding path program 1 times [2022-11-19 07:24:54,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:24:54,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059854553] [2022-11-19 07:24:54,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:24:54,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:24:54,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:24:55,395 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 07:24:55,396 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:24:55,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059854553] [2022-11-19 07:24:55,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059854553] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:24:55,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:24:55,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:24:55,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119204452] [2022-11-19 07:24:55,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:24:55,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 07:24:55,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:24:55,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 07:24:55,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:24:55,400 INFO L87 Difference]: Start difference. First operand 962 states and 3090 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 07:24:55,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:24:55,582 INFO L93 Difference]: Finished difference Result 812 states and 2575 transitions. [2022-11-19 07:24:55,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 07:24:55,583 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 07:24:55,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:24:55,589 INFO L225 Difference]: With dead ends: 812 [2022-11-19 07:24:55,589 INFO L226 Difference]: Without dead ends: 812 [2022-11-19 07:24:55,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:24:55,591 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 42 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:24:55,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 21 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:24:55,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2022-11-19 07:24:55,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 812. [2022-11-19 07:24:55,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 811 states have (on average 3.1750924784217016) internal successors, (2575), 811 states have internal predecessors, (2575), 0 states have call successors, (0), 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 07:24:55,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 2575 transitions. [2022-11-19 07:24:55,631 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 2575 transitions. Word has length 10 [2022-11-19 07:24:55,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:24:55,633 INFO L495 AbstractCegarLoop]: Abstraction has 812 states and 2575 transitions. [2022-11-19 07:24:55,633 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 07:24:55,633 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 2575 transitions. [2022-11-19 07:24:55,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-19 07:24:55,636 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:24:55,636 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:24:55,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-19 07:24:55,637 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 07:24:55,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:24:55,637 INFO L85 PathProgramCache]: Analyzing trace with hash -607169699, now seen corresponding path program 1 times [2022-11-19 07:24:55,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:24:55,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145612574] [2022-11-19 07:24:55,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:24:55,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:24:55,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:24:55,854 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 07:24:55,857 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:24:55,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145612574] [2022-11-19 07:24:55,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145612574] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:24:55,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:24:55,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:24:55,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915327812] [2022-11-19 07:24:55,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:24:55,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:24:55,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:24:55,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:24:55,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:24:55,864 INFO L87 Difference]: Start difference. First operand 812 states and 2575 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) 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 07:24:56,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:24:56,024 INFO L93 Difference]: Finished difference Result 862 states and 2630 transitions. [2022-11-19 07:24:56,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:24:56,024 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) 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 07:24:56,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:24:56,029 INFO L225 Difference]: With dead ends: 862 [2022-11-19 07:24:56,029 INFO L226 Difference]: Without dead ends: 712 [2022-11-19 07:24:56,029 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 07:24:56,030 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 31 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:24:56,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 13 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:24:56,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2022-11-19 07:24:56,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 712. [2022-11-19 07:24:56,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 711 states have (on average 3.1153305203938118) internal successors, (2215), 711 states have internal predecessors, (2215), 0 states have call successors, (0), 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 07:24:56,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 2215 transitions. [2022-11-19 07:24:56,062 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 2215 transitions. Word has length 10 [2022-11-19 07:24:56,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:24:56,062 INFO L495 AbstractCegarLoop]: Abstraction has 712 states and 2215 transitions. [2022-11-19 07:24:56,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) 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 07:24:56,063 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 2215 transitions. [2022-11-19 07:24:56,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-19 07:24:56,069 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:24:56,069 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:24:56,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-19 07:24:56,070 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 07:24:56,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:24:56,071 INFO L85 PathProgramCache]: Analyzing trace with hash 591778375, now seen corresponding path program 1 times [2022-11-19 07:24:56,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:24:56,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287604563] [2022-11-19 07:24:56,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:24:56,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:24:56,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:24:56,255 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 07:24:56,255 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:24:56,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287604563] [2022-11-19 07:24:56,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287604563] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:24:56,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:24:56,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:24:56,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288214826] [2022-11-19 07:24:56,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:24:56,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:24:56,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:24:56,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:24:56,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:24:56,257 INFO L87 Difference]: Start difference. First operand 712 states and 2215 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:24:56,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:24:56,355 INFO L93 Difference]: Finished difference Result 606 states and 1636 transitions. [2022-11-19 07:24:56,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:24:56,355 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-19 07:24:56,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:24:56,358 INFO L225 Difference]: With dead ends: 606 [2022-11-19 07:24:56,358 INFO L226 Difference]: Without dead ends: 456 [2022-11-19 07:24:56,358 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 07:24:56,359 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 42 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:24:56,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 9 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:24:56,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2022-11-19 07:24:56,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 456. [2022-11-19 07:24:56,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 455 states have (on average 2.6175824175824176) internal successors, (1191), 455 states have internal predecessors, (1191), 0 states have call successors, (0), 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 07:24:56,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 1191 transitions. [2022-11-19 07:24:56,373 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 1191 transitions. Word has length 12 [2022-11-19 07:24:56,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:24:56,373 INFO L495 AbstractCegarLoop]: Abstraction has 456 states and 1191 transitions. [2022-11-19 07:24:56,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:24:56,373 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 1191 transitions. [2022-11-19 07:24:56,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-19 07:24:56,374 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:24:56,374 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:24:56,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-19 07:24:56,375 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 07:24:56,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:24:56,375 INFO L85 PathProgramCache]: Analyzing trace with hash -293878698, now seen corresponding path program 1 times [2022-11-19 07:24:56,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:24:56,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013508289] [2022-11-19 07:24:56,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:24:56,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:24:56,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:24:56,611 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 07:24:56,611 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:24:56,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013508289] [2022-11-19 07:24:56,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013508289] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:24:56,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:24:56,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:24:56,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578183729] [2022-11-19 07:24:56,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:24:56,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:24:56,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:24:56,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:24:56,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:24:56,613 INFO L87 Difference]: Start difference. First operand 456 states and 1191 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 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 07:24:56,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:24:56,749 INFO L93 Difference]: Finished difference Result 334 states and 796 transitions. [2022-11-19 07:24:56,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:24:56,751 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 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 07:24:56,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:24:56,752 INFO L225 Difference]: With dead ends: 334 [2022-11-19 07:24:56,753 INFO L226 Difference]: Without dead ends: 264 [2022-11-19 07:24:56,753 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 07:24:56,754 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 86 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:24:56,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 12 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:24:56,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-11-19 07:24:56,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2022-11-19 07:24:56,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 263 states have (on average 2.338403041825095) internal successors, (615), 263 states have internal predecessors, (615), 0 states have call successors, (0), 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 07:24:56,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 615 transitions. [2022-11-19 07:24:56,762 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 615 transitions. Word has length 15 [2022-11-19 07:24:56,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:24:56,762 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 615 transitions. [2022-11-19 07:24:56,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 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 07:24:56,762 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 615 transitions. [2022-11-19 07:24:56,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-19 07:24:56,763 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:24:56,763 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:24:56,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-19 07:24:56,763 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 07:24:56,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:24:56,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1701967393, now seen corresponding path program 1 times [2022-11-19 07:24:56,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:24:56,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292247044] [2022-11-19 07:24:56,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:24:56,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:24:56,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:24:57,050 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 07:24:57,050 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:24:57,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292247044] [2022-11-19 07:24:57,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292247044] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:24:57,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:24:57,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 07:24:57,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908427067] [2022-11-19 07:24:57,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:24:57,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 07:24:57,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:24:57,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 07:24:57,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:24:57,052 INFO L87 Difference]: Start difference. First operand 264 states and 615 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:24:57,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:24:57,184 INFO L93 Difference]: Finished difference Result 230 states and 545 transitions. [2022-11-19 07:24:57,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 07:24:57,184 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-19 07:24:57,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:24:57,185 INFO L225 Difference]: With dead ends: 230 [2022-11-19 07:24:57,186 INFO L226 Difference]: Without dead ends: 216 [2022-11-19 07:24:57,186 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 07:24:57,186 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 108 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:24:57,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 9 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:24:57,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-11-19 07:24:57,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2022-11-19 07:24:57,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 2.4139534883720932) internal successors, (519), 215 states have internal predecessors, (519), 0 states have call successors, (0), 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 07:24:57,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 519 transitions. [2022-11-19 07:24:57,193 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 519 transitions. Word has length 19 [2022-11-19 07:24:57,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:24:57,194 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 519 transitions. [2022-11-19 07:24:57,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:24:57,194 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 519 transitions. [2022-11-19 07:24:57,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-19 07:24:57,195 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:24:57,195 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, 1] [2022-11-19 07:24:57,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-19 07:24:57,195 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 07:24:57,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:24:57,196 INFO L85 PathProgramCache]: Analyzing trace with hash 757224939, now seen corresponding path program 1 times [2022-11-19 07:24:57,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:24:57,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167291764] [2022-11-19 07:24:57,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:24:57,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:24:57,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:24:58,743 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 07:24:58,743 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:24:58,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167291764] [2022-11-19 07:24:58,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167291764] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:24:58,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:24:58,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-19 07:24:58,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395300289] [2022-11-19 07:24:58,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:24:58,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-19 07:24:58,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:24:58,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-19 07:24:58,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-19 07:24:58,745 INFO L87 Difference]: Start difference. First operand 216 states and 519 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:24:59,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:24:59,055 INFO L93 Difference]: Finished difference Result 317 states and 721 transitions. [2022-11-19 07:24:59,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:24:59,056 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-19 07:24:59,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:24:59,057 INFO L225 Difference]: With dead ends: 317 [2022-11-19 07:24:59,057 INFO L226 Difference]: Without dead ends: 230 [2022-11-19 07:24:59,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-19 07:24:59,058 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 44 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:24:59,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 42 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 07:24:59,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-11-19 07:24:59,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 202. [2022-11-19 07:24:59,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 201 states have (on average 2.2935323383084576) internal successors, (461), 201 states have internal predecessors, (461), 0 states have call successors, (0), 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 07:24:59,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 461 transitions. [2022-11-19 07:24:59,065 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 461 transitions. Word has length 23 [2022-11-19 07:24:59,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:24:59,065 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 461 transitions. [2022-11-19 07:24:59,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:24:59,066 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 461 transitions. [2022-11-19 07:24:59,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-19 07:24:59,066 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:24:59,066 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, 1] [2022-11-19 07:24:59,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-19 07:24:59,068 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 07:24:59,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:24:59,069 INFO L85 PathProgramCache]: Analyzing trace with hash 471308265, now seen corresponding path program 2 times [2022-11-19 07:24:59,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:24:59,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576459187] [2022-11-19 07:24:59,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:24:59,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:24:59,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:24:59,393 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 07:24:59,393 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:24:59,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576459187] [2022-11-19 07:24:59,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576459187] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:24:59,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:24:59,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:24:59,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596914446] [2022-11-19 07:24:59,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:24:59,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:24:59,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:24:59,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:24:59,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:24:59,396 INFO L87 Difference]: Start difference. First operand 202 states and 461 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:24:59,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:24:59,542 INFO L93 Difference]: Finished difference Result 281 states and 624 transitions. [2022-11-19 07:24:59,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:24:59,543 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-19 07:24:59,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:24:59,543 INFO L225 Difference]: With dead ends: 281 [2022-11-19 07:24:59,544 INFO L226 Difference]: Without dead ends: 118 [2022-11-19 07:24:59,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:24:59,544 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 23 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:24:59,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 16 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:24:59,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-11-19 07:24:59,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-11-19 07:24:59,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 2.0256410256410255) internal successors, (237), 117 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:24:59,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 237 transitions. [2022-11-19 07:24:59,549 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 237 transitions. Word has length 23 [2022-11-19 07:24:59,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:24:59,550 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 237 transitions. [2022-11-19 07:24:59,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:24:59,550 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 237 transitions. [2022-11-19 07:24:59,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-19 07:24:59,553 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:24:59,553 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, 1] [2022-11-19 07:24:59,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-19 07:24:59,553 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 07:24:59,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:24:59,554 INFO L85 PathProgramCache]: Analyzing trace with hash -2051672265, now seen corresponding path program 3 times [2022-11-19 07:24:59,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:24:59,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066745875] [2022-11-19 07:24:59,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:24:59,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:24:59,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:25:00,211 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 07:25:00,211 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:25:00,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066745875] [2022-11-19 07:25:00,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066745875] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:25:00,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:25:00,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-19 07:25:00,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003916170] [2022-11-19 07:25:00,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:25:00,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-19 07:25:00,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:25:00,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-19 07:25:00,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-19 07:25:00,213 INFO L87 Difference]: Start difference. First operand 118 states and 237 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:25:00,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:25:00,495 INFO L93 Difference]: Finished difference Result 182 states and 363 transitions. [2022-11-19 07:25:00,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-19 07:25:00,496 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-19 07:25:00,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:25:00,497 INFO L225 Difference]: With dead ends: 182 [2022-11-19 07:25:00,497 INFO L226 Difference]: Without dead ends: 147 [2022-11-19 07:25:00,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-11-19 07:25:00,498 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 47 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:25:00,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 32 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:25:00,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-11-19 07:25:00,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 98. [2022-11-19 07:25:00,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 1.9278350515463918) internal successors, (187), 97 states have internal predecessors, (187), 0 states have call successors, (0), 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 07:25:00,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 187 transitions. [2022-11-19 07:25:00,502 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 187 transitions. Word has length 23 [2022-11-19 07:25:00,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:25:00,502 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 187 transitions. [2022-11-19 07:25:00,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:25:00,503 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 187 transitions. [2022-11-19 07:25:00,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-19 07:25:00,503 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:25:00,503 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, 1] [2022-11-19 07:25:00,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-19 07:25:00,504 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 07:25:00,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:25:00,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1945716681, now seen corresponding path program 4 times [2022-11-19 07:25:00,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:25:00,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057208542] [2022-11-19 07:25:00,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:25:00,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:25:00,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 07:25:00,563 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-19 07:25:00,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 07:25:00,660 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-19 07:25:00,660 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-19 07:25:00,661 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-11-19 07:25:00,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-11-19 07:25:00,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-19 07:25:00,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-11-19 07:25:00,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-11-19 07:25:00,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-19 07:25:00,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-19 07:25:00,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-19 07:25:00,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-11-19 07:25:00,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-11-19 07:25:00,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-11-19 07:25:00,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-11-19 07:25:00,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-19 07:25:00,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-19 07:25:00,668 INFO L444 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:25:00,673 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-19 07:25:00,673 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-19 07:25:00,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:25:00 BasicIcfg [2022-11-19 07:25:00,732 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-19 07:25:00,732 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-19 07:25:00,732 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-19 07:25:00,732 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-19 07:25:00,733 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:24:47" (3/4) ... [2022-11-19 07:25:00,736 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-19 07:25:00,736 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-19 07:25:00,737 INFO L158 Benchmark]: Toolchain (without parser) took 14730.64ms. Allocated memory was 121.6MB in the beginning and 218.1MB in the end (delta: 96.5MB). Free memory was 80.3MB in the beginning and 172.5MB in the end (delta: -92.2MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. [2022-11-19 07:25:00,737 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 121.6MB. Free memory was 99.1MB in the beginning and 99.0MB in the end (delta: 73.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:25:00,737 INFO L158 Benchmark]: CACSL2BoogieTranslator took 743.17ms. Allocated memory is still 121.6MB. Free memory was 80.1MB in the beginning and 82.4MB in the end (delta: -2.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-19 07:25:00,738 INFO L158 Benchmark]: Boogie Procedure Inliner took 93.36ms. Allocated memory is still 121.6MB. Free memory was 82.4MB in the beginning and 79.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 07:25:00,738 INFO L158 Benchmark]: Boogie Preprocessor took 58.76ms. Allocated memory is still 121.6MB. Free memory was 79.7MB in the beginning and 77.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 07:25:00,738 INFO L158 Benchmark]: RCFGBuilder took 907.41ms. Allocated memory is still 121.6MB. Free memory was 77.8MB in the beginning and 95.3MB in the end (delta: -17.4MB). Peak memory consumption was 41.5MB. Max. memory is 16.1GB. [2022-11-19 07:25:00,739 INFO L158 Benchmark]: TraceAbstraction took 12916.58ms. Allocated memory was 121.6MB in the beginning and 218.1MB in the end (delta: 96.5MB). Free memory was 94.7MB in the beginning and 172.5MB in the end (delta: -77.8MB). Peak memory consumption was 137.5MB. Max. memory is 16.1GB. [2022-11-19 07:25:00,739 INFO L158 Benchmark]: Witness Printer took 3.96ms. Allocated memory is still 218.1MB. Free memory is still 172.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:25:00,740 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.17ms. Allocated memory is still 121.6MB. Free memory was 99.1MB in the beginning and 99.0MB in the end (delta: 73.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 743.17ms. Allocated memory is still 121.6MB. Free memory was 80.1MB in the beginning and 82.4MB in the end (delta: -2.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 93.36ms. Allocated memory is still 121.6MB. Free memory was 82.4MB in the beginning and 79.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.76ms. Allocated memory is still 121.6MB. Free memory was 79.7MB in the beginning and 77.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 907.41ms. Allocated memory is still 121.6MB. Free memory was 77.8MB in the beginning and 95.3MB in the end (delta: -17.4MB). Peak memory consumption was 41.5MB. Max. memory is 16.1GB. * TraceAbstraction took 12916.58ms. Allocated memory was 121.6MB in the beginning and 218.1MB in the end (delta: 96.5MB). Free memory was 94.7MB in the beginning and 172.5MB in the end (delta: -77.8MB). Peak memory consumption was 137.5MB. Max. memory is 16.1GB. * Witness Printer took 3.96ms. Allocated memory is still 218.1MB. Free memory is still 172.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: 5.6s, 137 PlacesBefore, 45 PlacesAfterwards, 129 TransitionsBefore, 36 TransitionsAfterwards, 2524 CoEnabledTransitionPairs, 7 FixpointIterations, 52 TrivialSequentialCompositions, 65 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 127 TotalNumberOfCompositions, 6752 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3561, independent: 3379, independent conditional: 0, independent unconditional: 3379, dependent: 182, dependent conditional: 0, dependent unconditional: 182, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1768, independent: 1721, independent conditional: 0, independent unconditional: 1721, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1768, independent: 1703, independent conditional: 0, independent unconditional: 1703, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 65, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 428, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 401, dependent conditional: 0, dependent unconditional: 401, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3561, independent: 1658, independent conditional: 0, independent unconditional: 1658, dependent: 135, dependent conditional: 0, dependent unconditional: 135, unknown: 1768, unknown conditional: 0, unknown unconditional: 1768] , Statistics on independence cache: Total cache size (in pairs): 202, Positive cache size: 179, Positive conditional cache size: 0, Positive unconditional cache size: 179, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, 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: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L715] 0 int __unbuffered_p2_EBX = 0; [L733] 0 _Bool a$w_buff1_used; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L711] 0 int __unbuffered_p0_EAX = 0; [L719] 0 int a$mem_tmp; [L728] 0 _Bool a$read_delayed; [L717] 0 int a = 0; [L727] 0 _Bool a$r_buff1_thd3; [L713] 0 int __unbuffered_p2_EAX = 0; [L725] 0 _Bool a$r_buff1_thd1; [L730] 0 int a$w_buff0; [L726] 0 _Bool a$r_buff1_thd2; [L732] 0 int a$w_buff1; [L718] 0 _Bool a$flush_delayed; [L724] 0 _Bool a$r_buff1_thd0; [L709] 0 int __unbuffered_cnt = 0; [L729] 0 int *a$read_delayed_var; [L735] 0 _Bool main$tmp_guard1; [L734] 0 _Bool main$tmp_guard0; [L731] 0 _Bool a$w_buff0_used; [L721] 0 _Bool a$r_buff0_thd1; [L720] 0 _Bool a$r_buff0_thd0; [L723] 0 _Bool a$r_buff0_thd3; [L722] 0 _Bool a$r_buff0_thd2; [L737] 0 int x = 0; [L739] 0 int y = 0; [L741] 0 int z = 0; [L843] 0 pthread_t t1105; [L844] FCALL, FORK 0 pthread_create(&t1105, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1105, ((void *)0), P0, ((void *)0))=-2, t1105={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L845] 0 pthread_t t1106; [L846] FCALL, FORK 0 pthread_create(&t1106, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1106, ((void *)0), P1, ((void *)0))=-1, t1105={5:0}, t1106={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L847] 0 pthread_t t1107; [L747] 1 a$w_buff1 = a$w_buff0 [L748] 1 a$w_buff0 = 1 [L749] 1 a$w_buff1_used = a$w_buff0_used [L750] 1 a$w_buff0_used = (_Bool)1 [L751] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L751] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L752] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L753] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L754] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L755] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L756] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, y=0, z=0] [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, y=0, z=0] [L776] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L779] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L782] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L783] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L784] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L785] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L786] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 2 return 0; [L848] FCALL, FORK 0 pthread_create(&t1107, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1107, ((void *)0), P2, ((void *)0))=0, t1105={5:0}, t1106={6:0}, t1107={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L796] 3 y = 2 [L799] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=2, z=1] [L802] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=2, z=1] [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 a$flush_delayed = weak$$choice2 [L808] 3 a$mem_tmp = a [L809] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L810] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L811] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L812] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L813] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L815] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 __unbuffered_p2_EBX = a [L817] 3 a = a$flush_delayed ? a$mem_tmp : a [L818] 3 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=1] [L821] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L822] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L823] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L824] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L825] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=1] [L762] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L763] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L764] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L765] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L766] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, 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=49, weak$$choice2=0, x=1, y=2, z=1] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 1 return 0; [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L830] 3 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L855] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L856] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L857] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L858] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1105={5:0}, t1106={6:0}, t1107={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=1] [L861] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L863] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=1] - UnprovableResult [Line: 18]: 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: 841]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 848]: 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: 844]: 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: 846]: 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, 158 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 12.7s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 438 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 438 mSDsluCounter, 163 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 116 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1033 IncrementalHoareTripleChecker+Invalid, 1071 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 47 mSDtfsCounter, 1033 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1288occurred in iteration=0, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 77 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 162 NumberOfCodeBlocks, 162 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 129 ConstructedInterpolants, 0 QuantifiedInterpolants, 897 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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 07:25:00,765 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/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_0b774f15-71ee-4ad6-944c-1f011c22857e/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/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_0b774f15-71ee-4ad6-944c-1f011c22857e/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/bin/utaipan-I9t0OCRTmS/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix042.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/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_0b774f15-71ee-4ad6-944c-1f011c22857e/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 65b1f643bcee3322b8ab5a998e6338f6065aa9114a28902f0ff5431bd8cb45ea --- 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 07:25:03,073 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 07:25:03,076 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 07:25:03,114 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 07:25:03,114 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 07:25:03,118 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 07:25:03,121 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 07:25:03,125 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 07:25:03,128 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 07:25:03,135 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 07:25:03,137 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 07:25:03,139 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 07:25:03,140 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 07:25:03,142 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 07:25:03,143 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 07:25:03,145 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 07:25:03,146 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 07:25:03,148 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 07:25:03,153 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 07:25:03,158 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 07:25:03,162 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 07:25:03,163 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 07:25:03,165 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 07:25:03,167 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 07:25:03,173 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 07:25:03,178 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 07:25:03,178 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 07:25:03,179 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 07:25:03,181 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 07:25:03,182 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 07:25:03,183 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 07:25:03,184 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 07:25:03,185 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 07:25:03,186 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 07:25:03,187 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 07:25:03,188 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 07:25:03,189 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 07:25:03,189 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 07:25:03,189 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 07:25:03,191 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 07:25:03,192 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 07:25:03,197 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-19 07:25:03,237 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 07:25:03,238 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 07:25:03,239 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 07:25:03,239 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 07:25:03,240 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 07:25:03,240 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 07:25:03,240 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 07:25:03,241 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 07:25:03,241 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 07:25:03,241 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 07:25:03,242 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 07:25:03,242 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 07:25:03,244 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-19 07:25:03,244 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-19 07:25:03,244 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 07:25:03,244 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 07:25:03,245 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-19 07:25:03,245 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 07:25:03,245 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 07:25:03,245 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 07:25:03,245 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-19 07:25:03,246 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-19 07:25:03,246 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-19 07:25:03,246 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 07:25:03,246 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-19 07:25:03,246 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-19 07:25:03,247 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-19 07:25:03,247 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 07:25:03,247 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 07:25:03,247 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 07:25:03,248 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-19 07:25:03,248 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 07:25:03,248 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:25:03,249 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 07:25:03,249 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 07:25:03,249 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-19 07:25:03,250 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-19 07:25:03,250 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 07:25:03,250 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-19 07:25:03,250 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_0b774f15-71ee-4ad6-944c-1f011c22857e/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_0b774f15-71ee-4ad6-944c-1f011c22857e/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 -> 65b1f643bcee3322b8ab5a998e6338f6065aa9114a28902f0ff5431bd8cb45ea [2022-11-19 07:25:03,617 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 07:25:03,647 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 07:25:03,650 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 07:25:03,651 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 07:25:03,652 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 07:25:03,653 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/pthread-wmm/mix042.oepc.i [2022-11-19 07:25:03,723 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/bin/utaipan-I9t0OCRTmS/data/6aadebec3/9f300e5b2afb424f8c8dd2a9be9c7768/FLAGe6b74458c [2022-11-19 07:25:04,284 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 07:25:04,285 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/sv-benchmarks/c/pthread-wmm/mix042.oepc.i [2022-11-19 07:25:04,300 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/bin/utaipan-I9t0OCRTmS/data/6aadebec3/9f300e5b2afb424f8c8dd2a9be9c7768/FLAGe6b74458c [2022-11-19 07:25:04,567 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/bin/utaipan-I9t0OCRTmS/data/6aadebec3/9f300e5b2afb424f8c8dd2a9be9c7768 [2022-11-19 07:25:04,569 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 07:25:04,571 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 07:25:04,577 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 07:25:04,578 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 07:25:04,581 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 07:25:04,582 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:25:04" (1/1) ... [2022-11-19 07:25:04,583 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2607c256 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:04, skipping insertion in model container [2022-11-19 07:25:04,584 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:25:04" (1/1) ... [2022-11-19 07:25:04,591 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 07:25:04,630 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 07:25:04,862 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_0b774f15-71ee-4ad6-944c-1f011c22857e/sv-benchmarks/c/pthread-wmm/mix042.oepc.i[945,958] [2022-11-19 07:25:05,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:25:05,179 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 07:25:05,202 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_0b774f15-71ee-4ad6-944c-1f011c22857e/sv-benchmarks/c/pthread-wmm/mix042.oepc.i[945,958] [2022-11-19 07:25:05,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:25:05,331 INFO L208 MainTranslator]: Completed translation [2022-11-19 07:25:05,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:05 WrapperNode [2022-11-19 07:25:05,332 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 07:25:05,333 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 07:25:05,333 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 07:25:05,333 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 07:25:05,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:05" (1/1) ... [2022-11-19 07:25:05,373 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:05" (1/1) ... [2022-11-19 07:25:05,410 INFO L138 Inliner]: procedures = 179, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 131 [2022-11-19 07:25:05,410 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 07:25:05,411 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 07:25:05,411 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 07:25:05,411 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 07:25:05,420 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:05" (1/1) ... [2022-11-19 07:25:05,421 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:05" (1/1) ... [2022-11-19 07:25:05,424 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:05" (1/1) ... [2022-11-19 07:25:05,424 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:05" (1/1) ... [2022-11-19 07:25:05,433 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:05" (1/1) ... [2022-11-19 07:25:05,435 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:05" (1/1) ... [2022-11-19 07:25:05,438 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:05" (1/1) ... [2022-11-19 07:25:05,439 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:05" (1/1) ... [2022-11-19 07:25:05,443 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 07:25:05,444 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 07:25:05,444 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 07:25:05,444 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 07:25:05,445 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:05" (1/1) ... [2022-11-19 07:25:05,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:25:05,462 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:25:05,475 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 07:25:05,520 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 07:25:05,537 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-19 07:25:05,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 07:25:05,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-19 07:25:05,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 07:25:05,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-19 07:25:05,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-19 07:25:05,539 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-19 07:25:05,539 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-19 07:25:05,540 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-19 07:25:05,540 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-19 07:25:05,540 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-19 07:25:05,540 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-19 07:25:05,540 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-19 07:25:05,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 07:25:05,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 07:25:05,542 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 07:25:05,772 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 07:25:05,774 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 07:25:06,162 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 07:25:06,365 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 07:25:06,365 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-19 07:25:06,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:25:06 BoogieIcfgContainer [2022-11-19 07:25:06,368 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 07:25:06,371 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 07:25:06,371 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 07:25:06,374 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 07:25:06,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:25:04" (1/3) ... [2022-11-19 07:25:06,376 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c616b20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:25:06, skipping insertion in model container [2022-11-19 07:25:06,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:05" (2/3) ... [2022-11-19 07:25:06,376 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c616b20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:25:06, skipping insertion in model container [2022-11-19 07:25:06,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:25:06" (3/3) ... [2022-11-19 07:25:06,378 INFO L112 eAbstractionObserver]: Analyzing ICFG mix042.oepc.i [2022-11-19 07:25:06,396 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 07:25:06,397 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-19 07:25:06,397 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-19 07:25:06,496 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-19 07:25:06,540 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-19 07:25:06,556 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 130 transitions, 275 flow [2022-11-19 07:25:06,561 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 130 transitions, 275 flow [2022-11-19 07:25:06,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 130 transitions, 275 flow [2022-11-19 07:25:06,618 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2022-11-19 07:25:06,619 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-19 07:25:06,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 0 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2022-11-19 07:25:06,627 INFO L119 LiptonReduction]: Number of co-enabled transitions 2524 [2022-11-19 07:25:15,712 INFO L134 LiptonReduction]: Checked pairs total: 6863 [2022-11-19 07:25:15,712 INFO L136 LiptonReduction]: Total number of compositions: 128 [2022-11-19 07:25:15,720 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 36 transitions, 87 flow [2022-11-19 07:25:15,813 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1288 states, 1273 states have (on average 3.3747054202670856) internal successors, (4296), 1287 states have internal predecessors, (4296), 0 states have call successors, (0), 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 07:25:15,831 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 07:25:15,857 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;@7c03a737, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 07:25:15,858 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-19 07:25:15,863 INFO L276 IsEmpty]: Start isEmpty. Operand has 1288 states, 1273 states have (on average 3.3747054202670856) internal successors, (4296), 1287 states have internal predecessors, (4296), 0 states have call successors, (0), 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 07:25:15,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-19 07:25:15,869 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:25:15,870 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-19 07:25:15,871 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 07:25:15,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:25:15,879 INFO L85 PathProgramCache]: Analyzing trace with hash 559, now seen corresponding path program 1 times [2022-11-19 07:25:15,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:25:15,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1711675847] [2022-11-19 07:25:15,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:25:15,891 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 07:25:15,892 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:25:15,897 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/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 07:25:15,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/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 07:25:15,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:25:15,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-19 07:25:15,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:25:15,979 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 07:25:15,980 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:25:15,980 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:25:15,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1711675847] [2022-11-19 07:25:15,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1711675847] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:25:15,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:25:15,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-19 07:25:15,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207987884] [2022-11-19 07:25:15,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:25:15,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-19 07:25:15,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:25:16,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-19 07:25:16,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-19 07:25:16,018 INFO L87 Difference]: Start difference. First operand has 1288 states, 1273 states have (on average 3.3747054202670856) internal successors, (4296), 1287 states have internal predecessors, (4296), 0 states have call successors, (0), 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 07:25:16,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:25:16,266 INFO L93 Difference]: Finished difference Result 1214 states and 3934 transitions. [2022-11-19 07:25:16,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-19 07:25:16,268 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 07:25:16,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:25:16,306 INFO L225 Difference]: With dead ends: 1214 [2022-11-19 07:25:16,313 INFO L226 Difference]: Without dead ends: 1214 [2022-11-19 07:25:16,314 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 07:25:16,318 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:25:16,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:25:16,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2022-11-19 07:25:16,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 1214. [2022-11-19 07:25:16,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1214 states, 1209 states have (on average 3.2539288668320925) internal successors, (3934), 1213 states have internal predecessors, (3934), 0 states have call successors, (0), 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 07:25:16,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 3934 transitions. [2022-11-19 07:25:16,456 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 3934 transitions. Word has length 1 [2022-11-19 07:25:16,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:25:16,456 INFO L495 AbstractCegarLoop]: Abstraction has 1214 states and 3934 transitions. [2022-11-19 07:25:16,456 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 07:25:16,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 3934 transitions. [2022-11-19 07:25:16,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-19 07:25:16,457 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:25:16,457 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-19 07:25:16,474 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/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 07:25:16,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/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 07:25:16,669 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 07:25:16,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:25:16,669 INFO L85 PathProgramCache]: Analyzing trace with hash 549019, now seen corresponding path program 1 times [2022-11-19 07:25:16,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:25:16,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [598914508] [2022-11-19 07:25:16,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:25:16,670 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 07:25:16,670 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:25:16,676 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/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 07:25:16,679 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/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 07:25:16,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:25:16,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 07:25:16,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:25:16,787 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 07:25:16,787 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:25:16,788 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:25:16,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [598914508] [2022-11-19 07:25:16,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [598914508] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:25:16,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:25:16,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 07:25:16,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533591158] [2022-11-19 07:25:16,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:25:16,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:25:16,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:25:16,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:25:16,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:25:16,791 INFO L87 Difference]: Start difference. First operand 1214 states and 3934 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:25:16,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:25:16,935 INFO L93 Difference]: Finished difference Result 992 states and 3169 transitions. [2022-11-19 07:25:16,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:25:16,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-19 07:25:16,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:25:16,951 INFO L225 Difference]: With dead ends: 992 [2022-11-19 07:25:16,951 INFO L226 Difference]: Without dead ends: 962 [2022-11-19 07:25:16,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:25:16,953 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:25:16,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 6 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:25:16,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2022-11-19 07:25:17,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 962. [2022-11-19 07:25:17,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 960 states have (on average 3.21875) internal successors, (3090), 961 states have internal predecessors, (3090), 0 states have call successors, (0), 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 07:25:17,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 3090 transitions. [2022-11-19 07:25:17,032 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 3090 transitions. Word has length 3 [2022-11-19 07:25:17,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:25:17,055 INFO L495 AbstractCegarLoop]: Abstraction has 962 states and 3090 transitions. [2022-11-19 07:25:17,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:25:17,056 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 3090 transitions. [2022-11-19 07:25:17,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-19 07:25:17,058 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:25:17,058 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:25:17,076 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/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 07:25:17,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/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 07:25:17,269 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 07:25:17,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:25:17,271 INFO L85 PathProgramCache]: Analyzing trace with hash -2107011789, now seen corresponding path program 1 times [2022-11-19 07:25:17,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:25:17,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [77663800] [2022-11-19 07:25:17,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:25:17,275 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 07:25:17,275 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:25:17,277 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/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 07:25:17,334 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/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 07:25:17,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:25:17,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 07:25:17,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:25:17,476 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 07:25:17,478 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:25:17,478 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:25:17,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [77663800] [2022-11-19 07:25:17,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [77663800] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:25:17,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:25:17,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:25:17,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434502342] [2022-11-19 07:25:17,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:25:17,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:25:17,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:25:17,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:25:17,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:25:17,484 INFO L87 Difference]: Start difference. First operand 962 states and 3090 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 07:25:17,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:25:17,634 INFO L93 Difference]: Finished difference Result 712 states and 1935 transitions. [2022-11-19 07:25:17,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:25:17,635 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 07:25:17,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:25:17,638 INFO L225 Difference]: With dead ends: 712 [2022-11-19 07:25:17,638 INFO L226 Difference]: Without dead ends: 562 [2022-11-19 07:25:17,638 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 07:25:17,642 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 46 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:25:17,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 9 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:25:17,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2022-11-19 07:25:17,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2022-11-19 07:25:17,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 560 states have (on average 2.6607142857142856) internal successors, (1490), 561 states have internal predecessors, (1490), 0 states have call successors, (0), 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 07:25:17,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1490 transitions. [2022-11-19 07:25:17,672 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1490 transitions. Word has length 10 [2022-11-19 07:25:17,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:25:17,672 INFO L495 AbstractCegarLoop]: Abstraction has 562 states and 1490 transitions. [2022-11-19 07:25:17,672 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 07:25:17,673 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1490 transitions. [2022-11-19 07:25:17,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-19 07:25:17,675 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:25:17,675 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:25:17,696 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/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 07:25:17,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/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 07:25:17,892 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 07:25:17,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:25:17,893 INFO L85 PathProgramCache]: Analyzing trace with hash 710086030, now seen corresponding path program 1 times [2022-11-19 07:25:17,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:25:17,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1975326141] [2022-11-19 07:25:17,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:25:17,894 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 07:25:17,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:25:17,895 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/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 07:25:17,897 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/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 07:25:18,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:25:18,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 07:25:18,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:25:18,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 07:25:18,056 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:25:18,056 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:25:18,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1975326141] [2022-11-19 07:25:18,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1975326141] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:25:18,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:25:18,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:25:18,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077425029] [2022-11-19 07:25:18,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:25:18,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:25:18,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:25:18,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:25:18,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:25:18,059 INFO L87 Difference]: Start difference. First operand 562 states and 1490 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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 07:25:18,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:25:18,227 INFO L93 Difference]: Finished difference Result 352 states and 831 transitions. [2022-11-19 07:25:18,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:25:18,227 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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 07:25:18,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:25:18,229 INFO L225 Difference]: With dead ends: 352 [2022-11-19 07:25:18,229 INFO L226 Difference]: Without dead ends: 282 [2022-11-19 07:25:18,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 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 07:25:18,230 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 72 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:25:18,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 15 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:25:18,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-11-19 07:25:18,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2022-11-19 07:25:18,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 280 states have (on average 2.3214285714285716) internal successors, (650), 281 states have internal predecessors, (650), 0 states have call successors, (0), 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 07:25:18,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 650 transitions. [2022-11-19 07:25:18,241 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 650 transitions. Word has length 14 [2022-11-19 07:25:18,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:25:18,241 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 650 transitions. [2022-11-19 07:25:18,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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 07:25:18,241 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 650 transitions. [2022-11-19 07:25:18,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-19 07:25:18,243 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:25:18,243 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 07:25:18,260 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/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 07:25:18,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/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 07:25:18,455 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 07:25:18,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:25:18,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1643974467, now seen corresponding path program 1 times [2022-11-19 07:25:18,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:25:18,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [251459657] [2022-11-19 07:25:18,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:25:18,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 07:25:18,457 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:25:18,458 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/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 07:25:18,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/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 07:25:18,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:25:18,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-19 07:25:18,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:25:18,699 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 07:25:18,699 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:25:18,699 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:25:18,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [251459657] [2022-11-19 07:25:18,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [251459657] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:25:18,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:25:18,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 07:25:18,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127861022] [2022-11-19 07:25:18,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:25:18,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 07:25:18,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:25:18,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 07:25:18,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:25:18,702 INFO L87 Difference]: Start difference. First operand 282 states and 650 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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 07:25:18,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:25:18,955 INFO L93 Difference]: Finished difference Result 231 states and 546 transitions. [2022-11-19 07:25:18,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 07:25:18,956 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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 07:25:18,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:25:18,957 INFO L225 Difference]: With dead ends: 231 [2022-11-19 07:25:18,958 INFO L226 Difference]: Without dead ends: 217 [2022-11-19 07:25:18,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-19 07:25:18,959 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 81 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:25:18,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 27 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:25:18,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-11-19 07:25:18,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2022-11-19 07:25:18,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 215 states have (on average 2.4186046511627906) internal successors, (520), 216 states have internal predecessors, (520), 0 states have call successors, (0), 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 07:25:18,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 520 transitions. [2022-11-19 07:25:18,972 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 520 transitions. Word has length 18 [2022-11-19 07:25:18,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:25:18,972 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 520 transitions. [2022-11-19 07:25:18,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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 07:25:18,973 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 520 transitions. [2022-11-19 07:25:18,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-19 07:25:18,976 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:25:18,976 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, 1] [2022-11-19 07:25:18,996 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/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)] Ended with exit code 0 [2022-11-19 07:25:19,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/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 07:25:19,187 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 07:25:19,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:25:19,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1904479418, now seen corresponding path program 1 times [2022-11-19 07:25:19,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:25:19,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [168486965] [2022-11-19 07:25:19,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:25:19,190 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 07:25:19,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:25:19,193 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/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 07:25:19,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/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 07:25:19,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:25:19,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 07:25:19,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:25:19,393 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 07:25:19,393 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:25:19,393 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:25:19,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [168486965] [2022-11-19 07:25:19,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [168486965] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:25:19,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:25:19,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:25:19,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330012650] [2022-11-19 07:25:19,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:25:19,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:25:19,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:25:19,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:25:19,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:25:19,396 INFO L87 Difference]: Start difference. First operand 217 states and 520 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:25:19,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:25:19,584 INFO L93 Difference]: Finished difference Result 317 states and 744 transitions. [2022-11-19 07:25:19,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:25:19,585 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-19 07:25:19,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:25:19,587 INFO L225 Difference]: With dead ends: 317 [2022-11-19 07:25:19,587 INFO L226 Difference]: Without dead ends: 317 [2022-11-19 07:25:19,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:25:19,588 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 32 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:25:19,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 16 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:25:19,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-11-19 07:25:19,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 316. [2022-11-19 07:25:19,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 314 states have (on average 2.3694267515923566) internal successors, (744), 315 states have internal predecessors, (744), 0 states have call successors, (0), 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 07:25:19,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 744 transitions. [2022-11-19 07:25:19,600 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 744 transitions. Word has length 23 [2022-11-19 07:25:19,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:25:19,600 INFO L495 AbstractCegarLoop]: Abstraction has 316 states and 744 transitions. [2022-11-19 07:25:19,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:25:19,601 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 744 transitions. [2022-11-19 07:25:19,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-19 07:25:19,602 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:25:19,602 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, 1] [2022-11-19 07:25:19,619 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/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 07:25:19,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/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 07:25:19,815 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 07:25:19,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:25:19,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1904479458, now seen corresponding path program 1 times [2022-11-19 07:25:19,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:25:19,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [924687392] [2022-11-19 07:25:19,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:25:19,816 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 07:25:19,816 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:25:19,817 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/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 07:25:19,818 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/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 07:25:19,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:25:19,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-19 07:25:20,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:25:20,459 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 07:25:20,459 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:25:20,459 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:25:20,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [924687392] [2022-11-19 07:25:20,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [924687392] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:25:20,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:25:20,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:25:20,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670418090] [2022-11-19 07:25:20,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:25:20,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:25:20,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:25:20,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:25:20,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:25:20,461 INFO L87 Difference]: Start difference. First operand 316 states and 744 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:25:20,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:25:20,533 INFO L93 Difference]: Finished difference Result 315 states and 742 transitions. [2022-11-19 07:25:20,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:25:20,534 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-19 07:25:20,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:25:20,535 INFO L225 Difference]: With dead ends: 315 [2022-11-19 07:25:20,535 INFO L226 Difference]: Without dead ends: 152 [2022-11-19 07:25:20,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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 07:25:20,536 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 12 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:25:20,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 18 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 28 Unchecked, 0.1s Time] [2022-11-19 07:25:20,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-11-19 07:25:20,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2022-11-19 07:25:20,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 2.218543046357616) internal successors, (335), 151 states have internal predecessors, (335), 0 states have call successors, (0), 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 07:25:20,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 335 transitions. [2022-11-19 07:25:20,542 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 335 transitions. Word has length 23 [2022-11-19 07:25:20,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:25:20,542 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 335 transitions. [2022-11-19 07:25:20,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:25:20,542 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 335 transitions. [2022-11-19 07:25:20,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-19 07:25:20,543 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:25:20,543 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, 1] [2022-11-19 07:25:20,559 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/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 07:25:20,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/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 07:25:20,756 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 07:25:20,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:25:20,757 INFO L85 PathProgramCache]: Analyzing trace with hash 2038815108, now seen corresponding path program 2 times [2022-11-19 07:25:20,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:25:20,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1550639853] [2022-11-19 07:25:20,757 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-19 07:25:20,758 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 07:25:20,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:25:20,759 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/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 07:25:20,802 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/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 07:25:20,894 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-19 07:25:20,894 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:25:20,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 07:25:20,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:25:20,928 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 07:25:20,928 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:25:20,928 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:25:20,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1550639853] [2022-11-19 07:25:20,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1550639853] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:25:20,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:25:20,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:25:20,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021561712] [2022-11-19 07:25:20,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:25:20,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:25:20,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:25:20,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:25:20,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:25:20,931 INFO L87 Difference]: Start difference. First operand 152 states and 335 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:25:21,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:25:21,051 INFO L93 Difference]: Finished difference Result 200 states and 434 transitions. [2022-11-19 07:25:21,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:25:21,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-19 07:25:21,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:25:21,052 INFO L225 Difference]: With dead ends: 200 [2022-11-19 07:25:21,052 INFO L226 Difference]: Without dead ends: 112 [2022-11-19 07:25:21,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 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 07:25:21,053 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 8 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:25:21,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 10 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:25:21,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-11-19 07:25:21,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-11-19 07:25:21,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 2.1171171171171173) internal successors, (235), 111 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:25:21,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 235 transitions. [2022-11-19 07:25:21,057 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 235 transitions. Word has length 23 [2022-11-19 07:25:21,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:25:21,057 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 235 transitions. [2022-11-19 07:25:21,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:25:21,058 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 235 transitions. [2022-11-19 07:25:21,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-19 07:25:21,058 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:25:21,058 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, 1] [2022-11-19 07:25:21,077 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/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 07:25:21,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/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 07:25:21,268 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 07:25:21,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:25:21,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1466174012, now seen corresponding path program 3 times [2022-11-19 07:25:21,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:25:21,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [258389708] [2022-11-19 07:25:21,270 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 07:25:21,270 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 07:25:21,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:25:21,271 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/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 07:25:21,312 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/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 07:25:21,415 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-19 07:25:21,415 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:25:21,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-19 07:25:21,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:25:21,591 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 07:25:21,592 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:25:21,592 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:25:21,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [258389708] [2022-11-19 07:25:21,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [258389708] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:25:21,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:25:21,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 07:25:21,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260588493] [2022-11-19 07:25:21,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:25:21,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 07:25:21,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:25:21,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 07:25:21,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:25:21,595 INFO L87 Difference]: Start difference. First operand 112 states and 235 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:25:21,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:25:21,857 INFO L93 Difference]: Finished difference Result 133 states and 271 transitions. [2022-11-19 07:25:21,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-19 07:25:21,858 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-19 07:25:21,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:25:21,859 INFO L225 Difference]: With dead ends: 133 [2022-11-19 07:25:21,859 INFO L226 Difference]: Without dead ends: 112 [2022-11-19 07:25:21,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 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 07:25:21,859 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 48 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:25:21,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 20 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:25:21,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-11-19 07:25:21,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-11-19 07:25:21,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 2.099099099099099) internal successors, (233), 111 states have internal predecessors, (233), 0 states have call successors, (0), 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 07:25:21,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 233 transitions. [2022-11-19 07:25:21,865 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 233 transitions. Word has length 23 [2022-11-19 07:25:21,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:25:21,866 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 233 transitions. [2022-11-19 07:25:21,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:25:21,867 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 233 transitions. [2022-11-19 07:25:21,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-19 07:25:21,867 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:25:21,868 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, 1] [2022-11-19 07:25:21,880 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/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 07:25:22,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/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 07:25:22,075 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 07:25:22,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:25:22,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1546438564, now seen corresponding path program 4 times [2022-11-19 07:25:22,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:25:22,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [984529603] [2022-11-19 07:25:22,076 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-19 07:25:22,076 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 07:25:22,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:25:22,077 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/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 07:25:22,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/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 07:25:22,217 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-19 07:25:22,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:25:22,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-19 07:25:22,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:25:22,519 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 07:25:22,519 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:25:22,519 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:25:22,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [984529603] [2022-11-19 07:25:22,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [984529603] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:25:22,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:25:22,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-19 07:25:22,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888407633] [2022-11-19 07:25:22,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:25:22,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-19 07:25:22,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:25:22,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-19 07:25:22,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-19 07:25:22,522 INFO L87 Difference]: Start difference. First operand 112 states and 233 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:25:22,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:25:22,804 INFO L93 Difference]: Finished difference Result 127 states and 256 transitions. [2022-11-19 07:25:22,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-19 07:25:22,804 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-19 07:25:22,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:25:22,805 INFO L225 Difference]: With dead ends: 127 [2022-11-19 07:25:22,805 INFO L226 Difference]: Without dead ends: 66 [2022-11-19 07:25:22,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 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 07:25:22,806 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 43 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:25:22,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 23 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:25:22,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-19 07:25:22,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-11-19 07:25:22,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.7692307692307692) internal successors, (115), 65 states have internal predecessors, (115), 0 states have call successors, (0), 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 07:25:22,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 115 transitions. [2022-11-19 07:25:22,809 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 115 transitions. Word has length 23 [2022-11-19 07:25:22,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:25:22,809 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 115 transitions. [2022-11-19 07:25:22,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:25:22,809 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 115 transitions. [2022-11-19 07:25:22,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-19 07:25:22,809 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:25:22,810 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, 1] [2022-11-19 07:25:22,824 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/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 07:25:23,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/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 07:25:23,010 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 07:25:23,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:25:23,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1917617086, now seen corresponding path program 5 times [2022-11-19 07:25:23,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:25:23,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [659785921] [2022-11-19 07:25:23,011 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-19 07:25:23,011 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 07:25:23,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:25:23,013 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/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 07:25:23,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/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 07:25:23,164 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-19 07:25:23,164 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-19 07:25:23,164 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-19 07:25:23,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 07:25:23,338 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2022-11-19 07:25:23,338 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-19 07:25:23,339 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-11-19 07:25:23,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-11-19 07:25:23,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-19 07:25:23,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-11-19 07:25:23,342 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-11-19 07:25:23,342 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-19 07:25:23,342 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-19 07:25:23,342 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-19 07:25:23,342 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-11-19 07:25:23,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-11-19 07:25:23,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-11-19 07:25:23,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-11-19 07:25:23,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-19 07:25:23,359 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/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 07:25:23,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/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 07:25:23,554 INFO L444 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1] [2022-11-19 07:25:23,558 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-19 07:25:23,558 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-19 07:25:23,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:25:23 BasicIcfg [2022-11-19 07:25:23,651 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-19 07:25:23,651 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-19 07:25:23,651 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-19 07:25:23,652 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-19 07:25:23,652 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:25:06" (3/4) ... [2022-11-19 07:25:23,655 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-19 07:25:23,655 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-19 07:25:23,656 INFO L158 Benchmark]: Toolchain (without parser) took 19084.81ms. Allocated memory was 58.7MB in the beginning and 151.0MB in the end (delta: 92.3MB). Free memory was 35.6MB in the beginning and 40.9MB in the end (delta: -5.3MB). Peak memory consumption was 88.0MB. Max. memory is 16.1GB. [2022-11-19 07:25:23,656 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 58.7MB. Free memory is still 40.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:25:23,656 INFO L158 Benchmark]: CACSL2BoogieTranslator took 755.03ms. Allocated memory was 58.7MB in the beginning and 77.6MB in the end (delta: 18.9MB). Free memory was 35.2MB in the beginning and 47.5MB in the end (delta: -12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-19 07:25:23,657 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.39ms. Allocated memory is still 77.6MB. Free memory was 47.5MB in the beginning and 45.1MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-19 07:25:23,657 INFO L158 Benchmark]: Boogie Preprocessor took 32.31ms. Allocated memory is still 77.6MB. Free memory was 45.1MB in the beginning and 43.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 07:25:23,658 INFO L158 Benchmark]: RCFGBuilder took 924.34ms. Allocated memory is still 77.6MB. Free memory was 42.7MB in the beginning and 39.1MB in the end (delta: 3.7MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. [2022-11-19 07:25:23,659 INFO L158 Benchmark]: TraceAbstraction took 17279.93ms. Allocated memory was 77.6MB in the beginning and 151.0MB in the end (delta: 73.4MB). Free memory was 38.3MB in the beginning and 40.9MB in the end (delta: -2.5MB). Peak memory consumption was 72.8MB. Max. memory is 16.1GB. [2022-11-19 07:25:23,659 INFO L158 Benchmark]: Witness Printer took 3.69ms. Allocated memory is still 151.0MB. Free memory is still 40.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:25:23,661 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.29ms. Allocated memory is still 58.7MB. Free memory is still 40.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 755.03ms. Allocated memory was 58.7MB in the beginning and 77.6MB in the end (delta: 18.9MB). Free memory was 35.2MB in the beginning and 47.5MB in the end (delta: -12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.39ms. Allocated memory is still 77.6MB. Free memory was 47.5MB in the beginning and 45.1MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.31ms. Allocated memory is still 77.6MB. Free memory was 45.1MB in the beginning and 43.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 924.34ms. Allocated memory is still 77.6MB. Free memory was 42.7MB in the beginning and 39.1MB in the end (delta: 3.7MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. * TraceAbstraction took 17279.93ms. Allocated memory was 77.6MB in the beginning and 151.0MB in the end (delta: 73.4MB). Free memory was 38.3MB in the beginning and 40.9MB in the end (delta: -2.5MB). Peak memory consumption was 72.8MB. Max. memory is 16.1GB. * Witness Printer took 3.69ms. Allocated memory is still 151.0MB. Free memory is still 40.9MB. 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.2s, 138 PlacesBefore, 45 PlacesAfterwards, 130 TransitionsBefore, 36 TransitionsAfterwards, 2524 CoEnabledTransitionPairs, 7 FixpointIterations, 53 TrivialSequentialCompositions, 65 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 128 TotalNumberOfCompositions, 6863 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3726, independent: 3544, independent conditional: 0, independent unconditional: 3544, dependent: 182, dependent conditional: 0, dependent unconditional: 182, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1790, independent: 1747, independent conditional: 0, independent unconditional: 1747, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1790, independent: 1720, independent conditional: 0, independent unconditional: 1720, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 70, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 389, independent: 49, independent conditional: 0, independent unconditional: 49, dependent: 340, dependent conditional: 0, dependent unconditional: 340, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3726, independent: 1797, independent conditional: 0, independent unconditional: 1797, dependent: 139, dependent conditional: 0, dependent unconditional: 139, unknown: 1790, unknown conditional: 0, unknown unconditional: 1790] , Statistics on independence cache: Total cache size (in pairs): 217, Positive cache size: 196, Positive conditional cache size: 0, Positive unconditional cache size: 196, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, 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: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L715] 0 int __unbuffered_p2_EBX = 0; [L733] 0 _Bool a$w_buff1_used; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L711] 0 int __unbuffered_p0_EAX = 0; [L719] 0 int a$mem_tmp; [L728] 0 _Bool a$read_delayed; [L717] 0 int a = 0; [L727] 0 _Bool a$r_buff1_thd3; [L713] 0 int __unbuffered_p2_EAX = 0; [L725] 0 _Bool a$r_buff1_thd1; [L730] 0 int a$w_buff0; [L726] 0 _Bool a$r_buff1_thd2; [L732] 0 int a$w_buff1; [L718] 0 _Bool a$flush_delayed; [L724] 0 _Bool a$r_buff1_thd0; [L709] 0 int __unbuffered_cnt = 0; [L729] 0 int *a$read_delayed_var; [L735] 0 _Bool main$tmp_guard1; [L734] 0 _Bool main$tmp_guard0; [L731] 0 _Bool a$w_buff0_used; [L721] 0 _Bool a$r_buff0_thd1; [L720] 0 _Bool a$r_buff0_thd0; [L723] 0 _Bool a$r_buff0_thd3; [L722] 0 _Bool a$r_buff0_thd2; [L737] 0 int x = 0; [L739] 0 int y = 0; [L741] 0 int z = 0; [L843] 0 pthread_t t1105; [L844] FCALL, FORK 0 pthread_create(&t1105, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1105, ((void *)0), P0, ((void *)0))=0, t1105={-6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L845] 0 pthread_t t1106; [L846] FCALL, FORK 0 pthread_create(&t1106, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1106, ((void *)0), P1, ((void *)0))=1, t1105={-6:0}, t1106={-10:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L847] 0 pthread_t t1107; [L848] FCALL, FORK 0 pthread_create(&t1107, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1107, ((void *)0), P2, ((void *)0))=2, t1105={-6:0}, t1106={-10:0}, t1107={-2:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L747] 1 a$w_buff1 = a$w_buff0 [L748] 1 a$w_buff0 = 1 [L749] 1 a$w_buff1_used = a$w_buff0_used [L750] 1 a$w_buff0_used = (_Bool)1 [L751] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L751] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L752] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L753] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L754] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L755] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L756] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, y=0, z=0] [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, y=0, z=0] [L776] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=0, z=0] [L779] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=0] [L796] 3 y = 2 [L799] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=2, z=1] [L802] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=2, z=1] [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 a$flush_delayed = weak$$choice2 [L808] 3 a$mem_tmp = a [L809] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L810] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L811] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L812] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L813] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L815] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 __unbuffered_p2_EBX = a [L817] 3 a = a$flush_delayed ? a$mem_tmp : a [L818] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=2, z=1] [L821] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L822] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L823] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L824] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L825] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=2, z=1] [L762] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L763] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L764] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L765] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L766] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, 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=2, weak$$choice2=0, x=1, y=2, z=1] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 1 return 0; [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L830] 3 return 0; [L782] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L783] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L784] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L785] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L786] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=2, z=1] [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 2 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L855] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L856] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L857] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L858] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1105={-6:0}, t1106={-10:0}, t1107={-2:0}, weak$$choice0=2, weak$$choice2=0, x=1, y=2, z=1] [L861] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L863] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=2, z=1] - UnprovableResult [Line: 18]: 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: 841]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 848]: 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: 844]: 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: 846]: 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, 159 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 17.0s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 357 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 357 mSDsluCounter, 147 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 28 IncrementalHoareTripleChecker+Unchecked, 97 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 940 IncrementalHoareTripleChecker+Invalid, 1003 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 50 mSDtfsCounter, 940 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 167 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1288occurred in iteration=0, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 184 NumberOfCodeBlocks, 184 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 151 ConstructedInterpolants, 18 QuantifiedInterpolants, 1351 SizeOfPredicates, 21 NumberOfNonLiveVariables, 1288 ConjunctsInSsa, 74 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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 07:25:23,695 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b774f15-71ee-4ad6-944c-1f011c22857e/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