./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c2900eb-dc39-49a0-a510-883364af2d74/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c2900eb-dc39-49a0-a510-883364af2d74/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_4c2900eb-dc39-49a0-a510-883364af2d74/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c2900eb-dc39-49a0-a510-883364af2d74/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c2900eb-dc39-49a0-a510-883364af2d74/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_4c2900eb-dc39-49a0-a510-883364af2d74/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 3e08637578a960e5117d483812e56de1a390e4c3bc66da607109cc6e10390727 --- 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:00:15,485 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 12:00:15,487 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 12:00:15,517 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 12:00:15,517 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 12:00:15,529 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 12:00:15,532 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 12:00:15,537 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 12:00:15,540 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 12:00:15,546 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 12:00:15,547 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 12:00:15,550 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 12:00:15,550 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 12:00:15,556 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 12:00:15,557 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 12:00:15,558 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 12:00:15,559 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 12:00:15,560 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 12:00:15,562 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 12:00:15,564 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 12:00:15,569 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 12:00:15,571 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 12:00:15,574 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 12:00:15,575 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 12:00:15,588 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 12:00:15,589 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 12:00:15,589 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 12:00:15,590 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 12:00:15,591 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 12:00:15,592 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 12:00:15,592 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 12:00:15,593 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 12:00:15,595 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 12:00:15,595 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 12:00:15,597 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 12:00:15,597 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 12:00:15,598 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 12:00:15,602 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 12:00:15,603 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 12:00:15,607 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 12:00:15,608 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 12:00:15,609 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c2900eb-dc39-49a0-a510-883364af2d74/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 12:00:15,653 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 12:00:15,653 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 12:00:15,654 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 12:00:15,654 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 12:00:15,655 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 12:00:15,655 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 12:00:15,656 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 12:00:15,656 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 12:00:15,657 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 12:00:15,657 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 12:00:15,658 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 12:00:15,658 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 12:00:15,659 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 12:00:15,659 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 12:00:15,659 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 12:00:15,659 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 12:00:15,659 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 12:00:15,660 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 12:00:15,660 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 12:00:15,660 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 12:00:15,660 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 12:00:15,661 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 12:00:15,661 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 12:00:15,661 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 12:00:15,661 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:00:15,661 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 12:00:15,662 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 12:00:15,662 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 12:00:15,663 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 12:00:15,663 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 12:00:15,663 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 12:00:15,664 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 12:00:15,664 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 12:00:15,664 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_4c2900eb-dc39-49a0-a510-883364af2d74/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_4c2900eb-dc39-49a0-a510-883364af2d74/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 -> 3e08637578a960e5117d483812e56de1a390e4c3bc66da607109cc6e10390727 [2022-11-20 12:00:16,015 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 12:00:16,058 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 12:00:16,061 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 12:00:16,062 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 12:00:16,063 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 12:00:16,065 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c2900eb-dc39-49a0-a510-883364af2d74/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/pthread-wmm/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-11-20 12:00:19,536 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 12:00:19,952 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 12:00:19,952 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c2900eb-dc39-49a0-a510-883364af2d74/sv-benchmarks/c/pthread-wmm/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-11-20 12:00:19,969 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c2900eb-dc39-49a0-a510-883364af2d74/bin/uautomizer-ug76WZFUDN/data/febb98ffb/02250096c43045fc8ac11ca3cc7cef37/FLAG8cd1b9a05 [2022-11-20 12:00:19,986 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c2900eb-dc39-49a0-a510-883364af2d74/bin/uautomizer-ug76WZFUDN/data/febb98ffb/02250096c43045fc8ac11ca3cc7cef37 [2022-11-20 12:00:19,989 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 12:00:19,991 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 12:00:19,993 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 12:00:19,993 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 12:00:20,002 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 12:00:20,003 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:00:19" (1/1) ... [2022-11-20 12:00:20,004 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25ed2c36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:00:20, skipping insertion in model container [2022-11-20 12:00:20,005 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:00:19" (1/1) ... [2022-11-20 12:00:20,014 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 12:00:20,059 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 12:00:20,263 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_4c2900eb-dc39-49a0-a510-883364af2d74/sv-benchmarks/c/pthread-wmm/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-11-20 12:00:20,515 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:00:20,529 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 12:00:20,559 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_4c2900eb-dc39-49a0-a510-883364af2d74/sv-benchmarks/c/pthread-wmm/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-11-20 12:00:20,657 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:00:20,726 INFO L208 MainTranslator]: Completed translation [2022-11-20 12:00:20,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:00:20 WrapperNode [2022-11-20 12:00:20,727 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 12:00:20,729 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 12:00:20,729 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 12:00:20,729 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 12:00:20,739 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:00:20" (1/1) ... [2022-11-20 12:00:20,774 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:00:20" (1/1) ... [2022-11-20 12:00:20,812 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 150 [2022-11-20 12:00:20,812 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 12:00:20,813 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 12:00:20,813 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 12:00:20,813 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 12:00:20,825 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:00:20" (1/1) ... [2022-11-20 12:00:20,825 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:00:20" (1/1) ... [2022-11-20 12:00:20,829 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:00:20" (1/1) ... [2022-11-20 12:00:20,829 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:00:20" (1/1) ... [2022-11-20 12:00:20,837 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:00:20" (1/1) ... [2022-11-20 12:00:20,848 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:00:20" (1/1) ... [2022-11-20 12:00:20,850 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:00:20" (1/1) ... [2022-11-20 12:00:20,852 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:00:20" (1/1) ... [2022-11-20 12:00:20,856 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 12:00:20,859 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 12:00:20,861 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 12:00:20,861 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 12:00:20,863 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:00:20" (1/1) ... [2022-11-20 12:00:20,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:00:20,887 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c2900eb-dc39-49a0-a510-883364af2d74/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:00:20,904 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c2900eb-dc39-49a0-a510-883364af2d74/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 12:00:20,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c2900eb-dc39-49a0-a510-883364af2d74/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 12:00:20,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 12:00:20,959 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 12:00:20,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 12:00:20,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 12:00:20,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 12:00:20,961 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-20 12:00:20,962 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-20 12:00:20,962 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-20 12:00:20,963 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-20 12:00:20,963 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-20 12:00:20,964 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-20 12:00:20,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 12:00:20,964 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 12:00:20,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 12:00:20,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 12:00:20,967 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:00:21,179 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 12:00:21,181 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 12:00:21,725 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 12:00:21,896 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 12:00:21,897 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 12:00:21,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:00:21 BoogieIcfgContainer [2022-11-20 12:00:21,901 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 12:00:21,904 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 12:00:21,905 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 12:00:21,909 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 12:00:21,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:00:19" (1/3) ... [2022-11-20 12:00:21,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@523b0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:00:21, skipping insertion in model container [2022-11-20 12:00:21,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:00:20" (2/3) ... [2022-11-20 12:00:21,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@523b0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:00:21, skipping insertion in model container [2022-11-20 12:00:21,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:00:21" (3/3) ... [2022-11-20 12:00:21,914 INFO L112 eAbstractionObserver]: Analyzing ICFG mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-11-20 12:00:21,925 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 12:00:21,939 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 12:00:21,939 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-20 12:00:21,940 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 12:00:22,078 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-20 12:00:22,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 117 transitions, 249 flow [2022-11-20 12:00:22,260 INFO L130 PetriNetUnfolder]: 2/114 cut-off events. [2022-11-20 12:00:22,262 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 12:00:22,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2022-11-20 12:00:22,270 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 117 transitions, 249 flow [2022-11-20 12:00:22,277 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 114 transitions, 237 flow [2022-11-20 12:00:22,298 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 12:00:22,307 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;@26cebab4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 12:00:22,308 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-20 12:00:22,346 INFO L130 PetriNetUnfolder]: 0/73 cut-off events. [2022-11-20 12:00:22,346 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 12:00:22,346 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:00:22,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] [2022-11-20 12:00:22,348 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 12:00:22,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:00:22,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1577986965, now seen corresponding path program 1 times [2022-11-20 12:00:22,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:00:22,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929958786] [2022-11-20 12:00:22,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:00:22,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:00:22,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:23,103 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:00:23,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:00:23,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929958786] [2022-11-20 12:00:23,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929958786] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:00:23,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:00:23,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:00:23,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560702367] [2022-11-20 12:00:23,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:00:23,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:00:23,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:00:23,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:00:23,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:00:23,161 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 117 [2022-11-20 12:00:23,165 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 114 transitions, 237 flow. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states 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:00:23,166 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:00:23,166 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 117 [2022-11-20 12:00:23,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:00:23,378 INFO L130 PetriNetUnfolder]: 17/194 cut-off events. [2022-11-20 12:00:23,378 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-20 12:00:23,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 194 events. 17/194 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 490 event pairs, 3 based on Foata normal form. 9/196 useless extension candidates. Maximal degree in co-relation 193. Up to 27 conditions per place. [2022-11-20 12:00:23,385 INFO L137 encePairwiseOnDemand]: 112/117 looper letters, 10 selfloop transitions, 2 changer transitions 0/113 dead transitions. [2022-11-20 12:00:23,386 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 113 transitions, 259 flow [2022-11-20 12:00:23,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:00:23,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:00:23,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 329 transitions. [2022-11-20 12:00:23,421 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9373219373219374 [2022-11-20 12:00:23,422 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 329 transitions. [2022-11-20 12:00:23,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 329 transitions. [2022-11-20 12:00:23,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:00:23,428 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 329 transitions. [2022-11-20 12:00:23,432 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states 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:00:23,439 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 0 states 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:00:23,439 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 0 states 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:00:23,442 INFO L175 Difference]: Start difference. First operand has 122 places, 114 transitions, 237 flow. Second operand 3 states and 329 transitions. [2022-11-20 12:00:23,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 113 transitions, 259 flow [2022-11-20 12:00:23,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 113 transitions, 256 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-20 12:00:23,452 INFO L231 Difference]: Finished difference. Result has 119 places, 110 transitions, 230 flow [2022-11-20 12:00:23,455 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=230, PETRI_PLACES=119, PETRI_TRANSITIONS=110} [2022-11-20 12:00:23,459 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, -3 predicate places. [2022-11-20 12:00:23,460 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 110 transitions, 230 flow [2022-11-20 12:00:23,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states 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:00:23,461 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:00:23,461 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] [2022-11-20 12:00:23,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 12:00:23,462 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 12:00:23,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:00:23,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1120235349, now seen corresponding path program 1 times [2022-11-20 12:00:23,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:00:23,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362301165] [2022-11-20 12:00:23,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:00:23,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:00:23,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:25,138 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:00:25,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:00:25,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362301165] [2022-11-20 12:00:25,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362301165] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:00:25,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:00:25,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:00:25,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224808365] [2022-11-20 12:00:25,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:00:25,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:00:25,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:00:25,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:00:25,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:00:25,144 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 117 [2022-11-20 12:00:25,146 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 110 transitions, 230 flow. Second operand has 7 states, 7 states have (on average 86.85714285714286) internal successors, (608), 7 states have internal predecessors, (608), 0 states have call successors, (0), 0 states 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:00:25,146 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:00:25,146 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 117 [2022-11-20 12:00:25,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:00:26,652 INFO L130 PetriNetUnfolder]: 995/2809 cut-off events. [2022-11-20 12:00:26,652 INFO L131 PetriNetUnfolder]: For 56/56 co-relation queries the response was YES. [2022-11-20 12:00:26,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4487 conditions, 2809 events. 995/2809 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 22692 event pairs, 164 based on Foata normal form. 0/2733 useless extension candidates. Maximal degree in co-relation 4425. Up to 581 conditions per place. [2022-11-20 12:00:26,674 INFO L137 encePairwiseOnDemand]: 105/117 looper letters, 35 selfloop transitions, 8 changer transitions 78/191 dead transitions. [2022-11-20 12:00:26,674 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 191 transitions, 618 flow [2022-11-20 12:00:26,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 12:00:26,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-20 12:00:26,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1205 transitions. [2022-11-20 12:00:26,682 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7922419460881 [2022-11-20 12:00:26,683 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1205 transitions. [2022-11-20 12:00:26,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1205 transitions. [2022-11-20 12:00:26,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:00:26,685 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1205 transitions. [2022-11-20 12:00:26,689 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 92.6923076923077) internal successors, (1205), 13 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states 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:00:26,695 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states 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:00:26,697 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states 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:00:26,697 INFO L175 Difference]: Start difference. First operand has 119 places, 110 transitions, 230 flow. Second operand 13 states and 1205 transitions. [2022-11-20 12:00:26,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 191 transitions, 618 flow [2022-11-20 12:00:26,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 191 transitions, 608 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 12:00:26,704 INFO L231 Difference]: Finished difference. Result has 141 places, 104 transitions, 310 flow [2022-11-20 12:00:26,705 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=310, PETRI_PLACES=141, PETRI_TRANSITIONS=104} [2022-11-20 12:00:26,706 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, 19 predicate places. [2022-11-20 12:00:26,706 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 104 transitions, 310 flow [2022-11-20 12:00:26,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 86.85714285714286) internal successors, (608), 7 states have internal predecessors, (608), 0 states have call successors, (0), 0 states 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:00:26,707 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:00:26,708 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] [2022-11-20 12:00:26,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 12:00:26,708 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 12:00:26,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:00:26,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1848748142, now seen corresponding path program 1 times [2022-11-20 12:00:26,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:00:26,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649555399] [2022-11-20 12:00:26,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:00:26,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:00:26,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:27,993 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:00:27,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:00:27,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649555399] [2022-11-20 12:00:27,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649555399] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:00:27,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:00:27,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:00:27,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063509560] [2022-11-20 12:00:27,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:00:27,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:00:27,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:00:27,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:00:27,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:00:27,998 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 117 [2022-11-20 12:00:27,999 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 104 transitions, 310 flow. Second operand has 7 states, 7 states have (on average 87.14285714285714) internal successors, (610), 7 states have internal predecessors, (610), 0 states have call successors, (0), 0 states 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:00:27,999 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:00:27,999 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 117 [2022-11-20 12:00:28,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:00:29,143 INFO L130 PetriNetUnfolder]: 631/1666 cut-off events. [2022-11-20 12:00:29,143 INFO L131 PetriNetUnfolder]: For 3497/4256 co-relation queries the response was YES. [2022-11-20 12:00:29,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5209 conditions, 1666 events. 631/1666 cut-off events. For 3497/4256 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 11406 event pairs, 134 based on Foata normal form. 37/1653 useless extension candidates. Maximal degree in co-relation 5135. Up to 531 conditions per place. [2022-11-20 12:00:29,163 INFO L137 encePairwiseOnDemand]: 102/117 looper letters, 37 selfloop transitions, 18 changer transitions 55/180 dead transitions. [2022-11-20 12:00:29,163 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 180 transitions, 1050 flow [2022-11-20 12:00:29,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 12:00:29,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-20 12:00:29,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1200 transitions. [2022-11-20 12:00:29,167 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7889546351084813 [2022-11-20 12:00:29,168 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1200 transitions. [2022-11-20 12:00:29,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1200 transitions. [2022-11-20 12:00:29,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:00:29,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1200 transitions. [2022-11-20 12:00:29,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 92.3076923076923) internal successors, (1200), 13 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states 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:00:29,203 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states 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:00:29,204 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states 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:00:29,204 INFO L175 Difference]: Start difference. First operand has 141 places, 104 transitions, 310 flow. Second operand 13 states and 1200 transitions. [2022-11-20 12:00:29,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 180 transitions, 1050 flow [2022-11-20 12:00:29,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 180 transitions, 998 flow, removed 24 selfloop flow, removed 4 redundant places. [2022-11-20 12:00:29,234 INFO L231 Difference]: Finished difference. Result has 139 places, 112 transitions, 439 flow [2022-11-20 12:00:29,234 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=439, PETRI_PLACES=139, PETRI_TRANSITIONS=112} [2022-11-20 12:00:29,237 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, 17 predicate places. [2022-11-20 12:00:29,237 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 112 transitions, 439 flow [2022-11-20 12:00:29,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 87.14285714285714) internal successors, (610), 7 states have internal predecessors, (610), 0 states have call successors, (0), 0 states 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:00:29,238 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:00:29,239 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] [2022-11-20 12:00:29,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 12:00:29,240 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 12:00:29,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:00:29,241 INFO L85 PathProgramCache]: Analyzing trace with hash 858211543, now seen corresponding path program 1 times [2022-11-20 12:00:29,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:00:29,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957237689] [2022-11-20 12:00:29,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:00:29,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:00:29,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:31,609 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:00:31,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:00:31,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957237689] [2022-11-20 12:00:31,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957237689] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:00:31,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:00:31,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-20 12:00:31,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694659124] [2022-11-20 12:00:31,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:00:31,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 12:00:31,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:00:31,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 12:00:31,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-11-20 12:00:31,614 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 117 [2022-11-20 12:00:31,616 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 112 transitions, 439 flow. Second operand has 13 states, 13 states have (on average 85.76923076923077) internal successors, (1115), 13 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states 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:00:31,616 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:00:31,616 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 117 [2022-11-20 12:00:31,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:00:32,842 INFO L130 PetriNetUnfolder]: 566/1386 cut-off events. [2022-11-20 12:00:32,843 INFO L131 PetriNetUnfolder]: For 5347/8444 co-relation queries the response was YES. [2022-11-20 12:00:32,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5525 conditions, 1386 events. 566/1386 cut-off events. For 5347/8444 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 8779 event pairs, 87 based on Foata normal form. 35/1379 useless extension candidates. Maximal degree in co-relation 5439. Up to 495 conditions per place. [2022-11-20 12:00:32,862 INFO L137 encePairwiseOnDemand]: 100/117 looper letters, 62 selfloop transitions, 24 changer transitions 80/236 dead transitions. [2022-11-20 12:00:32,862 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 236 transitions, 1866 flow [2022-11-20 12:00:32,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 12:00:32,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-11-20 12:00:32,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1704 transitions. [2022-11-20 12:00:32,868 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.766531713900135 [2022-11-20 12:00:32,868 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1704 transitions. [2022-11-20 12:00:32,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1704 transitions. [2022-11-20 12:00:32,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:00:32,870 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1704 transitions. [2022-11-20 12:00:32,878 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 89.6842105263158) internal successors, (1704), 19 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states 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:00:32,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 117.0) internal successors, (2340), 20 states have internal predecessors, (2340), 0 states have call successors, (0), 0 states 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:00:32,888 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 117.0) internal successors, (2340), 20 states have internal predecessors, (2340), 0 states have call successors, (0), 0 states 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:00:32,889 INFO L175 Difference]: Start difference. First operand has 139 places, 112 transitions, 439 flow. Second operand 19 states and 1704 transitions. [2022-11-20 12:00:32,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 236 transitions, 1866 flow [2022-11-20 12:00:32,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 236 transitions, 1776 flow, removed 45 selfloop flow, removed 12 redundant places. [2022-11-20 12:00:32,915 INFO L231 Difference]: Finished difference. Result has 148 places, 130 transitions, 697 flow [2022-11-20 12:00:32,916 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=697, PETRI_PLACES=148, PETRI_TRANSITIONS=130} [2022-11-20 12:00:32,917 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, 26 predicate places. [2022-11-20 12:00:32,923 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 130 transitions, 697 flow [2022-11-20 12:00:32,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 85.76923076923077) internal successors, (1115), 13 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states 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:00:32,924 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:00:32,924 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] [2022-11-20 12:00:32,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 12:00:32,925 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 12:00:32,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:00:32,925 INFO L85 PathProgramCache]: Analyzing trace with hash 134678921, now seen corresponding path program 1 times [2022-11-20 12:00:32,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:00:32,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243107197] [2022-11-20 12:00:32,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:00:32,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:00:32,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:33,949 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:00:33,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:00:33,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243107197] [2022-11-20 12:00:33,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243107197] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:00:33,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:00:33,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 12:00:33,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239514388] [2022-11-20 12:00:33,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:00:33,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 12:00:33,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:00:33,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 12:00:33,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:00:33,955 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 117 [2022-11-20 12:00:33,956 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 130 transitions, 697 flow. Second operand has 10 states, 10 states have (on average 94.7) internal successors, (947), 10 states have internal predecessors, (947), 0 states have call successors, (0), 0 states 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:00:33,956 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:00:33,957 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 117 [2022-11-20 12:00:33,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:00:34,700 INFO L130 PetriNetUnfolder]: 407/1094 cut-off events. [2022-11-20 12:00:34,701 INFO L131 PetriNetUnfolder]: For 7853/9735 co-relation queries the response was YES. [2022-11-20 12:00:34,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5253 conditions, 1094 events. 407/1094 cut-off events. For 7853/9735 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6850 event pairs, 64 based on Foata normal form. 62/1099 useless extension candidates. Maximal degree in co-relation 5165. Up to 445 conditions per place. [2022-11-20 12:00:34,719 INFO L137 encePairwiseOnDemand]: 106/117 looper letters, 41 selfloop transitions, 20 changer transitions 31/183 dead transitions. [2022-11-20 12:00:34,720 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 183 transitions, 1560 flow [2022-11-20 12:00:34,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 12:00:34,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-20 12:00:34,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1166 transitions. [2022-11-20 12:00:34,724 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8304843304843305 [2022-11-20 12:00:34,724 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1166 transitions. [2022-11-20 12:00:34,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1166 transitions. [2022-11-20 12:00:34,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:00:34,725 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1166 transitions. [2022-11-20 12:00:34,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 97.16666666666667) internal successors, (1166), 12 states have internal predecessors, (1166), 0 states have call successors, (0), 0 states 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:00:34,731 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 117.0) internal successors, (1521), 13 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states 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:00:34,732 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 117.0) internal successors, (1521), 13 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states 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:00:34,733 INFO L175 Difference]: Start difference. First operand has 148 places, 130 transitions, 697 flow. Second operand 12 states and 1166 transitions. [2022-11-20 12:00:34,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 183 transitions, 1560 flow [2022-11-20 12:00:34,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 183 transitions, 1474 flow, removed 38 selfloop flow, removed 11 redundant places. [2022-11-20 12:00:34,751 INFO L231 Difference]: Finished difference. Result has 147 places, 143 transitions, 908 flow [2022-11-20 12:00:34,751 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=651, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=908, PETRI_PLACES=147, PETRI_TRANSITIONS=143} [2022-11-20 12:00:34,752 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, 25 predicate places. [2022-11-20 12:00:34,752 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 143 transitions, 908 flow [2022-11-20 12:00:34,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 94.7) internal successors, (947), 10 states have internal predecessors, (947), 0 states have call successors, (0), 0 states 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:00:34,753 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:00:34,753 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] [2022-11-20 12:00:34,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 12:00:34,753 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 12:00:34,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:00:34,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1525925973, now seen corresponding path program 2 times [2022-11-20 12:00:34,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:00:34,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052098487] [2022-11-20 12:00:34,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:00:34,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:00:34,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:35,623 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:00:35,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:00:35,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052098487] [2022-11-20 12:00:35,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052098487] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:00:35,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:00:35,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 12:00:35,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681309612] [2022-11-20 12:00:35,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:00:35,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 12:00:35,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:00:35,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 12:00:35,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:00:35,627 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 117 [2022-11-20 12:00:35,628 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 143 transitions, 908 flow. Second operand has 10 states, 10 states have (on average 95.6) internal successors, (956), 10 states have internal predecessors, (956), 0 states have call successors, (0), 0 states 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:00:35,629 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:00:35,629 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 117 [2022-11-20 12:00:35,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:00:36,378 INFO L130 PetriNetUnfolder]: 452/1172 cut-off events. [2022-11-20 12:00:36,378 INFO L131 PetriNetUnfolder]: For 15072/19145 co-relation queries the response was YES. [2022-11-20 12:00:36,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6763 conditions, 1172 events. 452/1172 cut-off events. For 15072/19145 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 7397 event pairs, 55 based on Foata normal form. 94/1212 useless extension candidates. Maximal degree in co-relation 6676. Up to 500 conditions per place. [2022-11-20 12:00:36,401 INFO L137 encePairwiseOnDemand]: 106/117 looper letters, 34 selfloop transitions, 44 changer transitions 31/201 dead transitions. [2022-11-20 12:00:36,401 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 201 transitions, 2127 flow [2022-11-20 12:00:36,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 12:00:36,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-20 12:00:36,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1278 transitions. [2022-11-20 12:00:36,406 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8402366863905325 [2022-11-20 12:00:36,406 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1278 transitions. [2022-11-20 12:00:36,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1278 transitions. [2022-11-20 12:00:36,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:00:36,408 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1278 transitions. [2022-11-20 12:00:36,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 98.3076923076923) internal successors, (1278), 13 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states 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:00:36,415 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states 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:00:36,416 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states 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:00:36,417 INFO L175 Difference]: Start difference. First operand has 147 places, 143 transitions, 908 flow. Second operand 13 states and 1278 transitions. [2022-11-20 12:00:36,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 201 transitions, 2127 flow [2022-11-20 12:00:36,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 201 transitions, 2094 flow, removed 16 selfloop flow, removed 4 redundant places. [2022-11-20 12:00:36,461 INFO L231 Difference]: Finished difference. Result has 157 places, 161 transitions, 1363 flow [2022-11-20 12:00:36,461 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=889, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1363, PETRI_PLACES=157, PETRI_TRANSITIONS=161} [2022-11-20 12:00:36,464 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, 35 predicate places. [2022-11-20 12:00:36,465 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 161 transitions, 1363 flow [2022-11-20 12:00:36,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 95.6) internal successors, (956), 10 states have internal predecessors, (956), 0 states have call successors, (0), 0 states 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:00:36,466 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:00:36,466 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] [2022-11-20 12:00:36,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 12:00:36,467 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 12:00:36,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:00:36,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1256025453, now seen corresponding path program 3 times [2022-11-20 12:00:36,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:00:36,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181935644] [2022-11-20 12:00:36,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:00:36,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:00:36,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:37,984 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:00:37,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:00:37,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181935644] [2022-11-20 12:00:37,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181935644] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:00:37,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:00:37,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 12:00:37,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267326336] [2022-11-20 12:00:37,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:00:37,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 12:00:37,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:00:38,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 12:00:38,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:00:38,002 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 117 [2022-11-20 12:00:38,004 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 161 transitions, 1363 flow. Second operand has 10 states, 10 states have (on average 88.2) internal successors, (882), 10 states have internal predecessors, (882), 0 states have call successors, (0), 0 states 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:00:38,004 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:00:38,004 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 117 [2022-11-20 12:00:38,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:00:39,044 INFO L130 PetriNetUnfolder]: 522/1443 cut-off events. [2022-11-20 12:00:39,044 INFO L131 PetriNetUnfolder]: For 18004/26874 co-relation queries the response was YES. [2022-11-20 12:00:39,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8577 conditions, 1443 events. 522/1443 cut-off events. For 18004/26874 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 9828 event pairs, 38 based on Foata normal form. 65/1460 useless extension candidates. Maximal degree in co-relation 8479. Up to 503 conditions per place. [2022-11-20 12:00:39,069 INFO L137 encePairwiseOnDemand]: 103/117 looper letters, 70 selfloop transitions, 55 changer transitions 75/272 dead transitions. [2022-11-20 12:00:39,070 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 272 transitions, 3625 flow [2022-11-20 12:00:39,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 12:00:39,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-20 12:00:39,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1484 transitions. [2022-11-20 12:00:39,074 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7927350427350427 [2022-11-20 12:00:39,075 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1484 transitions. [2022-11-20 12:00:39,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1484 transitions. [2022-11-20 12:00:39,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:00:39,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1484 transitions. [2022-11-20 12:00:39,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 92.75) internal successors, (1484), 16 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states 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:00:39,085 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 117.0) internal successors, (1989), 17 states have internal predecessors, (1989), 0 states have call successors, (0), 0 states 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:00:39,086 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 117.0) internal successors, (1989), 17 states have internal predecessors, (1989), 0 states have call successors, (0), 0 states 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:00:39,087 INFO L175 Difference]: Start difference. First operand has 157 places, 161 transitions, 1363 flow. Second operand 16 states and 1484 transitions. [2022-11-20 12:00:39,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 272 transitions, 3625 flow [2022-11-20 12:00:39,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 272 transitions, 3459 flow, removed 74 selfloop flow, removed 8 redundant places. [2022-11-20 12:00:39,159 INFO L231 Difference]: Finished difference. Result has 170 places, 181 transitions, 1863 flow [2022-11-20 12:00:39,159 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=1253, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1863, PETRI_PLACES=170, PETRI_TRANSITIONS=181} [2022-11-20 12:00:39,160 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, 48 predicate places. [2022-11-20 12:00:39,160 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 181 transitions, 1863 flow [2022-11-20 12:00:39,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 88.2) internal successors, (882), 10 states have internal predecessors, (882), 0 states have call successors, (0), 0 states 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:00:39,163 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:00:39,163 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] [2022-11-20 12:00:39,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 12:00:39,164 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 12:00:39,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:00:39,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1760522480, now seen corresponding path program 1 times [2022-11-20 12:00:39,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:00:39,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974742105] [2022-11-20 12:00:39,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:00:39,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:00:39,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:40,246 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:00:40,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:00:40,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974742105] [2022-11-20 12:00:40,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974742105] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:00:40,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:00:40,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-20 12:00:40,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780858317] [2022-11-20 12:00:40,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:00:40,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 12:00:40,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:00:40,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 12:00:40,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-11-20 12:00:40,250 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 117 [2022-11-20 12:00:40,251 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 181 transitions, 1863 flow. Second operand has 13 states, 13 states have (on average 94.38461538461539) internal successors, (1227), 13 states have internal predecessors, (1227), 0 states have call successors, (0), 0 states 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:00:40,251 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:00:40,251 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 117 [2022-11-20 12:00:40,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:00:40,841 INFO L130 PetriNetUnfolder]: 380/1119 cut-off events. [2022-11-20 12:00:40,841 INFO L131 PetriNetUnfolder]: For 17302/20201 co-relation queries the response was YES. [2022-11-20 12:00:40,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7100 conditions, 1119 events. 380/1119 cut-off events. For 17302/20201 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7519 event pairs, 31 based on Foata normal form. 86/1144 useless extension candidates. Maximal degree in co-relation 6998. Up to 404 conditions per place. [2022-11-20 12:00:40,863 INFO L137 encePairwiseOnDemand]: 105/117 looper letters, 47 selfloop transitions, 48 changer transitions 13/209 dead transitions. [2022-11-20 12:00:40,863 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 209 transitions, 2501 flow [2022-11-20 12:00:40,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 12:00:40,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-20 12:00:40,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1346 transitions. [2022-11-20 12:00:40,867 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8217338217338217 [2022-11-20 12:00:40,867 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1346 transitions. [2022-11-20 12:00:40,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1346 transitions. [2022-11-20 12:00:40,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:00:40,869 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1346 transitions. [2022-11-20 12:00:40,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 96.14285714285714) internal successors, (1346), 14 states have internal predecessors, (1346), 0 states have call successors, (0), 0 states 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:00:40,875 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 117.0) internal successors, (1755), 15 states have internal predecessors, (1755), 0 states have call successors, (0), 0 states 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:00:40,876 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 117.0) internal successors, (1755), 15 states have internal predecessors, (1755), 0 states have call successors, (0), 0 states 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:00:40,876 INFO L175 Difference]: Start difference. First operand has 170 places, 181 transitions, 1863 flow. Second operand 14 states and 1346 transitions. [2022-11-20 12:00:40,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 209 transitions, 2501 flow [2022-11-20 12:00:40,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 209 transitions, 2459 flow, removed 15 selfloop flow, removed 6 redundant places. [2022-11-20 12:00:40,917 INFO L231 Difference]: Finished difference. Result has 175 places, 184 transitions, 2079 flow [2022-11-20 12:00:40,917 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=1835, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2079, PETRI_PLACES=175, PETRI_TRANSITIONS=184} [2022-11-20 12:00:40,918 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, 53 predicate places. [2022-11-20 12:00:40,918 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 184 transitions, 2079 flow [2022-11-20 12:00:40,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 94.38461538461539) internal successors, (1227), 13 states have internal predecessors, (1227), 0 states have call successors, (0), 0 states 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:00:40,919 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:00:40,920 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] [2022-11-20 12:00:40,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 12:00:40,920 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 12:00:40,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:00:40,921 INFO L85 PathProgramCache]: Analyzing trace with hash -332976818, now seen corresponding path program 2 times [2022-11-20 12:00:40,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:00:40,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058481253] [2022-11-20 12:00:40,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:00:40,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:00:40,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:42,063 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:00:42,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:00:42,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058481253] [2022-11-20 12:00:42,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058481253] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:00:42,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:00:42,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 12:00:42,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172746021] [2022-11-20 12:00:42,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:00:42,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 12:00:42,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:00:42,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 12:00:42,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-11-20 12:00:42,068 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 117 [2022-11-20 12:00:42,069 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 184 transitions, 2079 flow. Second operand has 11 states, 11 states have (on average 93.72727272727273) internal successors, (1031), 11 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states 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:00:42,069 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:00:42,069 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 117 [2022-11-20 12:00:42,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:00:42,924 INFO L130 PetriNetUnfolder]: 393/1208 cut-off events. [2022-11-20 12:00:42,924 INFO L131 PetriNetUnfolder]: For 21381/25332 co-relation queries the response was YES. [2022-11-20 12:00:42,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8013 conditions, 1208 events. 393/1208 cut-off events. For 21381/25332 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 8541 event pairs, 69 based on Foata normal form. 95/1235 useless extension candidates. Maximal degree in co-relation 7904. Up to 429 conditions per place. [2022-11-20 12:00:42,955 INFO L137 encePairwiseOnDemand]: 105/117 looper letters, 71 selfloop transitions, 22 changer transitions 13/206 dead transitions. [2022-11-20 12:00:42,955 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 206 transitions, 2726 flow [2022-11-20 12:00:42,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 12:00:42,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-20 12:00:42,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1238 transitions. [2022-11-20 12:00:42,960 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8139381985535832 [2022-11-20 12:00:42,960 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1238 transitions. [2022-11-20 12:00:42,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1238 transitions. [2022-11-20 12:00:42,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:00:42,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1238 transitions. [2022-11-20 12:00:42,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 95.23076923076923) internal successors, (1238), 13 states have internal predecessors, (1238), 0 states have call successors, (0), 0 states 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:00:42,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states 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:00:42,969 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states 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:00:42,969 INFO L175 Difference]: Start difference. First operand has 175 places, 184 transitions, 2079 flow. Second operand 13 states and 1238 transitions. [2022-11-20 12:00:42,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 206 transitions, 2726 flow [2022-11-20 12:00:43,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 206 transitions, 2577 flow, removed 50 selfloop flow, removed 13 redundant places. [2022-11-20 12:00:43,025 INFO L231 Difference]: Finished difference. Result has 175 places, 187 transitions, 2163 flow [2022-11-20 12:00:43,025 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=1998, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2163, PETRI_PLACES=175, PETRI_TRANSITIONS=187} [2022-11-20 12:00:43,026 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, 53 predicate places. [2022-11-20 12:00:43,026 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 187 transitions, 2163 flow [2022-11-20 12:00:43,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 93.72727272727273) internal successors, (1031), 11 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states 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:00:43,027 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:00:43,027 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] [2022-11-20 12:00:43,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 12:00:43,028 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 12:00:43,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:00:43,028 INFO L85 PathProgramCache]: Analyzing trace with hash -748515998, now seen corresponding path program 3 times [2022-11-20 12:00:43,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:00:43,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392652900] [2022-11-20 12:00:43,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:00:43,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:00:43,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:44,064 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:00:44,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:00:44,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392652900] [2022-11-20 12:00:44,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392652900] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:00:44,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:00:44,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-20 12:00:44,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971427610] [2022-11-20 12:00:44,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:00:44,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 12:00:44,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:00:44,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 12:00:44,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-11-20 12:00:44,072 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 117 [2022-11-20 12:00:44,074 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 187 transitions, 2163 flow. Second operand has 13 states, 13 states have (on average 92.53846153846153) internal successors, (1203), 13 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states 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:00:44,074 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:00:44,074 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 117 [2022-11-20 12:00:44,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:00:44,778 INFO L130 PetriNetUnfolder]: 412/1303 cut-off events. [2022-11-20 12:00:44,778 INFO L131 PetriNetUnfolder]: For 22327/29648 co-relation queries the response was YES. [2022-11-20 12:00:44,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8556 conditions, 1303 events. 412/1303 cut-off events. For 22327/29648 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 9807 event pairs, 57 based on Foata normal form. 79/1323 useless extension candidates. Maximal degree in co-relation 8448. Up to 458 conditions per place. [2022-11-20 12:00:44,812 INFO L137 encePairwiseOnDemand]: 105/117 looper letters, 78 selfloop transitions, 28 changer transitions 10/215 dead transitions. [2022-11-20 12:00:44,813 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 215 transitions, 3021 flow [2022-11-20 12:00:44,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 12:00:44,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-20 12:00:44,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1039 transitions. [2022-11-20 12:00:44,816 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8073038073038074 [2022-11-20 12:00:44,816 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1039 transitions. [2022-11-20 12:00:44,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1039 transitions. [2022-11-20 12:00:44,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:00:44,817 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1039 transitions. [2022-11-20 12:00:44,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 94.45454545454545) internal successors, (1039), 11 states have internal predecessors, (1039), 0 states have call successors, (0), 0 states 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:00:44,822 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 117.0) internal successors, (1404), 12 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states 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:00:44,823 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 117.0) internal successors, (1404), 12 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states 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:00:44,823 INFO L175 Difference]: Start difference. First operand has 175 places, 187 transitions, 2163 flow. Second operand 11 states and 1039 transitions. [2022-11-20 12:00:44,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 215 transitions, 3021 flow [2022-11-20 12:00:44,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 215 transitions, 2871 flow, removed 55 selfloop flow, removed 11 redundant places. [2022-11-20 12:00:44,877 INFO L231 Difference]: Finished difference. Result has 172 places, 198 transitions, 2428 flow [2022-11-20 12:00:44,879 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=2085, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2428, PETRI_PLACES=172, PETRI_TRANSITIONS=198} [2022-11-20 12:00:44,880 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, 50 predicate places. [2022-11-20 12:00:44,880 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 198 transitions, 2428 flow [2022-11-20 12:00:44,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 92.53846153846153) internal successors, (1203), 13 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states 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:00:44,881 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:00:44,881 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] [2022-11-20 12:00:44,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 12:00:44,884 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 12:00:44,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:00:44,885 INFO L85 PathProgramCache]: Analyzing trace with hash 921360272, now seen corresponding path program 4 times [2022-11-20 12:00:44,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:00:44,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780597531] [2022-11-20 12:00:44,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:00:44,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:00:44,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:46,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:00:46,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:00:46,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780597531] [2022-11-20 12:00:46,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780597531] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:00:46,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:00:46,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 12:00:46,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468675663] [2022-11-20 12:00:46,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:00:46,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 12:00:46,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:00:46,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 12:00:46,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-11-20 12:00:46,105 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 117 [2022-11-20 12:00:46,107 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 198 transitions, 2428 flow. Second operand has 11 states, 11 states have (on average 91.0) internal successors, (1001), 11 states have internal predecessors, (1001), 0 states have call successors, (0), 0 states 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:00:46,107 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:00:46,107 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 117 [2022-11-20 12:00:46,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:00:46,892 INFO L130 PetriNetUnfolder]: 379/1265 cut-off events. [2022-11-20 12:00:46,892 INFO L131 PetriNetUnfolder]: For 20081/29276 co-relation queries the response was YES. [2022-11-20 12:00:46,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8123 conditions, 1265 events. 379/1265 cut-off events. For 20081/29276 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 9633 event pairs, 65 based on Foata normal form. 62/1271 useless extension candidates. Maximal degree in co-relation 8014. Up to 433 conditions per place. [2022-11-20 12:00:46,956 INFO L137 encePairwiseOnDemand]: 107/117 looper letters, 86 selfloop transitions, 24 changer transitions 13/220 dead transitions. [2022-11-20 12:00:46,957 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 220 transitions, 3046 flow [2022-11-20 12:00:46,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 12:00:46,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-20 12:00:46,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1202 transitions. [2022-11-20 12:00:46,965 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7902695595003287 [2022-11-20 12:00:46,965 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1202 transitions. [2022-11-20 12:00:46,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1202 transitions. [2022-11-20 12:00:46,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:00:46,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1202 transitions. [2022-11-20 12:00:46,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 92.46153846153847) internal successors, (1202), 13 states have internal predecessors, (1202), 0 states have call successors, (0), 0 states 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:00:46,972 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states 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:00:46,983 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states 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:00:46,992 INFO L175 Difference]: Start difference. First operand has 172 places, 198 transitions, 2428 flow. Second operand 13 states and 1202 transitions. [2022-11-20 12:00:46,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 220 transitions, 3046 flow [2022-11-20 12:00:47,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 220 transitions, 2948 flow, removed 28 selfloop flow, removed 10 redundant places. [2022-11-20 12:00:47,047 INFO L231 Difference]: Finished difference. Result has 178 places, 198 transitions, 2419 flow [2022-11-20 12:00:47,047 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=2344, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2419, PETRI_PLACES=178, PETRI_TRANSITIONS=198} [2022-11-20 12:00:47,048 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, 56 predicate places. [2022-11-20 12:00:47,048 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 198 transitions, 2419 flow [2022-11-20 12:00:47,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 91.0) internal successors, (1001), 11 states have internal predecessors, (1001), 0 states have call successors, (0), 0 states 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:00:47,049 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:00:47,050 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] [2022-11-20 12:00:47,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 12:00:47,050 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 12:00:47,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:00:47,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1901653066, now seen corresponding path program 1 times [2022-11-20 12:00:47,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:00:47,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915515496] [2022-11-20 12:00:47,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:00:47,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:00:47,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:47,286 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:00:47,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:00:47,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915515496] [2022-11-20 12:00:47,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915515496] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:00:47,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:00:47,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 12:00:47,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80802033] [2022-11-20 12:00:47,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:00:47,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:00:47,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:00:47,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:00:47,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:00:47,290 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 117 [2022-11-20 12:00:47,290 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 198 transitions, 2419 flow. Second operand has 6 states, 6 states have (on average 96.33333333333333) internal successors, (578), 6 states have internal predecessors, (578), 0 states have call successors, (0), 0 states 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:00:47,291 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:00:47,291 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 117 [2022-11-20 12:00:47,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:00:49,080 INFO L130 PetriNetUnfolder]: 3040/6166 cut-off events. [2022-11-20 12:00:49,080 INFO L131 PetriNetUnfolder]: For 131717/138506 co-relation queries the response was YES. [2022-11-20 12:00:49,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34057 conditions, 6166 events. 3040/6166 cut-off events. For 131717/138506 co-relation queries the response was YES. Maximal size of possible extension queue 553. Compared 52251 event pairs, 203 based on Foata normal form. 600/6392 useless extension candidates. Maximal degree in co-relation 33954. Up to 1855 conditions per place. [2022-11-20 12:00:49,177 INFO L137 encePairwiseOnDemand]: 107/117 looper letters, 164 selfloop transitions, 7 changer transitions 175/450 dead transitions. [2022-11-20 12:00:49,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 450 transitions, 8234 flow [2022-11-20 12:00:49,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 12:00:49,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-20 12:00:49,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1014 transitions. [2022-11-20 12:00:49,183 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8666666666666667 [2022-11-20 12:00:49,184 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1014 transitions. [2022-11-20 12:00:49,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1014 transitions. [2022-11-20 12:00:49,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:00:49,185 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1014 transitions. [2022-11-20 12:00:49,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 101.4) internal successors, (1014), 10 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states 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:00:49,188 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 117.0) internal successors, (1287), 11 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states 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:00:49,189 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 117.0) internal successors, (1287), 11 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states 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:00:49,189 INFO L175 Difference]: Start difference. First operand has 178 places, 198 transitions, 2419 flow. Second operand 10 states and 1014 transitions. [2022-11-20 12:00:49,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 450 transitions, 8234 flow [2022-11-20 12:00:49,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 450 transitions, 8099 flow, removed 40 selfloop flow, removed 10 redundant places. [2022-11-20 12:00:49,305 INFO L231 Difference]: Finished difference. Result has 177 places, 190 transitions, 2169 flow [2022-11-20 12:00:49,305 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=2138, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2169, PETRI_PLACES=177, PETRI_TRANSITIONS=190} [2022-11-20 12:00:49,306 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, 55 predicate places. [2022-11-20 12:00:49,306 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 190 transitions, 2169 flow [2022-11-20 12:00:49,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 96.33333333333333) internal successors, (578), 6 states have internal predecessors, (578), 0 states have call successors, (0), 0 states 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:00:49,307 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:00:49,307 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] [2022-11-20 12:00:49,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 12:00:49,307 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 12:00:49,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:00:49,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1926797162, now seen corresponding path program 1 times [2022-11-20 12:00:49,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:00:49,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920685219] [2022-11-20 12:00:49,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:00:49,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:00:49,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:49,568 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:00:49,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:00:49,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920685219] [2022-11-20 12:00:49,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920685219] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:00:49,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:00:49,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:00:49,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518771211] [2022-11-20 12:00:49,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:00:49,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:00:49,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:00:49,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:00:49,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:00:49,572 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 117 [2022-11-20 12:00:49,573 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 190 transitions, 2169 flow. Second operand has 7 states, 7 states have (on average 96.14285714285714) internal successors, (673), 7 states have internal predecessors, (673), 0 states have call successors, (0), 0 states 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:00:49,573 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:00:49,573 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 117 [2022-11-20 12:00:49,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:00:50,994 INFO L130 PetriNetUnfolder]: 1401/3624 cut-off events. [2022-11-20 12:00:50,994 INFO L131 PetriNetUnfolder]: For 65562/68238 co-relation queries the response was YES. [2022-11-20 12:00:51,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21040 conditions, 3624 events. 1401/3624 cut-off events. For 65562/68238 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 32491 event pairs, 54 based on Foata normal form. 378/3924 useless extension candidates. Maximal degree in co-relation 20938. Up to 960 conditions per place. [2022-11-20 12:00:51,056 INFO L137 encePairwiseOnDemand]: 107/117 looper letters, 144 selfloop transitions, 20 changer transitions 96/363 dead transitions. [2022-11-20 12:00:51,056 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 363 transitions, 6358 flow [2022-11-20 12:00:51,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 12:00:51,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-20 12:00:51,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1116 transitions. [2022-11-20 12:00:51,060 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8671328671328671 [2022-11-20 12:00:51,060 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1116 transitions. [2022-11-20 12:00:51,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1116 transitions. [2022-11-20 12:00:51,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:00:51,061 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1116 transitions. [2022-11-20 12:00:51,063 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 101.45454545454545) internal successors, (1116), 11 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states 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:00:51,065 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 117.0) internal successors, (1404), 12 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states 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:00:51,066 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 117.0) internal successors, (1404), 12 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states 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:00:51,066 INFO L175 Difference]: Start difference. First operand has 177 places, 190 transitions, 2169 flow. Second operand 11 states and 1116 transitions. [2022-11-20 12:00:51,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 363 transitions, 6358 flow [2022-11-20 12:00:51,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 363 transitions, 6224 flow, removed 9 selfloop flow, removed 9 redundant places. [2022-11-20 12:00:51,385 INFO L231 Difference]: Finished difference. Result has 178 places, 185 transitions, 1887 flow [2022-11-20 12:00:51,385 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=1759, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1887, PETRI_PLACES=178, PETRI_TRANSITIONS=185} [2022-11-20 12:00:51,387 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, 56 predicate places. [2022-11-20 12:00:51,388 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 185 transitions, 1887 flow [2022-11-20 12:00:51,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 96.14285714285714) internal successors, (673), 7 states have internal predecessors, (673), 0 states have call successors, (0), 0 states 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:00:51,388 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:00:51,389 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] [2022-11-20 12:00:51,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 12:00:51,389 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 12:00:51,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:00:51,390 INFO L85 PathProgramCache]: Analyzing trace with hash -584277813, now seen corresponding path program 1 times [2022-11-20 12:00:51,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:00:51,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815880485] [2022-11-20 12:00:51,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:00:51,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:00:51,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:52,483 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:00:52,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:00:52,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815880485] [2022-11-20 12:00:52,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815880485] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:00:52,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:00:52,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:00:52,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337451649] [2022-11-20 12:00:52,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:00:52,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:00:52,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:00:52,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:00:52,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:00:52,487 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 117 [2022-11-20 12:00:52,488 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 185 transitions, 1887 flow. Second operand has 7 states, 7 states have (on average 87.57142857142857) internal successors, (613), 7 states have internal predecessors, (613), 0 states have call successors, (0), 0 states 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:00:52,488 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:00:52,488 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 117 [2022-11-20 12:00:52,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:00:53,429 INFO L130 PetriNetUnfolder]: 566/2720 cut-off events. [2022-11-20 12:00:53,429 INFO L131 PetriNetUnfolder]: For 15052/16198 co-relation queries the response was YES. [2022-11-20 12:00:53,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10942 conditions, 2720 events. 566/2720 cut-off events. For 15052/16198 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 29315 event pairs, 37 based on Foata normal form. 21/2580 useless extension candidates. Maximal degree in co-relation 10831. Up to 821 conditions per place. [2022-11-20 12:00:53,469 INFO L137 encePairwiseOnDemand]: 107/117 looper letters, 58 selfloop transitions, 13 changer transitions 77/240 dead transitions. [2022-11-20 12:00:53,470 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 240 transitions, 3226 flow [2022-11-20 12:00:53,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 12:00:53,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-20 12:00:53,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 906 transitions. [2022-11-20 12:00:53,473 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7743589743589744 [2022-11-20 12:00:53,473 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 906 transitions. [2022-11-20 12:00:53,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 906 transitions. [2022-11-20 12:00:53,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:00:53,474 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 906 transitions. [2022-11-20 12:00:53,476 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 90.6) internal successors, (906), 10 states have internal predecessors, (906), 0 states have call successors, (0), 0 states 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:00:53,478 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 117.0) internal successors, (1287), 11 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states 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:00:53,479 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 117.0) internal successors, (1287), 11 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states 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:00:53,479 INFO L175 Difference]: Start difference. First operand has 178 places, 185 transitions, 1887 flow. Second operand 10 states and 906 transitions. [2022-11-20 12:00:53,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 240 transitions, 3226 flow [2022-11-20 12:00:53,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 240 transitions, 3082 flow, removed 52 selfloop flow, removed 8 redundant places. [2022-11-20 12:00:53,587 INFO L231 Difference]: Finished difference. Result has 186 places, 153 transitions, 1167 flow [2022-11-20 12:00:53,587 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=1761, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1167, PETRI_PLACES=186, PETRI_TRANSITIONS=153} [2022-11-20 12:00:53,588 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, 64 predicate places. [2022-11-20 12:00:53,588 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 153 transitions, 1167 flow [2022-11-20 12:00:53,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 87.57142857142857) internal successors, (613), 7 states have internal predecessors, (613), 0 states have call successors, (0), 0 states 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:00:53,588 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:00:53,588 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:00:53,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 12:00:53,589 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 12:00:53,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:00:53,589 INFO L85 PathProgramCache]: Analyzing trace with hash -550862591, now seen corresponding path program 1 times [2022-11-20 12:00:53,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:00:53,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520882363] [2022-11-20 12:00:53,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:00:53,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:00:53,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:53,905 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:00:53,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:00:53,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520882363] [2022-11-20 12:00:53,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520882363] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:00:53,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:00:53,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 12:00:53,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641681431] [2022-11-20 12:00:53,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:00:53,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 12:00:53,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:00:53,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 12:00:53,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:00:53,909 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 117 [2022-11-20 12:00:53,910 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 153 transitions, 1167 flow. Second operand has 8 states, 8 states have (on average 96.125) internal successors, (769), 8 states have internal predecessors, (769), 0 states have call successors, (0), 0 states 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:00:53,910 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:00:53,911 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 117 [2022-11-20 12:00:53,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:00:54,949 INFO L130 PetriNetUnfolder]: 1221/3518 cut-off events. [2022-11-20 12:00:54,949 INFO L131 PetriNetUnfolder]: For 51025/52930 co-relation queries the response was YES. [2022-11-20 12:00:54,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17682 conditions, 3518 events. 1221/3518 cut-off events. For 51025/52930 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 34001 event pairs, 53 based on Foata normal form. 240/3684 useless extension candidates. Maximal degree in co-relation 17631. Up to 683 conditions per place. [2022-11-20 12:00:54,991 INFO L137 encePairwiseOnDemand]: 107/117 looper letters, 67 selfloop transitions, 22 changer transitions 66/244 dead transitions. [2022-11-20 12:00:54,992 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 244 transitions, 3070 flow [2022-11-20 12:00:54,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 12:00:54,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-20 12:00:54,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1391 transitions. [2022-11-20 12:00:54,995 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8492063492063492 [2022-11-20 12:00:54,996 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1391 transitions. [2022-11-20 12:00:54,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1391 transitions. [2022-11-20 12:00:54,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:00:54,997 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1391 transitions. [2022-11-20 12:00:55,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 99.35714285714286) internal successors, (1391), 14 states have internal predecessors, (1391), 0 states have call successors, (0), 0 states 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:00:55,003 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 117.0) internal successors, (1755), 15 states have internal predecessors, (1755), 0 states have call successors, (0), 0 states 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:00:55,004 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 117.0) internal successors, (1755), 15 states have internal predecessors, (1755), 0 states have call successors, (0), 0 states 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:00:55,004 INFO L175 Difference]: Start difference. First operand has 186 places, 153 transitions, 1167 flow. Second operand 14 states and 1391 transitions. [2022-11-20 12:00:55,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 244 transitions, 3070 flow [2022-11-20 12:00:55,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 244 transitions, 2706 flow, removed 154 selfloop flow, removed 17 redundant places. [2022-11-20 12:00:55,135 INFO L231 Difference]: Finished difference. Result has 183 places, 141 transitions, 915 flow [2022-11-20 12:00:55,135 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=916, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=915, PETRI_PLACES=183, PETRI_TRANSITIONS=141} [2022-11-20 12:00:55,136 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, 61 predicate places. [2022-11-20 12:00:55,136 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 141 transitions, 915 flow [2022-11-20 12:00:55,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 96.125) internal successors, (769), 8 states have internal predecessors, (769), 0 states have call successors, (0), 0 states 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:00:55,137 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:00:55,137 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] [2022-11-20 12:00:55,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 12:00:55,137 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 12:00:55,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:00:55,138 INFO L85 PathProgramCache]: Analyzing trace with hash -935051085, now seen corresponding path program 1 times [2022-11-20 12:00:55,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:00:55,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378128934] [2022-11-20 12:00:55,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:00:55,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:00:55,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:55,451 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:00:55,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:00:55,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378128934] [2022-11-20 12:00:55,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378128934] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:00:55,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:00:55,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:00:55,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543398595] [2022-11-20 12:00:55,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:00:55,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:00:55,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:00:55,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:00:55,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:00:55,458 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 117 [2022-11-20 12:00:55,458 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 141 transitions, 915 flow. Second operand has 7 states, 7 states have (on average 97.42857142857143) internal successors, (682), 7 states have internal predecessors, (682), 0 states have call successors, (0), 0 states 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:00:55,459 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:00:55,459 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 117 [2022-11-20 12:00:55,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:00:55,740 INFO L130 PetriNetUnfolder]: 103/664 cut-off events. [2022-11-20 12:00:55,740 INFO L131 PetriNetUnfolder]: For 1974/2072 co-relation queries the response was YES. [2022-11-20 12:00:55,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2048 conditions, 664 events. 103/664 cut-off events. For 1974/2072 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4742 event pairs, 2 based on Foata normal form. 2/625 useless extension candidates. Maximal degree in co-relation 1965. Up to 86 conditions per place. [2022-11-20 12:00:55,747 INFO L137 encePairwiseOnDemand]: 111/117 looper letters, 18 selfloop transitions, 1 changer transitions 38/156 dead transitions. [2022-11-20 12:00:55,747 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 156 transitions, 1202 flow [2022-11-20 12:00:55,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 12:00:55,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-20 12:00:55,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 694 transitions. [2022-11-20 12:00:55,752 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8473748473748474 [2022-11-20 12:00:55,752 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 694 transitions. [2022-11-20 12:00:55,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 694 transitions. [2022-11-20 12:00:55,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:00:55,753 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 694 transitions. [2022-11-20 12:00:55,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 99.14285714285714) internal successors, (694), 7 states have internal predecessors, (694), 0 states have call successors, (0), 0 states 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:00:55,761 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 117.0) internal successors, (936), 8 states have internal predecessors, (936), 0 states have call successors, (0), 0 states 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:00:55,762 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 117.0) internal successors, (936), 8 states have internal predecessors, (936), 0 states have call successors, (0), 0 states 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:00:55,763 INFO L175 Difference]: Start difference. First operand has 183 places, 141 transitions, 915 flow. Second operand 7 states and 694 transitions. [2022-11-20 12:00:55,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 156 transitions, 1202 flow [2022-11-20 12:00:55,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 156 transitions, 927 flow, removed 97 selfloop flow, removed 23 redundant places. [2022-11-20 12:00:55,779 INFO L231 Difference]: Finished difference. Result has 168 places, 118 transitions, 500 flow [2022-11-20 12:00:55,780 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=721, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=500, PETRI_PLACES=168, PETRI_TRANSITIONS=118} [2022-11-20 12:00:55,781 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, 46 predicate places. [2022-11-20 12:00:55,782 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 118 transitions, 500 flow [2022-11-20 12:00:55,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 97.42857142857143) internal successors, (682), 7 states have internal predecessors, (682), 0 states have call successors, (0), 0 states 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:00:55,782 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:00:55,782 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] [2022-11-20 12:00:55,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-20 12:00:55,783 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 12:00:55,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:00:55,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1987845703, now seen corresponding path program 2 times [2022-11-20 12:00:55,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:00:55,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417669994] [2022-11-20 12:00:55,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:00:55,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:00:55,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:00:55,840 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 12:00:55,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:00:55,958 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 12:00:55,959 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 12:00:55,960 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-20 12:00:55,963 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-20 12:00:55,964 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-20 12:00:55,968 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-20 12:00:55,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-20 12:00:55,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-20 12:00:55,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-20 12:00:55,970 INFO L444 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:00:55,979 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-20 12:00:55,979 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 12:00:56,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 12:00:56 BasicIcfg [2022-11-20 12:00:56,143 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 12:00:56,144 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 12:00:56,144 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 12:00:56,144 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 12:00:56,145 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:00:21" (3/4) ... [2022-11-20 12:00:56,147 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-20 12:00:56,275 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c2900eb-dc39-49a0-a510-883364af2d74/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 12:00:56,276 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 12:00:56,277 INFO L158 Benchmark]: Toolchain (without parser) took 36285.56ms. Allocated memory was 153.1MB in the beginning and 977.3MB in the end (delta: 824.2MB). Free memory was 121.1MB in the beginning and 354.7MB in the end (delta: -233.7MB). Peak memory consumption was 591.9MB. Max. memory is 16.1GB. [2022-11-20 12:00:56,277 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 117.4MB. Free memory was 71.0MB in the beginning and 70.7MB in the end (delta: 241.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 12:00:56,278 INFO L158 Benchmark]: CACSL2BoogieTranslator took 734.94ms. Allocated memory is still 153.1MB. Free memory was 121.1MB in the beginning and 98.1MB in the end (delta: 22.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-20 12:00:56,278 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.74ms. Allocated memory is still 153.1MB. Free memory was 98.1MB in the beginning and 95.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 12:00:56,279 INFO L158 Benchmark]: Boogie Preprocessor took 45.64ms. Allocated memory is still 153.1MB. Free memory was 95.5MB in the beginning and 93.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 12:00:56,279 INFO L158 Benchmark]: RCFGBuilder took 1041.71ms. Allocated memory is still 153.1MB. Free memory was 93.4MB in the beginning and 61.2MB in the end (delta: 32.3MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-11-20 12:00:56,280 INFO L158 Benchmark]: TraceAbstraction took 34238.66ms. Allocated memory was 153.1MB in the beginning and 977.3MB in the end (delta: 824.2MB). Free memory was 60.8MB in the beginning and 378.8MB in the end (delta: -318.1MB). Peak memory consumption was 510.1MB. Max. memory is 16.1GB. [2022-11-20 12:00:56,280 INFO L158 Benchmark]: Witness Printer took 132.50ms. Allocated memory is still 977.3MB. Free memory was 378.8MB in the beginning and 354.7MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-20 12:00:56,282 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.35ms. Allocated memory is still 117.4MB. Free memory was 71.0MB in the beginning and 70.7MB in the end (delta: 241.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 734.94ms. Allocated memory is still 153.1MB. Free memory was 121.1MB in the beginning and 98.1MB in the end (delta: 22.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.74ms. Allocated memory is still 153.1MB. Free memory was 98.1MB in the beginning and 95.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.64ms. Allocated memory is still 153.1MB. Free memory was 95.5MB in the beginning and 93.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1041.71ms. Allocated memory is still 153.1MB. Free memory was 93.4MB in the beginning and 61.2MB in the end (delta: 32.3MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 34238.66ms. Allocated memory was 153.1MB in the beginning and 977.3MB in the end (delta: 824.2MB). Free memory was 60.8MB in the beginning and 378.8MB in the end (delta: -318.1MB). Peak memory consumption was 510.1MB. Max. memory is 16.1GB. * Witness Printer took 132.50ms. Allocated memory is still 977.3MB. Free memory was 378.8MB in the beginning and 354.7MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. 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: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L713] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L715] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L716] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L717] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L719] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L721] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L722] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L723] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L724] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L725] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L726] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L727] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L728] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L729] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L730] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L731] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L732] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L733] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L734] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L735] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L736] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L737] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L740] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L741] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L823] 0 pthread_t t1196; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1196={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L824] FCALL, FORK 0 pthread_create(&t1196, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1196, ((void *)0), P0, ((void *)0))=-2, t1196={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L825] 0 pthread_t t1197; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1196={5:0}, t1197={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L826] FCALL, FORK 0 pthread_create(&t1197, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1197, ((void *)0), P1, ((void *)0))=-1, t1196={5:0}, t1197={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L827] 0 pthread_t t1198; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1196={5:0}, t1197={6:0}, t1198={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L828] FCALL, FORK 0 pthread_create(&t1198, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1198, ((void *)0), P2, ((void *)0))=0, t1196={5:0}, t1197={6:0}, t1198={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] 3 y$w_buff1 = y$w_buff0 [L781] 3 y$w_buff0 = 2 [L782] 3 y$w_buff1_used = y$w_buff0_used [L783] 3 y$w_buff0_used = (_Bool)1 [L784] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L784] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L785] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L786] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L787] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L788] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L789] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L792] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L795] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L745] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L763] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L767] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L768] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L769] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L770] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1196={5:0}, t1197={6:0}, t1198={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L832] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L832] RET 0 assume_abort_if_not(main$tmp_guard0) [L834] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L835] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L836] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L837] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L838] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1196={5:0}, t1197={6:0}, t1198={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L841] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L842] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L843] 0 y$flush_delayed = weak$$choice2 [L844] 0 y$mem_tmp = y [L845] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L846] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L847] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L848] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L849] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L850] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L851] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L853] 0 y = y$flush_delayed ? y$mem_tmp : y [L854] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1196={5:0}, t1197={6:0}, t1198={3:0}, weak$$choice0=53, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L856] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=53, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, 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: 826]: 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: 824]: 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: 828]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 145 locations, 6 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: 33.8s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 17.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 982 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 982 mSDsluCounter, 1273 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1015 mSDsCounter, 145 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2046 IncrementalHoareTripleChecker+Invalid, 2191 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 145 mSolverCounterUnsat, 258 mSDtfsCounter, 2046 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 243 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2428occurred in iteration=10, InterpolantAutomatonStates: 192, 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, 15.1s InterpolantComputationTime, 1395 NumberOfCodeBlocks, 1395 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1288 ConstructedInterpolants, 0 QuantifiedInterpolants, 7329 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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:00:56,318 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c2900eb-dc39-49a0-a510-883364af2d74/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