./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version dbf71c69 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e531cf4b-13db-424b-827d-dc7777bf0055/bin/uautomizer-J5u9QxTXDZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e531cf4b-13db-424b-827d-dc7777bf0055/bin/uautomizer-J5u9QxTXDZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e531cf4b-13db-424b-827d-dc7777bf0055/bin/uautomizer-J5u9QxTXDZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e531cf4b-13db-424b-827d-dc7777bf0055/bin/uautomizer-J5u9QxTXDZ/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e531cf4b-13db-424b-827d-dc7777bf0055/bin/uautomizer-J5u9QxTXDZ/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e531cf4b-13db-424b-827d-dc7777bf0055/bin/uautomizer-J5u9QxTXDZ --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 6e0191a7c0154db5e6d5798f5b20e5814ce0ff555e18a7acf1f1e5e323a36576 --- 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-dbf71c6-m [2022-10-17 10:47:20,483 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-17 10:47:20,490 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-17 10:47:20,550 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-17 10:47:20,551 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-17 10:47:20,555 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-17 10:47:20,557 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-17 10:47:20,563 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-17 10:47:20,566 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-17 10:47:20,571 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-17 10:47:20,572 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-17 10:47:20,575 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-17 10:47:20,576 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-17 10:47:20,578 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-17 10:47:20,580 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-17 10:47:20,582 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-17 10:47:20,584 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-17 10:47:20,585 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-17 10:47:20,587 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-17 10:47:20,598 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-17 10:47:20,599 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-17 10:47:20,601 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-17 10:47:20,605 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-17 10:47:20,606 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-17 10:47:20,610 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-17 10:47:20,611 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-17 10:47:20,611 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-17 10:47:20,612 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-17 10:47:20,613 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-17 10:47:20,614 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-17 10:47:20,614 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-17 10:47:20,615 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-17 10:47:20,616 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-17 10:47:20,617 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-17 10:47:20,618 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-17 10:47:20,619 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-17 10:47:20,619 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-17 10:47:20,620 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-17 10:47:20,620 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-17 10:47:20,621 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-17 10:47:20,621 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-17 10:47:20,622 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e531cf4b-13db-424b-827d-dc7777bf0055/bin/uautomizer-J5u9QxTXDZ/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-10-17 10:47:20,645 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-17 10:47:20,645 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-17 10:47:20,646 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-17 10:47:20,646 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-17 10:47:20,646 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-17 10:47:20,647 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-17 10:47:20,647 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-17 10:47:20,647 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-17 10:47:20,648 INFO L138 SettingsManager]: * Use SBE=true [2022-10-17 10:47:20,648 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-17 10:47:20,648 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-17 10:47:20,648 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-17 10:47:20,648 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-17 10:47:20,649 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-17 10:47:20,649 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-17 10:47:20,649 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-17 10:47:20,649 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-17 10:47:20,649 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-17 10:47:20,650 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-17 10:47:20,650 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-17 10:47:20,650 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-17 10:47:20,650 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-17 10:47:20,650 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-17 10:47:20,651 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-17 10:47:20,651 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-17 10:47:20,651 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-17 10:47:20,651 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-17 10:47:20,652 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-17 10:47:20,652 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-17 10:47:20,652 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-17 10:47:20,652 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-17 10:47:20,652 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-10-17 10:47:20,653 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-17 10:47:20,653 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_e531cf4b-13db-424b-827d-dc7777bf0055/bin/uautomizer-J5u9QxTXDZ/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_e531cf4b-13db-424b-827d-dc7777bf0055/bin/uautomizer-J5u9QxTXDZ 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 -> 6e0191a7c0154db5e6d5798f5b20e5814ce0ff555e18a7acf1f1e5e323a36576 [2022-10-17 10:47:20,911 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-17 10:47:20,940 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-17 10:47:20,942 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-17 10:47:20,944 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-17 10:47:20,945 INFO L275 PluginConnector]: CDTParser initialized [2022-10-17 10:47:20,947 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e531cf4b-13db-424b-827d-dc7777bf0055/bin/uautomizer-J5u9QxTXDZ/../../sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2022-10-17 10:47:21,021 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e531cf4b-13db-424b-827d-dc7777bf0055/bin/uautomizer-J5u9QxTXDZ/data/c826b0130/2ae947edce884e1eba6f9e2617afeccc/FLAGad09ccbc7 [2022-10-17 10:47:21,645 INFO L306 CDTParser]: Found 1 translation units. [2022-10-17 10:47:21,645 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e531cf4b-13db-424b-827d-dc7777bf0055/sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2022-10-17 10:47:21,667 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e531cf4b-13db-424b-827d-dc7777bf0055/bin/uautomizer-J5u9QxTXDZ/data/c826b0130/2ae947edce884e1eba6f9e2617afeccc/FLAGad09ccbc7 [2022-10-17 10:47:21,898 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e531cf4b-13db-424b-827d-dc7777bf0055/bin/uautomizer-J5u9QxTXDZ/data/c826b0130/2ae947edce884e1eba6f9e2617afeccc [2022-10-17 10:47:21,900 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-17 10:47:21,902 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-10-17 10:47:21,903 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-17 10:47:21,904 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-17 10:47:21,907 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-17 10:47:21,908 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 10:47:21" (1/1) ... [2022-10-17 10:47:21,909 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26947382 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:47:21, skipping insertion in model container [2022-10-17 10:47:21,909 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 10:47:21" (1/1) ... [2022-10-17 10:47:21,916 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-17 10:47:21,965 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-17 10:47:22,183 WARN L230 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_e531cf4b-13db-424b-827d-dc7777bf0055/sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i[967,980] [2022-10-17 10:47:22,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 10:47:22,416 INFO L203 MainTranslator]: Completed pre-run [2022-10-17 10:47:22,425 WARN L230 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_e531cf4b-13db-424b-827d-dc7777bf0055/sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i[967,980] [2022-10-17 10:47:22,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 10:47:22,519 INFO L208 MainTranslator]: Completed translation [2022-10-17 10:47:22,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:47:22 WrapperNode [2022-10-17 10:47:22,519 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-17 10:47:22,521 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-17 10:47:22,521 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-17 10:47:22,521 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-17 10:47:22,530 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:47:22" (1/1) ... [2022-10-17 10:47:22,566 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:47:22" (1/1) ... [2022-10-17 10:47:22,613 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 273 [2022-10-17 10:47:22,619 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-17 10:47:22,619 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-17 10:47:22,620 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-17 10:47:22,620 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-17 10:47:22,630 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:47:22" (1/1) ... [2022-10-17 10:47:22,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:47:22" (1/1) ... [2022-10-17 10:47:22,636 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:47:22" (1/1) ... [2022-10-17 10:47:22,637 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:47:22" (1/1) ... [2022-10-17 10:47:22,650 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:47:22" (1/1) ... [2022-10-17 10:47:22,654 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:47:22" (1/1) ... [2022-10-17 10:47:22,658 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:47:22" (1/1) ... [2022-10-17 10:47:22,661 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:47:22" (1/1) ... [2022-10-17 10:47:22,668 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-17 10:47:22,669 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-17 10:47:22,669 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-17 10:47:22,669 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-17 10:47:22,671 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:47:22" (1/1) ... [2022-10-17 10:47:22,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-17 10:47:22,718 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e531cf4b-13db-424b-827d-dc7777bf0055/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:47:22,731 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e531cf4b-13db-424b-827d-dc7777bf0055/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-17 10:47:22,749 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e531cf4b-13db-424b-827d-dc7777bf0055/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-17 10:47:22,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-17 10:47:22,793 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-10-17 10:47:22,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-17 10:47:22,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-17 10:47:22,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-17 10:47:22,793 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-10-17 10:47:22,794 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-10-17 10:47:22,794 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-10-17 10:47:22,794 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-10-17 10:47:22,794 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-10-17 10:47:22,794 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-10-17 10:47:22,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-17 10:47:22,795 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-10-17 10:47:22,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-17 10:47:22,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-17 10:47:22,798 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-10-17 10:47:22,941 INFO L235 CfgBuilder]: Building ICFG [2022-10-17 10:47:22,943 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-17 10:47:23,712 INFO L276 CfgBuilder]: Performing block encoding [2022-10-17 10:47:24,188 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-17 10:47:24,188 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-10-17 10:47:24,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 10:47:24 BoogieIcfgContainer [2022-10-17 10:47:24,191 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-17 10:47:24,195 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-17 10:47:24,195 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-17 10:47:24,198 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-17 10:47:24,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.10 10:47:21" (1/3) ... [2022-10-17 10:47:24,199 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21272b25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 10:47:24, skipping insertion in model container [2022-10-17 10:47:24,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:47:22" (2/3) ... [2022-10-17 10:47:24,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21272b25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 10:47:24, skipping insertion in model container [2022-10-17 10:47:24,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 10:47:24" (3/3) ... [2022-10-17 10:47:24,201 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_power.opt_pso.opt_rmo.opt.i [2022-10-17 10:47:24,210 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-17 10:47:24,221 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-17 10:47:24,221 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-10-17 10:47:24,221 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-17 10:47:24,301 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-10-17 10:47:24,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 239 flow [2022-10-17 10:47:24,432 INFO L130 PetriNetUnfolder]: 2/109 cut-off events. [2022-10-17 10:47:24,432 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-10-17 10:47:24,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-10-17 10:47:24,437 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 112 transitions, 239 flow [2022-10-17 10:47:24,442 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 109 transitions, 227 flow [2022-10-17 10:47:24,455 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-17 10:47:24,461 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;@8eed2a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-17 10:47:24,462 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-10-17 10:47:24,479 INFO L130 PetriNetUnfolder]: 0/71 cut-off events. [2022-10-17 10:47:24,479 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-10-17 10:47:24,480 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:47:24,480 INFO L208 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] [2022-10-17 10:47:24,481 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-10-17 10:47:24,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:47:24,486 INFO L85 PathProgramCache]: Analyzing trace with hash -2040665683, now seen corresponding path program 1 times [2022-10-17 10:47:24,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:47:24,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884262259] [2022-10-17 10:47:24,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:47:24,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:47:24,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:47: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-10-17 10:47:25,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:47:25,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884262259] [2022-10-17 10:47:25,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884262259] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:47:25,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:47:25,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-17 10:47:25,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118260202] [2022-10-17 10:47:25,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:47:25,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-17 10:47:25,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:47:25,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 10:47:25,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 10:47:25,201 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 112 [2022-10-17 10:47:25,205 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 109 transitions, 227 flow. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:25,205 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:47:25,205 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 112 [2022-10-17 10:47:25,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:47:25,357 INFO L130 PetriNetUnfolder]: 17/241 cut-off events. [2022-10-17 10:47:25,357 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-10-17 10:47:25,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 293 conditions, 241 events. 17/241 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 751 event pairs, 7 based on Foata normal form. 8/237 useless extension candidates. Maximal degree in co-relation 243. Up to 27 conditions per place. [2022-10-17 10:47:25,362 INFO L137 encePairwiseOnDemand]: 107/112 looper letters, 10 selfloop transitions, 2 changer transitions 0/108 dead transitions. [2022-10-17 10:47:25,362 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 108 transitions, 249 flow [2022-10-17 10:47:25,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 10:47:25,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-10-17 10:47:25,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 314 transitions. [2022-10-17 10:47:25,379 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9345238095238095 [2022-10-17 10:47:25,380 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 314 transitions. [2022-10-17 10:47:25,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 314 transitions. [2022-10-17 10:47:25,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:47:25,385 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 314 transitions. [2022-10-17 10:47:25,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:25,397 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:25,397 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:25,399 INFO L175 Difference]: Start difference. First operand has 117 places, 109 transitions, 227 flow. Second operand 3 states and 314 transitions. [2022-10-17 10:47:25,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 108 transitions, 249 flow [2022-10-17 10:47:25,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 108 transitions, 246 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-10-17 10:47:25,409 INFO L231 Difference]: Finished difference. Result has 114 places, 105 transitions, 220 flow [2022-10-17 10:47:25,411 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=220, PETRI_PLACES=114, PETRI_TRANSITIONS=105} [2022-10-17 10:47:25,416 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, -3 predicate places. [2022-10-17 10:47:25,416 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 105 transitions, 220 flow [2022-10-17 10:47:25,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:25,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:47:25,417 INFO L208 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] [2022-10-17 10:47:25,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-17 10:47:25,418 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-10-17 10:47:25,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:47:25,418 INFO L85 PathProgramCache]: Analyzing trace with hash -690634123, now seen corresponding path program 1 times [2022-10-17 10:47:25,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:47:25,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682166772] [2022-10-17 10:47:25,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:47:25,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:47:25,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:47:26,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:47:26,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:47:26,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682166772] [2022-10-17 10:47:26,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682166772] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:47:26,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:47:26,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-17 10:47:26,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377524920] [2022-10-17 10:47:26,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:47:26,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-17 10:47:26,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:47:26,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-17 10:47:26,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-17 10:47:26,115 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 112 [2022-10-17 10:47:26,116 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 105 transitions, 220 flow. Second operand has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:26,117 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:47:26,122 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 112 [2022-10-17 10:47:26,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:47:26,812 INFO L130 PetriNetUnfolder]: 357/1164 cut-off events. [2022-10-17 10:47:26,812 INFO L131 PetriNetUnfolder]: For 72/72 co-relation queries the response was YES. [2022-10-17 10:47:26,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1841 conditions, 1164 events. 357/1164 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 7954 event pairs, 56 based on Foata normal form. 0/1130 useless extension candidates. Maximal degree in co-relation 1791. Up to 333 conditions per place. [2022-10-17 10:47:26,828 INFO L137 encePairwiseOnDemand]: 105/112 looper letters, 20 selfloop transitions, 3 changer transitions 48/148 dead transitions. [2022-10-17 10:47:26,828 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 148 transitions, 444 flow [2022-10-17 10:47:26,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-17 10:47:26,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-10-17 10:47:26,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 881 transitions. [2022-10-17 10:47:26,839 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8740079365079365 [2022-10-17 10:47:26,839 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 881 transitions. [2022-10-17 10:47:26,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 881 transitions. [2022-10-17 10:47:26,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:47:26,841 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 881 transitions. [2022-10-17 10:47:26,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.88888888888889) internal successors, (881), 9 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:26,852 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:26,853 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:26,853 INFO L175 Difference]: Start difference. First operand has 114 places, 105 transitions, 220 flow. Second operand 9 states and 881 transitions. [2022-10-17 10:47:26,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 148 transitions, 444 flow [2022-10-17 10:47:26,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 148 transitions, 426 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-10-17 10:47:26,862 INFO L231 Difference]: Finished difference. Result has 127 places, 95 transitions, 235 flow [2022-10-17 10:47:26,862 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=235, PETRI_PLACES=127, PETRI_TRANSITIONS=95} [2022-10-17 10:47:26,864 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 10 predicate places. [2022-10-17 10:47:26,864 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 95 transitions, 235 flow [2022-10-17 10:47:26,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:26,865 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:47:26,865 INFO L208 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] [2022-10-17 10:47:26,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-17 10:47:26,866 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-10-17 10:47:26,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:47:26,868 INFO L85 PathProgramCache]: Analyzing trace with hash -909743756, now seen corresponding path program 1 times [2022-10-17 10:47:26,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:47:26,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360632131] [2022-10-17 10:47:26,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:47:26,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:47:26,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:47:27,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:47:27,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:47:27,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360632131] [2022-10-17 10:47:27,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360632131] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:47:27,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:47:27,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-17 10:47:27,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058677815] [2022-10-17 10:47:27,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:47:27,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-17 10:47:27,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:47:27,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-17 10:47:27,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-17 10:47:27,277 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 112 [2022-10-17 10:47:27,278 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 95 transitions, 235 flow. Second operand has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:27,278 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:47:27,279 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 112 [2022-10-17 10:47:27,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:47:27,781 INFO L130 PetriNetUnfolder]: 387/953 cut-off events. [2022-10-17 10:47:27,781 INFO L131 PetriNetUnfolder]: For 735/739 co-relation queries the response was YES. [2022-10-17 10:47:27,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2117 conditions, 953 events. 387/953 cut-off events. For 735/739 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 5573 event pairs, 178 based on Foata normal form. 24/927 useless extension candidates. Maximal degree in co-relation 2060. Up to 348 conditions per place. [2022-10-17 10:47:27,793 INFO L137 encePairwiseOnDemand]: 105/112 looper letters, 20 selfloop transitions, 3 changer transitions 34/136 dead transitions. [2022-10-17 10:47:27,794 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 136 transitions, 453 flow [2022-10-17 10:47:27,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-17 10:47:27,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-10-17 10:47:27,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 878 transitions. [2022-10-17 10:47:27,798 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.871031746031746 [2022-10-17 10:47:27,798 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 878 transitions. [2022-10-17 10:47:27,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 878 transitions. [2022-10-17 10:47:27,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:47:27,799 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 878 transitions. [2022-10-17 10:47:27,802 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.55555555555556) internal successors, (878), 9 states have internal predecessors, (878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:27,805 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:27,806 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:27,806 INFO L175 Difference]: Start difference. First operand has 127 places, 95 transitions, 235 flow. Second operand 9 states and 878 transitions. [2022-10-17 10:47:27,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 136 transitions, 453 flow [2022-10-17 10:47:27,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 136 transitions, 436 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-10-17 10:47:27,819 INFO L231 Difference]: Finished difference. Result has 120 places, 97 transitions, 269 flow [2022-10-17 10:47:27,819 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=269, PETRI_PLACES=120, PETRI_TRANSITIONS=97} [2022-10-17 10:47:27,822 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 3 predicate places. [2022-10-17 10:47:27,822 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 97 transitions, 269 flow [2022-10-17 10:47:27,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:27,823 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:47:27,823 INFO L208 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-10-17 10:47:27,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-17 10:47:27,824 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-10-17 10:47:27,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:47:27,825 INFO L85 PathProgramCache]: Analyzing trace with hash 2085786923, now seen corresponding path program 1 times [2022-10-17 10:47:27,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:47:27,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230007858] [2022-10-17 10:47:27,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:47:27,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:47:27,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:47:28,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:47:28,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:47:28,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230007858] [2022-10-17 10:47:28,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230007858] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:47:28,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:47:28,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-10-17 10:47:28,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427494122] [2022-10-17 10:47:28,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:47:28,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-17 10:47:28,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:47:28,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-17 10:47:28,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-10-17 10:47:28,841 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 112 [2022-10-17 10:47:28,842 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 97 transitions, 269 flow. Second operand has 9 states, 9 states have (on average 91.44444444444444) internal successors, (823), 9 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:28,842 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:47:28,842 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 112 [2022-10-17 10:47:28,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:47:29,423 INFO L130 PetriNetUnfolder]: 437/1046 cut-off events. [2022-10-17 10:47:29,423 INFO L131 PetriNetUnfolder]: For 1823/1832 co-relation queries the response was YES. [2022-10-17 10:47:29,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2820 conditions, 1046 events. 437/1046 cut-off events. For 1823/1832 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 6253 event pairs, 163 based on Foata normal form. 29/1018 useless extension candidates. Maximal degree in co-relation 2756. Up to 401 conditions per place. [2022-10-17 10:47:29,439 INFO L137 encePairwiseOnDemand]: 101/112 looper letters, 16 selfloop transitions, 9 changer transitions 34/139 dead transitions. [2022-10-17 10:47:29,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 139 transitions, 517 flow [2022-10-17 10:47:29,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-17 10:47:29,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-10-17 10:47:29,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1322 transitions. [2022-10-17 10:47:29,444 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8431122448979592 [2022-10-17 10:47:29,444 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1322 transitions. [2022-10-17 10:47:29,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1322 transitions. [2022-10-17 10:47:29,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:47:29,479 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1322 transitions. [2022-10-17 10:47:29,483 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 94.42857142857143) internal successors, (1322), 14 states have internal predecessors, (1322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:29,492 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 112.0) internal successors, (1680), 15 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:29,494 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 112.0) internal successors, (1680), 15 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:29,495 INFO L175 Difference]: Start difference. First operand has 120 places, 97 transitions, 269 flow. Second operand 14 states and 1322 transitions. [2022-10-17 10:47:29,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 139 transitions, 517 flow [2022-10-17 10:47:29,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 139 transitions, 496 flow, removed 9 selfloop flow, removed 4 redundant places. [2022-10-17 10:47:29,506 INFO L231 Difference]: Finished difference. Result has 134 places, 103 transitions, 346 flow [2022-10-17 10:47:29,507 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=346, PETRI_PLACES=134, PETRI_TRANSITIONS=103} [2022-10-17 10:47:29,511 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 17 predicate places. [2022-10-17 10:47:29,511 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 103 transitions, 346 flow [2022-10-17 10:47:29,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 91.44444444444444) internal successors, (823), 9 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:29,513 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:47:29,513 INFO L208 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] [2022-10-17 10:47:29,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-17 10:47:29,514 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-10-17 10:47:29,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:47:29,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1195724569, now seen corresponding path program 1 times [2022-10-17 10:47:29,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:47:29,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552116992] [2022-10-17 10:47:29,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:47:29,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:47:29,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:47:29,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:47:29,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:47:29,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552116992] [2022-10-17 10:47:29,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552116992] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:47:29,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:47:29,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-17 10:47:29,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48573572] [2022-10-17 10:47:29,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:47:29,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-17 10:47:29,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:47:29,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-17 10:47:29,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-17 10:47:29,818 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 112 [2022-10-17 10:47:29,819 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 103 transitions, 346 flow. Second operand has 6 states, 6 states have (on average 93.16666666666667) internal successors, (559), 6 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:29,819 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:47:29,819 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 112 [2022-10-17 10:47:29,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:47:30,395 INFO L130 PetriNetUnfolder]: 457/1170 cut-off events. [2022-10-17 10:47:30,395 INFO L131 PetriNetUnfolder]: For 4992/5182 co-relation queries the response was YES. [2022-10-17 10:47:30,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4444 conditions, 1170 events. 457/1170 cut-off events. For 4992/5182 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7310 event pairs, 192 based on Foata normal form. 20/1137 useless extension candidates. Maximal degree in co-relation 4370. Up to 366 conditions per place. [2022-10-17 10:47:30,418 INFO L137 encePairwiseOnDemand]: 106/112 looper letters, 32 selfloop transitions, 3 changer transitions 26/142 dead transitions. [2022-10-17 10:47:30,418 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 142 transitions, 759 flow [2022-10-17 10:47:30,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-17 10:47:30,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-10-17 10:47:30,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 873 transitions. [2022-10-17 10:47:30,422 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8660714285714286 [2022-10-17 10:47:30,422 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 873 transitions. [2022-10-17 10:47:30,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 873 transitions. [2022-10-17 10:47:30,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:47:30,423 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 873 transitions. [2022-10-17 10:47:30,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.0) internal successors, (873), 9 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:30,428 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:30,429 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:30,429 INFO L175 Difference]: Start difference. First operand has 134 places, 103 transitions, 346 flow. Second operand 9 states and 873 transitions. [2022-10-17 10:47:30,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 142 transitions, 759 flow [2022-10-17 10:47:30,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 142 transitions, 729 flow, removed 14 selfloop flow, removed 4 redundant places. [2022-10-17 10:47:30,442 INFO L231 Difference]: Finished difference. Result has 136 places, 103 transitions, 361 flow [2022-10-17 10:47:30,442 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=361, PETRI_PLACES=136, PETRI_TRANSITIONS=103} [2022-10-17 10:47:30,443 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 19 predicate places. [2022-10-17 10:47:30,443 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 103 transitions, 361 flow [2022-10-17 10:47:30,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.16666666666667) internal successors, (559), 6 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:30,444 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:47:30,444 INFO L208 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] [2022-10-17 10:47:30,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-17 10:47:30,445 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-10-17 10:47:30,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:47:30,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1553593508, now seen corresponding path program 1 times [2022-10-17 10:47:30,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:47:30,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463023625] [2022-10-17 10:47:30,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:47:30,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:47:30,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:47:30,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:47:30,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:47:30,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463023625] [2022-10-17 10:47:30,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463023625] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:47:30,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:47:30,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-17 10:47:30,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338249399] [2022-10-17 10:47:30,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:47:30,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-17 10:47:30,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:47:30,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-17 10:47:30,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-10-17 10:47:30,914 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 112 [2022-10-17 10:47:30,915 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 103 transitions, 361 flow. Second operand has 8 states, 8 states have (on average 91.75) internal successors, (734), 8 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:30,915 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:47:30,916 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 112 [2022-10-17 10:47:30,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:47:31,501 INFO L130 PetriNetUnfolder]: 392/1091 cut-off events. [2022-10-17 10:47:31,501 INFO L131 PetriNetUnfolder]: For 5658/5759 co-relation queries the response was YES. [2022-10-17 10:47:31,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4173 conditions, 1091 events. 392/1091 cut-off events. For 5658/5759 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 7159 event pairs, 128 based on Foata normal form. 25/1029 useless extension candidates. Maximal degree in co-relation 4093. Up to 396 conditions per place. [2022-10-17 10:47:31,520 INFO L137 encePairwiseOnDemand]: 102/112 looper letters, 26 selfloop transitions, 8 changer transitions 19/133 dead transitions. [2022-10-17 10:47:31,520 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 133 transitions, 693 flow [2022-10-17 10:47:31,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-17 10:47:31,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-10-17 10:47:31,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1040 transitions. [2022-10-17 10:47:31,525 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8441558441558441 [2022-10-17 10:47:31,525 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1040 transitions. [2022-10-17 10:47:31,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1040 transitions. [2022-10-17 10:47:31,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:47:31,527 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1040 transitions. [2022-10-17 10:47:31,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 94.54545454545455) internal successors, (1040), 11 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:31,533 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 112.0) internal successors, (1344), 12 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:31,534 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 112.0) internal successors, (1344), 12 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:31,534 INFO L175 Difference]: Start difference. First operand has 136 places, 103 transitions, 361 flow. Second operand 11 states and 1040 transitions. [2022-10-17 10:47:31,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 133 transitions, 693 flow [2022-10-17 10:47:31,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 133 transitions, 644 flow, removed 23 selfloop flow, removed 7 redundant places. [2022-10-17 10:47:31,550 INFO L231 Difference]: Finished difference. Result has 140 places, 106 transitions, 394 flow [2022-10-17 10:47:31,551 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=394, PETRI_PLACES=140, PETRI_TRANSITIONS=106} [2022-10-17 10:47:31,554 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 23 predicate places. [2022-10-17 10:47:31,554 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 106 transitions, 394 flow [2022-10-17 10:47:31,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 91.75) internal successors, (734), 8 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:31,555 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:47:31,555 INFO L208 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] [2022-10-17 10:47:31,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-17 10:47:31,555 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-10-17 10:47:31,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:47:31,556 INFO L85 PathProgramCache]: Analyzing trace with hash 703272026, now seen corresponding path program 2 times [2022-10-17 10:47:31,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:47:31,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207840617] [2022-10-17 10:47:31,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:47:31,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:47:31,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:47:32,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:47:32,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:47:32,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207840617] [2022-10-17 10:47:32,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207840617] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:47:32,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:47:32,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-10-17 10:47:32,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015545571] [2022-10-17 10:47:32,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:47:32,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-17 10:47:32,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:47:32,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-17 10:47:32,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-10-17 10:47:32,355 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 112 [2022-10-17 10:47:32,357 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 106 transitions, 394 flow. Second operand has 10 states, 10 states have (on average 90.5) internal successors, (905), 10 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:32,357 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:47:32,358 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 112 [2022-10-17 10:47:32,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:47:32,912 INFO L130 PetriNetUnfolder]: 349/1001 cut-off events. [2022-10-17 10:47:32,913 INFO L131 PetriNetUnfolder]: For 5363/5644 co-relation queries the response was YES. [2022-10-17 10:47:32,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3963 conditions, 1001 events. 349/1001 cut-off events. For 5363/5644 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6418 event pairs, 112 based on Foata normal form. 28/962 useless extension candidates. Maximal degree in co-relation 3879. Up to 360 conditions per place. [2022-10-17 10:47:32,931 INFO L137 encePairwiseOnDemand]: 103/112 looper letters, 24 selfloop transitions, 7 changer transitions 19/129 dead transitions. [2022-10-17 10:47:32,931 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 129 transitions, 678 flow [2022-10-17 10:47:32,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-17 10:47:32,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-10-17 10:47:32,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1113 transitions. [2022-10-17 10:47:32,936 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.828125 [2022-10-17 10:47:32,936 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1113 transitions. [2022-10-17 10:47:32,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1113 transitions. [2022-10-17 10:47:32,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:47:32,938 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1113 transitions. [2022-10-17 10:47:32,942 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 92.75) internal successors, (1113), 12 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:32,946 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 112.0) internal successors, (1456), 13 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:32,947 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 112.0) internal successors, (1456), 13 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:32,947 INFO L175 Difference]: Start difference. First operand has 140 places, 106 transitions, 394 flow. Second operand 12 states and 1113 transitions. [2022-10-17 10:47:32,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 129 transitions, 678 flow [2022-10-17 10:47:32,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 129 transitions, 623 flow, removed 23 selfloop flow, removed 8 redundant places. [2022-10-17 10:47:32,965 INFO L231 Difference]: Finished difference. Result has 144 places, 106 transitions, 395 flow [2022-10-17 10:47:32,965 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=395, PETRI_PLACES=144, PETRI_TRANSITIONS=106} [2022-10-17 10:47:32,966 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 27 predicate places. [2022-10-17 10:47:32,966 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 106 transitions, 395 flow [2022-10-17 10:47:32,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 90.5) internal successors, (905), 10 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:32,967 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:47:32,968 INFO L208 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] [2022-10-17 10:47:32,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-17 10:47:32,968 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-10-17 10:47:32,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:47:32,969 INFO L85 PathProgramCache]: Analyzing trace with hash 289013689, now seen corresponding path program 1 times [2022-10-17 10:47:32,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:47:32,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097406469] [2022-10-17 10:47:32,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:47:32,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:47:33,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:47:33,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:47:33,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:47:33,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097406469] [2022-10-17 10:47:33,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097406469] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:47:33,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:47:33,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-17 10:47:33,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799134391] [2022-10-17 10:47:33,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:47:33,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-17 10:47:33,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:47:33,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-17 10:47:33,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-17 10:47:33,284 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 112 [2022-10-17 10:47:33,285 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 106 transitions, 395 flow. Second operand has 6 states, 6 states have (on average 93.16666666666667) internal successors, (559), 6 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:33,285 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:47:33,285 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 112 [2022-10-17 10:47:33,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:47:33,894 INFO L130 PetriNetUnfolder]: 454/1514 cut-off events. [2022-10-17 10:47:33,894 INFO L131 PetriNetUnfolder]: For 7796/8228 co-relation queries the response was YES. [2022-10-17 10:47:33,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5812 conditions, 1514 events. 454/1514 cut-off events. For 7796/8228 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 11842 event pairs, 118 based on Foata normal form. 42/1468 useless extension candidates. Maximal degree in co-relation 5728. Up to 308 conditions per place. [2022-10-17 10:47:33,964 INFO L137 encePairwiseOnDemand]: 106/112 looper letters, 39 selfloop transitions, 12 changer transitions 6/138 dead transitions. [2022-10-17 10:47:33,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 138 transitions, 784 flow [2022-10-17 10:47:33,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-17 10:47:33,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-10-17 10:47:33,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 867 transitions. [2022-10-17 10:47:33,968 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8601190476190477 [2022-10-17 10:47:33,969 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 867 transitions. [2022-10-17 10:47:33,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 867 transitions. [2022-10-17 10:47:33,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:47:33,970 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 867 transitions. [2022-10-17 10:47:33,973 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 96.33333333333333) internal successors, (867), 9 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:33,976 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:33,977 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:33,977 INFO L175 Difference]: Start difference. First operand has 144 places, 106 transitions, 395 flow. Second operand 9 states and 867 transitions. [2022-10-17 10:47:33,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 138 transitions, 784 flow [2022-10-17 10:47:34,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 138 transitions, 699 flow, removed 37 selfloop flow, removed 13 redundant places. [2022-10-17 10:47:34,010 INFO L231 Difference]: Finished difference. Result has 140 places, 115 transitions, 502 flow [2022-10-17 10:47:34,010 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=502, PETRI_PLACES=140, PETRI_TRANSITIONS=115} [2022-10-17 10:47:34,013 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 23 predicate places. [2022-10-17 10:47:34,014 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 115 transitions, 502 flow [2022-10-17 10:47:34,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.16666666666667) internal successors, (559), 6 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:34,014 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:47:34,014 INFO L208 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] [2022-10-17 10:47:34,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-17 10:47:34,015 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-10-17 10:47:34,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:47:34,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1942204875, now seen corresponding path program 1 times [2022-10-17 10:47:34,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:47:34,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837736424] [2022-10-17 10:47:34,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:47:34,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:47:34,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:47:34,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:47:34,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:47:34,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837736424] [2022-10-17 10:47:34,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837736424] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:47:34,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:47:34,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-10-17 10:47:34,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938828129] [2022-10-17 10:47:34,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:47:34,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-17 10:47:34,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:47:34,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-17 10:47:34,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-10-17 10:47:34,987 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 112 [2022-10-17 10:47:34,988 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 115 transitions, 502 flow. Second operand has 10 states, 10 states have (on average 90.5) internal successors, (905), 10 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:34,989 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:47:34,989 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 112 [2022-10-17 10:47:34,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:47:35,759 INFO L130 PetriNetUnfolder]: 630/1903 cut-off events. [2022-10-17 10:47:35,759 INFO L131 PetriNetUnfolder]: For 9374/9583 co-relation queries the response was YES. [2022-10-17 10:47:35,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7298 conditions, 1903 events. 630/1903 cut-off events. For 9374/9583 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 16041 event pairs, 242 based on Foata normal form. 53/1812 useless extension candidates. Maximal degree in co-relation 7216. Up to 552 conditions per place. [2022-10-17 10:47:35,785 INFO L137 encePairwiseOnDemand]: 101/112 looper letters, 20 selfloop transitions, 10 changer transitions 41/150 dead transitions. [2022-10-17 10:47:35,785 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 150 transitions, 944 flow [2022-10-17 10:47:35,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-17 10:47:35,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-10-17 10:47:35,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1206 transitions. [2022-10-17 10:47:35,790 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8282967032967034 [2022-10-17 10:47:35,790 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1206 transitions. [2022-10-17 10:47:35,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1206 transitions. [2022-10-17 10:47:35,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:47:35,791 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1206 transitions. [2022-10-17 10:47:35,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 92.76923076923077) internal successors, (1206), 13 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:35,799 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:35,800 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:35,800 INFO L175 Difference]: Start difference. First operand has 140 places, 115 transitions, 502 flow. Second operand 13 states and 1206 transitions. [2022-10-17 10:47:35,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 150 transitions, 944 flow [2022-10-17 10:47:35,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 150 transitions, 883 flow, removed 29 selfloop flow, removed 1 redundant places. [2022-10-17 10:47:35,850 INFO L231 Difference]: Finished difference. Result has 158 places, 107 transitions, 434 flow [2022-10-17 10:47:35,850 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=434, PETRI_PLACES=158, PETRI_TRANSITIONS=107} [2022-10-17 10:47:35,851 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 41 predicate places. [2022-10-17 10:47:35,851 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 107 transitions, 434 flow [2022-10-17 10:47:35,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 90.5) internal successors, (905), 10 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:35,852 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:47:35,852 INFO L208 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-10-17 10:47:35,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-17 10:47:35,854 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-10-17 10:47:35,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:47:35,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1635822944, now seen corresponding path program 1 times [2022-10-17 10:47:35,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:47:35,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000479862] [2022-10-17 10:47:35,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:47:35,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:47:35,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:47:36,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:47:36,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:47:36,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000479862] [2022-10-17 10:47:36,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000479862] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:47:36,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:47:36,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-10-17 10:47:36,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595824005] [2022-10-17 10:47:36,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:47:36,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-10-17 10:47:36,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:47:36,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-10-17 10:47:36,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-10-17 10:47:36,820 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 112 [2022-10-17 10:47:36,822 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 107 transitions, 434 flow. Second operand has 11 states, 11 states have (on average 90.45454545454545) internal successors, (995), 11 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:36,822 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:47:36,822 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 112 [2022-10-17 10:47:36,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:47:37,496 INFO L130 PetriNetUnfolder]: 321/1098 cut-off events. [2022-10-17 10:47:37,496 INFO L131 PetriNetUnfolder]: For 10015/10197 co-relation queries the response was YES. [2022-10-17 10:47:37,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5057 conditions, 1098 events. 321/1098 cut-off events. For 10015/10197 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 7949 event pairs, 133 based on Foata normal form. 40/1033 useless extension candidates. Maximal degree in co-relation 4964. Up to 342 conditions per place. [2022-10-17 10:47:37,516 INFO L137 encePairwiseOnDemand]: 101/112 looper letters, 26 selfloop transitions, 9 changer transitions 19/133 dead transitions. [2022-10-17 10:47:37,517 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 133 transitions, 810 flow [2022-10-17 10:47:37,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-17 10:47:37,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-10-17 10:47:37,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1205 transitions. [2022-10-17 10:47:37,522 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8276098901098901 [2022-10-17 10:47:37,523 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1205 transitions. [2022-10-17 10:47:37,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1205 transitions. [2022-10-17 10:47:37,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:47:37,524 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1205 transitions. [2022-10-17 10:47:37,528 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-10-17 10:47:37,533 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:37,534 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:37,534 INFO L175 Difference]: Start difference. First operand has 158 places, 107 transitions, 434 flow. Second operand 13 states and 1205 transitions. [2022-10-17 10:47:37,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 133 transitions, 810 flow [2022-10-17 10:47:37,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 133 transitions, 743 flow, removed 26 selfloop flow, removed 14 redundant places. [2022-10-17 10:47:37,558 INFO L231 Difference]: Finished difference. Result has 151 places, 109 transitions, 465 flow [2022-10-17 10:47:37,559 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=465, PETRI_PLACES=151, PETRI_TRANSITIONS=109} [2022-10-17 10:47:37,560 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 34 predicate places. [2022-10-17 10:47:37,560 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 109 transitions, 465 flow [2022-10-17 10:47:37,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 90.45454545454545) internal successors, (995), 11 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:37,561 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:47:37,561 INFO L208 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-10-17 10:47:37,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-17 10:47:37,562 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-10-17 10:47:37,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:47:37,562 INFO L85 PathProgramCache]: Analyzing trace with hash 423310144, now seen corresponding path program 2 times [2022-10-17 10:47:37,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:47:37,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169714884] [2022-10-17 10:47:37,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:47:37,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:47:37,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:47:38,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:47:38,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:47:38,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169714884] [2022-10-17 10:47:38,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169714884] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:47:38,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:47:38,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-10-17 10:47:38,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73985689] [2022-10-17 10:47:38,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:47:38,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-10-17 10:47:38,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:47:38,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-10-17 10:47:38,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-10-17 10:47:38,355 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 112 [2022-10-17 10:47:38,357 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 109 transitions, 465 flow. Second operand has 11 states, 11 states have (on average 88.63636363636364) internal successors, (975), 11 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:38,357 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:47:38,357 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 112 [2022-10-17 10:47:38,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:47:38,995 INFO L130 PetriNetUnfolder]: 256/957 cut-off events. [2022-10-17 10:47:38,995 INFO L131 PetriNetUnfolder]: For 10264/10667 co-relation queries the response was YES. [2022-10-17 10:47:39,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4758 conditions, 957 events. 256/957 cut-off events. For 10264/10667 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 6955 event pairs, 87 based on Foata normal form. 38/904 useless extension candidates. Maximal degree in co-relation 4666. Up to 238 conditions per place. [2022-10-17 10:47:39,013 INFO L137 encePairwiseOnDemand]: 101/112 looper letters, 30 selfloop transitions, 11 changer transitions 19/137 dead transitions. [2022-10-17 10:47:39,013 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 137 transitions, 1001 flow [2022-10-17 10:47:39,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-17 10:47:39,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-10-17 10:47:39,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1182 transitions. [2022-10-17 10:47:39,018 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8118131868131868 [2022-10-17 10:47:39,018 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1182 transitions. [2022-10-17 10:47:39,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1182 transitions. [2022-10-17 10:47:39,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:47:39,019 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1182 transitions. [2022-10-17 10:47:39,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 90.92307692307692) internal successors, (1182), 13 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:39,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:39,029 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:39,029 INFO L175 Difference]: Start difference. First operand has 151 places, 109 transitions, 465 flow. Second operand 13 states and 1182 transitions. [2022-10-17 10:47:39,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 137 transitions, 1001 flow [2022-10-17 10:47:39,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 137 transitions, 885 flow, removed 51 selfloop flow, removed 11 redundant places. [2022-10-17 10:47:39,052 INFO L231 Difference]: Finished difference. Result has 153 places, 111 transitions, 508 flow [2022-10-17 10:47:39,052 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=419, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=508, PETRI_PLACES=153, PETRI_TRANSITIONS=111} [2022-10-17 10:47:39,053 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 36 predicate places. [2022-10-17 10:47:39,054 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 111 transitions, 508 flow [2022-10-17 10:47:39,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 88.63636363636364) internal successors, (975), 11 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:39,054 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:47:39,055 INFO L208 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] [2022-10-17 10:47:39,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-17 10:47:39,056 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-10-17 10:47:39,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:47:39,057 INFO L85 PathProgramCache]: Analyzing trace with hash -243566072, now seen corresponding path program 1 times [2022-10-17 10:47:39,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:47:39,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673216307] [2022-10-17 10:47:39,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:47:39,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:47:39,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:47:40,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:47:40,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:47:40,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673216307] [2022-10-17 10:47:40,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673216307] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:47:40,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:47:40,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-10-17 10:47:40,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197058888] [2022-10-17 10:47:40,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:47:40,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-10-17 10:47:40,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:47:40,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-10-17 10:47:40,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-10-17 10:47:40,169 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 112 [2022-10-17 10:47:40,171 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 111 transitions, 508 flow. Second operand has 11 states, 11 states have (on average 89.63636363636364) internal successors, (986), 11 states have internal predecessors, (986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:40,171 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:47:40,171 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 112 [2022-10-17 10:47:40,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:47:40,690 INFO L130 PetriNetUnfolder]: 190/820 cut-off events. [2022-10-17 10:47:40,691 INFO L131 PetriNetUnfolder]: For 8876/9106 co-relation queries the response was YES. [2022-10-17 10:47:40,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3904 conditions, 820 events. 190/820 cut-off events. For 8876/9106 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5653 event pairs, 72 based on Foata normal form. 28/774 useless extension candidates. Maximal degree in co-relation 3812. Up to 280 conditions per place. [2022-10-17 10:47:40,713 INFO L137 encePairwiseOnDemand]: 100/112 looper letters, 29 selfloop transitions, 11 changer transitions 10/128 dead transitions. [2022-10-17 10:47:40,714 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 128 transitions, 852 flow [2022-10-17 10:47:40,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-17 10:47:40,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-10-17 10:47:40,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1185 transitions. [2022-10-17 10:47:40,717 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8138736263736264 [2022-10-17 10:47:40,717 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1185 transitions. [2022-10-17 10:47:40,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1185 transitions. [2022-10-17 10:47:40,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:47:40,719 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1185 transitions. [2022-10-17 10:47:40,724 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 91.15384615384616) internal successors, (1185), 13 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:40,727 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:40,728 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:40,728 INFO L175 Difference]: Start difference. First operand has 153 places, 111 transitions, 508 flow. Second operand 13 states and 1185 transitions. [2022-10-17 10:47:40,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 128 transitions, 852 flow [2022-10-17 10:47:40,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 128 transitions, 767 flow, removed 38 selfloop flow, removed 10 redundant places. [2022-10-17 10:47:40,755 INFO L231 Difference]: Finished difference. Result has 156 places, 113 transitions, 546 flow [2022-10-17 10:47:40,755 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=546, PETRI_PLACES=156, PETRI_TRANSITIONS=113} [2022-10-17 10:47:40,756 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 39 predicate places. [2022-10-17 10:47:40,757 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 113 transitions, 546 flow [2022-10-17 10:47:40,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 89.63636363636364) internal successors, (986), 11 states have internal predecessors, (986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:40,757 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:47:40,758 INFO L208 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] [2022-10-17 10:47:40,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-17 10:47:40,758 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-10-17 10:47:40,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:47:40,759 INFO L85 PathProgramCache]: Analyzing trace with hash 895466230, now seen corresponding path program 2 times [2022-10-17 10:47:40,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:47:40,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668347266] [2022-10-17 10:47:40,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:47:40,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:47:40,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:47:41,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:47:41,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:47:41,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668347266] [2022-10-17 10:47:41,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668347266] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:47:41,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:47:41,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-10-17 10:47:41,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127185562] [2022-10-17 10:47:41,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:47:41,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-10-17 10:47:41,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:47:41,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-10-17 10:47:41,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-10-17 10:47:41,767 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 112 [2022-10-17 10:47:41,769 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 113 transitions, 546 flow. Second operand has 13 states, 13 states have (on average 87.53846153846153) internal successors, (1138), 13 states have internal predecessors, (1138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:41,769 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:47:41,769 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 112 [2022-10-17 10:47:41,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:47:42,298 INFO L130 PetriNetUnfolder]: 191/821 cut-off events. [2022-10-17 10:47:42,299 INFO L131 PetriNetUnfolder]: For 9287/9781 co-relation queries the response was YES. [2022-10-17 10:47:42,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3967 conditions, 821 events. 191/821 cut-off events. For 9287/9781 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5780 event pairs, 74 based on Foata normal form. 23/771 useless extension candidates. Maximal degree in co-relation 3872. Up to 280 conditions per place. [2022-10-17 10:47:42,314 INFO L137 encePairwiseOnDemand]: 100/112 looper letters, 29 selfloop transitions, 15 changer transitions 10/130 dead transitions. [2022-10-17 10:47:42,314 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 130 transitions, 908 flow [2022-10-17 10:47:42,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-17 10:47:42,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-10-17 10:47:42,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1246 transitions. [2022-10-17 10:47:42,318 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7946428571428571 [2022-10-17 10:47:42,318 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1246 transitions. [2022-10-17 10:47:42,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1246 transitions. [2022-10-17 10:47:42,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:47:42,319 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1246 transitions. [2022-10-17 10:47:42,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 89.0) internal successors, (1246), 14 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:42,335 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 112.0) internal successors, (1680), 15 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:42,344 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 112.0) internal successors, (1680), 15 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:42,345 INFO L175 Difference]: Start difference. First operand has 156 places, 113 transitions, 546 flow. Second operand 14 states and 1246 transitions. [2022-10-17 10:47:42,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 130 transitions, 908 flow [2022-10-17 10:47:42,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 130 transitions, 813 flow, removed 37 selfloop flow, removed 11 redundant places. [2022-10-17 10:47:42,374 INFO L231 Difference]: Finished difference. Result has 160 places, 117 transitions, 614 flow [2022-10-17 10:47:42,375 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=614, PETRI_PLACES=160, PETRI_TRANSITIONS=117} [2022-10-17 10:47:42,376 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 43 predicate places. [2022-10-17 10:47:42,376 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 117 transitions, 614 flow [2022-10-17 10:47:42,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 87.53846153846153) internal successors, (1138), 13 states have internal predecessors, (1138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:42,377 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:47:42,377 INFO L208 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] [2022-10-17 10:47:42,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-10-17 10:47:42,378 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-10-17 10:47:42,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:47:42,378 INFO L85 PathProgramCache]: Analyzing trace with hash -693206800, now seen corresponding path program 3 times [2022-10-17 10:47:42,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:47:42,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516309270] [2022-10-17 10:47:42,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:47:42,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:47:42,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:47:43,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:47:43,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:47:43,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516309270] [2022-10-17 10:47:43,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516309270] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:47:43,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:47:43,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-10-17 10:47:43,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763401688] [2022-10-17 10:47:43,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:47:43,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-10-17 10:47:43,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:47:43,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-10-17 10:47:43,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-10-17 10:47:43,326 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 112 [2022-10-17 10:47:43,327 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 117 transitions, 614 flow. Second operand has 11 states, 11 states have (on average 88.72727272727273) internal successors, (976), 11 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:43,328 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:47:43,328 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 112 [2022-10-17 10:47:43,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:47:43,802 INFO L130 PetriNetUnfolder]: 150/781 cut-off events. [2022-10-17 10:47:43,803 INFO L131 PetriNetUnfolder]: For 7212/7744 co-relation queries the response was YES. [2022-10-17 10:47:43,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3447 conditions, 781 events. 150/781 cut-off events. For 7212/7744 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5718 event pairs, 38 based on Foata normal form. 24/739 useless extension candidates. Maximal degree in co-relation 3350. Up to 139 conditions per place. [2022-10-17 10:47:43,818 INFO L137 encePairwiseOnDemand]: 102/112 looper letters, 34 selfloop transitions, 12 changer transitions 10/133 dead transitions. [2022-10-17 10:47:43,818 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 133 transitions, 966 flow [2022-10-17 10:47:43,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-17 10:47:43,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-10-17 10:47:43,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1173 transitions. [2022-10-17 10:47:43,824 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8056318681318682 [2022-10-17 10:47:43,825 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1173 transitions. [2022-10-17 10:47:43,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1173 transitions. [2022-10-17 10:47:43,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:47:43,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1173 transitions. [2022-10-17 10:47:43,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 90.23076923076923) internal successors, (1173), 13 states have internal predecessors, (1173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:43,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:43,832 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:43,832 INFO L175 Difference]: Start difference. First operand has 160 places, 117 transitions, 614 flow. Second operand 13 states and 1173 transitions. [2022-10-17 10:47:43,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 133 transitions, 966 flow [2022-10-17 10:47:43,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 133 transitions, 837 flow, removed 58 selfloop flow, removed 10 redundant places. [2022-10-17 10:47:43,860 INFO L231 Difference]: Finished difference. Result has 163 places, 117 transitions, 588 flow [2022-10-17 10:47:43,861 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=545, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=588, PETRI_PLACES=163, PETRI_TRANSITIONS=117} [2022-10-17 10:47:43,862 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 46 predicate places. [2022-10-17 10:47:43,862 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 117 transitions, 588 flow [2022-10-17 10:47:43,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 88.72727272727273) internal successors, (976), 11 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:43,863 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:47:43,863 INFO L208 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] [2022-10-17 10:47:43,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-10-17 10:47:43,863 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-10-17 10:47:43,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:47:43,864 INFO L85 PathProgramCache]: Analyzing trace with hash 732521874, now seen corresponding path program 1 times [2022-10-17 10:47:43,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:47:43,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091079869] [2022-10-17 10:47:43,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:47:43,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:47:43,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:47:44,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:47:44,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:47:44,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091079869] [2022-10-17 10:47:44,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091079869] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:47:44,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:47:44,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-17 10:47:44,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128685822] [2022-10-17 10:47:44,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:47:44,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-17 10:47:44,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:47:44,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-17 10:47:44,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-17 10:47:44,096 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 112 [2022-10-17 10:47:44,097 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 117 transitions, 588 flow. Second operand has 6 states, 6 states have (on average 91.33333333333333) internal successors, (548), 6 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:44,097 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:47:44,097 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 112 [2022-10-17 10:47:44,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:47:45,598 INFO L130 PetriNetUnfolder]: 3068/5981 cut-off events. [2022-10-17 10:47:45,598 INFO L131 PetriNetUnfolder]: For 35336/35884 co-relation queries the response was YES. [2022-10-17 10:47:45,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20979 conditions, 5981 events. 3068/5981 cut-off events. For 35336/35884 co-relation queries the response was YES. Maximal size of possible extension queue 567. Compared 49216 event pairs, 106 based on Foata normal form. 387/5979 useless extension candidates. Maximal degree in co-relation 20886. Up to 2057 conditions per place. [2022-10-17 10:47:45,674 INFO L137 encePairwiseOnDemand]: 102/112 looper letters, 47 selfloop transitions, 6 changer transitions 107/240 dead transitions. [2022-10-17 10:47:45,675 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 240 transitions, 2122 flow [2022-10-17 10:47:45,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-17 10:47:45,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-10-17 10:47:45,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 964 transitions. [2022-10-17 10:47:45,680 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8607142857142858 [2022-10-17 10:47:45,680 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 964 transitions. [2022-10-17 10:47:45,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 964 transitions. [2022-10-17 10:47:45,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:47:45,681 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 964 transitions. [2022-10-17 10:47:45,683 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 96.4) internal successors, (964), 10 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:45,686 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:45,686 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:45,687 INFO L175 Difference]: Start difference. First operand has 163 places, 117 transitions, 588 flow. Second operand 10 states and 964 transitions. [2022-10-17 10:47:45,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 240 transitions, 2122 flow [2022-10-17 10:47:45,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 240 transitions, 1913 flow, removed 67 selfloop flow, removed 14 redundant places. [2022-10-17 10:47:45,845 INFO L231 Difference]: Finished difference. Result has 158 places, 113 transitions, 537 flow [2022-10-17 10:47:45,846 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=533, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=537, PETRI_PLACES=158, PETRI_TRANSITIONS=113} [2022-10-17 10:47:45,846 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 41 predicate places. [2022-10-17 10:47:45,846 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 113 transitions, 537 flow [2022-10-17 10:47:45,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.33333333333333) internal successors, (548), 6 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:45,847 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:47:45,847 INFO L208 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-10-17 10:47:45,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-10-17 10:47:45,848 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-10-17 10:47:45,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:47:45,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1639052179, now seen corresponding path program 1 times [2022-10-17 10:47:45,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:47:45,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270506225] [2022-10-17 10:47:45,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:47:45,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:47:45,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:47:46,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:47:46,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:47:46,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270506225] [2022-10-17 10:47:46,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270506225] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:47:46,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:47:46,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-17 10:47:46,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626022846] [2022-10-17 10:47:46,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:47:46,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-17 10:47:46,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:47:46,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-17 10:47:46,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-10-17 10:47:46,095 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 112 [2022-10-17 10:47:46,096 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 113 transitions, 537 flow. Second operand has 7 states, 7 states have (on average 91.14285714285714) internal successors, (638), 7 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:46,096 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:47:46,096 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 112 [2022-10-17 10:47:46,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:47:46,828 INFO L130 PetriNetUnfolder]: 684/1883 cut-off events. [2022-10-17 10:47:46,828 INFO L131 PetriNetUnfolder]: For 8579/8763 co-relation queries the response was YES. [2022-10-17 10:47:46,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7406 conditions, 1883 events. 684/1883 cut-off events. For 8579/8763 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 14815 event pairs, 26 based on Foata normal form. 179/2015 useless extension candidates. Maximal degree in co-relation 7317. Up to 595 conditions per place. [2022-10-17 10:47:46,847 INFO L137 encePairwiseOnDemand]: 103/112 looper letters, 42 selfloop transitions, 9 changer transitions 71/201 dead transitions. [2022-10-17 10:47:46,847 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 201 transitions, 1654 flow [2022-10-17 10:47:46,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-17 10:47:46,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-10-17 10:47:46,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 962 transitions. [2022-10-17 10:47:46,854 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8589285714285714 [2022-10-17 10:47:46,854 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 962 transitions. [2022-10-17 10:47:46,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 962 transitions. [2022-10-17 10:47:46,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:47:46,855 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 962 transitions. [2022-10-17 10:47:46,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 96.2) internal successors, (962), 10 states have internal predecessors, (962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:46,860 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:46,860 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:46,862 INFO L175 Difference]: Start difference. First operand has 158 places, 113 transitions, 537 flow. Second operand 10 states and 962 transitions. [2022-10-17 10:47:46,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 201 transitions, 1654 flow [2022-10-17 10:47:46,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 201 transitions, 1522 flow, removed 17 selfloop flow, removed 13 redundant places. [2022-10-17 10:47:46,889 INFO L231 Difference]: Finished difference. Result has 154 places, 113 transitions, 549 flow [2022-10-17 10:47:46,889 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=549, PETRI_PLACES=154, PETRI_TRANSITIONS=113} [2022-10-17 10:47:46,890 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 37 predicate places. [2022-10-17 10:47:46,891 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 113 transitions, 549 flow [2022-10-17 10:47:46,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.14285714285714) internal successors, (638), 7 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:46,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:47:46,893 INFO L208 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-10-17 10:47:46,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-10-17 10:47:46,894 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-10-17 10:47:46,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:47:46,894 INFO L85 PathProgramCache]: Analyzing trace with hash 2020955958, now seen corresponding path program 1 times [2022-10-17 10:47:46,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:47:46,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532862030] [2022-10-17 10:47:46,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:47:46,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:47:46,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:47:47,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:47:47,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:47:47,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532862030] [2022-10-17 10:47:47,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532862030] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:47:47,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:47:47,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-17 10:47:47,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658875181] [2022-10-17 10:47:47,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:47:47,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-17 10:47:47,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:47:47,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-17 10:47:47,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-10-17 10:47:47,202 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 112 [2022-10-17 10:47:47,203 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 113 transitions, 549 flow. Second operand has 8 states, 8 states have (on average 91.0) internal successors, (728), 8 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:47,203 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:47:47,203 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 112 [2022-10-17 10:47:47,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:47:47,603 INFO L130 PetriNetUnfolder]: 188/789 cut-off events. [2022-10-17 10:47:47,603 INFO L131 PetriNetUnfolder]: For 3691/3803 co-relation queries the response was YES. [2022-10-17 10:47:47,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3045 conditions, 789 events. 188/789 cut-off events. For 3691/3803 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5485 event pairs, 2 based on Foata normal form. 68/837 useless extension candidates. Maximal degree in co-relation 2958. Up to 213 conditions per place. [2022-10-17 10:47:47,611 INFO L137 encePairwiseOnDemand]: 103/112 looper letters, 20 selfloop transitions, 12 changer transitions 54/160 dead transitions. [2022-10-17 10:47:47,611 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 160 transitions, 1168 flow [2022-10-17 10:47:47,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-17 10:47:47,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-10-17 10:47:47,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1033 transitions. [2022-10-17 10:47:47,615 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.838474025974026 [2022-10-17 10:47:47,615 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1033 transitions. [2022-10-17 10:47:47,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1033 transitions. [2022-10-17 10:47:47,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:47:47,616 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1033 transitions. [2022-10-17 10:47:47,619 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 93.9090909090909) internal successors, (1033), 11 states have internal predecessors, (1033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:47,622 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 112.0) internal successors, (1344), 12 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:47,623 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 112.0) internal successors, (1344), 12 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:47,623 INFO L175 Difference]: Start difference. First operand has 154 places, 113 transitions, 549 flow. Second operand 11 states and 1033 transitions. [2022-10-17 10:47:47,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 160 transitions, 1168 flow [2022-10-17 10:47:47,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 160 transitions, 927 flow, removed 106 selfloop flow, removed 17 redundant places. [2022-10-17 10:47:47,646 INFO L231 Difference]: Finished difference. Result has 149 places, 100 transitions, 376 flow [2022-10-17 10:47:47,646 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=376, PETRI_PLACES=149, PETRI_TRANSITIONS=100} [2022-10-17 10:47:47,647 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 32 predicate places. [2022-10-17 10:47:47,647 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 100 transitions, 376 flow [2022-10-17 10:47:47,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 91.0) internal successors, (728), 8 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:47:47,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:47:47,648 INFO L208 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-10-17 10:47:47,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-10-17 10:47:47,649 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:47:47,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:47:47,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1355815032, now seen corresponding path program 1 times [2022-10-17 10:47:47,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:47:47,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611443925] [2022-10-17 10:47:47,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:47:47,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:47:47,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:47:47,702 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 10:47:47,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:47:47,833 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-17 10:47:47,833 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-17 10:47:47,834 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-10-17 10:47:47,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-10-17 10:47:47,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-10-17 10:47:47,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-10-17 10:47:47,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-10-17 10:47:47,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-10-17 10:47:47,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-10-17 10:47:47,838 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:47:47,846 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-10-17 10:47:47,847 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-17 10:47:47,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.10 10:47:47 BasicIcfg [2022-10-17 10:47:47,995 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-17 10:47:48,002 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-10-17 10:47:48,003 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-10-17 10:47:48,003 INFO L275 PluginConnector]: Witness Printer initialized [2022-10-17 10:47:48,004 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 10:47:24" (3/4) ... [2022-10-17 10:47:48,005 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-10-17 10:47:48,171 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e531cf4b-13db-424b-827d-dc7777bf0055/bin/uautomizer-J5u9QxTXDZ/witness.graphml [2022-10-17 10:47:48,171 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-10-17 10:47:48,172 INFO L158 Benchmark]: Toolchain (without parser) took 26270.29ms. Allocated memory was 113.2MB in the beginning and 696.3MB in the end (delta: 583.0MB). Free memory was 80.5MB in the beginning and 318.0MB in the end (delta: -237.5MB). Peak memory consumption was 345.0MB. Max. memory is 16.1GB. [2022-10-17 10:47:48,175 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 113.2MB. Free memory is still 67.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-10-17 10:47:48,175 INFO L158 Benchmark]: CACSL2BoogieTranslator took 616.63ms. Allocated memory is still 113.2MB. Free memory was 80.1MB in the beginning and 71.9MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-10-17 10:47:48,176 INFO L158 Benchmark]: Boogie Procedure Inliner took 98.20ms. Allocated memory is still 113.2MB. Free memory was 71.5MB in the beginning and 68.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-10-17 10:47:48,176 INFO L158 Benchmark]: Boogie Preprocessor took 48.71ms. Allocated memory is still 113.2MB. Free memory was 68.8MB in the beginning and 66.3MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-10-17 10:47:48,177 INFO L158 Benchmark]: RCFGBuilder took 1522.02ms. Allocated memory was 113.2MB in the beginning and 148.9MB in the end (delta: 35.7MB). Free memory was 66.3MB in the beginning and 88.2MB in the end (delta: -21.9MB). Peak memory consumption was 33.8MB. Max. memory is 16.1GB. [2022-10-17 10:47:48,177 INFO L158 Benchmark]: TraceAbstraction took 23807.38ms. Allocated memory was 148.9MB in the beginning and 696.3MB in the end (delta: 547.4MB). Free memory was 87.1MB in the beginning and 342.1MB in the end (delta: -255.0MB). Peak memory consumption was 292.3MB. Max. memory is 16.1GB. [2022-10-17 10:47:48,178 INFO L158 Benchmark]: Witness Printer took 168.90ms. Allocated memory is still 696.3MB. Free memory was 342.1MB in the beginning and 318.0MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-10-17 10:47:48,181 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.24ms. Allocated memory is still 113.2MB. Free memory is still 67.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 616.63ms. Allocated memory is still 113.2MB. Free memory was 80.1MB in the beginning and 71.9MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 98.20ms. Allocated memory is still 113.2MB. Free memory was 71.5MB in the beginning and 68.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.71ms. Allocated memory is still 113.2MB. Free memory was 68.8MB in the beginning and 66.3MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1522.02ms. Allocated memory was 113.2MB in the beginning and 148.9MB in the end (delta: 35.7MB). Free memory was 66.3MB in the beginning and 88.2MB in the end (delta: -21.9MB). Peak memory consumption was 33.8MB. Max. memory is 16.1GB. * TraceAbstraction took 23807.38ms. Allocated memory was 148.9MB in the beginning and 696.3MB in the end (delta: 547.4MB). Free memory was 87.1MB in the beginning and 342.1MB in the end (delta: -255.0MB). Peak memory consumption was 292.3MB. Max. memory is 16.1GB. * Witness Printer took 168.90ms. Allocated memory is still 696.3MB. Free memory was 342.1MB in the beginning and 318.0MB 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] [L710] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L711] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L713] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L715] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L716] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L717] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L718] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=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] [L719] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=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] [L720] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=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] [L721] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=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] [L722] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=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] [L723] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=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] [L724] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=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] [L725] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=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] [L726] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=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] [L727] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=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}] [L728] 0 int y$w_buff0; VAL [__unbuffered_cnt=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] [L729] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=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] [L730] 0 int y$w_buff1; VAL [__unbuffered_cnt=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] [L731] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=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] [L733] 0 int z = 0; VAL [__unbuffered_cnt=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] [L734] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=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] [L735] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=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] [L811] 0 pthread_t t2492; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2492={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] [L812] FCALL, FORK 0 pthread_create(&t2492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2492, ((void *)0), P0, ((void *)0))=-2, t2492={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] [L813] 0 pthread_t t2493; VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2492={5:0}, t2493={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] [L814] FCALL, FORK 0 pthread_create(&t2493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2493, ((void *)0), P1, ((void *)0))=-1, t2492={5:0}, t2493={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] [L815] 0 pthread_t t2494; VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2492={5:0}, t2493={6:0}, t2494={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] [L816] FCALL, FORK 0 pthread_create(&t2494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2494, ((void *)0), P2, ((void *)0))=0, t2492={5:0}, t2493={6:0}, t2494={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] [L774] 3 y$w_buff1 = y$w_buff0 [L775] 3 y$w_buff0 = 2 [L776] 3 y$w_buff1_used = y$w_buff0_used [L777] 3 y$w_buff0_used = (_Bool)1 [L778] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L778] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=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] [L786] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L739] 1 z = 2 VAL [__unbuffered_cnt=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=2] [L742] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, 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=2] [L754] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, 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=2] [L757] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, 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=2] [L789] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L789] 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) [L790] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L791] 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 [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L792] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L793] 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 [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L760] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L760] 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) [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L762] 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 [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L764] 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 [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=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=2] [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, 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=2] [L796] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, 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=2] [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2492={5:0}, t2493={6:0}, t2494={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=2] [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, 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=2] [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] 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) [L823] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L824] 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 [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L826] 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 [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y [L833] EXPR 0 !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) [L833] 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) [L834] EXPR 0 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)) [L834] EXPR 0 !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) [L834] EXPR 0 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)) [L834] 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)) [L835] EXPR 0 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)) [L835] EXPR 0 !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) [L835] EXPR 0 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)) [L835] 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)) [L836] EXPR 0 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)) [L836] EXPR 0 !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) [L836] EXPR 0 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)) [L836] 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)) [L837] EXPR 0 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)) [L837] EXPR 0 !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) [L837] EXPR 0 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)) [L837] 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)) [L838] EXPR 0 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)) [L838] EXPR 0 !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) [L838] EXPR 0 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)) [L838] 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)) [L839] EXPR 0 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)) [L839] EXPR 0 !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) [L839] EXPR 0 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)) [L839] 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)) [L840] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L841] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L841] 0 y = y$flush_delayed ? y$mem_tmp : y [L842] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2492={5:0}, t2493={6:0}, t2494={3:0}, weak$$choice0=49, weak$$choice2=0, 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=2] [L844] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=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=2] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=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=2] - 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: 812]: 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: 816]: 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: 814]: 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, 138 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: 23.5s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 11.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 684 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 684 mSDsluCounter, 744 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1113 mSDsCounter, 212 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1935 IncrementalHoareTripleChecker+Invalid, 2147 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 212 mSolverCounterUnsat, 153 mSDtfsCounter, 1935 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 237 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=614occurred in iteration=13, InterpolantAutomatonStates: 186, 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, 10.0s InterpolantComputationTime, 1392 NumberOfCodeBlocks, 1392 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1289 ConstructedInterpolants, 0 QuantifiedInterpolants, 7083 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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-10-17 10:47:48,271 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e531cf4b-13db-424b-827d-dc7777bf0055/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0