./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e6840d5-78ee-49fc-a40e-5e677af27c05/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e6840d5-78ee-49fc-a40e-5e677af27c05/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e6840d5-78ee-49fc-a40e-5e677af27c05/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e6840d5-78ee-49fc-a40e-5e677af27c05/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e6840d5-78ee-49fc-a40e-5e677af27c05/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e6840d5-78ee-49fc-a40e-5e677af27c05/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3e08637578a960e5117d483812e56de1a390e4c3bc66da607109cc6e10390727 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 10:55:35,431 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 10:55:35,433 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 10:55:35,468 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 10:55:35,469 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 10:55:35,470 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 10:55:35,471 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 10:55:35,473 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 10:55:35,475 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 10:55:35,476 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 10:55:35,478 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 10:55:35,479 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 10:55:35,480 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 10:55:35,481 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 10:55:35,482 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 10:55:35,484 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 10:55:35,485 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 10:55:35,486 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 10:55:35,488 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 10:55:35,494 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 10:55:35,496 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 10:55:35,497 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 10:55:35,499 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 10:55:35,500 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 10:55:35,504 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 10:55:35,505 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 10:55:35,505 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 10:55:35,506 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 10:55:35,507 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 10:55:35,508 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 10:55:35,509 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 10:55:35,510 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 10:55:35,511 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 10:55:35,512 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 10:55:35,513 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 10:55:35,514 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 10:55:35,515 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 10:55:35,516 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 10:55:35,516 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 10:55:35,517 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 10:55:35,518 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 10:55:35,519 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e6840d5-78ee-49fc-a40e-5e677af27c05/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-16 10:55:35,545 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 10:55:35,546 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 10:55:35,546 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 10:55:35,546 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 10:55:35,547 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 10:55:35,548 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 10:55:35,549 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 10:55:35,549 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 10:55:35,549 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 10:55:35,550 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 10:55:35,550 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 10:55:35,550 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 10:55:35,551 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 10:55:35,551 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 10:55:35,551 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 10:55:35,552 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 10:55:35,552 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 10:55:35,552 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 10:55:35,552 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 10:55:35,553 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 10:55:35,553 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 10:55:35,553 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 10:55:35,554 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 10:55:35,554 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 10:55:35,554 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 10:55:35,554 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 10:55:35,555 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 10:55:35,555 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 10:55:35,555 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 10:55:35,555 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 10:55:35,556 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 10:55:35,556 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 10:55:35,556 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 10:55:35,556 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_8e6840d5-78ee-49fc-a40e-5e677af27c05/bin/uautomizer-tPACEb0tL8/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_8e6840d5-78ee-49fc-a40e-5e677af27c05/bin/uautomizer-tPACEb0tL8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3e08637578a960e5117d483812e56de1a390e4c3bc66da607109cc6e10390727 [2022-11-16 10:55:35,885 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 10:55:35,915 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 10:55:35,918 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 10:55:35,920 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 10:55:35,926 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 10:55:35,928 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e6840d5-78ee-49fc-a40e-5e677af27c05/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/pthread-wmm/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-11-16 10:55:36,049 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e6840d5-78ee-49fc-a40e-5e677af27c05/bin/uautomizer-tPACEb0tL8/data/dc83130af/032abb826ba14fbea0fae5380c429938/FLAG25a6e006d [2022-11-16 10:55:36,722 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 10:55:36,722 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e6840d5-78ee-49fc-a40e-5e677af27c05/sv-benchmarks/c/pthread-wmm/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-11-16 10:55:36,738 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e6840d5-78ee-49fc-a40e-5e677af27c05/bin/uautomizer-tPACEb0tL8/data/dc83130af/032abb826ba14fbea0fae5380c429938/FLAG25a6e006d [2022-11-16 10:55:36,913 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e6840d5-78ee-49fc-a40e-5e677af27c05/bin/uautomizer-tPACEb0tL8/data/dc83130af/032abb826ba14fbea0fae5380c429938 [2022-11-16 10:55:36,917 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 10:55:36,921 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 10:55:36,927 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 10:55:36,928 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 10:55:36,932 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 10:55:36,933 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:55:36" (1/1) ... [2022-11-16 10:55:36,936 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51e99ce4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:55:36, skipping insertion in model container [2022-11-16 10:55:36,937 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:55:36" (1/1) ... [2022-11-16 10:55:36,946 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 10:55:37,030 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 10:55:37,330 WARN L229 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_8e6840d5-78ee-49fc-a40e-5e677af27c05/sv-benchmarks/c/pthread-wmm/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-11-16 10:55:37,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 10:55:37,725 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 10:55:37,742 WARN L229 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_8e6840d5-78ee-49fc-a40e-5e677af27c05/sv-benchmarks/c/pthread-wmm/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-11-16 10:55:37,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 10:55:37,894 INFO L208 MainTranslator]: Completed translation [2022-11-16 10:55:37,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:55:37 WrapperNode [2022-11-16 10:55:37,895 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 10:55:37,897 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 10:55:37,897 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 10:55:37,898 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 10:55:37,908 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:55:37" (1/1) ... [2022-11-16 10:55:37,932 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:55:37" (1/1) ... [2022-11-16 10:55:37,980 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 150 [2022-11-16 10:55:37,981 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 10:55:37,981 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 10:55:37,982 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 10:55:37,982 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 10:55:37,995 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:55:37" (1/1) ... [2022-11-16 10:55:37,995 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:55:37" (1/1) ... [2022-11-16 10:55:38,002 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:55:37" (1/1) ... [2022-11-16 10:55:38,008 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:55:37" (1/1) ... [2022-11-16 10:55:38,016 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:55:37" (1/1) ... [2022-11-16 10:55:38,035 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:55:37" (1/1) ... [2022-11-16 10:55:38,037 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:55:37" (1/1) ... [2022-11-16 10:55:38,039 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:55:37" (1/1) ... [2022-11-16 10:55:38,058 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 10:55:38,059 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 10:55:38,059 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 10:55:38,059 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 10:55:38,061 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:55:37" (1/1) ... [2022-11-16 10:55:38,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 10:55:38,090 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e6840d5-78ee-49fc-a40e-5e677af27c05/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:55:38,105 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e6840d5-78ee-49fc-a40e-5e677af27c05/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 10:55:38,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e6840d5-78ee-49fc-a40e-5e677af27c05/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 10:55:38,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 10:55:38,163 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 10:55:38,163 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 10:55:38,163 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 10:55:38,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 10:55:38,164 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-16 10:55:38,164 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-16 10:55:38,164 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-16 10:55:38,164 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-16 10:55:38,165 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-16 10:55:38,165 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-16 10:55:38,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 10:55:38,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 10:55:38,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 10:55:38,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 10:55:38,168 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 10:55:38,335 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 10:55:38,338 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 10:55:38,860 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 10:55:39,160 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 10:55:39,160 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 10:55:39,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 10:55:39 BoogieIcfgContainer [2022-11-16 10:55:39,164 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 10:55:39,166 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 10:55:39,167 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 10:55:39,171 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 10:55:39,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 10:55:36" (1/3) ... [2022-11-16 10:55:39,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13deae15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:55:39, skipping insertion in model container [2022-11-16 10:55:39,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:55:37" (2/3) ... [2022-11-16 10:55:39,174 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13deae15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:55:39, skipping insertion in model container [2022-11-16 10:55:39,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 10:55:39" (3/3) ... [2022-11-16 10:55:39,176 INFO L112 eAbstractionObserver]: Analyzing ICFG mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-11-16 10:55:39,187 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 10:55:39,201 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 10:55:39,201 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-16 10:55:39,202 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 10:55:39,267 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 10:55:39,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 117 transitions, 249 flow [2022-11-16 10:55:39,430 INFO L130 PetriNetUnfolder]: 2/114 cut-off events. [2022-11-16 10:55:39,431 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 10:55:39,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2022-11-16 10:55:39,438 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 117 transitions, 249 flow [2022-11-16 10:55:39,447 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 114 transitions, 237 flow [2022-11-16 10:55:39,461 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 10:55:39,471 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;@2aef58ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 10:55:39,471 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-16 10:55:39,499 INFO L130 PetriNetUnfolder]: 0/73 cut-off events. [2022-11-16 10:55:39,500 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 10:55:39,500 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:55:39,501 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:55:39,502 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 10:55:39,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:39,509 INFO L85 PathProgramCache]: Analyzing trace with hash 2014837639, now seen corresponding path program 1 times [2022-11-16 10:55:39,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:39,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962522997] [2022-11-16 10:55:39,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:39,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:39,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:40,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 10:55:40,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:40,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962522997] [2022-11-16 10:55:40,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962522997] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:40,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:55:40,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 10:55:40,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851912100] [2022-11-16 10:55:40,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:40,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 10:55:40,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:40,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 10:55:40,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 10:55:40,435 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 117 [2022-11-16 10:55:40,439 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 114 transitions, 237 flow. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:55:40,439 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:55:40,440 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 117 [2022-11-16 10:55:40,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:55:40,574 INFO L130 PetriNetUnfolder]: 17/194 cut-off events. [2022-11-16 10:55:40,575 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-16 10:55:40,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 194 events. 17/194 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 490 event pairs, 3 based on Foata normal form. 9/196 useless extension candidates. Maximal degree in co-relation 193. Up to 27 conditions per place. [2022-11-16 10:55:40,582 INFO L137 encePairwiseOnDemand]: 112/117 looper letters, 10 selfloop transitions, 2 changer transitions 0/113 dead transitions. [2022-11-16 10:55:40,584 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 113 transitions, 259 flow [2022-11-16 10:55:40,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 10:55:40,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 10:55:40,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 329 transitions. [2022-11-16 10:55:40,602 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9373219373219374 [2022-11-16 10:55:40,604 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 329 transitions. [2022-11-16 10:55:40,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 329 transitions. [2022-11-16 10:55:40,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:55:40,610 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 329 transitions. [2022-11-16 10:55:40,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:55:40,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:55:40,622 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:55:40,624 INFO L175 Difference]: Start difference. First operand has 122 places, 114 transitions, 237 flow. Second operand 3 states and 329 transitions. [2022-11-16 10:55:40,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 113 transitions, 259 flow [2022-11-16 10:55:40,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 113 transitions, 256 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-16 10:55:40,634 INFO L231 Difference]: Finished difference. Result has 119 places, 110 transitions, 230 flow [2022-11-16 10:55:40,637 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=230, PETRI_PLACES=119, PETRI_TRANSITIONS=110} [2022-11-16 10:55:40,641 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, -3 predicate places. [2022-11-16 10:55:40,642 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 110 transitions, 230 flow [2022-11-16 10:55:40,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:55:40,643 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:55:40,643 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:55:40,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 10:55:40,644 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 10:55:40,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:40,645 INFO L85 PathProgramCache]: Analyzing trace with hash -2136953671, now seen corresponding path program 1 times [2022-11-16 10:55:40,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:40,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032074992] [2022-11-16 10:55:40,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:40,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:40,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:42,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 10:55:42,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:42,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032074992] [2022-11-16 10:55:42,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032074992] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:42,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:55:42,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 10:55:42,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471723787] [2022-11-16 10:55:42,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:42,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 10:55:42,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:42,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 10:55:42,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 10:55:42,509 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 117 [2022-11-16 10:55:42,512 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 110 transitions, 230 flow. Second operand has 7 states, 7 states have (on average 86.85714285714286) internal successors, (608), 7 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:55:42,512 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:55:42,512 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 117 [2022-11-16 10:55:42,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:55:44,150 INFO L130 PetriNetUnfolder]: 995/2809 cut-off events. [2022-11-16 10:55:44,151 INFO L131 PetriNetUnfolder]: For 57/57 co-relation queries the response was YES. [2022-11-16 10:55:44,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4487 conditions, 2809 events. 995/2809 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 22692 event pairs, 164 based on Foata normal form. 0/2733 useless extension candidates. Maximal degree in co-relation 4425. Up to 585 conditions per place. [2022-11-16 10:55:44,182 INFO L137 encePairwiseOnDemand]: 105/117 looper letters, 35 selfloop transitions, 8 changer transitions 78/191 dead transitions. [2022-11-16 10:55:44,183 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 191 transitions, 618 flow [2022-11-16 10:55:44,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 10:55:44,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-16 10:55:44,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1205 transitions. [2022-11-16 10:55:44,196 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7922419460881 [2022-11-16 10:55:44,196 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1205 transitions. [2022-11-16 10:55:44,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1205 transitions. [2022-11-16 10:55:44,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:55:44,198 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1205 transitions. [2022-11-16 10:55:44,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 92.6923076923077) internal successors, (1205), 13 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:55:44,212 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:55:44,215 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:55:44,215 INFO L175 Difference]: Start difference. First operand has 119 places, 110 transitions, 230 flow. Second operand 13 states and 1205 transitions. [2022-11-16 10:55:44,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 191 transitions, 618 flow [2022-11-16 10:55:44,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 191 transitions, 608 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 10:55:44,226 INFO L231 Difference]: Finished difference. Result has 141 places, 104 transitions, 310 flow [2022-11-16 10:55:44,226 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=310, PETRI_PLACES=141, PETRI_TRANSITIONS=104} [2022-11-16 10:55:44,228 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, 19 predicate places. [2022-11-16 10:55:44,228 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 104 transitions, 310 flow [2022-11-16 10:55:44,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 86.85714285714286) internal successors, (608), 7 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:55:44,230 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:55:44,230 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:55:44,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 10:55:44,231 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 10:55:44,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:44,235 INFO L85 PathProgramCache]: Analyzing trace with hash -884718858, now seen corresponding path program 1 times [2022-11-16 10:55:44,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:44,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983225021] [2022-11-16 10:55:44,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:44,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:44,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:45,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 10:55:45,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:45,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983225021] [2022-11-16 10:55:45,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983225021] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:45,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:55:45,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 10:55:45,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069130149] [2022-11-16 10:55:45,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:45,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 10:55:45,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:45,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 10:55:45,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 10:55:45,583 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 117 [2022-11-16 10:55:45,584 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 104 transitions, 310 flow. Second operand has 7 states, 7 states have (on average 87.14285714285714) internal successors, (610), 7 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:55:45,584 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:55:45,584 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 117 [2022-11-16 10:55:45,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:55:46,785 INFO L130 PetriNetUnfolder]: 631/1666 cut-off events. [2022-11-16 10:55:46,785 INFO L131 PetriNetUnfolder]: For 3497/4256 co-relation queries the response was YES. [2022-11-16 10:55:46,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5209 conditions, 1666 events. 631/1666 cut-off events. For 3497/4256 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 11434 event pairs, 134 based on Foata normal form. 37/1653 useless extension candidates. Maximal degree in co-relation 5135. Up to 536 conditions per place. [2022-11-16 10:55:46,804 INFO L137 encePairwiseOnDemand]: 102/117 looper letters, 37 selfloop transitions, 18 changer transitions 55/180 dead transitions. [2022-11-16 10:55:46,805 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 180 transitions, 1050 flow [2022-11-16 10:55:46,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 10:55:46,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-16 10:55:46,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1200 transitions. [2022-11-16 10:55:46,810 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7889546351084813 [2022-11-16 10:55:46,810 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1200 transitions. [2022-11-16 10:55:46,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1200 transitions. [2022-11-16 10:55:46,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:55:46,813 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1200 transitions. [2022-11-16 10:55:46,816 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 92.3076923076923) internal successors, (1200), 13 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:55:46,822 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:55:46,823 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:55:46,823 INFO L175 Difference]: Start difference. First operand has 141 places, 104 transitions, 310 flow. Second operand 13 states and 1200 transitions. [2022-11-16 10:55:46,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 180 transitions, 1050 flow [2022-11-16 10:55:46,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 180 transitions, 998 flow, removed 24 selfloop flow, removed 4 redundant places. [2022-11-16 10:55:46,848 INFO L231 Difference]: Finished difference. Result has 139 places, 112 transitions, 439 flow [2022-11-16 10:55:46,849 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=439, PETRI_PLACES=139, PETRI_TRANSITIONS=112} [2022-11-16 10:55:46,851 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, 17 predicate places. [2022-11-16 10:55:46,851 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 112 transitions, 439 flow [2022-11-16 10:55:46,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 87.14285714285714) internal successors, (610), 7 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:55:46,852 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:55:46,853 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:55:46,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 10:55:46,854 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 10:55:46,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:46,854 INFO L85 PathProgramCache]: Analyzing trace with hash -422582469, now seen corresponding path program 1 times [2022-11-16 10:55:46,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:46,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244154053] [2022-11-16 10:55:46,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:46,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:46,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:48,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 10:55:48,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:48,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244154053] [2022-11-16 10:55:48,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244154053] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:48,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:55:48,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-16 10:55:48,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171843982] [2022-11-16 10:55:48,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:48,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-16 10:55:48,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:48,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-16 10:55:48,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-11-16 10:55:48,999 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 117 [2022-11-16 10:55:49,001 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 112 transitions, 439 flow. Second operand has 13 states, 13 states have (on average 85.76923076923077) internal successors, (1115), 13 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:55:49,001 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:55:49,001 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 117 [2022-11-16 10:55:49,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:55:50,332 INFO L130 PetriNetUnfolder]: 563/1427 cut-off events. [2022-11-16 10:55:50,333 INFO L131 PetriNetUnfolder]: For 5358/6887 co-relation queries the response was YES. [2022-11-16 10:55:50,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5547 conditions, 1427 events. 563/1427 cut-off events. For 5358/6887 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 9244 event pairs, 91 based on Foata normal form. 47/1428 useless extension candidates. Maximal degree in co-relation 5461. Up to 493 conditions per place. [2022-11-16 10:55:50,349 INFO L137 encePairwiseOnDemand]: 97/117 looper letters, 60 selfloop transitions, 32 changer transitions 80/242 dead transitions. [2022-11-16 10:55:50,349 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 242 transitions, 1943 flow [2022-11-16 10:55:50,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-16 10:55:50,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-11-16 10:55:50,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1877 transitions. [2022-11-16 10:55:50,356 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7639397639397639 [2022-11-16 10:55:50,356 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 1877 transitions. [2022-11-16 10:55:50,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 1877 transitions. [2022-11-16 10:55:50,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:55:50,358 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1877 transitions. [2022-11-16 10:55:50,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 89.38095238095238) internal successors, (1877), 21 states have internal predecessors, (1877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:55:50,375 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 117.0) internal successors, (2574), 22 states have internal predecessors, (2574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:55:50,377 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 117.0) internal successors, (2574), 22 states have internal predecessors, (2574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:55:50,377 INFO L175 Difference]: Start difference. First operand has 139 places, 112 transitions, 439 flow. Second operand 21 states and 1877 transitions. [2022-11-16 10:55:50,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 242 transitions, 1943 flow [2022-11-16 10:55:50,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 242 transitions, 1841 flow, removed 51 selfloop flow, removed 12 redundant places. [2022-11-16 10:55:50,399 INFO L231 Difference]: Finished difference. Result has 150 places, 134 transitions, 742 flow [2022-11-16 10:55:50,400 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=742, PETRI_PLACES=150, PETRI_TRANSITIONS=134} [2022-11-16 10:55:50,401 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, 28 predicate places. [2022-11-16 10:55:50,401 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 134 transitions, 742 flow [2022-11-16 10:55:50,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 85.76923076923077) internal successors, (1115), 13 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:55:50,402 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:55:50,402 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:55:50,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 10:55:50,403 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 10:55:50,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:50,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1244234391, now seen corresponding path program 1 times [2022-11-16 10:55:50,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:50,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193053137] [2022-11-16 10:55:50,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:50,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:50,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:51,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 10:55:51,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:51,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193053137] [2022-11-16 10:55:51,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193053137] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:51,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:55:51,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-16 10:55:51,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120723923] [2022-11-16 10:55:51,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:51,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 10:55:51,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:51,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 10:55:51,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-16 10:55:51,757 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 117 [2022-11-16 10:55:51,759 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 134 transitions, 742 flow. Second operand has 9 states, 9 states have (on average 94.88888888888889) internal successors, (854), 9 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:55:51,759 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:55:51,759 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 117 [2022-11-16 10:55:51,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:55:52,380 INFO L130 PetriNetUnfolder]: 408/1104 cut-off events. [2022-11-16 10:55:52,380 INFO L131 PetriNetUnfolder]: For 6833/8879 co-relation queries the response was YES. [2022-11-16 10:55:52,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5040 conditions, 1104 events. 408/1104 cut-off events. For 6833/8879 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6908 event pairs, 67 based on Foata normal form. 59/1106 useless extension candidates. Maximal degree in co-relation 4950. Up to 446 conditions per place. [2022-11-16 10:55:52,395 INFO L137 encePairwiseOnDemand]: 106/117 looper letters, 41 selfloop transitions, 21 changer transitions 31/185 dead transitions. [2022-11-16 10:55:52,395 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 185 transitions, 1530 flow [2022-11-16 10:55:52,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 10:55:52,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-16 10:55:52,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1166 transitions. [2022-11-16 10:55:52,399 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8304843304843305 [2022-11-16 10:55:52,399 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1166 transitions. [2022-11-16 10:55:52,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1166 transitions. [2022-11-16 10:55:52,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:55:52,401 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1166 transitions. [2022-11-16 10:55:52,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 97.16666666666667) internal successors, (1166), 12 states have internal predecessors, (1166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:55:52,407 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 117.0) internal successors, (1521), 13 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:55:52,408 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 117.0) internal successors, (1521), 13 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:55:52,408 INFO L175 Difference]: Start difference. First operand has 150 places, 134 transitions, 742 flow. Second operand 12 states and 1166 transitions. [2022-11-16 10:55:52,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 185 transitions, 1530 flow [2022-11-16 10:55:52,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 185 transitions, 1428 flow, removed 45 selfloop flow, removed 11 redundant places. [2022-11-16 10:55:52,421 INFO L231 Difference]: Finished difference. Result has 149 places, 147 transitions, 937 flow [2022-11-16 10:55:52,422 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=937, PETRI_PLACES=149, PETRI_TRANSITIONS=147} [2022-11-16 10:55:52,423 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, 27 predicate places. [2022-11-16 10:55:52,423 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 147 transitions, 937 flow [2022-11-16 10:55:52,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 94.88888888888889) internal successors, (854), 9 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:55:52,424 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:55:52,424 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:55:52,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 10:55:52,425 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 10:55:52,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:52,426 INFO L85 PathProgramCache]: Analyzing trace with hash 476017265, now seen corresponding path program 2 times [2022-11-16 10:55:52,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:52,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019924151] [2022-11-16 10:55:52,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:52,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:52,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:53,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 10:55:53,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:53,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019924151] [2022-11-16 10:55:53,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019924151] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:53,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:55:53,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 10:55:53,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197475504] [2022-11-16 10:55:53,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:53,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 10:55:53,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:53,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 10:55:53,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-11-16 10:55:53,217 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 117 [2022-11-16 10:55:53,218 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 147 transitions, 937 flow. Second operand has 10 states, 10 states have (on average 95.6) internal successors, (956), 10 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:55:53,219 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:55:53,219 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 117 [2022-11-16 10:55:53,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:55:53,845 INFO L130 PetriNetUnfolder]: 452/1172 cut-off events. [2022-11-16 10:55:53,846 INFO L131 PetriNetUnfolder]: For 12607/17074 co-relation queries the response was YES. [2022-11-16 10:55:53,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6478 conditions, 1172 events. 452/1172 cut-off events. For 12607/17074 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 7398 event pairs, 73 based on Foata normal form. 89/1207 useless extension candidates. Maximal degree in co-relation 6390. Up to 503 conditions per place. [2022-11-16 10:55:53,863 INFO L137 encePairwiseOnDemand]: 106/117 looper letters, 35 selfloop transitions, 46 changer transitions 31/205 dead transitions. [2022-11-16 10:55:53,864 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 205 transitions, 2090 flow [2022-11-16 10:55:53,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 10:55:53,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-16 10:55:53,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1278 transitions. [2022-11-16 10:55:53,868 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8402366863905325 [2022-11-16 10:55:53,868 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1278 transitions. [2022-11-16 10:55:53,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1278 transitions. [2022-11-16 10:55:53,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:55:53,870 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1278 transitions. [2022-11-16 10:55:53,873 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 98.3076923076923) internal successors, (1278), 13 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:55:53,877 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:55:53,878 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:55:53,878 INFO L175 Difference]: Start difference. First operand has 149 places, 147 transitions, 937 flow. Second operand 13 states and 1278 transitions. [2022-11-16 10:55:53,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 205 transitions, 2090 flow [2022-11-16 10:55:53,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 205 transitions, 2041 flow, removed 16 selfloop flow, removed 5 redundant places. [2022-11-16 10:55:53,901 INFO L231 Difference]: Finished difference. Result has 158 places, 164 transitions, 1328 flow [2022-11-16 10:55:53,901 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=904, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1328, PETRI_PLACES=158, PETRI_TRANSITIONS=164} [2022-11-16 10:55:53,904 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, 36 predicate places. [2022-11-16 10:55:53,905 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 164 transitions, 1328 flow [2022-11-16 10:55:53,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 95.6) internal successors, (956), 10 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:55:53,905 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:55:53,906 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:55:53,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 10:55:53,906 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 10:55:53,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:53,907 INFO L85 PathProgramCache]: Analyzing trace with hash 853967505, now seen corresponding path program 3 times [2022-11-16 10:55:53,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:53,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015215356] [2022-11-16 10:55:53,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:53,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:53,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:54,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 10:55:54,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:54,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015215356] [2022-11-16 10:55:54,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015215356] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:54,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:55:54,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-16 10:55:54,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394891710] [2022-11-16 10:55:54,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:54,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 10:55:54,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:54,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 10:55:54,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-16 10:55:54,865 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 117 [2022-11-16 10:55:54,866 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 164 transitions, 1328 flow. Second operand has 9 states, 9 states have (on average 95.77777777777777) internal successors, (862), 9 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:55:54,866 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:55:54,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 117 [2022-11-16 10:55:54,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:55:55,542 INFO L130 PetriNetUnfolder]: 409/1118 cut-off events. [2022-11-16 10:55:55,542 INFO L131 PetriNetUnfolder]: For 13857/19010 co-relation queries the response was YES. [2022-11-16 10:55:55,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6494 conditions, 1118 events. 409/1118 cut-off events. For 13857/19010 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 7202 event pairs, 49 based on Foata normal form. 97/1162 useless extension candidates. Maximal degree in co-relation 6400. Up to 445 conditions per place. [2022-11-16 10:55:55,561 INFO L137 encePairwiseOnDemand]: 108/117 looper letters, 54 selfloop transitions, 26 changer transitions 32/205 dead transitions. [2022-11-16 10:55:55,562 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 205 transitions, 2341 flow [2022-11-16 10:55:55,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 10:55:55,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-16 10:55:55,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1083 transitions. [2022-11-16 10:55:55,566 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8414918414918415 [2022-11-16 10:55:55,566 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1083 transitions. [2022-11-16 10:55:55,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1083 transitions. [2022-11-16 10:55:55,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:55:55,568 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1083 transitions. [2022-11-16 10:55:55,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 98.45454545454545) internal successors, (1083), 11 states have internal predecessors, (1083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:55:55,574 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 117.0) internal successors, (1404), 12 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:55:55,575 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 117.0) internal successors, (1404), 12 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:55:55,575 INFO L175 Difference]: Start difference. First operand has 158 places, 164 transitions, 1328 flow. Second operand 11 states and 1083 transitions. [2022-11-16 10:55:55,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 205 transitions, 2341 flow [2022-11-16 10:55:55,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 205 transitions, 2252 flow, removed 44 selfloop flow, removed 7 redundant places. [2022-11-16 10:55:55,607 INFO L231 Difference]: Finished difference. Result has 162 places, 167 transitions, 1464 flow [2022-11-16 10:55:55,608 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=1267, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1464, PETRI_PLACES=162, PETRI_TRANSITIONS=167} [2022-11-16 10:55:55,608 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, 40 predicate places. [2022-11-16 10:55:55,609 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 167 transitions, 1464 flow [2022-11-16 10:55:55,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 95.77777777777777) internal successors, (862), 9 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:55:55,610 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:55:55,611 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:55:55,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 10:55:55,611 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 10:55:55,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:55,612 INFO L85 PathProgramCache]: Analyzing trace with hash 52045940, now seen corresponding path program 1 times [2022-11-16 10:55:55,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:55,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652358931] [2022-11-16 10:55:55,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:55,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:55,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:56,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 10:55:56,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:56,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652358931] [2022-11-16 10:55:56,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652358931] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:56,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:55:56,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-16 10:55:56,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842956508] [2022-11-16 10:55:56,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:56,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 10:55:56,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:56,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 10:55:56,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-11-16 10:55:56,725 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 117 [2022-11-16 10:55:56,729 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 167 transitions, 1464 flow. Second operand has 12 states, 12 states have (on average 94.5) internal successors, (1134), 12 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:55:56,730 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:55:56,730 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 117 [2022-11-16 10:55:56,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:55:57,417 INFO L130 PetriNetUnfolder]: 355/1044 cut-off events. [2022-11-16 10:55:57,418 INFO L131 PetriNetUnfolder]: For 13220/19817 co-relation queries the response was YES. [2022-11-16 10:55:57,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6012 conditions, 1044 events. 355/1044 cut-off events. For 13220/19817 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6856 event pairs, 27 based on Foata normal form. 120/1112 useless extension candidates. Maximal degree in co-relation 5915. Up to 386 conditions per place. [2022-11-16 10:55:57,476 INFO L137 encePairwiseOnDemand]: 105/117 looper letters, 44 selfloop transitions, 45 changer transitions 13/194 dead transitions. [2022-11-16 10:55:57,476 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 194 transitions, 2100 flow [2022-11-16 10:55:57,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-16 10:55:57,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-11-16 10:55:57,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1442 transitions. [2022-11-16 10:55:57,480 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8216524216524217 [2022-11-16 10:55:57,480 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1442 transitions. [2022-11-16 10:55:57,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1442 transitions. [2022-11-16 10:55:57,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:55:57,482 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1442 transitions. [2022-11-16 10:55:57,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 96.13333333333334) internal successors, (1442), 15 states have internal predecessors, (1442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:55:57,489 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 117.0) internal successors, (1872), 16 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:55:57,490 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 117.0) internal successors, (1872), 16 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:55:57,491 INFO L175 Difference]: Start difference. First operand has 162 places, 167 transitions, 1464 flow. Second operand 15 states and 1442 transitions. [2022-11-16 10:55:57,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 194 transitions, 2100 flow [2022-11-16 10:55:57,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 194 transitions, 1967 flow, removed 61 selfloop flow, removed 8 redundant places. [2022-11-16 10:55:57,520 INFO L231 Difference]: Finished difference. Result has 169 places, 169 transitions, 1596 flow [2022-11-16 10:55:57,521 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=1407, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1596, PETRI_PLACES=169, PETRI_TRANSITIONS=169} [2022-11-16 10:55:57,524 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, 47 predicate places. [2022-11-16 10:55:57,524 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 169 transitions, 1596 flow [2022-11-16 10:55:57,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 94.5) internal successors, (1134), 12 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:55:57,525 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:55:57,525 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:55:57,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 10:55:57,528 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 10:55:57,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:57,528 INFO L85 PathProgramCache]: Analyzing trace with hash 840207242, now seen corresponding path program 2 times [2022-11-16 10:55:57,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:57,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943875323] [2022-11-16 10:55:57,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:57,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:57,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:58,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 10:55:58,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:58,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943875323] [2022-11-16 10:55:58,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943875323] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:58,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:55:58,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 10:55:58,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987303884] [2022-11-16 10:55:58,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:58,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 10:55:58,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:58,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 10:55:58,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-11-16 10:55:58,364 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 117 [2022-11-16 10:55:58,365 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 169 transitions, 1596 flow. Second operand has 10 states, 10 states have (on average 94.8) internal successors, (948), 10 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:55:58,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:55:58,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 117 [2022-11-16 10:55:58,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:55:58,904 INFO L130 PetriNetUnfolder]: 371/1113 cut-off events. [2022-11-16 10:55:58,904 INFO L131 PetriNetUnfolder]: For 14294/23128 co-relation queries the response was YES. [2022-11-16 10:55:58,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6513 conditions, 1113 events. 371/1113 cut-off events. For 14294/23128 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7612 event pairs, 59 based on Foata normal form. 99/1152 useless extension candidates. Maximal degree in co-relation 6412. Up to 408 conditions per place. [2022-11-16 10:55:58,923 INFO L137 encePairwiseOnDemand]: 106/117 looper letters, 59 selfloop transitions, 29 changer transitions 13/193 dead transitions. [2022-11-16 10:55:58,923 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 193 transitions, 2213 flow [2022-11-16 10:55:58,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 10:55:58,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-16 10:55:58,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1159 transitions. [2022-11-16 10:55:58,927 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8254985754985755 [2022-11-16 10:55:58,927 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1159 transitions. [2022-11-16 10:55:58,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1159 transitions. [2022-11-16 10:55:58,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:55:58,928 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1159 transitions. [2022-11-16 10:55:58,931 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 96.58333333333333) internal successors, (1159), 12 states have internal predecessors, (1159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:55:58,934 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 117.0) internal successors, (1521), 13 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:55:58,935 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 117.0) internal successors, (1521), 13 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:55:58,935 INFO L175 Difference]: Start difference. First operand has 169 places, 169 transitions, 1596 flow. Second operand 12 states and 1159 transitions. [2022-11-16 10:55:58,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 193 transitions, 2213 flow [2022-11-16 10:55:58,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 193 transitions, 2051 flow, removed 60 selfloop flow, removed 12 redundant places. [2022-11-16 10:55:58,976 INFO L231 Difference]: Finished difference. Result has 169 places, 171 transitions, 1657 flow [2022-11-16 10:55:58,977 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=1512, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1657, PETRI_PLACES=169, PETRI_TRANSITIONS=171} [2022-11-16 10:55:58,977 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, 47 predicate places. [2022-11-16 10:55:58,978 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 171 transitions, 1657 flow [2022-11-16 10:55:58,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 94.8) internal successors, (948), 10 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:55:58,978 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:55:58,979 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:55:58,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 10:55:58,979 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 10:55:58,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:58,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1358725436, now seen corresponding path program 3 times [2022-11-16 10:55:58,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:58,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83205880] [2022-11-16 10:55:58,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:58,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:59,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:56:00,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-11-16 10:56:00,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:56:00,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83205880] [2022-11-16 10:56:00,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83205880] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:56:00,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:56:00,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-16 10:56:00,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324254024] [2022-11-16 10:56:00,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:56:00,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 10:56:00,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:56:00,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 10:56:00,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-11-16 10:56:00,325 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 117 [2022-11-16 10:56:00,327 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 171 transitions, 1657 flow. Second operand has 14 states, 14 states have (on average 83.92857142857143) internal successors, (1175), 14 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:56:00,327 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:56:00,327 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 117 [2022-11-16 10:56:00,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:56:01,519 INFO L130 PetriNetUnfolder]: 489/1517 cut-off events. [2022-11-16 10:56:01,520 INFO L131 PetriNetUnfolder]: For 17905/31073 co-relation queries the response was YES. [2022-11-16 10:56:01,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8904 conditions, 1517 events. 489/1517 cut-off events. For 17905/31073 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 11439 event pairs, 83 based on Foata normal form. 90/1538 useless extension candidates. Maximal degree in co-relation 8797. Up to 604 conditions per place. [2022-11-16 10:56:01,548 INFO L137 encePairwiseOnDemand]: 98/117 looper letters, 105 selfloop transitions, 58 changer transitions 31/262 dead transitions. [2022-11-16 10:56:01,548 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 262 transitions, 3592 flow [2022-11-16 10:56:01,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 10:56:01,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-11-16 10:56:01,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1476 transitions. [2022-11-16 10:56:01,553 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7420814479638009 [2022-11-16 10:56:01,554 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1476 transitions. [2022-11-16 10:56:01,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1476 transitions. [2022-11-16 10:56:01,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:56:01,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1476 transitions. [2022-11-16 10:56:01,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 86.82352941176471) internal successors, (1476), 17 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:56:01,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 117.0) internal successors, (2106), 18 states have internal predecessors, (2106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:56:01,566 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 117.0) internal successors, (2106), 18 states have internal predecessors, (2106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:56:01,566 INFO L175 Difference]: Start difference. First operand has 169 places, 171 transitions, 1657 flow. Second operand 17 states and 1476 transitions. [2022-11-16 10:56:01,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 262 transitions, 3592 flow [2022-11-16 10:56:01,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 262 transitions, 3352 flow, removed 86 selfloop flow, removed 10 redundant places. [2022-11-16 10:56:01,619 INFO L231 Difference]: Finished difference. Result has 178 places, 208 transitions, 2421 flow [2022-11-16 10:56:01,620 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=1565, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2421, PETRI_PLACES=178, PETRI_TRANSITIONS=208} [2022-11-16 10:56:01,621 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, 56 predicate places. [2022-11-16 10:56:01,621 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 208 transitions, 2421 flow [2022-11-16 10:56:01,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 83.92857142857143) internal successors, (1175), 14 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:56:01,622 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:56:01,622 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:56:01,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 10:56:01,622 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 10:56:01,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:56:01,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1248507350, now seen corresponding path program 4 times [2022-11-16 10:56:01,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:56:01,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251171641] [2022-11-16 10:56:01,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:56:01,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:56:01,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:56:02,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 10:56:02,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:56:02,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251171641] [2022-11-16 10:56:02,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251171641] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:56:02,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:56:02,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-16 10:56:02,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409083137] [2022-11-16 10:56:02,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:56:02,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 10:56:02,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:56:02,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 10:56:02,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-16 10:56:02,705 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 117 [2022-11-16 10:56:02,706 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 208 transitions, 2421 flow. Second operand has 11 states, 11 states have (on average 93.72727272727273) internal successors, (1031), 11 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:56:02,707 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:56:02,707 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 117 [2022-11-16 10:56:02,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:56:03,528 INFO L130 PetriNetUnfolder]: 386/1339 cut-off events. [2022-11-16 10:56:03,528 INFO L131 PetriNetUnfolder]: For 18610/38258 co-relation queries the response was YES. [2022-11-16 10:56:03,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7911 conditions, 1339 events. 386/1339 cut-off events. For 18610/38258 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 10206 event pairs, 34 based on Foata normal form. 101/1387 useless extension candidates. Maximal degree in co-relation 7802. Up to 447 conditions per place. [2022-11-16 10:56:03,549 INFO L137 encePairwiseOnDemand]: 108/117 looper letters, 92 selfloop transitions, 22 changer transitions 13/230 dead transitions. [2022-11-16 10:56:03,549 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 230 transitions, 3079 flow [2022-11-16 10:56:03,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 10:56:03,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-16 10:56:03,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1146 transitions. [2022-11-16 10:56:03,552 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8162393162393162 [2022-11-16 10:56:03,553 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1146 transitions. [2022-11-16 10:56:03,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1146 transitions. [2022-11-16 10:56:03,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:56:03,554 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1146 transitions. [2022-11-16 10:56:03,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 95.5) internal successors, (1146), 12 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:56:03,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 117.0) internal successors, (1521), 13 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:56:03,561 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 117.0) internal successors, (1521), 13 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:56:03,561 INFO L175 Difference]: Start difference. First operand has 178 places, 208 transitions, 2421 flow. Second operand 12 states and 1146 transitions. [2022-11-16 10:56:03,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 230 transitions, 3079 flow [2022-11-16 10:56:03,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 230 transitions, 2896 flow, removed 83 selfloop flow, removed 8 redundant places. [2022-11-16 10:56:03,619 INFO L231 Difference]: Finished difference. Result has 182 places, 208 transitions, 2332 flow [2022-11-16 10:56:03,620 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=2264, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2332, PETRI_PLACES=182, PETRI_TRANSITIONS=208} [2022-11-16 10:56:03,620 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, 60 predicate places. [2022-11-16 10:56:03,620 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 208 transitions, 2332 flow [2022-11-16 10:56:03,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 93.72727272727273) internal successors, (1031), 11 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:56:03,622 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:56:03,622 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:56:03,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 10:56:03,622 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 10:56:03,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:56:03,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1943597930, now seen corresponding path program 1 times [2022-11-16 10:56:03,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:56:03,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989572223] [2022-11-16 10:56:03,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:56:03,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:56:03,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:56:03,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 10:56:03,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:56:03,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989572223] [2022-11-16 10:56:03,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989572223] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:56:03,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:56:03,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 10:56:03,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197676500] [2022-11-16 10:56:03,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:56:03,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 10:56:03,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:56:03,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 10:56:03,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 10:56:03,862 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 117 [2022-11-16 10:56:03,863 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 208 transitions, 2332 flow. Second operand has 6 states, 6 states have (on average 96.33333333333333) internal successors, (578), 6 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:56:03,864 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:56:03,864 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 117 [2022-11-16 10:56:03,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:56:05,751 INFO L130 PetriNetUnfolder]: 3089/6215 cut-off events. [2022-11-16 10:56:05,752 INFO L131 PetriNetUnfolder]: For 119735/125945 co-relation queries the response was YES. [2022-11-16 10:56:05,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33283 conditions, 6215 events. 3089/6215 cut-off events. For 119735/125945 co-relation queries the response was YES. Maximal size of possible extension queue 565. Compared 52898 event pairs, 89 based on Foata normal form. 591/6421 useless extension candidates. Maximal degree in co-relation 33176. Up to 1852 conditions per place. [2022-11-16 10:56:05,830 INFO L137 encePairwiseOnDemand]: 107/117 looper letters, 181 selfloop transitions, 13 changer transitions 168/468 dead transitions. [2022-11-16 10:56:05,831 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 468 transitions, 8081 flow [2022-11-16 10:56:05,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 10:56:05,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-16 10:56:05,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1014 transitions. [2022-11-16 10:56:05,834 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8666666666666667 [2022-11-16 10:56:05,834 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1014 transitions. [2022-11-16 10:56:05,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1014 transitions. [2022-11-16 10:56:05,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:56:05,835 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1014 transitions. [2022-11-16 10:56:05,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 101.4) internal successors, (1014), 10 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:56:05,839 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 117.0) internal successors, (1287), 11 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:56:05,840 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 117.0) internal successors, (1287), 11 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:56:05,840 INFO L175 Difference]: Start difference. First operand has 182 places, 208 transitions, 2332 flow. Second operand 10 states and 1014 transitions. [2022-11-16 10:56:05,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 468 transitions, 8081 flow [2022-11-16 10:56:05,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 468 transitions, 7698 flow, removed 93 selfloop flow, removed 13 redundant places. [2022-11-16 10:56:05,978 INFO L231 Difference]: Finished difference. Result has 178 places, 205 transitions, 2059 flow [2022-11-16 10:56:05,978 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=1989, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2059, PETRI_PLACES=178, PETRI_TRANSITIONS=205} [2022-11-16 10:56:05,979 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, 56 predicate places. [2022-11-16 10:56:05,979 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 205 transitions, 2059 flow [2022-11-16 10:56:05,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 96.33333333333333) internal successors, (578), 6 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:56:05,980 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:56:05,980 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:56:05,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 10:56:05,981 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 10:56:05,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:56:05,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1558967772, now seen corresponding path program 1 times [2022-11-16 10:56:05,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:56:05,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267674249] [2022-11-16 10:56:05,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:56:05,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:56:06,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:56:06,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 10:56:06,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:56:06,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267674249] [2022-11-16 10:56:06,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267674249] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:56:06,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:56:06,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 10:56:06,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925897903] [2022-11-16 10:56:06,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:56:06,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 10:56:06,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:56:06,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 10:56:06,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 10:56:06,253 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 117 [2022-11-16 10:56:06,254 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 205 transitions, 2059 flow. Second operand has 7 states, 7 states have (on average 96.14285714285714) internal successors, (673), 7 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:56:06,254 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:56:06,254 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 117 [2022-11-16 10:56:06,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:56:07,893 INFO L130 PetriNetUnfolder]: 2594/5542 cut-off events. [2022-11-16 10:56:07,893 INFO L131 PetriNetUnfolder]: For 88705/93730 co-relation queries the response was YES. [2022-11-16 10:56:07,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32446 conditions, 5542 events. 2594/5542 cut-off events. For 88705/93730 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 49096 event pairs, 82 based on Foata normal form. 772/6109 useless extension candidates. Maximal degree in co-relation 32342. Up to 1349 conditions per place. [2022-11-16 10:56:07,963 INFO L137 encePairwiseOnDemand]: 107/117 looper letters, 133 selfloop transitions, 26 changer transitions 187/450 dead transitions. [2022-11-16 10:56:07,963 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 450 transitions, 7505 flow [2022-11-16 10:56:07,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 10:56:07,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-16 10:56:07,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1316 transitions. [2022-11-16 10:56:07,968 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8652202498356345 [2022-11-16 10:56:07,968 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1316 transitions. [2022-11-16 10:56:07,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1316 transitions. [2022-11-16 10:56:07,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:56:07,969 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1316 transitions. [2022-11-16 10:56:07,972 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 101.23076923076923) internal successors, (1316), 13 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:56:07,976 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:56:07,977 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:56:07,978 INFO L175 Difference]: Start difference. First operand has 178 places, 205 transitions, 2059 flow. Second operand 13 states and 1316 transitions. [2022-11-16 10:56:07,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 450 transitions, 7505 flow [2022-11-16 10:56:08,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 450 transitions, 7244 flow, removed 36 selfloop flow, removed 7 redundant places. [2022-11-16 10:56:08,163 INFO L231 Difference]: Finished difference. Result has 187 places, 195 transitions, 1727 flow [2022-11-16 10:56:08,163 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=1560, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1727, PETRI_PLACES=187, PETRI_TRANSITIONS=195} [2022-11-16 10:56:08,164 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, 65 predicate places. [2022-11-16 10:56:08,164 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 195 transitions, 1727 flow [2022-11-16 10:56:08,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 96.14285714285714) internal successors, (673), 7 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:56:08,165 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:56:08,165 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:56:08,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 10:56:08,166 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 10:56:08,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:56:08,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1560735623, now seen corresponding path program 1 times [2022-11-16 10:56:08,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:56:08,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775318703] [2022-11-16 10:56:08,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:56:08,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:56:08,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:56:09,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 10:56:09,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:56:09,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775318703] [2022-11-16 10:56:09,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775318703] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:56:09,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:56:09,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 10:56:09,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982083724] [2022-11-16 10:56:09,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:56:09,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 10:56:09,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:56:09,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 10:56:09,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 10:56:09,302 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 117 [2022-11-16 10:56:09,303 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 195 transitions, 1727 flow. Second operand has 7 states, 7 states have (on average 87.57142857142857) internal successors, (613), 7 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:56:09,303 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:56:09,303 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 117 [2022-11-16 10:56:09,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:56:10,189 INFO L130 PetriNetUnfolder]: 741/3481 cut-off events. [2022-11-16 10:56:10,190 INFO L131 PetriNetUnfolder]: For 14324/15374 co-relation queries the response was YES. [2022-11-16 10:56:10,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12755 conditions, 3481 events. 741/3481 cut-off events. For 14324/15374 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 40588 event pairs, 22 based on Foata normal form. 26/3299 useless extension candidates. Maximal degree in co-relation 12640. Up to 863 conditions per place. [2022-11-16 10:56:10,233 INFO L137 encePairwiseOnDemand]: 107/117 looper letters, 65 selfloop transitions, 12 changer transitions 77/253 dead transitions. [2022-11-16 10:56:10,233 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 253 transitions, 2928 flow [2022-11-16 10:56:10,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 10:56:10,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-16 10:56:10,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 906 transitions. [2022-11-16 10:56:10,236 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7743589743589744 [2022-11-16 10:56:10,236 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 906 transitions. [2022-11-16 10:56:10,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 906 transitions. [2022-11-16 10:56:10,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:56:10,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 906 transitions. [2022-11-16 10:56:10,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 90.6) internal successors, (906), 10 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:56:10,240 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 117.0) internal successors, (1287), 11 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:56:10,241 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 117.0) internal successors, (1287), 11 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:56:10,241 INFO L175 Difference]: Start difference. First operand has 187 places, 195 transitions, 1727 flow. Second operand 10 states and 906 transitions. [2022-11-16 10:56:10,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 253 transitions, 2928 flow [2022-11-16 10:56:10,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 253 transitions, 2754 flow, removed 62 selfloop flow, removed 10 redundant places. [2022-11-16 10:56:10,447 INFO L231 Difference]: Finished difference. Result has 193 places, 166 transitions, 1165 flow [2022-11-16 10:56:10,448 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=1577, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1165, PETRI_PLACES=193, PETRI_TRANSITIONS=166} [2022-11-16 10:56:10,449 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, 71 predicate places. [2022-11-16 10:56:10,449 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 166 transitions, 1165 flow [2022-11-16 10:56:10,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 87.57142857142857) internal successors, (613), 7 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:56:10,449 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:56:10,450 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:56:10,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 10:56:10,450 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 10:56:10,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:56:10,450 INFO L85 PathProgramCache]: Analyzing trace with hash 953969559, now seen corresponding path program 1 times [2022-11-16 10:56:10,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:56:10,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229196458] [2022-11-16 10:56:10,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:56:10,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:56:10,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:56:10,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 10:56:10,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:56:10,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229196458] [2022-11-16 10:56:10,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229196458] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:56:10,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:56:10,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 10:56:10,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496605506] [2022-11-16 10:56:10,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:56:10,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 10:56:10,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:56:10,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 10:56:10,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-16 10:56:10,729 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 117 [2022-11-16 10:56:10,730 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 166 transitions, 1165 flow. Second operand has 8 states, 8 states have (on average 96.125) internal successors, (769), 8 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:56:10,730 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:56:10,730 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 117 [2022-11-16 10:56:10,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:56:12,002 INFO L130 PetriNetUnfolder]: 2212/5486 cut-off events. [2022-11-16 10:56:12,003 INFO L131 PetriNetUnfolder]: For 67023/70803 co-relation queries the response was YES. [2022-11-16 10:56:12,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28060 conditions, 5486 events. 2212/5486 cut-off events. For 67023/70803 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 54610 event pairs, 60 based on Foata normal form. 483/5762 useless extension candidates. Maximal degree in co-relation 28012. Up to 1189 conditions per place. [2022-11-16 10:56:12,205 INFO L137 encePairwiseOnDemand]: 107/117 looper letters, 68 selfloop transitions, 22 changer transitions 116/296 dead transitions. [2022-11-16 10:56:12,205 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 296 transitions, 3704 flow [2022-11-16 10:56:12,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-16 10:56:12,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-16 10:56:12,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1591 transitions. [2022-11-16 10:56:12,210 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8498931623931624 [2022-11-16 10:56:12,210 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1591 transitions. [2022-11-16 10:56:12,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1591 transitions. [2022-11-16 10:56:12,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:56:12,212 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1591 transitions. [2022-11-16 10:56:12,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 99.4375) internal successors, (1591), 16 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:56:12,223 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 117.0) internal successors, (1989), 17 states have internal predecessors, (1989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:56:12,224 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 117.0) internal successors, (1989), 17 states have internal predecessors, (1989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:56:12,224 INFO L175 Difference]: Start difference. First operand has 193 places, 166 transitions, 1165 flow. Second operand 16 states and 1591 transitions. [2022-11-16 10:56:12,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 296 transitions, 3704 flow [2022-11-16 10:56:12,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 296 transitions, 3191 flow, removed 157 selfloop flow, removed 20 redundant places. [2022-11-16 10:56:12,564 INFO L231 Difference]: Finished difference. Result has 189 places, 143 transitions, 878 flow [2022-11-16 10:56:12,565 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=926, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=878, PETRI_PLACES=189, PETRI_TRANSITIONS=143} [2022-11-16 10:56:12,565 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, 67 predicate places. [2022-11-16 10:56:12,565 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 143 transitions, 878 flow [2022-11-16 10:56:12,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 96.125) internal successors, (769), 8 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:56:12,566 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:56:12,566 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:56:12,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 10:56:12,567 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 10:56:12,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:56:12,567 INFO L85 PathProgramCache]: Analyzing trace with hash -987110707, now seen corresponding path program 1 times [2022-11-16 10:56:12,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:56:12,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869731926] [2022-11-16 10:56:12,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:56:12,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:56:12,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:56:13,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 10:56:13,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:56:13,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869731926] [2022-11-16 10:56:13,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869731926] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:56:13,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:56:13,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-16 10:56:13,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895874386] [2022-11-16 10:56:13,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:56:13,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 10:56:13,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:56:13,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 10:56:13,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-16 10:56:13,189 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 117 [2022-11-16 10:56:13,190 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 143 transitions, 878 flow. Second operand has 9 states, 9 states have (on average 95.11111111111111) internal successors, (856), 9 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:56:13,190 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:56:13,190 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 117 [2022-11-16 10:56:13,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:56:13,497 INFO L130 PetriNetUnfolder]: 115/727 cut-off events. [2022-11-16 10:56:13,497 INFO L131 PetriNetUnfolder]: For 1900/1974 co-relation queries the response was YES. [2022-11-16 10:56:13,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2334 conditions, 727 events. 115/727 cut-off events. For 1900/1974 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5307 event pairs, 2 based on Foata normal form. 1/685 useless extension candidates. Maximal degree in co-relation 2251. Up to 87 conditions per place. [2022-11-16 10:56:13,503 INFO L137 encePairwiseOnDemand]: 108/117 looper letters, 20 selfloop transitions, 1 changer transitions 49/167 dead transitions. [2022-11-16 10:56:13,503 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 167 transitions, 1283 flow [2022-11-16 10:56:13,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 10:56:13,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 10:56:13,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 872 transitions. [2022-11-16 10:56:13,506 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8281101614434948 [2022-11-16 10:56:13,506 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 872 transitions. [2022-11-16 10:56:13,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 872 transitions. [2022-11-16 10:56:13,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:56:13,507 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 872 transitions. [2022-11-16 10:56:13,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 96.88888888888889) internal successors, (872), 9 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:56:13,521 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 117.0) internal successors, (1170), 10 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:56:13,522 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 117.0) internal successors, (1170), 10 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:56:13,526 INFO L175 Difference]: Start difference. First operand has 189 places, 143 transitions, 878 flow. Second operand 9 states and 872 transitions. [2022-11-16 10:56:13,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 167 transitions, 1283 flow [2022-11-16 10:56:13,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 167 transitions, 969 flow, removed 101 selfloop flow, removed 23 redundant places. [2022-11-16 10:56:13,544 INFO L231 Difference]: Finished difference. Result has 172 places, 118 transitions, 492 flow [2022-11-16 10:56:13,545 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=684, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=492, PETRI_PLACES=172, PETRI_TRANSITIONS=118} [2022-11-16 10:56:13,545 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, 50 predicate places. [2022-11-16 10:56:13,546 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 118 transitions, 492 flow [2022-11-16 10:56:13,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 95.11111111111111) internal successors, (856), 9 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:56:13,547 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:56:13,547 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:56:13,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-16 10:56:13,548 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 10:56:13,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:56:13,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1701309525, now seen corresponding path program 2 times [2022-11-16 10:56:13,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:56:13,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587190897] [2022-11-16 10:56:13,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:56:13,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:56:13,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 10:56:13,593 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 10:56:13,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 10:56:13,721 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 10:56:13,722 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 10:56:13,724 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-16 10:56:13,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-16 10:56:13,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-16 10:56:13,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-16 10:56:13,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-16 10:56:13,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-16 10:56:13,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-16 10:56:13,728 INFO L444 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:56:13,736 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 10:56:13,737 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 10:56:13,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 10:56:13 BasicIcfg [2022-11-16 10:56:13,888 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 10:56:13,889 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 10:56:13,889 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 10:56:13,890 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 10:56:13,890 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 10:55:39" (3/4) ... [2022-11-16 10:56:13,892 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-16 10:56:14,040 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e6840d5-78ee-49fc-a40e-5e677af27c05/bin/uautomizer-tPACEb0tL8/witness.graphml [2022-11-16 10:56:14,040 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 10:56:14,041 INFO L158 Benchmark]: Toolchain (without parser) took 37120.10ms. Allocated memory was 125.8MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 89.8MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 373.6MB. Max. memory is 16.1GB. [2022-11-16 10:56:14,042 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 88.1MB. Free memory is still 42.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 10:56:14,043 INFO L158 Benchmark]: CACSL2BoogieTranslator took 968.99ms. Allocated memory is still 125.8MB. Free memory was 89.6MB in the beginning and 88.3MB in the end (delta: 1.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-16 10:56:14,043 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.81ms. Allocated memory is still 125.8MB. Free memory was 88.3MB in the beginning and 85.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 10:56:14,046 INFO L158 Benchmark]: Boogie Preprocessor took 76.51ms. Allocated memory is still 125.8MB. Free memory was 85.6MB in the beginning and 83.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 10:56:14,046 INFO L158 Benchmark]: RCFGBuilder took 1104.97ms. Allocated memory is still 125.8MB. Free memory was 83.5MB in the beginning and 51.4MB in the end (delta: 32.1MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-11-16 10:56:14,047 INFO L158 Benchmark]: TraceAbstraction took 34722.33ms. Allocated memory was 125.8MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 51.2MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 315.2MB. Max. memory is 16.1GB. [2022-11-16 10:56:14,047 INFO L158 Benchmark]: Witness Printer took 151.09ms. Allocated memory is still 2.1GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-16 10:56:14,049 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.36ms. Allocated memory is still 88.1MB. Free memory is still 42.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 968.99ms. Allocated memory is still 125.8MB. Free memory was 89.6MB in the beginning and 88.3MB in the end (delta: 1.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.81ms. Allocated memory is still 125.8MB. Free memory was 88.3MB in the beginning and 85.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.51ms. Allocated memory is still 125.8MB. Free memory was 85.6MB in the beginning and 83.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1104.97ms. Allocated memory is still 125.8MB. Free memory was 83.5MB in the beginning and 51.4MB in the end (delta: 32.1MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 34722.33ms. Allocated memory was 125.8MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 51.2MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 315.2MB. Max. memory is 16.1GB. * Witness Printer took 151.09ms. Allocated memory is still 2.1GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 23.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: [L713] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_p2_EBX=0] [L740] 0 _Bool weak$$choice0; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0] [L741] 0 _Bool weak$$choice2; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0] [L734] 0 int y$w_buff0; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, y$w_buff0=0] [L736] 0 int y$w_buff1; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, y$w_buff0=0, y$w_buff1=0] [L726] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, y$r_buff0_thd2=0, y$w_buff0=0, y$w_buff1=0] [L727] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$w_buff0=0, y$w_buff1=0] [L723] 0 int y$mem_tmp; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$w_buff0=0, y$w_buff1=0] [L724] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$w_buff0=0, y$w_buff1=0] [L725] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=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$w_buff0=0, y$w_buff1=0] [L732] 0 _Bool y$read_delayed; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=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$read_delayed=0, y$w_buff0=0, y$w_buff1=0] [L715] 0 int a = 0; VAL [__unbuffered_p2_EBX=0, a=0, weak$$choice0=0, weak$$choice2=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$read_delayed=0, y$w_buff0=0, y$w_buff1=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, weak$$choice0=0, weak$$choice2=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$read_delayed=0, y$w_buff0=0, y$w_buff1=0] [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, weak$$choice0=0, weak$$choice2=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$read_delayed=0, y$w_buff0=0, y$w_buff1=0] [L722] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, weak$$choice0=0, weak$$choice2=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$read_delayed=0, y$w_buff0=0, y$w_buff1=0] [L737] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, weak$$choice0=0, weak$$choice2=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$read_delayed=0, y$w_buff0=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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$read_delayed=0, y$w_buff0=0, y$w_buff1=0, y$w_buff1_used=0] [L716] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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$read_delayed=0, y$w_buff0=0, y$w_buff1=0, y$w_buff1_used=0] [L733] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff1=0, y$w_buff1_used=0] [L735] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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$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] [L719] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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$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] [L728] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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$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] [L721] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, 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$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] [L730] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, 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_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, 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_thd2=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] [L729] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, 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$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] [L731] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L823] 0 pthread_t t1196; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1196={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L824] FCALL, FORK 0 pthread_create(&t1196, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1196, ((void *)0), P0, ((void *)0))=-2, t1196={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L825] 0 pthread_t t1197; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1196={5:0}, t1197={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L826] FCALL, FORK 0 pthread_create(&t1197, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1197, ((void *)0), P1, ((void *)0))=-1, t1196={5:0}, t1197={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L827] 0 pthread_t t1198; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1196={5:0}, t1197={6:0}, t1198={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L828] FCALL, FORK 0 pthread_create(&t1198, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1198, ((void *)0), P2, ((void *)0))=0, t1196={5:0}, t1197={6:0}, t1198={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] 3 y$w_buff1 = y$w_buff0 [L781] 3 y$w_buff0 = 2 [L782] 3 y$w_buff1_used = y$w_buff0_used [L783] 3 y$w_buff0_used = (_Bool)1 [L784] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L784] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L785] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L786] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L787] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L788] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L789] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L792] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L795] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L745] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L763] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L767] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L768] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L769] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L770] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1196={5:0}, t1197={6:0}, t1198={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L832] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L832] RET 0 assume_abort_if_not(main$tmp_guard0) [L834] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L835] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L836] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L837] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L838] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1196={5:0}, t1197={6:0}, t1198={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L841] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L842] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L843] 0 y$flush_delayed = weak$$choice2 [L844] 0 y$mem_tmp = y [L845] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L846] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L847] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L848] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L849] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L850] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L851] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L853] 0 y = y$flush_delayed ? y$mem_tmp : y [L854] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1196={5:0}, t1197={6:0}, t1198={3:0}, weak$$choice0=53, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L856] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 826]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 824]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 145 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 34.4s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 17.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1015 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1015 mSDsluCounter, 1257 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1007 mSDsCounter, 152 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1987 IncrementalHoareTripleChecker+Invalid, 2139 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 152 mSolverCounterUnsat, 250 mSDtfsCounter, 1987 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 253 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 577 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2421occurred in iteration=10, InterpolantAutomatonStates: 200, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 15.0s InterpolantComputationTime, 1395 NumberOfCodeBlocks, 1395 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1288 ConstructedInterpolants, 0 QuantifiedInterpolants, 7234 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-16 10:56:14,091 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e6840d5-78ee-49fc-a40e-5e677af27c05/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE