./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b 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_84a0b13e-bfe3-4649-a760-e70bf3d6b16e/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84a0b13e-bfe3-4649-a760-e70bf3d6b16e/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84a0b13e-bfe3-4649-a760-e70bf3d6b16e/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84a0b13e-bfe3-4649-a760-e70bf3d6b16e/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84a0b13e-bfe3-4649-a760-e70bf3d6b16e/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84a0b13e-bfe3-4649-a760-e70bf3d6b16e/bin/uautomizer-ug76WZFUDN --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 76dbb78f4fe406633111c7d7e2c1e8bd933a1f67e6e1cf5d4cbd1b0379bfe086 --- 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-6b4ec56 [2022-11-20 12:12:26,272 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 12:12:26,275 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 12:12:26,314 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 12:12:26,318 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 12:12:26,323 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 12:12:26,325 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 12:12:26,329 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 12:12:26,331 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 12:12:26,338 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 12:12:26,340 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 12:12:26,343 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 12:12:26,344 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 12:12:26,346 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 12:12:26,349 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 12:12:26,351 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 12:12:26,353 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 12:12:26,355 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 12:12:26,356 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 12:12:26,363 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 12:12:26,366 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 12:12:26,369 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 12:12:26,372 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 12:12:26,373 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 12:12:26,379 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 12:12:26,382 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 12:12:26,383 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 12:12:26,384 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 12:12:26,386 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 12:12:26,388 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 12:12:26,390 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 12:12:26,391 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 12:12:26,393 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 12:12:26,394 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 12:12:26,395 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 12:12:26,396 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 12:12:26,397 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 12:12:26,397 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 12:12:26,397 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 12:12:26,398 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 12:12:26,399 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 12:12:26,400 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84a0b13e-bfe3-4649-a760-e70bf3d6b16e/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 12:12:26,442 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 12:12:26,442 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 12:12:26,443 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 12:12:26,444 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 12:12:26,445 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 12:12:26,445 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 12:12:26,446 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 12:12:26,446 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 12:12:26,447 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 12:12:26,447 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 12:12:26,449 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 12:12:26,449 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 12:12:26,449 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 12:12:26,450 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 12:12:26,450 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 12:12:26,450 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 12:12:26,451 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 12:12:26,451 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 12:12:26,451 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 12:12:26,452 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 12:12:26,452 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 12:12:26,452 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 12:12:26,453 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 12:12:26,453 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 12:12:26,453 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:12:26,454 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 12:12:26,454 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 12:12:26,454 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 12:12:26,455 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 12:12:26,456 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 12:12:26,456 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 12:12:26,457 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 12:12:26,457 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 12:12:26,458 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_84a0b13e-bfe3-4649-a760-e70bf3d6b16e/bin/uautomizer-ug76WZFUDN/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_84a0b13e-bfe3-4649-a760-e70bf3d6b16e/bin/uautomizer-ug76WZFUDN 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 -> Automizer 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 -> 76dbb78f4fe406633111c7d7e2c1e8bd933a1f67e6e1cf5d4cbd1b0379bfe086 [2022-11-20 12:12:26,827 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 12:12:26,859 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 12:12:26,862 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 12:12:26,863 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 12:12:26,864 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 12:12:26,865 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84a0b13e-bfe3-4649-a760-e70bf3d6b16e/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2022-11-20 12:12:30,020 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 12:12:30,329 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 12:12:30,329 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84a0b13e-bfe3-4649-a760-e70bf3d6b16e/sv-benchmarks/c/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2022-11-20 12:12:30,352 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84a0b13e-bfe3-4649-a760-e70bf3d6b16e/bin/uautomizer-ug76WZFUDN/data/e9f2760c3/0fc151f8745342bea1953edc708c7700/FLAG7ccbf0be6 [2022-11-20 12:12:30,367 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84a0b13e-bfe3-4649-a760-e70bf3d6b16e/bin/uautomizer-ug76WZFUDN/data/e9f2760c3/0fc151f8745342bea1953edc708c7700 [2022-11-20 12:12:30,370 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 12:12:30,371 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 12:12:30,373 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 12:12:30,373 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 12:12:30,376 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 12:12:30,377 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:12:30" (1/1) ... [2022-11-20 12:12:30,378 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ceb44a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:12:30, skipping insertion in model container [2022-11-20 12:12:30,379 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:12:30" (1/1) ... [2022-11-20 12:12:30,387 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 12:12:30,435 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 12:12:30,676 WARN L237 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_84a0b13e-bfe3-4649-a760-e70bf3d6b16e/sv-benchmarks/c/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i[979,992] [2022-11-20 12:12:31,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:12:31,041 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 12:12:31,055 WARN L237 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_84a0b13e-bfe3-4649-a760-e70bf3d6b16e/sv-benchmarks/c/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i[979,992] [2022-11-20 12:12:31,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:12:31,193 INFO L208 MainTranslator]: Completed translation [2022-11-20 12:12:31,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:12:31 WrapperNode [2022-11-20 12:12:31,194 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 12:12:31,195 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 12:12:31,196 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 12:12:31,196 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 12:12:31,204 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:12:31" (1/1) ... [2022-11-20 12:12:31,241 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:12:31" (1/1) ... [2022-11-20 12:12:31,275 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2022-11-20 12:12:31,276 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 12:12:31,277 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 12:12:31,277 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 12:12:31,277 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 12:12:31,287 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:12:31" (1/1) ... [2022-11-20 12:12:31,288 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:12:31" (1/1) ... [2022-11-20 12:12:31,302 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:12:31" (1/1) ... [2022-11-20 12:12:31,306 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:12:31" (1/1) ... [2022-11-20 12:12:31,315 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:12:31" (1/1) ... [2022-11-20 12:12:31,335 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:12:31" (1/1) ... [2022-11-20 12:12:31,338 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:12:31" (1/1) ... [2022-11-20 12:12:31,339 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:12:31" (1/1) ... [2022-11-20 12:12:31,342 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 12:12:31,347 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 12:12:31,347 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 12:12:31,347 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 12:12:31,348 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:12:31" (1/1) ... [2022-11-20 12:12:31,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:12:31,376 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84a0b13e-bfe3-4649-a760-e70bf3d6b16e/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:12:31,394 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84a0b13e-bfe3-4649-a760-e70bf3d6b16e/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 12:12:31,423 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84a0b13e-bfe3-4649-a760-e70bf3d6b16e/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 12:12:31,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 12:12:31,446 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 12:12:31,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 12:12:31,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 12:12:31,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 12:12:31,446 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-20 12:12:31,446 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-20 12:12:31,447 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-20 12:12:31,447 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-20 12:12:31,448 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-20 12:12:31,448 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-20 12:12:31,448 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-20 12:12:31,448 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-20 12:12:31,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 12:12:31,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 12:12:31,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 12:12:31,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 12:12:31,452 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 12:12:31,657 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 12:12:31,659 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 12:12:32,122 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 12:12:32,327 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 12:12:32,327 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 12:12:32,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:12:32 BoogieIcfgContainer [2022-11-20 12:12:32,330 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 12:12:32,336 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 12:12:32,337 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 12:12:32,340 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 12:12:32,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:12:30" (1/3) ... [2022-11-20 12:12:32,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24df8915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:12:32, skipping insertion in model container [2022-11-20 12:12:32,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:12:31" (2/3) ... [2022-11-20 12:12:32,343 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24df8915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:12:32, skipping insertion in model container [2022-11-20 12:12:32,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:12:32" (3/3) ... [2022-11-20 12:12:32,344 INFO L112 eAbstractionObserver]: Analyzing ICFG mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2022-11-20 12:12:32,351 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 12:12:32,360 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 12:12:32,361 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-20 12:12:32,361 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 12:12:32,451 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-20 12:12:32,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 136 transitions, 292 flow [2022-11-20 12:12:32,601 INFO L130 PetriNetUnfolder]: 2/132 cut-off events. [2022-11-20 12:12:32,601 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 12:12:32,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 132 events. 2/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2022-11-20 12:12:32,608 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 136 transitions, 292 flow [2022-11-20 12:12:32,614 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 143 places, 132 transitions, 276 flow [2022-11-20 12:12:32,640 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 12:12:32,647 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=PETRI_NET, 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;@a1b5999, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 12:12:32,647 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-20 12:12:32,658 INFO L130 PetriNetUnfolder]: 0/50 cut-off events. [2022-11-20 12:12:32,658 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 12:12:32,658 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:12:32,659 INFO L209 CegarLoopForPetriNet]: 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, 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-20 12:12:32,659 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-20 12:12:32,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:12:32,665 INFO L85 PathProgramCache]: Analyzing trace with hash 287061904, now seen corresponding path program 1 times [2022-11-20 12:12:32,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:12:32,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735699893] [2022-11-20 12:12:32,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:32,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:12:32,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:33,244 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-20 12:12:33,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:12:33,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735699893] [2022-11-20 12:12:33,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735699893] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:12:33,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:12:33,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:12:33,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217474667] [2022-11-20 12:12:33,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:12:33,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:12:33,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:12:33,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:12:33,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:12:33,291 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 136 [2022-11-20 12:12:33,294 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 132 transitions, 276 flow. Second operand has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 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-20 12:12:33,295 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:12:33,295 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 136 [2022-11-20 12:12:33,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:12:33,581 INFO L130 PetriNetUnfolder]: 162/546 cut-off events. [2022-11-20 12:12:33,582 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-11-20 12:12:33,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 852 conditions, 546 events. 162/546 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2863 event pairs, 34 based on Foata normal form. 45/560 useless extension candidates. Maximal degree in co-relation 795. Up to 191 conditions per place. [2022-11-20 12:12:33,591 INFO L137 encePairwiseOnDemand]: 131/136 looper letters, 18 selfloop transitions, 2 changer transitions 0/136 dead transitions. [2022-11-20 12:12:33,591 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 136 transitions, 333 flow [2022-11-20 12:12:33,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:12:33,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:12:33,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 385 transitions. [2022-11-20 12:12:33,606 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9436274509803921 [2022-11-20 12:12:33,607 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 385 transitions. [2022-11-20 12:12:33,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 385 transitions. [2022-11-20 12:12:33,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:12:33,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 385 transitions. [2022-11-20 12:12:33,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 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-20 12:12:33,623 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 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-20 12:12:33,623 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 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-20 12:12:33,625 INFO L175 Difference]: Start difference. First operand has 143 places, 132 transitions, 276 flow. Second operand 3 states and 385 transitions. [2022-11-20 12:12:33,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 136 transitions, 333 flow [2022-11-20 12:12:33,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 136 transitions, 326 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-20 12:12:33,634 INFO L231 Difference]: Finished difference. Result has 139 places, 128 transitions, 268 flow [2022-11-20 12:12:33,636 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=268, PETRI_PLACES=139, PETRI_TRANSITIONS=128} [2022-11-20 12:12:33,640 INFO L288 CegarLoopForPetriNet]: 143 programPoint places, -4 predicate places. [2022-11-20 12:12:33,640 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 128 transitions, 268 flow [2022-11-20 12:12:33,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 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-20 12:12:33,641 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:12:33,641 INFO L209 CegarLoopForPetriNet]: 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:12:33,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 12:12:33,642 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-20 12:12:33,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:12:33,643 INFO L85 PathProgramCache]: Analyzing trace with hash 2040346038, now seen corresponding path program 1 times [2022-11-20 12:12:33,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:12:33,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553166488] [2022-11-20 12:12:33,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:33,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:12:33,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:34,215 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-20 12:12:34,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:12:34,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553166488] [2022-11-20 12:12:34,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553166488] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:12:34,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:12:34,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 12:12:34,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372137259] [2022-11-20 12:12:34,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:12:34,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:12:34,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:12:34,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:12:34,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:12:34,220 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 136 [2022-11-20 12:12:34,221 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 128 transitions, 268 flow. Second operand has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 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-20 12:12:34,221 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:12:34,221 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 136 [2022-11-20 12:12:34,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:12:35,941 INFO L130 PetriNetUnfolder]: 2125/5419 cut-off events. [2022-11-20 12:12:35,941 INFO L131 PetriNetUnfolder]: For 208/208 co-relation queries the response was YES. [2022-11-20 12:12:35,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8744 conditions, 5419 events. 2125/5419 cut-off events. For 208/208 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 47865 event pairs, 1020 based on Foata normal form. 0/5256 useless extension candidates. Maximal degree in co-relation 8688. Up to 1734 conditions per place. [2022-11-20 12:12:35,988 INFO L137 encePairwiseOnDemand]: 129/136 looper letters, 27 selfloop transitions, 3 changer transitions 65/189 dead transitions. [2022-11-20 12:12:35,988 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 189 transitions, 574 flow [2022-11-20 12:12:35,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 12:12:35,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-20 12:12:35,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1083 transitions. [2022-11-20 12:12:35,993 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8848039215686274 [2022-11-20 12:12:35,994 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1083 transitions. [2022-11-20 12:12:35,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1083 transitions. [2022-11-20 12:12:35,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:12:35,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1083 transitions. [2022-11-20 12:12:35,999 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 120.33333333333333) internal successors, (1083), 9 states have internal predecessors, (1083), 0 states have call successors, (0), 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-20 12:12:36,003 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 0 states have call successors, (0), 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-20 12:12:36,004 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 0 states have call successors, (0), 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-20 12:12:36,004 INFO L175 Difference]: Start difference. First operand has 139 places, 128 transitions, 268 flow. Second operand 9 states and 1083 transitions. [2022-11-20 12:12:36,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 189 transitions, 574 flow [2022-11-20 12:12:36,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 189 transitions, 556 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 12:12:36,010 INFO L231 Difference]: Finished difference. Result has 152 places, 116 transitions, 279 flow [2022-11-20 12:12:36,010 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=279, PETRI_PLACES=152, PETRI_TRANSITIONS=116} [2022-11-20 12:12:36,011 INFO L288 CegarLoopForPetriNet]: 143 programPoint places, 9 predicate places. [2022-11-20 12:12:36,012 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 116 transitions, 279 flow [2022-11-20 12:12:36,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 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-20 12:12:36,013 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:12:36,013 INFO L209 CegarLoopForPetriNet]: 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:12:36,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 12:12:36,013 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-20 12:12:36,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:12:36,014 INFO L85 PathProgramCache]: Analyzing trace with hash 896001269, now seen corresponding path program 1 times [2022-11-20 12:12:36,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:12:36,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158304275] [2022-11-20 12:12:36,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:36,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:12:36,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:36,328 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-20 12:12:36,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:12:36,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158304275] [2022-11-20 12:12:36,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158304275] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:12:36,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:12:36,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 12:12:36,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11137771] [2022-11-20 12:12:36,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:12:36,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:12:36,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:12:36,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:12:36,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:12:36,333 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 136 [2022-11-20 12:12:36,334 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 116 transitions, 279 flow. Second operand has 6 states, 6 states have (on average 111.0) internal successors, (666), 6 states have internal predecessors, (666), 0 states have call successors, (0), 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-20 12:12:36,334 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:12:36,334 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 136 [2022-11-20 12:12:36,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:12:38,638 INFO L130 PetriNetUnfolder]: 4967/9068 cut-off events. [2022-11-20 12:12:38,639 INFO L131 PetriNetUnfolder]: For 1699/1699 co-relation queries the response was YES. [2022-11-20 12:12:38,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17849 conditions, 9068 events. 4967/9068 cut-off events. For 1699/1699 co-relation queries the response was YES. Maximal size of possible extension queue 610. Compared 72960 event pairs, 309 based on Foata normal form. 0/8770 useless extension candidates. Maximal degree in co-relation 17786. Up to 2617 conditions per place. [2022-11-20 12:12:38,719 INFO L137 encePairwiseOnDemand]: 125/136 looper letters, 47 selfloop transitions, 8 changer transitions 50/198 dead transitions. [2022-11-20 12:12:38,719 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 198 transitions, 659 flow [2022-11-20 12:12:38,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 12:12:38,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-20 12:12:38,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1197 transitions. [2022-11-20 12:12:38,724 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8801470588235294 [2022-11-20 12:12:38,724 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1197 transitions. [2022-11-20 12:12:38,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1197 transitions. [2022-11-20 12:12:38,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:12:38,726 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1197 transitions. [2022-11-20 12:12:38,730 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 119.7) internal successors, (1197), 10 states have internal predecessors, (1197), 0 states have call successors, (0), 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-20 12:12:38,733 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 136.0) internal successors, (1496), 11 states have internal predecessors, (1496), 0 states have call successors, (0), 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-20 12:12:38,735 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 136.0) internal successors, (1496), 11 states have internal predecessors, (1496), 0 states have call successors, (0), 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-20 12:12:38,735 INFO L175 Difference]: Start difference. First operand has 152 places, 116 transitions, 279 flow. Second operand 10 states and 1197 transitions. [2022-11-20 12:12:38,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 198 transitions, 659 flow [2022-11-20 12:12:38,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 198 transitions, 650 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-11-20 12:12:38,769 INFO L231 Difference]: Finished difference. Result has 143 places, 121 transitions, 344 flow [2022-11-20 12:12:38,770 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=344, PETRI_PLACES=143, PETRI_TRANSITIONS=121} [2022-11-20 12:12:38,771 INFO L288 CegarLoopForPetriNet]: 143 programPoint places, 0 predicate places. [2022-11-20 12:12:38,771 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 121 transitions, 344 flow [2022-11-20 12:12:38,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.0) internal successors, (666), 6 states have internal predecessors, (666), 0 states have call successors, (0), 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-20 12:12:38,772 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:12:38,772 INFO L209 CegarLoopForPetriNet]: 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:12:38,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 12:12:38,773 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-20 12:12:38,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:12:38,774 INFO L85 PathProgramCache]: Analyzing trace with hash -30629779, now seen corresponding path program 1 times [2022-11-20 12:12:38,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:12:38,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709839161] [2022-11-20 12:12:38,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:38,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:12:38,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:39,116 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-20 12:12:39,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:12:39,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709839161] [2022-11-20 12:12:39,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709839161] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:12:39,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:12:39,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 12:12:39,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253131163] [2022-11-20 12:12:39,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:12:39,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:12:39,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:12:39,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:12:39,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:12:39,127 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 136 [2022-11-20 12:12:39,129 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 121 transitions, 344 flow. Second operand has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 0 states have call successors, (0), 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-20 12:12:39,129 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:12:39,130 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 136 [2022-11-20 12:12:39,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:12:41,386 INFO L130 PetriNetUnfolder]: 3330/7970 cut-off events. [2022-11-20 12:12:41,386 INFO L131 PetriNetUnfolder]: For 5694/6170 co-relation queries the response was YES. [2022-11-20 12:12:41,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19240 conditions, 7970 events. 3330/7970 cut-off events. For 5694/6170 co-relation queries the response was YES. Maximal size of possible extension queue 540. Compared 78994 event pairs, 1300 based on Foata normal form. 156/7711 useless extension candidates. Maximal degree in co-relation 19172. Up to 1638 conditions per place. [2022-11-20 12:12:41,495 INFO L137 encePairwiseOnDemand]: 130/136 looper letters, 64 selfloop transitions, 11 changer transitions 0/174 dead transitions. [2022-11-20 12:12:41,495 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 174 transitions, 646 flow [2022-11-20 12:12:41,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 12:12:41,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-20 12:12:41,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1075 transitions. [2022-11-20 12:12:41,500 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8782679738562091 [2022-11-20 12:12:41,501 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1075 transitions. [2022-11-20 12:12:41,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1075 transitions. [2022-11-20 12:12:41,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:12:41,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1075 transitions. [2022-11-20 12:12:41,511 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 119.44444444444444) internal successors, (1075), 9 states have internal predecessors, (1075), 0 states have call successors, (0), 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-20 12:12:41,515 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 0 states have call successors, (0), 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-20 12:12:41,518 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 0 states have call successors, (0), 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-20 12:12:41,519 INFO L175 Difference]: Start difference. First operand has 143 places, 121 transitions, 344 flow. Second operand 9 states and 1075 transitions. [2022-11-20 12:12:41,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 174 transitions, 646 flow [2022-11-20 12:12:41,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 174 transitions, 629 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-11-20 12:12:41,557 INFO L231 Difference]: Finished difference. Result has 150 places, 129 transitions, 432 flow [2022-11-20 12:12:41,563 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=432, PETRI_PLACES=150, PETRI_TRANSITIONS=129} [2022-11-20 12:12:41,565 INFO L288 CegarLoopForPetriNet]: 143 programPoint places, 7 predicate places. [2022-11-20 12:12:41,565 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 129 transitions, 432 flow [2022-11-20 12:12:41,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 0 states have call successors, (0), 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-20 12:12:41,566 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:12:41,567 INFO L209 CegarLoopForPetriNet]: 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:12:41,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 12:12:41,567 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-20 12:12:41,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:12:41,569 INFO L85 PathProgramCache]: Analyzing trace with hash -543431771, now seen corresponding path program 1 times [2022-11-20 12:12:41,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:12:41,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043424363] [2022-11-20 12:12:41,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:41,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:12:41,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:42,089 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-20 12:12:42,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:12:42,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043424363] [2022-11-20 12:12:42,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043424363] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:12:42,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:12:42,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:12:42,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237047856] [2022-11-20 12:12:42,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:12:42,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:12:42,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:12:42,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:12:42,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:12:42,095 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 136 [2022-11-20 12:12:42,097 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 129 transitions, 432 flow. Second operand has 7 states, 7 states have (on average 111.0) internal successors, (777), 7 states have internal predecessors, (777), 0 states have call successors, (0), 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-20 12:12:42,097 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:12:42,097 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 136 [2022-11-20 12:12:42,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:12:44,472 INFO L130 PetriNetUnfolder]: 4490/8933 cut-off events. [2022-11-20 12:12:44,473 INFO L131 PetriNetUnfolder]: For 10334/10376 co-relation queries the response was YES. [2022-11-20 12:12:44,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24942 conditions, 8933 events. 4490/8933 cut-off events. For 10334/10376 co-relation queries the response was YES. Maximal size of possible extension queue 600. Compared 76379 event pairs, 401 based on Foata normal form. 186/8947 useless extension candidates. Maximal degree in co-relation 24870. Up to 2435 conditions per place. [2022-11-20 12:12:44,530 INFO L137 encePairwiseOnDemand]: 125/136 looper letters, 46 selfloop transitions, 11 changer transitions 61/219 dead transitions. [2022-11-20 12:12:44,530 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 219 transitions, 1042 flow [2022-11-20 12:12:44,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 12:12:44,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-20 12:12:44,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1319 transitions. [2022-11-20 12:12:44,535 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8816844919786097 [2022-11-20 12:12:44,535 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1319 transitions. [2022-11-20 12:12:44,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1319 transitions. [2022-11-20 12:12:44,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:12:44,536 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1319 transitions. [2022-11-20 12:12:44,539 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 119.9090909090909) internal successors, (1319), 11 states have internal predecessors, (1319), 0 states have call successors, (0), 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-20 12:12:44,542 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 136.0) internal successors, (1632), 12 states have internal predecessors, (1632), 0 states have call successors, (0), 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-20 12:12:44,543 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 136.0) internal successors, (1632), 12 states have internal predecessors, (1632), 0 states have call successors, (0), 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-20 12:12:44,543 INFO L175 Difference]: Start difference. First operand has 150 places, 129 transitions, 432 flow. Second operand 11 states and 1319 transitions. [2022-11-20 12:12:44,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 219 transitions, 1042 flow [2022-11-20 12:12:44,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 219 transitions, 1009 flow, removed 15 selfloop flow, removed 1 redundant places. [2022-11-20 12:12:44,585 INFO L231 Difference]: Finished difference. Result has 165 places, 131 transitions, 495 flow [2022-11-20 12:12:44,586 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=495, PETRI_PLACES=165, PETRI_TRANSITIONS=131} [2022-11-20 12:12:44,589 INFO L288 CegarLoopForPetriNet]: 143 programPoint places, 22 predicate places. [2022-11-20 12:12:44,590 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 131 transitions, 495 flow [2022-11-20 12:12:44,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.0) internal successors, (777), 7 states have internal predecessors, (777), 0 states have call successors, (0), 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-20 12:12:44,591 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:12:44,591 INFO L209 CegarLoopForPetriNet]: 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:12:44,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 12:12:44,591 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-20 12:12:44,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:12:44,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1002248122, now seen corresponding path program 1 times [2022-11-20 12:12:44,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:12:44,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590331729] [2022-11-20 12:12:44,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:44,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:12:44,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:45,072 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-20 12:12:45,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:12:45,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590331729] [2022-11-20 12:12:45,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590331729] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:12:45,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:12:45,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 12:12:45,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503037650] [2022-11-20 12:12:45,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:12:45,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 12:12:45,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:12:45,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 12:12:45,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:12:45,079 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 136 [2022-11-20 12:12:45,080 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 131 transitions, 495 flow. Second operand has 8 states, 8 states have (on average 111.125) internal successors, (889), 8 states have internal predecessors, (889), 0 states have call successors, (0), 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-20 12:12:45,080 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:12:45,080 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 136 [2022-11-20 12:12:45,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:12:46,247 INFO L130 PetriNetUnfolder]: 1318/3086 cut-off events. [2022-11-20 12:12:46,247 INFO L131 PetriNetUnfolder]: For 8640/8665 co-relation queries the response was YES. [2022-11-20 12:12:46,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10296 conditions, 3086 events. 1318/3086 cut-off events. For 8640/8665 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 23803 event pairs, 123 based on Foata normal form. 87/3114 useless extension candidates. Maximal degree in co-relation 10216. Up to 790 conditions per place. [2022-11-20 12:12:46,266 INFO L137 encePairwiseOnDemand]: 126/136 looper letters, 53 selfloop transitions, 15 changer transitions 55/216 dead transitions. [2022-11-20 12:12:46,266 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 216 transitions, 1228 flow [2022-11-20 12:12:46,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 12:12:46,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-20 12:12:46,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1316 transitions. [2022-11-20 12:12:46,271 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8796791443850267 [2022-11-20 12:12:46,271 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1316 transitions. [2022-11-20 12:12:46,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1316 transitions. [2022-11-20 12:12:46,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:12:46,272 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1316 transitions. [2022-11-20 12:12:46,275 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 119.63636363636364) internal successors, (1316), 11 states have internal predecessors, (1316), 0 states have call successors, (0), 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-20 12:12:46,278 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 136.0) internal successors, (1632), 12 states have internal predecessors, (1632), 0 states have call successors, (0), 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-20 12:12:46,280 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 136.0) internal successors, (1632), 12 states have internal predecessors, (1632), 0 states have call successors, (0), 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-20 12:12:46,280 INFO L175 Difference]: Start difference. First operand has 165 places, 131 transitions, 495 flow. Second operand 11 states and 1316 transitions. [2022-11-20 12:12:46,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 216 transitions, 1228 flow [2022-11-20 12:12:46,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 216 transitions, 1032 flow, removed 84 selfloop flow, removed 10 redundant places. [2022-11-20 12:12:46,342 INFO L231 Difference]: Finished difference. Result has 164 places, 127 transitions, 486 flow [2022-11-20 12:12:46,343 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=486, PETRI_PLACES=164, PETRI_TRANSITIONS=127} [2022-11-20 12:12:46,345 INFO L288 CegarLoopForPetriNet]: 143 programPoint places, 21 predicate places. [2022-11-20 12:12:46,345 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 127 transitions, 486 flow [2022-11-20 12:12:46,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 111.125) internal successors, (889), 8 states have internal predecessors, (889), 0 states have call successors, (0), 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-20 12:12:46,346 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:12:46,347 INFO L209 CegarLoopForPetriNet]: 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, 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, 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, 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-20 12:12:46,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 12:12:46,347 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-20 12:12:46,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:12:46,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1280676914, now seen corresponding path program 1 times [2022-11-20 12:12:46,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:12:46,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614054998] [2022-11-20 12:12:46,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:46,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:12:46,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:46,781 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-20 12:12:46,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:12:46,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614054998] [2022-11-20 12:12:46,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614054998] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:12:46,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:12:46,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:12:46,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94307028] [2022-11-20 12:12:46,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:12:46,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:12:46,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:12:46,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:12:46,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:12:46,792 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 136 [2022-11-20 12:12:46,793 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 127 transitions, 486 flow. Second operand has 7 states, 7 states have (on average 107.57142857142857) internal successors, (753), 7 states have internal predecessors, (753), 0 states have call successors, (0), 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-20 12:12:46,794 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:12:46,794 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 136 [2022-11-20 12:12:46,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:12:48,093 INFO L130 PetriNetUnfolder]: 1513/4328 cut-off events. [2022-11-20 12:12:48,093 INFO L131 PetriNetUnfolder]: For 7150/7620 co-relation queries the response was YES. [2022-11-20 12:12:48,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11284 conditions, 4328 events. 1513/4328 cut-off events. For 7150/7620 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 38065 event pairs, 115 based on Foata normal form. 150/4350 useless extension candidates. Maximal degree in co-relation 11200. Up to 968 conditions per place. [2022-11-20 12:12:48,145 INFO L137 encePairwiseOnDemand]: 125/136 looper letters, 60 selfloop transitions, 16 changer transitions 38/212 dead transitions. [2022-11-20 12:12:48,145 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 212 transitions, 1034 flow [2022-11-20 12:12:48,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 12:12:48,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-20 12:12:48,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1253 transitions. [2022-11-20 12:12:48,151 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8375668449197861 [2022-11-20 12:12:48,151 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1253 transitions. [2022-11-20 12:12:48,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1253 transitions. [2022-11-20 12:12:48,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:12:48,153 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1253 transitions. [2022-11-20 12:12:48,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 113.9090909090909) internal successors, (1253), 11 states have internal predecessors, (1253), 0 states have call successors, (0), 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-20 12:12:48,161 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 136.0) internal successors, (1632), 12 states have internal predecessors, (1632), 0 states have call successors, (0), 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-20 12:12:48,162 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 136.0) internal successors, (1632), 12 states have internal predecessors, (1632), 0 states have call successors, (0), 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-20 12:12:48,163 INFO L175 Difference]: Start difference. First operand has 164 places, 127 transitions, 486 flow. Second operand 11 states and 1253 transitions. [2022-11-20 12:12:48,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 212 transitions, 1034 flow [2022-11-20 12:12:48,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 212 transitions, 897 flow, removed 55 selfloop flow, removed 16 redundant places. [2022-11-20 12:12:48,272 INFO L231 Difference]: Finished difference. Result has 158 places, 141 transitions, 567 flow [2022-11-20 12:12:48,273 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=567, PETRI_PLACES=158, PETRI_TRANSITIONS=141} [2022-11-20 12:12:48,273 INFO L288 CegarLoopForPetriNet]: 143 programPoint places, 15 predicate places. [2022-11-20 12:12:48,274 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 141 transitions, 567 flow [2022-11-20 12:12:48,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 107.57142857142857) internal successors, (753), 7 states have internal predecessors, (753), 0 states have call successors, (0), 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-20 12:12:48,275 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:12:48,275 INFO L209 CegarLoopForPetriNet]: 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, 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, 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, 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-20 12:12:48,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 12:12:48,276 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-20 12:12:48,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:12:48,277 INFO L85 PathProgramCache]: Analyzing trace with hash 335874554, now seen corresponding path program 2 times [2022-11-20 12:12:48,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:12:48,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792467870] [2022-11-20 12:12:48,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:48,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:12:48,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:48,807 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-20 12:12:48,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:12:48,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792467870] [2022-11-20 12:12:48,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792467870] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:12:48,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:12:48,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 12:12:48,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375385486] [2022-11-20 12:12:48,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:12:48,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 12:12:48,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:12:48,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 12:12:48,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:12:48,812 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 136 [2022-11-20 12:12:48,814 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 141 transitions, 567 flow. Second operand has 9 states, 9 states have (on average 111.11111111111111) internal successors, (1000), 9 states have internal predecessors, (1000), 0 states have call successors, (0), 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-20 12:12:48,814 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:12:48,814 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 136 [2022-11-20 12:12:48,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:12:50,478 INFO L130 PetriNetUnfolder]: 2237/5607 cut-off events. [2022-11-20 12:12:50,478 INFO L131 PetriNetUnfolder]: For 6594/6753 co-relation queries the response was YES. [2022-11-20 12:12:50,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14453 conditions, 5607 events. 2237/5607 cut-off events. For 6594/6753 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 53188 event pairs, 416 based on Foata normal form. 61/5474 useless extension candidates. Maximal degree in co-relation 14426. Up to 1358 conditions per place. [2022-11-20 12:12:50,530 INFO L137 encePairwiseOnDemand]: 126/136 looper letters, 45 selfloop transitions, 21 changer transitions 28/199 dead transitions. [2022-11-20 12:12:50,531 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 199 transitions, 1058 flow [2022-11-20 12:12:50,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 12:12:50,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-20 12:12:50,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1395 transitions. [2022-11-20 12:12:50,537 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8547794117647058 [2022-11-20 12:12:50,538 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1395 transitions. [2022-11-20 12:12:50,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1395 transitions. [2022-11-20 12:12:50,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:12:50,539 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1395 transitions. [2022-11-20 12:12:50,543 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 116.25) internal successors, (1395), 12 states have internal predecessors, (1395), 0 states have call successors, (0), 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-20 12:12:50,547 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 136.0) internal successors, (1768), 13 states have internal predecessors, (1768), 0 states have call successors, (0), 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-20 12:12:50,548 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 136.0) internal successors, (1768), 13 states have internal predecessors, (1768), 0 states have call successors, (0), 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-20 12:12:50,548 INFO L175 Difference]: Start difference. First operand has 158 places, 141 transitions, 567 flow. Second operand 12 states and 1395 transitions. [2022-11-20 12:12:50,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 199 transitions, 1058 flow [2022-11-20 12:12:50,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 199 transitions, 996 flow, removed 31 selfloop flow, removed 6 redundant places. [2022-11-20 12:12:50,694 INFO L231 Difference]: Finished difference. Result has 163 places, 144 transitions, 609 flow [2022-11-20 12:12:50,694 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=521, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=609, PETRI_PLACES=163, PETRI_TRANSITIONS=144} [2022-11-20 12:12:50,695 INFO L288 CegarLoopForPetriNet]: 143 programPoint places, 20 predicate places. [2022-11-20 12:12:50,695 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 144 transitions, 609 flow [2022-11-20 12:12:50,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 111.11111111111111) internal successors, (1000), 9 states have internal predecessors, (1000), 0 states have call successors, (0), 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-20 12:12:50,696 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:12:50,697 INFO L209 CegarLoopForPetriNet]: 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, 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, 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, 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, 1, 1, 1, 1, 1] [2022-11-20 12:12:50,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 12:12:50,697 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-20 12:12:50,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:12:50,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1523945653, now seen corresponding path program 1 times [2022-11-20 12:12:50,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:12:50,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511228049] [2022-11-20 12:12:50,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:50,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:12:50,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:52,684 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-20 12:12:52,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:12:52,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511228049] [2022-11-20 12:12:52,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511228049] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:12:52,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:12:52,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-20 12:12:52,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619539138] [2022-11-20 12:12:52,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:12:52,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-20 12:12:52,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:12:52,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 12:12:52,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-11-20 12:12:52,689 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 136 [2022-11-20 12:12:52,691 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 144 transitions, 609 flow. Second operand has 14 states, 14 states have (on average 98.5) internal successors, (1379), 14 states have internal predecessors, (1379), 0 states have call successors, (0), 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-20 12:12:52,691 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:12:52,691 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 136 [2022-11-20 12:12:52,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:12:54,390 INFO L130 PetriNetUnfolder]: 1810/6257 cut-off events. [2022-11-20 12:12:54,390 INFO L131 PetriNetUnfolder]: For 10481/10936 co-relation queries the response was YES. [2022-11-20 12:12:54,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17288 conditions, 6257 events. 1810/6257 cut-off events. For 10481/10936 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 67817 event pairs, 234 based on Foata normal form. 32/6034 useless extension candidates. Maximal degree in co-relation 17194. Up to 1011 conditions per place. [2022-11-20 12:12:54,443 INFO L137 encePairwiseOnDemand]: 118/136 looper letters, 72 selfloop transitions, 37 changer transitions 21/224 dead transitions. [2022-11-20 12:12:54,443 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 224 transitions, 1275 flow [2022-11-20 12:12:54,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 12:12:54,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-11-20 12:12:54,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1541 transitions. [2022-11-20 12:12:54,448 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7553921568627451 [2022-11-20 12:12:54,448 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1541 transitions. [2022-11-20 12:12:54,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1541 transitions. [2022-11-20 12:12:54,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:12:54,450 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1541 transitions. [2022-11-20 12:12:54,454 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 102.73333333333333) internal successors, (1541), 15 states have internal predecessors, (1541), 0 states have call successors, (0), 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-20 12:12:54,458 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 136.0) internal successors, (2176), 16 states have internal predecessors, (2176), 0 states have call successors, (0), 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-20 12:12:54,459 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 136.0) internal successors, (2176), 16 states have internal predecessors, (2176), 0 states have call successors, (0), 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-20 12:12:54,459 INFO L175 Difference]: Start difference. First operand has 163 places, 144 transitions, 609 flow. Second operand 15 states and 1541 transitions. [2022-11-20 12:12:54,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 224 transitions, 1275 flow [2022-11-20 12:12:54,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 224 transitions, 1154 flow, removed 48 selfloop flow, removed 12 redundant places. [2022-11-20 12:12:54,709 INFO L231 Difference]: Finished difference. Result has 170 places, 167 transitions, 797 flow [2022-11-20 12:12:54,710 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=797, PETRI_PLACES=170, PETRI_TRANSITIONS=167} [2022-11-20 12:12:54,711 INFO L288 CegarLoopForPetriNet]: 143 programPoint places, 27 predicate places. [2022-11-20 12:12:54,711 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 167 transitions, 797 flow [2022-11-20 12:12:54,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 98.5) internal successors, (1379), 14 states have internal predecessors, (1379), 0 states have call successors, (0), 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-20 12:12:54,712 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:12:54,712 INFO L209 CegarLoopForPetriNet]: 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, 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, 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, 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, 1, 1, 1, 1, 1] [2022-11-20 12:12:54,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 12:12:54,713 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-20 12:12:54,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:12:54,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1996445999, now seen corresponding path program 2 times [2022-11-20 12:12:54,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:12:54,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818732279] [2022-11-20 12:12:54,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:54,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:12:54,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:56,364 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-20 12:12:56,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:12:56,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818732279] [2022-11-20 12:12:56,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818732279] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:12:56,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:12:56,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-20 12:12:56,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029939682] [2022-11-20 12:12:56,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:12:56,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-20 12:12:56,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:12:56,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 12:12:56,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-11-20 12:12:56,368 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 136 [2022-11-20 12:12:56,369 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 167 transitions, 797 flow. Second operand has 14 states, 14 states have (on average 104.07142857142857) internal successors, (1457), 14 states have internal predecessors, (1457), 0 states have call successors, (0), 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-20 12:12:56,370 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:12:56,370 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 136 [2022-11-20 12:12:56,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:12:57,333 INFO L130 PetriNetUnfolder]: 852/3503 cut-off events. [2022-11-20 12:12:57,333 INFO L131 PetriNetUnfolder]: For 3380/3875 co-relation queries the response was YES. [2022-11-20 12:12:57,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8342 conditions, 3503 events. 852/3503 cut-off events. For 3380/3875 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 35607 event pairs, 130 based on Foata normal form. 30/3351 useless extension candidates. Maximal degree in co-relation 8315. Up to 454 conditions per place. [2022-11-20 12:12:57,355 INFO L137 encePairwiseOnDemand]: 124/136 looper letters, 40 selfloop transitions, 13 changer transitions 19/190 dead transitions. [2022-11-20 12:12:57,356 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 190 transitions, 1031 flow [2022-11-20 12:12:57,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 12:12:57,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-20 12:12:57,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1378 transitions. [2022-11-20 12:12:57,360 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7794117647058824 [2022-11-20 12:12:57,360 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1378 transitions. [2022-11-20 12:12:57,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1378 transitions. [2022-11-20 12:12:57,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:12:57,362 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1378 transitions. [2022-11-20 12:12:57,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 106.0) internal successors, (1378), 13 states have internal predecessors, (1378), 0 states have call successors, (0), 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-20 12:12:57,369 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 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-20 12:12:57,371 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 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-20 12:12:57,371 INFO L175 Difference]: Start difference. First operand has 170 places, 167 transitions, 797 flow. Second operand 13 states and 1378 transitions. [2022-11-20 12:12:57,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 190 transitions, 1031 flow [2022-11-20 12:12:57,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 190 transitions, 963 flow, removed 12 selfloop flow, removed 11 redundant places. [2022-11-20 12:12:57,446 INFO L231 Difference]: Finished difference. Result has 173 places, 160 transitions, 718 flow [2022-11-20 12:12:57,446 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=735, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=718, PETRI_PLACES=173, PETRI_TRANSITIONS=160} [2022-11-20 12:12:57,447 INFO L288 CegarLoopForPetriNet]: 143 programPoint places, 30 predicate places. [2022-11-20 12:12:57,447 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 160 transitions, 718 flow [2022-11-20 12:12:57,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 104.07142857142857) internal successors, (1457), 14 states have internal predecessors, (1457), 0 states have call successors, (0), 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-20 12:12:57,448 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:12:57,449 INFO L209 CegarLoopForPetriNet]: 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, 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, 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, 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, 1, 1, 1, 1, 1] [2022-11-20 12:12:57,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 12:12:57,449 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-20 12:12:57,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:12:57,450 INFO L85 PathProgramCache]: Analyzing trace with hash -2067626325, now seen corresponding path program 3 times [2022-11-20 12:12:57,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:12:57,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329562120] [2022-11-20 12:12:57,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:57,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:12:57,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:57,824 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-20 12:12:57,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:12:57,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329562120] [2022-11-20 12:12:57,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329562120] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:12:57,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:12:57,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:12:57,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814618460] [2022-11-20 12:12:57,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:12:57,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:12:57,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:12:57,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:12:57,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:12:57,828 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 136 [2022-11-20 12:12:57,829 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 160 transitions, 718 flow. Second operand has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 0 states have call successors, (0), 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-20 12:12:57,829 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:12:57,829 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 136 [2022-11-20 12:12:57,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:12:58,699 INFO L130 PetriNetUnfolder]: 1554/5954 cut-off events. [2022-11-20 12:12:58,699 INFO L131 PetriNetUnfolder]: For 5052/5199 co-relation queries the response was YES. [2022-11-20 12:12:58,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13065 conditions, 5954 events. 1554/5954 cut-off events. For 5052/5199 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 67683 event pairs, 214 based on Foata normal form. 45/5773 useless extension candidates. Maximal degree in co-relation 13041. Up to 774 conditions per place. [2022-11-20 12:12:58,753 INFO L137 encePairwiseOnDemand]: 130/136 looper letters, 37 selfloop transitions, 1 changer transitions 38/194 dead transitions. [2022-11-20 12:12:58,754 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 194 transitions, 1105 flow [2022-11-20 12:12:58,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 12:12:58,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-20 12:12:58,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 808 transitions. [2022-11-20 12:12:58,757 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8487394957983193 [2022-11-20 12:12:58,757 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 808 transitions. [2022-11-20 12:12:58,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 808 transitions. [2022-11-20 12:12:58,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:12:58,759 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 808 transitions. [2022-11-20 12:12:58,761 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 115.42857142857143) internal successors, (808), 7 states have internal predecessors, (808), 0 states have call successors, (0), 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-20 12:12:58,764 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 136.0) internal successors, (1088), 8 states have internal predecessors, (1088), 0 states have call successors, (0), 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-20 12:12:58,764 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 136.0) internal successors, (1088), 8 states have internal predecessors, (1088), 0 states have call successors, (0), 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-20 12:12:58,765 INFO L175 Difference]: Start difference. First operand has 173 places, 160 transitions, 718 flow. Second operand 7 states and 808 transitions. [2022-11-20 12:12:58,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 194 transitions, 1105 flow [2022-11-20 12:12:58,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 194 transitions, 1037 flow, removed 9 selfloop flow, removed 12 redundant places. [2022-11-20 12:12:58,854 INFO L231 Difference]: Finished difference. Result has 168 places, 150 transitions, 611 flow [2022-11-20 12:12:58,854 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=678, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=611, PETRI_PLACES=168, PETRI_TRANSITIONS=150} [2022-11-20 12:12:58,855 INFO L288 CegarLoopForPetriNet]: 143 programPoint places, 25 predicate places. [2022-11-20 12:12:58,855 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 150 transitions, 611 flow [2022-11-20 12:12:58,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 0 states have call successors, (0), 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-20 12:12:58,856 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:12:58,856 INFO L209 CegarLoopForPetriNet]: 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, 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, 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, 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, 1, 1, 1, 1, 1] [2022-11-20 12:12:58,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 12:12:58,856 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-20 12:12:58,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:12:58,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1495963269, now seen corresponding path program 4 times [2022-11-20 12:12:58,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:12:58,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438001996] [2022-11-20 12:12:58,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:58,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:12:58,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:12:58,923 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 12:12:58,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:12:59,020 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 12:12:59,020 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 12:12:59,022 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-11-20 12:12:59,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-20 12:12:59,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-11-20 12:12:59,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-11-20 12:12:59,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-11-20 12:12:59,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-11-20 12:12:59,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-20 12:12:59,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 12:12:59,026 INFO L444 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1] [2022-11-20 12:12:59,033 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-20 12:12:59,033 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 12:12:59,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 12:12:59 BasicIcfg [2022-11-20 12:12:59,201 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 12:12:59,202 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 12:12:59,202 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 12:12:59,202 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 12:12:59,203 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:12:32" (3/4) ... [2022-11-20 12:12:59,205 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-20 12:12:59,421 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84a0b13e-bfe3-4649-a760-e70bf3d6b16e/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 12:12:59,426 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 12:12:59,427 INFO L158 Benchmark]: Toolchain (without parser) took 29055.94ms. Allocated memory was 140.5MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 98.5MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2022-11-20 12:12:59,428 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 104.9MB. Free memory is still 77.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 12:12:59,428 INFO L158 Benchmark]: CACSL2BoogieTranslator took 822.14ms. Allocated memory is still 140.5MB. Free memory was 98.5MB in the beginning and 99.1MB in the end (delta: -646.1kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-20 12:12:59,428 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.63ms. Allocated memory is still 140.5MB. Free memory was 99.1MB in the beginning and 96.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 12:12:59,429 INFO L158 Benchmark]: Boogie Preprocessor took 69.52ms. Allocated memory is still 140.5MB. Free memory was 96.5MB in the beginning and 94.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 12:12:59,429 INFO L158 Benchmark]: RCFGBuilder took 983.30ms. Allocated memory is still 140.5MB. Free memory was 94.4MB in the beginning and 56.6MB in the end (delta: 37.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-11-20 12:12:59,430 INFO L158 Benchmark]: TraceAbstraction took 26865.50ms. Allocated memory was 140.5MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 56.0MB in the beginning and 724.9MB in the end (delta: -668.9MB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2022-11-20 12:12:59,430 INFO L158 Benchmark]: Witness Printer took 224.79ms. Allocated memory is still 2.3GB. Free memory was 724.9MB in the beginning and 2.1GB in the end (delta: -1.3GB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-11-20 12:12:59,436 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.23ms. Allocated memory is still 104.9MB. Free memory is still 77.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 822.14ms. Allocated memory is still 140.5MB. Free memory was 98.5MB in the beginning and 99.1MB in the end (delta: -646.1kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.63ms. Allocated memory is still 140.5MB. Free memory was 99.1MB in the beginning and 96.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.52ms. Allocated memory is still 140.5MB. Free memory was 96.5MB in the beginning and 94.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 983.30ms. Allocated memory is still 140.5MB. Free memory was 94.4MB in the beginning and 56.6MB in the end (delta: 37.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 26865.50ms. Allocated memory was 140.5MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 56.0MB in the beginning and 724.9MB in the end (delta: -668.9MB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Witness Printer took 224.79ms. Allocated memory is still 2.3GB. Free memory was 724.9MB in the beginning and 2.1GB in the end (delta: -1.3GB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L714] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L716] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0] [L718] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0] [L719] 0 _Bool a$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0] [L720] 0 int a$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0] [L721] 0 _Bool a$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0] [L722] 0 _Bool a$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0] [L723] 0 _Bool a$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0] [L724] 0 _Bool a$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0] [L725] 0 _Bool a$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0] [L726] 0 _Bool a$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0] [L727] 0 _Bool a$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0] [L728] 0 _Bool a$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0] [L729] 0 _Bool a$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0] [L730] 0 _Bool a$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0] [L731] 0 _Bool a$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0] [L732] 0 int *a$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}] [L733] 0 int a$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0] [L734] 0 _Bool a$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0] [L735] 0 int a$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0] [L736] 0 _Bool a$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0] [L737] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0] [L738] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0] [L740] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L742] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L744] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L745] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0] [L746] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L861] 0 pthread_t t1353; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t1353={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L862] FCALL, FORK 0 pthread_create(&t1353, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1353, ((void *)0), P0, ((void *)0))=-3, t1353={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L863] 0 pthread_t t1354; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t1353={5:0}, t1354={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L864] FCALL, FORK 0 pthread_create(&t1354, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1354, ((void *)0), P1, ((void *)0))=-2, t1353={5:0}, t1354={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L865] 0 pthread_t t1355; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1353={5:0}, t1354={6:0}, t1355={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L866] FCALL, FORK 0 pthread_create(&t1355, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1355, ((void *)0), P2, ((void *)0))=-1, t1353={5:0}, t1354={6:0}, t1355={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L867] 0 pthread_t t1356; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1353={5:0}, t1354={6:0}, t1355={7:0}, t1356={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L868] FCALL, FORK 0 pthread_create(&t1356, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1356, ((void *)0), P3, ((void *)0))=0, t1353={5:0}, t1354={6:0}, t1355={7:0}, t1356={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L750] 1 a$w_buff1 = a$w_buff0 [L751] 1 a$w_buff0 = 1 [L752] 1 a$w_buff1_used = a$w_buff0_used [L753] 1 a$w_buff0_used = (_Bool)1 [L754] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L754] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L755] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L756] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L757] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L758] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L759] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L800] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L786] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L787] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L788] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L789] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L790] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L806] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L808] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L809] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L810] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L820] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L823] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L824] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L825] 4 a$flush_delayed = weak$$choice2 [L826] 4 a$mem_tmp = a [L827] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L828] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L829] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L830] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L831] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L833] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 __unbuffered_p3_EAX = a [L835] 4 a = a$flush_delayed ? a$mem_tmp : a [L836] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L839] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L840] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L841] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L842] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L843] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L846] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L870] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1353={5:0}, t1354={6:0}, t1355={7:0}, t1356={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L872] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L872] RET 0 assume_abort_if_not(main$tmp_guard0) [L874] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L875] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L876] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L877] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L878] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1353={5:0}, t1354={6:0}, t1355={7:0}, t1356={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L881] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1353={5:0}, t1354={6:0}, t1355={7:0}, t1356={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L883] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] - 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: 868]: 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: 862]: 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: 866]: 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: 864]: 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. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 26.5s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 18.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1013 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1013 mSDsluCounter, 694 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 568 mSDsCounter, 111 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2035 IncrementalHoareTripleChecker+Invalid, 2146 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 111 mSolverCounterUnsat, 126 mSDtfsCounter, 2035 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 152 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=797occurred in iteration=9, InterpolantAutomatonStates: 111, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 1116 NumberOfCodeBlocks, 1116 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1000 ConstructedInterpolants, 0 QuantifiedInterpolants, 4844 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-20 12:12:59,484 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84a0b13e-bfe3-4649-a760-e70bf3d6b16e/bin/uautomizer-ug76WZFUDN/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