./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix037.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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_27207752-e2c9-4e40-9ecf-aeb5a4f8220c/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27207752-e2c9-4e40-9ecf-aeb5a4f8220c/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_27207752-e2c9-4e40-9ecf-aeb5a4f8220c/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27207752-e2c9-4e40-9ecf-aeb5a4f8220c/bin/utaipan-I9t0OCRTmS/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix037.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27207752-e2c9-4e40-9ecf-aeb5a4f8220c/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27207752-e2c9-4e40-9ecf-aeb5a4f8220c/bin/utaipan-I9t0OCRTmS --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash be02b321ccd6bac38d207cd4c595c173c1a2ce3b705272ff0087ad749834a1ef --- 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:07:55,691 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 07:07:55,694 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 07:07:55,747 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 07:07:55,749 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 07:07:55,755 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 07:07:55,758 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 07:07:55,766 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 07:07:55,768 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 07:07:55,770 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 07:07:55,772 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 07:07:55,775 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 07:07:55,776 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 07:07:55,782 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 07:07:55,784 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 07:07:55,787 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 07:07:55,789 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 07:07:55,792 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 07:07:55,794 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 07:07:55,798 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 07:07:55,804 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 07:07:55,805 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 07:07:55,809 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 07:07:55,811 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 07:07:55,818 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 07:07:55,824 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 07:07:55,825 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 07:07:55,826 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 07:07:55,828 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 07:07:55,830 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 07:07:55,830 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 07:07:55,831 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 07:07:55,833 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 07:07:55,836 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 07:07:55,838 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 07:07:55,840 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 07:07:55,841 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 07:07:55,841 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 07:07:55,841 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 07:07:55,843 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 07:07:55,843 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 07:07:55,845 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27207752-e2c9-4e40-9ecf-aeb5a4f8220c/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-19 07:07:55,900 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 07:07:55,900 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 07:07:55,901 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 07:07:55,901 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 07:07:55,902 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 07:07:55,902 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 07:07:55,903 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 07:07:55,903 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 07:07:55,903 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 07:07:55,904 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 07:07:55,905 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 07:07:55,905 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 07:07:55,906 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 07:07:55,906 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 07:07:55,906 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 07:07:55,906 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 07:07:55,907 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 07:07:55,907 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 07:07:55,908 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 07:07:55,908 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 07:07:55,908 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 07:07:55,909 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 07:07:55,909 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 07:07:55,911 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-19 07:07:55,911 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 07:07:55,912 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-19 07:07:55,912 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 07:07:55,912 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-19 07:07:55,912 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 07:07:55,913 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-19 07:07:55,913 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 07:07:55,913 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 07:07:55,914 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:07:55,914 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 07:07:55,914 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 07:07:55,915 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 07:07:55,915 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-19 07:07:55,915 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 07:07:55,915 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 07:07:55,916 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-19 07:07:55,916 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 07:07:55,916 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_27207752-e2c9-4e40-9ecf-aeb5a4f8220c/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_27207752-e2c9-4e40-9ecf-aeb5a4f8220c/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 ! call(reach_error())) ) 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 -> be02b321ccd6bac38d207cd4c595c173c1a2ce3b705272ff0087ad749834a1ef [2022-11-19 07:07:56,354 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 07:07:56,382 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 07:07:56,385 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 07:07:56,387 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 07:07:56,388 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 07:07:56,390 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27207752-e2c9-4e40-9ecf-aeb5a4f8220c/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/pthread-wmm/mix037.opt.i [2022-11-19 07:07:56,479 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27207752-e2c9-4e40-9ecf-aeb5a4f8220c/bin/utaipan-I9t0OCRTmS/data/24ddb1923/b87aa3520e804025b96cedc9e331af93/FLAGa64414e36 [2022-11-19 07:07:57,119 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 07:07:57,124 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27207752-e2c9-4e40-9ecf-aeb5a4f8220c/sv-benchmarks/c/pthread-wmm/mix037.opt.i [2022-11-19 07:07:57,142 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27207752-e2c9-4e40-9ecf-aeb5a4f8220c/bin/utaipan-I9t0OCRTmS/data/24ddb1923/b87aa3520e804025b96cedc9e331af93/FLAGa64414e36 [2022-11-19 07:07:57,389 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27207752-e2c9-4e40-9ecf-aeb5a4f8220c/bin/utaipan-I9t0OCRTmS/data/24ddb1923/b87aa3520e804025b96cedc9e331af93 [2022-11-19 07:07:57,392 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 07:07:57,393 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 07:07:57,395 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 07:07:57,395 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 07:07:57,399 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 07:07:57,400 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:07:57" (1/1) ... [2022-11-19 07:07:57,402 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@378f570b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:07:57, skipping insertion in model container [2022-11-19 07:07:57,402 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:07:57" (1/1) ... [2022-11-19 07:07:57,414 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 07:07:57,493 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 07:07:57,762 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_27207752-e2c9-4e40-9ecf-aeb5a4f8220c/sv-benchmarks/c/pthread-wmm/mix037.opt.i[944,957] [2022-11-19 07:07:58,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:07:58,035 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 07:07:58,050 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_27207752-e2c9-4e40-9ecf-aeb5a4f8220c/sv-benchmarks/c/pthread-wmm/mix037.opt.i[944,957] [2022-11-19 07:07:58,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:07:58,145 INFO L208 MainTranslator]: Completed translation [2022-11-19 07:07:58,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:07:58 WrapperNode [2022-11-19 07:07:58,146 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 07:07:58,147 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 07:07:58,147 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 07:07:58,148 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 07:07:58,156 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:07:58" (1/1) ... [2022-11-19 07:07:58,183 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:07:58" (1/1) ... [2022-11-19 07:07:58,237 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 152 [2022-11-19 07:07:58,247 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 07:07:58,248 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 07:07:58,248 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 07:07:58,249 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 07:07:58,260 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:07:58" (1/1) ... [2022-11-19 07:07:58,262 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:07:58" (1/1) ... [2022-11-19 07:07:58,269 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:07:58" (1/1) ... [2022-11-19 07:07:58,284 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:07:58" (1/1) ... [2022-11-19 07:07:58,292 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:07:58" (1/1) ... [2022-11-19 07:07:58,294 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:07:58" (1/1) ... [2022-11-19 07:07:58,297 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:07:58" (1/1) ... [2022-11-19 07:07:58,299 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:07:58" (1/1) ... [2022-11-19 07:07:58,304 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 07:07:58,305 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 07:07:58,305 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 07:07:58,305 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 07:07:58,306 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:07:58" (1/1) ... [2022-11-19 07:07:58,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:07:58,341 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27207752-e2c9-4e40-9ecf-aeb5a4f8220c/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:07:58,369 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27207752-e2c9-4e40-9ecf-aeb5a4f8220c/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 07:07:58,412 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27207752-e2c9-4e40-9ecf-aeb5a4f8220c/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 07:07:58,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-19 07:07:58,447 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-19 07:07:58,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 07:07:58,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-19 07:07:58,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 07:07:58,448 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-19 07:07:58,448 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-19 07:07:58,449 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-19 07:07:58,449 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-19 07:07:58,449 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-19 07:07:58,449 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-19 07:07:58,450 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-19 07:07:58,450 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-19 07:07:58,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-19 07:07:58,450 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-19 07:07:58,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 07:07:58,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 07:07:58,452 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:07:58,674 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 07:07:58,677 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 07:07:59,179 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 07:07:59,397 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 07:07:59,398 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-19 07:07:59,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:07:59 BoogieIcfgContainer [2022-11-19 07:07:59,401 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 07:07:59,405 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 07:07:59,405 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 07:07:59,409 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 07:07:59,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:07:57" (1/3) ... [2022-11-19 07:07:59,410 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c313352 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:07:59, skipping insertion in model container [2022-11-19 07:07:59,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:07:58" (2/3) ... [2022-11-19 07:07:59,411 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c313352 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:07:59, skipping insertion in model container [2022-11-19 07:07:59,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:07:59" (3/3) ... [2022-11-19 07:07:59,414 INFO L112 eAbstractionObserver]: Analyzing ICFG mix037.opt.i [2022-11-19 07:07:59,428 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-19 07:07:59,440 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 07:07:59,441 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-19 07:07:59,441 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-19 07:07:59,550 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-19 07:07:59,612 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-19 07:07:59,632 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 137 transitions, 294 flow [2022-11-19 07:07:59,638 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 137 transitions, 294 flow [2022-11-19 07:07:59,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 137 transitions, 294 flow [2022-11-19 07:07:59,772 INFO L130 PetriNetUnfolder]: 2/133 cut-off events. [2022-11-19 07:07:59,773 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-19 07:07:59,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 133 events. 2/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2022-11-19 07:07:59,786 INFO L119 LiptonReduction]: Number of co-enabled transitions 3040 [2022-11-19 07:08:05,922 INFO L134 LiptonReduction]: Checked pairs total: 7120 [2022-11-19 07:08:05,923 INFO L136 LiptonReduction]: Total number of compositions: 121 [2022-11-19 07:08:05,932 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 32 transitions, 84 flow [2022-11-19 07:08:06,117 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2090 states, 2087 states have (on average 3.8485864877815046) internal successors, (8032), 2089 states have internal predecessors, (8032), 0 states have call successors, (0), 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:08:06,145 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 07:08:06,152 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=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@7db1e9d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 07:08:06,153 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-19 07:08:06,161 INFO L276 IsEmpty]: Start isEmpty. Operand has 2090 states, 2087 states have (on average 3.8485864877815046) internal successors, (8032), 2089 states have internal predecessors, (8032), 0 states have call successors, (0), 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:08:06,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-19 07:08:06,170 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:08:06,170 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:08:06,171 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 07:08:06,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:08:06,178 INFO L85 PathProgramCache]: Analyzing trace with hash 2007425148, now seen corresponding path program 1 times [2022-11-19 07:08:06,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:08:06,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546796211] [2022-11-19 07:08:06,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:08:06,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:08:06,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:08:06,717 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:08:06,717 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:08:06,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546796211] [2022-11-19 07:08:06,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546796211] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:08:06,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:08:06,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 07:08:06,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779668060] [2022-11-19 07:08:06,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:08:06,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:08:06,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:08:06,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:08:06,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:08:06,768 INFO L87 Difference]: Start difference. First operand has 2090 states, 2087 states have (on average 3.8485864877815046) internal successors, (8032), 2089 states have internal predecessors, (8032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:08:06,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:08:06,932 INFO L93 Difference]: Finished difference Result 1770 states and 6608 transitions. [2022-11-19 07:08:06,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:08:06,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-19 07:08:06,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:08:06,977 INFO L225 Difference]: With dead ends: 1770 [2022-11-19 07:08:06,977 INFO L226 Difference]: Without dead ends: 1706 [2022-11-19 07:08:06,978 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:08:06,983 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 11 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:08:06,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 8 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:08:07,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2022-11-19 07:08:07,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1706. [2022-11-19 07:08:07,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1706 states, 1705 states have (on average 3.7536656891495603) internal successors, (6400), 1705 states have internal predecessors, (6400), 0 states have call successors, (0), 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:08:07,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 6400 transitions. [2022-11-19 07:08:07,156 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 6400 transitions. Word has length 9 [2022-11-19 07:08:07,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:08:07,158 INFO L495 AbstractCegarLoop]: Abstraction has 1706 states and 6400 transitions. [2022-11-19 07:08:07,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:08:07,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 6400 transitions. [2022-11-19 07:08:07,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-19 07:08:07,167 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:08:07,168 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:08:07,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-19 07:08:07,168 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 07:08:07,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:08:07,169 INFO L85 PathProgramCache]: Analyzing trace with hash 695307849, now seen corresponding path program 1 times [2022-11-19 07:08:07,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:08:07,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779440641] [2022-11-19 07:08:07,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:08:07,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:08:07,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:08:07,453 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:08:07,453 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:08:07,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779440641] [2022-11-19 07:08:07,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779440641] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:08:07,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:08:07,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 07:08:07,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610160997] [2022-11-19 07:08:07,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:08:07,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:08:07,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:08:07,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:08:07,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:08:07,457 INFO L87 Difference]: Start difference. First operand 1706 states and 6400 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:08:07,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:08:07,564 INFO L93 Difference]: Finished difference Result 1658 states and 6180 transitions. [2022-11-19 07:08:07,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:08:07,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-19 07:08:07,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:08:07,579 INFO L225 Difference]: With dead ends: 1658 [2022-11-19 07:08:07,580 INFO L226 Difference]: Without dead ends: 1658 [2022-11-19 07:08:07,580 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:08:07,581 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 9 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:08:07,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 7 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:08:07,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1658 states. [2022-11-19 07:08:07,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1658 to 1658. [2022-11-19 07:08:07,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1658 states, 1657 states have (on average 3.7296318648159326) internal successors, (6180), 1657 states have internal predecessors, (6180), 0 states have call successors, (0), 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:08:07,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 6180 transitions. [2022-11-19 07:08:07,652 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 6180 transitions. Word has length 11 [2022-11-19 07:08:07,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:08:07,653 INFO L495 AbstractCegarLoop]: Abstraction has 1658 states and 6180 transitions. [2022-11-19 07:08:07,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:08:07,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 6180 transitions. [2022-11-19 07:08:07,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-19 07:08:07,656 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:08:07,656 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:08:07,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-19 07:08:07,656 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 07:08:07,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:08:07,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1933597896, now seen corresponding path program 1 times [2022-11-19 07:08:07,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:08:07,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003194604] [2022-11-19 07:08:07,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:08:07,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:08:07,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:08:07,939 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:08:07,940 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:08:07,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003194604] [2022-11-19 07:08:07,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003194604] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:08:07,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:08:07,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:08:07,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138590950] [2022-11-19 07:08:07,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:08:07,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:08:07,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:08:07,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:08:07,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:08:07,943 INFO L87 Difference]: Start difference. First operand 1658 states and 6180 transitions. Second operand has 4 states, 3 states have (on average 4.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:08:08,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:08:08,095 INFO L93 Difference]: Finished difference Result 2026 states and 7280 transitions. [2022-11-19 07:08:08,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:08:08,095 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.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:08:08,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:08:08,112 INFO L225 Difference]: With dead ends: 2026 [2022-11-19 07:08:08,112 INFO L226 Difference]: Without dead ends: 1954 [2022-11-19 07:08:08,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:08:08,117 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 25 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:08:08,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 10 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:08:08,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1954 states. [2022-11-19 07:08:08,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1954 to 1858. [2022-11-19 07:08:08,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1858 states, 1857 states have (on average 3.6532040926225093) internal successors, (6784), 1857 states have internal predecessors, (6784), 0 states have call successors, (0), 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:08:08,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 6784 transitions. [2022-11-19 07:08:08,209 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 6784 transitions. Word has length 12 [2022-11-19 07:08:08,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:08:08,209 INFO L495 AbstractCegarLoop]: Abstraction has 1858 states and 6784 transitions. [2022-11-19 07:08:08,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.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:08:08,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 6784 transitions. [2022-11-19 07:08:08,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-19 07:08:08,213 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:08:08,213 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:08:08,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-19 07:08:08,213 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 07:08:08,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:08:08,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1508594951, now seen corresponding path program 1 times [2022-11-19 07:08:08,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:08:08,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345787462] [2022-11-19 07:08:08,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:08:08,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:08:08,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:08:08,496 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:08:08,497 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:08:08,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345787462] [2022-11-19 07:08:08,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345787462] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:08:08,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:08:08,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:08:08,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279473287] [2022-11-19 07:08:08,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:08:08,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:08:08,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:08:08,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:08:08,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:08:08,501 INFO L87 Difference]: Start difference. First operand 1858 states and 6784 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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:08:08,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:08:08,648 INFO L93 Difference]: Finished difference Result 1963 states and 6505 transitions. [2022-11-19 07:08:08,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:08:08,649 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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:08:08,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:08:08,658 INFO L225 Difference]: With dead ends: 1963 [2022-11-19 07:08:08,659 INFO L226 Difference]: Without dead ends: 1475 [2022-11-19 07:08:08,659 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:08:08,661 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 36 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:08:08,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 20 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:08:08,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1475 states. [2022-11-19 07:08:08,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1475 to 1475. [2022-11-19 07:08:08,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1475 states, 1474 states have (on average 3.3059701492537314) internal successors, (4873), 1474 states have internal predecessors, (4873), 0 states have call successors, (0), 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:08:08,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1475 states and 4873 transitions. [2022-11-19 07:08:08,737 INFO L78 Accepts]: Start accepts. Automaton has 1475 states and 4873 transitions. Word has length 14 [2022-11-19 07:08:08,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:08:08,737 INFO L495 AbstractCegarLoop]: Abstraction has 1475 states and 4873 transitions. [2022-11-19 07:08:08,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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:08:08,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1475 states and 4873 transitions. [2022-11-19 07:08:08,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-19 07:08:08,742 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:08:08,742 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:08:08,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-19 07:08:08,743 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 07:08:08,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:08:08,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1144195485, now seen corresponding path program 1 times [2022-11-19 07:08:08,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:08:08,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518975850] [2022-11-19 07:08:08,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:08:08,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:08:08,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:08:08,969 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:08:08,969 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:08:08,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518975850] [2022-11-19 07:08:08,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518975850] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:08:08,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:08:08,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:08:08,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655300973] [2022-11-19 07:08:08,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:08:08,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:08:08,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:08:08,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:08:08,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:08:08,972 INFO L87 Difference]: Start difference. First operand 1475 states and 4873 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:08:09,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:08:09,077 INFO L93 Difference]: Finished difference Result 1944 states and 6262 transitions. [2022-11-19 07:08:09,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:08:09,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-19 07:08:09,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:08:09,087 INFO L225 Difference]: With dead ends: 1944 [2022-11-19 07:08:09,087 INFO L226 Difference]: Without dead ends: 1328 [2022-11-19 07:08:09,087 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:08:09,088 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 9 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:08:09,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 10 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:08:09,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2022-11-19 07:08:09,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 1190. [2022-11-19 07:08:09,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1190 states, 1189 states have (on average 3.1774600504625736) internal successors, (3778), 1189 states have internal predecessors, (3778), 0 states have call successors, (0), 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:08:09,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 1190 states and 3778 transitions. [2022-11-19 07:08:09,161 INFO L78 Accepts]: Start accepts. Automaton has 1190 states and 3778 transitions. Word has length 16 [2022-11-19 07:08:09,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:08:09,161 INFO L495 AbstractCegarLoop]: Abstraction has 1190 states and 3778 transitions. [2022-11-19 07:08:09,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:08:09,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 3778 transitions. [2022-11-19 07:08:09,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-19 07:08:09,165 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:08:09,165 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:08:09,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-19 07:08:09,165 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 07:08:09,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:08:09,166 INFO L85 PathProgramCache]: Analyzing trace with hash 48880175, now seen corresponding path program 1 times [2022-11-19 07:08:09,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:08:09,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260544214] [2022-11-19 07:08:09,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:08:09,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:08:09,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:08:09,435 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:08:09,435 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:08:09,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260544214] [2022-11-19 07:08:09,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260544214] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:08:09,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:08:09,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:08:09,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001202042] [2022-11-19 07:08:09,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:08:09,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:08:09,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:08:09,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:08:09,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:08:09,438 INFO L87 Difference]: Start difference. First operand 1190 states and 3778 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:08:09,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:08:09,615 INFO L93 Difference]: Finished difference Result 1034 states and 2984 transitions. [2022-11-19 07:08:09,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 07:08:09,616 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-19 07:08:09,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:08:09,620 INFO L225 Difference]: With dead ends: 1034 [2022-11-19 07:08:09,620 INFO L226 Difference]: Without dead ends: 785 [2022-11-19 07:08:09,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:08:09,621 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 57 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:08:09,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 28 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:08:09,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2022-11-19 07:08:09,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 785. [2022-11-19 07:08:09,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 785 states, 784 states have (on average 2.8316326530612246) internal successors, (2220), 784 states have internal predecessors, (2220), 0 states have call successors, (0), 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:08:09,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 2220 transitions. [2022-11-19 07:08:09,647 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 2220 transitions. Word has length 16 [2022-11-19 07:08:09,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:08:09,647 INFO L495 AbstractCegarLoop]: Abstraction has 785 states and 2220 transitions. [2022-11-19 07:08:09,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:08:09,647 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 2220 transitions. [2022-11-19 07:08:09,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-19 07:08:09,649 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:08:09,649 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:08:09,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-19 07:08:09,650 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 07:08:09,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:08:09,650 INFO L85 PathProgramCache]: Analyzing trace with hash -2101583854, now seen corresponding path program 1 times [2022-11-19 07:08:09,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:08:09,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145395447] [2022-11-19 07:08:09,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:08:09,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:08:09,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:08:09,913 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:08:09,913 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:08:09,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145395447] [2022-11-19 07:08:09,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145395447] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:08:09,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:08:09,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 07:08:09,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726660064] [2022-11-19 07:08:09,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:08:09,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 07:08:09,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:08:09,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 07:08:09,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:08:09,917 INFO L87 Difference]: Start difference. First operand 785 states and 2220 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:08:10,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:08:10,096 INFO L93 Difference]: Finished difference Result 683 states and 1892 transitions. [2022-11-19 07:08:10,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:08:10,097 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:08:10,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:08:10,100 INFO L225 Difference]: With dead ends: 683 [2022-11-19 07:08:10,101 INFO L226 Difference]: Without dead ends: 596 [2022-11-19 07:08:10,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:08:10,101 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 101 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:08:10,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 31 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:08:10,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2022-11-19 07:08:10,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2022-11-19 07:08:10,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 595 states have (on average 2.8117647058823527) internal successors, (1673), 595 states have internal predecessors, (1673), 0 states have call successors, (0), 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:08:10,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 1673 transitions. [2022-11-19 07:08:10,120 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 1673 transitions. Word has length 19 [2022-11-19 07:08:10,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:08:10,121 INFO L495 AbstractCegarLoop]: Abstraction has 596 states and 1673 transitions. [2022-11-19 07:08:10,121 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:08:10,121 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 1673 transitions. [2022-11-19 07:08:10,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 07:08:10,123 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:08:10,123 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:08:10,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-19 07:08:10,123 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 07:08:10,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:08:10,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1975595506, now seen corresponding path program 1 times [2022-11-19 07:08:10,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:08:10,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636039077] [2022-11-19 07:08:10,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:08:10,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:08:10,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:08:10,488 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:08:10,488 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:08:10,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636039077] [2022-11-19 07:08:10,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636039077] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:08:10,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:08:10,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-19 07:08:10,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054950159] [2022-11-19 07:08:10,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:08:10,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 07:08:10,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:08:10,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 07:08:10,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:08:10,492 INFO L87 Difference]: Start difference. First operand 596 states and 1673 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:08:10,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:08:10,675 INFO L93 Difference]: Finished difference Result 572 states and 1624 transitions. [2022-11-19 07:08:10,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-19 07:08:10,676 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-19 07:08:10,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:08:10,678 INFO L225 Difference]: With dead ends: 572 [2022-11-19 07:08:10,678 INFO L226 Difference]: Without dead ends: 353 [2022-11-19 07:08:10,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-19 07:08:10,679 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 97 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:08:10,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 25 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:08:10,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-11-19 07:08:10,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2022-11-19 07:08:10,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 352 states have (on average 2.747159090909091) internal successors, (967), 352 states have internal predecessors, (967), 0 states have call successors, (0), 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:08:10,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 967 transitions. [2022-11-19 07:08:10,689 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 967 transitions. Word has length 22 [2022-11-19 07:08:10,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:08:10,689 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 967 transitions. [2022-11-19 07:08:10,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:08:10,690 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 967 transitions. [2022-11-19 07:08:10,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-19 07:08:10,691 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:08:10,691 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, 1, 1] [2022-11-19 07:08:10,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-19 07:08:10,691 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 07:08:10,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:08:10,692 INFO L85 PathProgramCache]: Analyzing trace with hash 375723971, now seen corresponding path program 1 times [2022-11-19 07:08:10,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:08:10,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226554358] [2022-11-19 07:08:10,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:08:10,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:08:10,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:08:10,895 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:08:10,895 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:08:10,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226554358] [2022-11-19 07:08:10,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226554358] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:08:10,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:08:10,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:08:10,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805700509] [2022-11-19 07:08:10,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:08:10,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:08:10,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:08:10,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:08:10,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:08:10,897 INFO L87 Difference]: Start difference. First operand 353 states and 967 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:08:10,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:08:10,993 INFO L93 Difference]: Finished difference Result 463 states and 1254 transitions. [2022-11-19 07:08:10,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:08:10,994 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-19 07:08:10,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:08:10,995 INFO L225 Difference]: With dead ends: 463 [2022-11-19 07:08:10,995 INFO L226 Difference]: Without dead ends: 149 [2022-11-19 07:08:10,995 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:08:10,996 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 18 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:08:10,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 12 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:08:10,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-11-19 07:08:11,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2022-11-19 07:08:11,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 148 states have (on average 2.418918918918919) internal successors, (358), 148 states have internal predecessors, (358), 0 states have call successors, (0), 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:08:11,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 358 transitions. [2022-11-19 07:08:11,001 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 358 transitions. Word has length 25 [2022-11-19 07:08:11,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:08:11,001 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 358 transitions. [2022-11-19 07:08:11,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:08:11,001 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 358 transitions. [2022-11-19 07:08:11,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-19 07:08:11,002 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:08:11,002 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, 1, 1] [2022-11-19 07:08:11,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-19 07:08:11,003 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 07:08:11,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:08:11,003 INFO L85 PathProgramCache]: Analyzing trace with hash 225170923, now seen corresponding path program 2 times [2022-11-19 07:08:11,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:08:11,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84631974] [2022-11-19 07:08:11,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:08:11,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:08:11,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:08:11,214 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:08:11,214 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:08:11,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84631974] [2022-11-19 07:08:11,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84631974] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:08:11,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:08:11,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:08:11,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783388260] [2022-11-19 07:08:11,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:08:11,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:08:11,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:08:11,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:08:11,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:08:11,216 INFO L87 Difference]: Start difference. First operand 149 states and 358 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:08:11,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:08:11,364 INFO L93 Difference]: Finished difference Result 199 states and 476 transitions. [2022-11-19 07:08:11,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 07:08:11,364 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-19 07:08:11,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:08:11,365 INFO L225 Difference]: With dead ends: 199 [2022-11-19 07:08:11,365 INFO L226 Difference]: Without dead ends: 80 [2022-11-19 07:08:11,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:08:11,366 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 31 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:08:11,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 12 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:08:11,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-19 07:08:11,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-11-19 07:08:11,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 2.1012658227848102) internal successors, (166), 79 states have internal predecessors, (166), 0 states have call successors, (0), 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:08:11,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 166 transitions. [2022-11-19 07:08:11,370 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 166 transitions. Word has length 25 [2022-11-19 07:08:11,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:08:11,371 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 166 transitions. [2022-11-19 07:08:11,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:08:11,371 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 166 transitions. [2022-11-19 07:08:11,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-19 07:08:11,371 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:08:11,372 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, 1, 1] [2022-11-19 07:08:11,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-19 07:08:11,372 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 07:08:11,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:08:11,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1088203495, now seen corresponding path program 3 times [2022-11-19 07:08:11,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:08:11,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64886560] [2022-11-19 07:08:11,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:08:11,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:08:11,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:08:11,969 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:08:11,969 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:08:11,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64886560] [2022-11-19 07:08:11,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64886560] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:08:11,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:08:11,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:08:11,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698732322] [2022-11-19 07:08:11,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:08:11,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 07:08:11,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:08:11,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 07:08:11,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:08:11,972 INFO L87 Difference]: Start difference. First operand 80 states and 166 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:08:12,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:08:12,164 INFO L93 Difference]: Finished difference Result 98 states and 200 transitions. [2022-11-19 07:08:12,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-19 07:08:12,164 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-19 07:08:12,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:08:12,165 INFO L225 Difference]: With dead ends: 98 [2022-11-19 07:08:12,165 INFO L226 Difference]: Without dead ends: 52 [2022-11-19 07:08:12,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-19 07:08:12,166 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 55 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:08:12,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 12 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:08:12,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-11-19 07:08:12,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-11-19 07:08:12,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.7647058823529411) internal successors, (90), 51 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:08:12,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 90 transitions. [2022-11-19 07:08:12,168 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 90 transitions. Word has length 25 [2022-11-19 07:08:12,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:08:12,168 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 90 transitions. [2022-11-19 07:08:12,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:08:12,169 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 90 transitions. [2022-11-19 07:08:12,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-19 07:08:12,169 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:08:12,169 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, 1, 1] [2022-11-19 07:08:12,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-19 07:08:12,169 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 07:08:12,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:08:12,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1071646353, now seen corresponding path program 4 times [2022-11-19 07:08:12,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:08:12,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923320664] [2022-11-19 07:08:12,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:08:12,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:08:12,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 07:08:12,210 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-19 07:08:12,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 07:08:12,310 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-19 07:08:12,311 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-19 07:08:12,312 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-11-19 07:08:12,314 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-19 07:08:12,314 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-11-19 07:08:12,314 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-11-19 07:08:12,315 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-11-19 07:08:12,315 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-11-19 07:08:12,315 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-19 07:08:12,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-19 07:08:12,318 INFO L444 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:08:12,324 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-19 07:08:12,324 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-19 07:08:12,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:08:12 BasicIcfg [2022-11-19 07:08:12,402 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-19 07:08:12,402 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-19 07:08:12,402 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-19 07:08:12,402 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-19 07:08:12,403 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:07:59" (3/4) ... [2022-11-19 07:08:12,405 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-19 07:08:12,510 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27207752-e2c9-4e40-9ecf-aeb5a4f8220c/bin/utaipan-I9t0OCRTmS/witness.graphml [2022-11-19 07:08:12,511 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-19 07:08:12,512 INFO L158 Benchmark]: Toolchain (without parser) took 15118.76ms. Allocated memory was 119.5MB in the beginning and 237.0MB in the end (delta: 117.4MB). Free memory was 79.5MB in the beginning and 125.2MB in the end (delta: -45.7MB). Peak memory consumption was 71.6MB. Max. memory is 16.1GB. [2022-11-19 07:08:12,512 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 119.5MB. Free memory is still 97.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:08:12,512 INFO L158 Benchmark]: CACSL2BoogieTranslator took 751.40ms. Allocated memory is still 119.5MB. Free memory was 79.3MB in the beginning and 81.2MB in the end (delta: -1.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-19 07:08:12,513 INFO L158 Benchmark]: Boogie Procedure Inliner took 100.24ms. Allocated memory is still 119.5MB. Free memory was 81.2MB in the beginning and 78.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 07:08:12,513 INFO L158 Benchmark]: Boogie Preprocessor took 55.90ms. Allocated memory is still 119.5MB. Free memory was 78.6MB in the beginning and 76.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 07:08:12,514 INFO L158 Benchmark]: RCFGBuilder took 1096.50ms. Allocated memory was 119.5MB in the beginning and 157.3MB in the end (delta: 37.7MB). Free memory was 76.4MB in the beginning and 130.7MB in the end (delta: -54.3MB). Peak memory consumption was 38.0MB. Max. memory is 16.1GB. [2022-11-19 07:08:12,515 INFO L158 Benchmark]: TraceAbstraction took 12997.14ms. Allocated memory was 157.3MB in the beginning and 237.0MB in the end (delta: 79.7MB). Free memory was 130.7MB in the beginning and 141.0MB in the end (delta: -10.3MB). Peak memory consumption was 69.4MB. Max. memory is 16.1GB. [2022-11-19 07:08:12,515 INFO L158 Benchmark]: Witness Printer took 109.02ms. Allocated memory is still 237.0MB. Free memory was 141.0MB in the beginning and 125.2MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-19 07:08:12,519 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.33ms. Allocated memory is still 119.5MB. Free memory is still 97.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 751.40ms. Allocated memory is still 119.5MB. Free memory was 79.3MB in the beginning and 81.2MB in the end (delta: -1.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 100.24ms. Allocated memory is still 119.5MB. Free memory was 81.2MB in the beginning and 78.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.90ms. Allocated memory is still 119.5MB. Free memory was 78.6MB in the beginning and 76.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1096.50ms. Allocated memory was 119.5MB in the beginning and 157.3MB in the end (delta: 37.7MB). Free memory was 76.4MB in the beginning and 130.7MB in the end (delta: -54.3MB). Peak memory consumption was 38.0MB. Max. memory is 16.1GB. * TraceAbstraction took 12997.14ms. Allocated memory was 157.3MB in the beginning and 237.0MB in the end (delta: 79.7MB). Free memory was 130.7MB in the beginning and 141.0MB in the end (delta: -10.3MB). Peak memory consumption was 69.4MB. Max. memory is 16.1GB. * Witness Printer took 109.02ms. Allocated memory is still 237.0MB. Free memory was 141.0MB in the beginning and 125.2MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.3s, 148 PlacesBefore, 44 PlacesAfterwards, 137 TransitionsBefore, 32 TransitionsAfterwards, 3040 CoEnabledTransitionPairs, 7 FixpointIterations, 47 TrivialSequentialCompositions, 61 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 1 ChoiceCompositions, 121 TotalNumberOfCompositions, 7120 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4152, independent: 3962, independent conditional: 0, independent unconditional: 3962, dependent: 190, dependent conditional: 0, dependent unconditional: 190, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2252, independent: 2185, independent conditional: 0, independent unconditional: 2185, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2252, independent: 2154, independent conditional: 0, independent unconditional: 2154, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 98, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 439, independent: 60, independent conditional: 0, independent unconditional: 60, dependent: 378, dependent conditional: 0, dependent unconditional: 378, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4152, independent: 1777, independent conditional: 0, independent unconditional: 1777, dependent: 123, dependent conditional: 0, dependent unconditional: 123, unknown: 2252, unknown conditional: 0, unknown unconditional: 2252] , Statistics on independence cache: Total cache size (in pairs): 234, Positive cache size: 207, Positive conditional cache size: 0, Positive unconditional cache size: 207, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, 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 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L742] 0 _Bool z$r_buff1_thd4; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L749] 0 _Bool weak$$choice0; [L747] 0 int z$w_buff1; [L750] 0 _Bool weak$$choice2; [L731] 0 _Bool z$flush_delayed; [L745] 0 int z$w_buff0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L712] 0 int __unbuffered_p1_EAX = 0; [L733] 0 _Bool z$r_buff0_thd0; [L718] 0 int __unbuffered_p3_EBX = 0; [L736] 0 _Bool z$r_buff0_thd3; [L732] 0 int z$mem_tmp; [L737] 0 _Bool z$r_buff0_thd4; [L743] 0 _Bool z$read_delayed; [L720] 0 int a = 0; [L722] 0 int b = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L744] 0 int *z$read_delayed_var; [L748] 0 _Bool z$w_buff1_used; [L710] 0 int __unbuffered_cnt = 0; [L724] 0 _Bool main$tmp_guard1; [L723] 0 _Bool main$tmp_guard0; [L746] 0 _Bool z$w_buff0_used; [L716] 0 int __unbuffered_p3_EAX = 0; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L856] 0 pthread_t t973; [L857] FCALL, FORK 0 pthread_create(&t973, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t973, ((void *)0), P0, ((void *)0))=0, t973={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 pthread_t t974; [L859] FCALL, FORK 0 pthread_create(&t974, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t974, ((void *)0), P1, ((void *)0))=1, t973={6:0}, t974={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] 0 pthread_t t975; [L861] FCALL, FORK 0 pthread_create(&t975, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t975, ((void *)0), P2, ((void *)0))=2, t973={6:0}, t974={7:0}, t975={8:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L862] 0 pthread_t t976; [L863] FCALL, FORK 0 pthread_create(&t976, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t976, ((void *)0), P3, ((void *)0))=3, t973={6:0}, t974={7:0}, t975={8:0}, t976={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] 4 z$w_buff1 = z$w_buff0 [L813] 4 z$w_buff0 = 1 [L814] 4 z$w_buff1_used = z$w_buff0_used [L815] 4 z$w_buff0_used = (_Bool)1 [L816] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L816] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L817] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L818] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L819] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L820] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L821] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L822] 4 z$r_buff0_thd4 = (_Bool)1 [L825] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L828] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L831] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L772] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L784] 3 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L788] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L789] 3 z$flush_delayed = weak$$choice2 [L790] 3 z$mem_tmp = z [L791] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L792] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L793] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L794] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L795] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L797] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 __unbuffered_p2_EAX = z [L799] 3 z = z$flush_delayed ? z$mem_tmp : z [L800] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L834] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L835] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L836] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L837] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L838] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L843] 4 return 0; [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 3 return 0; [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L870] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L871] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L872] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L873] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t973={6:0}, t974={7:0}, t975={8:0}, t976={5:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L876] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 857]: 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: 863]: 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: 859]: 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: 861]: 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 9 procedures, 172 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 12.7s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 449 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 449 mSDsluCounter, 175 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 104 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 907 IncrementalHoareTripleChecker+Invalid, 952 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 71 mSDtfsCounter, 907 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2090occurred in iteration=0, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 234 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 219 NumberOfCodeBlocks, 219 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 183 ConstructedInterpolants, 0 QuantifiedInterpolants, 913 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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 proved your program to be incorrect! [2022-11-19 07:08:12,552 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27207752-e2c9-4e40-9ecf-aeb5a4f8220c/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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE