./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e561d0-fa10-4054-9f11-d7c5e89a3415/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e561d0-fa10-4054-9f11-d7c5e89a3415/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e561d0-fa10-4054-9f11-d7c5e89a3415/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e561d0-fa10-4054-9f11-d7c5e89a3415/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e561d0-fa10-4054-9f11-d7c5e89a3415/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e561d0-fa10-4054-9f11-d7c5e89a3415/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8e0bd33ffca0122f84e298c52bb9fdae01e72661c94f68aaa49ed0f187d88b87 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 10:55:23,449 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:55:23,459 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:55:23,490 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:55:23,490 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:55:23,491 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:55:23,493 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:55:23,495 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:55:23,497 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:55:23,498 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:55:23,499 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:55:23,500 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:55:23,501 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:55:23,502 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:55:23,503 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:55:23,504 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:55:23,505 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:55:23,507 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:55:23,509 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:55:23,511 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:55:23,512 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:55:23,514 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:55:23,515 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:55:23,516 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:55:23,520 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:55:23,521 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:55:23,521 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:55:23,522 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:55:23,522 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:55:23,524 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:55:23,524 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:55:23,525 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:55:23,526 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:55:23,527 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:55:23,528 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:55:23,528 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:55:23,529 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:55:23,529 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:55:23,530 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:55:23,531 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:55:23,532 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:55:23,532 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e561d0-fa10-4054-9f11-d7c5e89a3415/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 10:55:23,566 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:55:23,571 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:55:23,572 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:55:23,572 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:55:23,573 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:55:23,573 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:55:23,574 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:55:23,574 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:55:23,575 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:55:23,575 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:55:23,576 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 10:55:23,576 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:55:23,576 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 10:55:23,576 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:55:23,577 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 10:55:23,577 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:55:23,577 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 10:55:23,577 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 10:55:23,577 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 10:55:23,578 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:55:23,578 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 10:55:23,578 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:55:23,578 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:55:23,579 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:55:23,579 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:55:23,579 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:55:23,579 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:55:23,579 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 10:55:23,580 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 10:55:23,580 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 10:55:23,580 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 10:55:23,580 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 10:55:23,581 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 10:55:23,581 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_26e561d0-fa10-4054-9f11-d7c5e89a3415/bin/uautomizer-ug76WZFUDN/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e561d0-fa10-4054-9f11-d7c5e89a3415/bin/uautomizer-ug76WZFUDN Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8e0bd33ffca0122f84e298c52bb9fdae01e72661c94f68aaa49ed0f187d88b87 [2022-11-20 10:55:23,846 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:55:23,879 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:55:23,882 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:55:23,883 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:55:23,884 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:55:23,885 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e561d0-fa10-4054-9f11-d7c5e89a3415/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-20 10:55:27,087 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:55:27,420 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:55:27,420 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e561d0-fa10-4054-9f11-d7c5e89a3415/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-20 10:55:27,447 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e561d0-fa10-4054-9f11-d7c5e89a3415/bin/uautomizer-ug76WZFUDN/data/efe927700/265e6e9a1a074b459f6647278f03d24f/FLAGe06b33410 [2022-11-20 10:55:27,478 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e561d0-fa10-4054-9f11-d7c5e89a3415/bin/uautomizer-ug76WZFUDN/data/efe927700/265e6e9a1a074b459f6647278f03d24f [2022-11-20 10:55:27,481 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:55:27,486 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:55:27,490 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:55:27,491 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:55:27,497 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:55:27,501 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:55:27" (1/1) ... [2022-11-20 10:55:27,502 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b49d1fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:55:27, skipping insertion in model container [2022-11-20 10:55:27,503 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:55:27" (1/1) ... [2022-11-20 10:55:27,511 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:55:27,582 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:55:27,804 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e561d0-fa10-4054-9f11-d7c5e89a3415/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-11-20 10:55:28,104 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:55:28,118 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:55:28,130 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e561d0-fa10-4054-9f11-d7c5e89a3415/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-11-20 10:55:28,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:55:28,235 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:55:28,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:55:28 WrapperNode [2022-11-20 10:55:28,236 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:55:28,237 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:55:28,237 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:55:28,237 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:55:28,245 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:55:28" (1/1) ... [2022-11-20 10:55:28,264 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:55:28" (1/1) ... [2022-11-20 10:55:28,313 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2022-11-20 10:55:28,313 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:55:28,314 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:55:28,314 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:55:28,315 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:55:28,326 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:55:28" (1/1) ... [2022-11-20 10:55:28,326 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:55:28" (1/1) ... [2022-11-20 10:55:28,331 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:55:28" (1/1) ... [2022-11-20 10:55:28,331 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:55:28" (1/1) ... [2022-11-20 10:55:28,343 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:55:28" (1/1) ... [2022-11-20 10:55:28,345 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:55:28" (1/1) ... [2022-11-20 10:55:28,348 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:55:28" (1/1) ... [2022-11-20 10:55:28,350 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:55:28" (1/1) ... [2022-11-20 10:55:28,355 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:55:28,356 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:55:28,356 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:55:28,356 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:55:28,357 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:55:28" (1/1) ... [2022-11-20 10:55:28,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:55:28,380 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e561d0-fa10-4054-9f11-d7c5e89a3415/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:55:28,407 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e561d0-fa10-4054-9f11-d7c5e89a3415/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 10:55:28,420 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e561d0-fa10-4054-9f11-d7c5e89a3415/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 10:55:28,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 10:55:28,464 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 10:55:28,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 10:55:28,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 10:55:28,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 10:55:28,465 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-20 10:55:28,466 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-20 10:55:28,468 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-20 10:55:28,470 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-20 10:55:28,470 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-20 10:55:28,471 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-20 10:55:28,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 10:55:28,471 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 10:55:28,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:55:28,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:55:28,474 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 10:55:28,687 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:55:28,689 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:55:29,300 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:55:29,563 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:55:29,563 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 10:55:29,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:55:29 BoogieIcfgContainer [2022-11-20 10:55:29,566 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:55:29,569 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 10:55:29,569 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 10:55:29,573 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 10:55:29,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:55:27" (1/3) ... [2022-11-20 10:55:29,575 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d870b1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:55:29, skipping insertion in model container [2022-11-20 10:55:29,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:55:28" (2/3) ... [2022-11-20 10:55:29,577 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d870b1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:55:29, skipping insertion in model container [2022-11-20 10:55:29,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:55:29" (3/3) ... [2022-11-20 10:55:29,579 INFO L112 eAbstractionObserver]: Analyzing ICFG safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-20 10:55:29,590 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 10:55:29,607 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 10:55:29,607 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-20 10:55:29,608 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 10:55:29,683 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-20 10:55:29,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 243 flow [2022-11-20 10:55:29,823 INFO L130 PetriNetUnfolder]: 2/111 cut-off events. [2022-11-20 10:55:29,827 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 10:55:29,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-11-20 10:55:29,833 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 114 transitions, 243 flow [2022-11-20 10:55:29,838 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 111 transitions, 231 flow [2022-11-20 10:55:29,849 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:55:29,858 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;@27acae5f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:55:29,859 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-20 10:55:29,911 INFO L130 PetriNetUnfolder]: 0/73 cut-off events. [2022-11-20 10:55:29,911 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 10:55:29,911 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:55:29,913 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] [2022-11-20 10:55:29,914 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 10:55:29,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:29,921 INFO L85 PathProgramCache]: Analyzing trace with hash 868228712, now seen corresponding path program 1 times [2022-11-20 10:55:29,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:29,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085946998] [2022-11-20 10:55:29,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:29,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:30,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:30,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:55:30,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:55:30,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085946998] [2022-11-20 10:55:30,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085946998] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:55:30,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:55:30,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:55:30,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186849315] [2022-11-20 10:55:30,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:55:30,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:55:30,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:55:30,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:55:30,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:55:30,790 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 114 [2022-11-20 10:55:30,793 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 111 transitions, 231 flow. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:30,793 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:55:30,793 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 114 [2022-11-20 10:55:30,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:55:31,157 INFO L130 PetriNetUnfolder]: 126/549 cut-off events. [2022-11-20 10:55:31,157 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-11-20 10:55:31,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 785 conditions, 549 events. 126/549 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2904 event pairs, 34 based on Foata normal form. 24/540 useless extension candidates. Maximal degree in co-relation 734. Up to 141 conditions per place. [2022-11-20 10:55:31,171 INFO L137 encePairwiseOnDemand]: 109/114 looper letters, 16 selfloop transitions, 2 changer transitions 0/113 dead transitions. [2022-11-20 10:55:31,171 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 113 transitions, 271 flow [2022-11-20 10:55:31,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:55:31,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 10:55:31,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 317 transitions. [2022-11-20 10:55:31,196 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9269005847953217 [2022-11-20 10:55:31,197 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 317 transitions. [2022-11-20 10:55:31,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 317 transitions. [2022-11-20 10:55:31,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:55:31,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 317 transitions. [2022-11-20 10:55:31,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:31,223 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:31,224 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:31,226 INFO L175 Difference]: Start difference. First operand has 119 places, 111 transitions, 231 flow. Second operand 3 states and 317 transitions. [2022-11-20 10:55:31,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 113 transitions, 271 flow [2022-11-20 10:55:31,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 113 transitions, 268 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-20 10:55:31,240 INFO L231 Difference]: Finished difference. Result has 116 places, 107 transitions, 224 flow [2022-11-20 10:55:31,243 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=116, PETRI_TRANSITIONS=107} [2022-11-20 10:55:31,251 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, -3 predicate places. [2022-11-20 10:55:31,252 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 107 transitions, 224 flow [2022-11-20 10:55:31,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:31,253 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:55:31,253 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] [2022-11-20 10:55:31,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 10:55:31,254 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 10:55:31,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:31,256 INFO L85 PathProgramCache]: Analyzing trace with hash -587547777, now seen corresponding path program 1 times [2022-11-20 10:55:31,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:31,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072531996] [2022-11-20 10:55:31,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:31,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:31,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:32,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:55:32,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:55:32,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072531996] [2022-11-20 10:55:32,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072531996] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:55:32,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:55:32,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 10:55:32,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059774327] [2022-11-20 10:55:32,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:55:32,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:55:32,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:55:32,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:55:32,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:55:32,278 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 114 [2022-11-20 10:55:32,284 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 107 transitions, 224 flow. Second operand has 7 states, 7 states have (on average 82.85714285714286) internal successors, (580), 7 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:32,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:55:32,288 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 114 [2022-11-20 10:55:32,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:55:34,431 INFO L130 PetriNetUnfolder]: 1814/4534 cut-off events. [2022-11-20 10:55:34,431 INFO L131 PetriNetUnfolder]: For 165/165 co-relation queries the response was YES. [2022-11-20 10:55:34,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7457 conditions, 4534 events. 1814/4534 cut-off events. For 165/165 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 37182 event pairs, 219 based on Foata normal form. 0/4404 useless extension candidates. Maximal degree in co-relation 7397. Up to 1371 conditions per place. [2022-11-20 10:55:34,463 INFO L137 encePairwiseOnDemand]: 99/114 looper letters, 38 selfloop transitions, 13 changer transitions 96/213 dead transitions. [2022-11-20 10:55:34,463 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 213 transitions, 726 flow [2022-11-20 10:55:34,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 10:55:34,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-20 10:55:34,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1179 transitions. [2022-11-20 10:55:34,469 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7955465587044535 [2022-11-20 10:55:34,469 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1179 transitions. [2022-11-20 10:55:34,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1179 transitions. [2022-11-20 10:55:34,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:55:34,471 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1179 transitions. [2022-11-20 10:55:34,475 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 90.6923076923077) internal successors, (1179), 13 states have internal predecessors, (1179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:34,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:34,482 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:34,482 INFO L175 Difference]: Start difference. First operand has 116 places, 107 transitions, 224 flow. Second operand 13 states and 1179 transitions. [2022-11-20 10:55:34,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 213 transitions, 726 flow [2022-11-20 10:55:34,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 213 transitions, 708 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 10:55:34,489 INFO L231 Difference]: Finished difference. Result has 137 places, 104 transitions, 320 flow [2022-11-20 10:55:34,490 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=320, PETRI_PLACES=137, PETRI_TRANSITIONS=104} [2022-11-20 10:55:34,491 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 18 predicate places. [2022-11-20 10:55:34,491 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 104 transitions, 320 flow [2022-11-20 10:55:34,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 82.85714285714286) internal successors, (580), 7 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:34,492 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:55:34,492 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:55:34,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 10:55:34,493 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 10:55:34,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:34,494 INFO L85 PathProgramCache]: Analyzing trace with hash 623547358, now seen corresponding path program 1 times [2022-11-20 10:55:34,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:34,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673202370] [2022-11-20 10:55:34,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:34,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:34,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:35,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:55:35,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:55:35,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673202370] [2022-11-20 10:55:35,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673202370] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:55:35,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:55:35,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 10:55:35,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235443077] [2022-11-20 10:55:35,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:55:35,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:55:35,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:55:35,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:55:35,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:55:35,150 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 114 [2022-11-20 10:55:35,151 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 104 transitions, 320 flow. Second operand has 7 states, 7 states have (on average 83.0) internal successors, (581), 7 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:35,151 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:55:35,152 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 114 [2022-11-20 10:55:35,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:55:36,483 INFO L130 PetriNetUnfolder]: 982/1958 cut-off events. [2022-11-20 10:55:36,483 INFO L131 PetriNetUnfolder]: For 4233/5878 co-relation queries the response was YES. [2022-11-20 10:55:36,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7047 conditions, 1958 events. 982/1958 cut-off events. For 4233/5878 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 11479 event pairs, 231 based on Foata normal form. 69/1948 useless extension candidates. Maximal degree in co-relation 6973. Up to 851 conditions per place. [2022-11-20 10:55:36,500 INFO L137 encePairwiseOnDemand]: 102/114 looper letters, 45 selfloop transitions, 10 changer transitions 73/194 dead transitions. [2022-11-20 10:55:36,500 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 194 transitions, 1119 flow [2022-11-20 10:55:36,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 10:55:36,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-20 10:55:36,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1149 transitions. [2022-11-20 10:55:36,506 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7753036437246964 [2022-11-20 10:55:36,506 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1149 transitions. [2022-11-20 10:55:36,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1149 transitions. [2022-11-20 10:55:36,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:55:36,509 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1149 transitions. [2022-11-20 10:55:36,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 88.38461538461539) internal successors, (1149), 13 states have internal predecessors, (1149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:36,517 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:36,518 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:36,518 INFO L175 Difference]: Start difference. First operand has 137 places, 104 transitions, 320 flow. Second operand 13 states and 1149 transitions. [2022-11-20 10:55:36,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 194 transitions, 1119 flow [2022-11-20 10:55:36,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 194 transitions, 1071 flow, removed 24 selfloop flow, removed 6 redundant places. [2022-11-20 10:55:36,546 INFO L231 Difference]: Finished difference. Result has 134 places, 110 transitions, 429 flow [2022-11-20 10:55:36,546 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=429, PETRI_PLACES=134, PETRI_TRANSITIONS=110} [2022-11-20 10:55:36,551 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 15 predicate places. [2022-11-20 10:55:36,552 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 110 transitions, 429 flow [2022-11-20 10:55:36,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 83.0) internal successors, (581), 7 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:36,552 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:55:36,553 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:55:36,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 10:55:36,554 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 10:55:36,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:36,555 INFO L85 PathProgramCache]: Analyzing trace with hash -919367550, now seen corresponding path program 1 times [2022-11-20 10:55:36,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:36,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112523440] [2022-11-20 10:55:36,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:36,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:36,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:38,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:55:38,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:55:38,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112523440] [2022-11-20 10:55:38,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112523440] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:55:38,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:55:38,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 10:55:38,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321957521] [2022-11-20 10:55:38,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:55:38,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 10:55:38,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:55:38,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 10:55:38,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-11-20 10:55:38,443 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 114 [2022-11-20 10:55:38,444 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 110 transitions, 429 flow. Second operand has 11 states, 11 states have (on average 89.54545454545455) internal successors, (985), 11 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:38,444 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:55:38,444 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 114 [2022-11-20 10:55:38,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:55:39,133 INFO L130 PetriNetUnfolder]: 474/1043 cut-off events. [2022-11-20 10:55:39,133 INFO L131 PetriNetUnfolder]: For 4231/5991 co-relation queries the response was YES. [2022-11-20 10:55:39,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4291 conditions, 1043 events. 474/1043 cut-off events. For 4231/5991 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 5371 event pairs, 60 based on Foata normal form. 110/1089 useless extension candidates. Maximal degree in co-relation 4215. Up to 532 conditions per place. [2022-11-20 10:55:39,145 INFO L137 encePairwiseOnDemand]: 105/114 looper letters, 34 selfloop transitions, 6 changer transitions 34/154 dead transitions. [2022-11-20 10:55:39,145 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 154 transitions, 936 flow [2022-11-20 10:55:39,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 10:55:39,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-20 10:55:39,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1114 transitions. [2022-11-20 10:55:39,149 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.814327485380117 [2022-11-20 10:55:39,149 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1114 transitions. [2022-11-20 10:55:39,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1114 transitions. [2022-11-20 10:55:39,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:55:39,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1114 transitions. [2022-11-20 10:55:39,157 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 92.83333333333333) internal successors, (1114), 12 states have internal predecessors, (1114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:39,160 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:39,163 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:39,163 INFO L175 Difference]: Start difference. First operand has 134 places, 110 transitions, 429 flow. Second operand 12 states and 1114 transitions. [2022-11-20 10:55:39,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 154 transitions, 936 flow [2022-11-20 10:55:39,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 154 transitions, 890 flow, removed 21 selfloop flow, removed 4 redundant places. [2022-11-20 10:55:39,183 INFO L231 Difference]: Finished difference. Result has 140 places, 112 transitions, 445 flow [2022-11-20 10:55:39,184 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=445, PETRI_PLACES=140, PETRI_TRANSITIONS=112} [2022-11-20 10:55:39,185 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 21 predicate places. [2022-11-20 10:55:39,187 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 112 transitions, 445 flow [2022-11-20 10:55:39,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 89.54545454545455) internal successors, (985), 11 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:39,188 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:55:39,188 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] [2022-11-20 10:55:39,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 10:55:39,189 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 10:55:39,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:39,190 INFO L85 PathProgramCache]: Analyzing trace with hash 2112477712, now seen corresponding path program 1 times [2022-11-20 10:55:39,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:39,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553246909] [2022-11-20 10:55:39,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:39,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:39,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:39,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:55:39,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:55:39,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553246909] [2022-11-20 10:55:39,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553246909] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:55:39,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:55:39,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 10:55:39,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996900606] [2022-11-20 10:55:39,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:55:39,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:55:39,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:55:39,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:55:39,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:55:39,568 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2022-11-20 10:55:39,569 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 112 transitions, 445 flow. Second operand has 6 states, 6 states have (on average 92.5) internal successors, (555), 6 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:39,569 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:55:39,569 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2022-11-20 10:55:39,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:55:40,215 INFO L130 PetriNetUnfolder]: 586/1448 cut-off events. [2022-11-20 10:55:40,216 INFO L131 PetriNetUnfolder]: For 4032/10322 co-relation queries the response was YES. [2022-11-20 10:55:40,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5679 conditions, 1448 events. 586/1448 cut-off events. For 4032/10322 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9129 event pairs, 225 based on Foata normal form. 22/1394 useless extension candidates. Maximal degree in co-relation 5598. Up to 669 conditions per place. [2022-11-20 10:55:40,231 INFO L137 encePairwiseOnDemand]: 108/114 looper letters, 38 selfloop transitions, 7 changer transitions 28/150 dead transitions. [2022-11-20 10:55:40,232 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 150 transitions, 912 flow [2022-11-20 10:55:40,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 10:55:40,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-20 10:55:40,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 870 transitions. [2022-11-20 10:55:40,235 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.847953216374269 [2022-11-20 10:55:40,235 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 870 transitions. [2022-11-20 10:55:40,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 870 transitions. [2022-11-20 10:55:40,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:55:40,236 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 870 transitions. [2022-11-20 10:55:40,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 96.66666666666667) internal successors, (870), 9 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:40,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:40,241 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:40,242 INFO L175 Difference]: Start difference. First operand has 140 places, 112 transitions, 445 flow. Second operand 9 states and 870 transitions. [2022-11-20 10:55:40,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 150 transitions, 912 flow [2022-11-20 10:55:40,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 150 transitions, 847 flow, removed 29 selfloop flow, removed 15 redundant places. [2022-11-20 10:55:40,259 INFO L231 Difference]: Finished difference. Result has 134 places, 112 transitions, 443 flow [2022-11-20 10:55:40,259 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=443, PETRI_PLACES=134, PETRI_TRANSITIONS=112} [2022-11-20 10:55:40,260 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 15 predicate places. [2022-11-20 10:55:40,260 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 112 transitions, 443 flow [2022-11-20 10:55:40,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.5) internal successors, (555), 6 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:40,261 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:55:40,261 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:55:40,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 10:55:40,262 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 10:55:40,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:40,262 INFO L85 PathProgramCache]: Analyzing trace with hash -276885542, now seen corresponding path program 1 times [2022-11-20 10:55:40,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:40,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317697169] [2022-11-20 10:55:40,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:40,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:40,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:41,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:55:41,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:55:41,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317697169] [2022-11-20 10:55:41,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317697169] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:55:41,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:55:41,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-20 10:55:41,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773941004] [2022-11-20 10:55:41,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:55:41,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 10:55:41,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:55:41,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 10:55:41,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-11-20 10:55:41,905 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 114 [2022-11-20 10:55:41,906 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 112 transitions, 443 flow. Second operand has 13 states, 13 states have (on average 80.07692307692308) internal successors, (1041), 13 states have internal predecessors, (1041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:41,906 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:55:41,906 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 114 [2022-11-20 10:55:41,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:55:43,995 INFO L130 PetriNetUnfolder]: 752/1785 cut-off events. [2022-11-20 10:55:43,996 INFO L131 PetriNetUnfolder]: For 6035/10812 co-relation queries the response was YES. [2022-11-20 10:55:44,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7105 conditions, 1785 events. 752/1785 cut-off events. For 6035/10812 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 11257 event pairs, 84 based on Foata normal form. 44/1725 useless extension candidates. Maximal degree in co-relation 7020. Up to 804 conditions per place. [2022-11-20 10:55:44,017 INFO L137 encePairwiseOnDemand]: 96/114 looper letters, 55 selfloop transitions, 50 changer transitions 50/219 dead transitions. [2022-11-20 10:55:44,017 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 219 transitions, 1681 flow [2022-11-20 10:55:44,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 10:55:44,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-11-20 10:55:44,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1602 transitions. [2022-11-20 10:55:44,024 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.739612188365651 [2022-11-20 10:55:44,025 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1602 transitions. [2022-11-20 10:55:44,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1602 transitions. [2022-11-20 10:55:44,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:55:44,026 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1602 transitions. [2022-11-20 10:55:44,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 84.3157894736842) internal successors, (1602), 19 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:44,037 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 114.0) internal successors, (2280), 20 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:44,038 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 114.0) internal successors, (2280), 20 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:44,039 INFO L175 Difference]: Start difference. First operand has 134 places, 112 transitions, 443 flow. Second operand 19 states and 1602 transitions. [2022-11-20 10:55:44,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 219 transitions, 1681 flow [2022-11-20 10:55:44,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 219 transitions, 1618 flow, removed 20 selfloop flow, removed 7 redundant places. [2022-11-20 10:55:44,060 INFO L231 Difference]: Finished difference. Result has 150 places, 145 transitions, 895 flow [2022-11-20 10:55:44,060 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=895, PETRI_PLACES=150, PETRI_TRANSITIONS=145} [2022-11-20 10:55:44,063 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 31 predicate places. [2022-11-20 10:55:44,063 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 145 transitions, 895 flow [2022-11-20 10:55:44,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 80.07692307692308) internal successors, (1041), 13 states have internal predecessors, (1041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:44,064 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:55:44,065 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:55:44,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 10:55:44,065 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 10:55:44,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:44,066 INFO L85 PathProgramCache]: Analyzing trace with hash -45681332, now seen corresponding path program 2 times [2022-11-20 10:55:44,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:44,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294355618] [2022-11-20 10:55:44,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:44,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:44,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:45,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:55:45,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:55:45,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294355618] [2022-11-20 10:55:45,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294355618] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:55:45,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:55:45,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-11-20 10:55:45,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867402930] [2022-11-20 10:55:45,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:55:45,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-20 10:55:45,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:55:45,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-20 10:55:45,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-11-20 10:55:45,932 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 114 [2022-11-20 10:55:45,934 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 145 transitions, 895 flow. Second operand has 16 states, 16 states have (on average 85.375) internal successors, (1366), 16 states have internal predecessors, (1366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:45,934 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:55:45,934 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 114 [2022-11-20 10:55:45,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:55:47,172 INFO L130 PetriNetUnfolder]: 708/1670 cut-off events. [2022-11-20 10:55:47,172 INFO L131 PetriNetUnfolder]: For 9503/34461 co-relation queries the response was YES. [2022-11-20 10:55:47,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8038 conditions, 1670 events. 708/1670 cut-off events. For 9503/34461 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 10747 event pairs, 69 based on Foata normal form. 183/1765 useless extension candidates. Maximal degree in co-relation 7945. Up to 867 conditions per place. [2022-11-20 10:55:47,193 INFO L137 encePairwiseOnDemand]: 97/114 looper letters, 58 selfloop transitions, 30 changer transitions 51/222 dead transitions. [2022-11-20 10:55:47,193 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 222 transitions, 2040 flow [2022-11-20 10:55:47,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 10:55:47,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-20 10:55:47,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1412 transitions. [2022-11-20 10:55:47,198 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7741228070175439 [2022-11-20 10:55:47,198 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1412 transitions. [2022-11-20 10:55:47,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1412 transitions. [2022-11-20 10:55:47,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:55:47,199 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1412 transitions. [2022-11-20 10:55:47,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 88.25) internal successors, (1412), 16 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:47,208 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 114.0) internal successors, (1938), 17 states have internal predecessors, (1938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:47,209 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 114.0) internal successors, (1938), 17 states have internal predecessors, (1938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:47,209 INFO L175 Difference]: Start difference. First operand has 150 places, 145 transitions, 895 flow. Second operand 16 states and 1412 transitions. [2022-11-20 10:55:47,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 222 transitions, 2040 flow [2022-11-20 10:55:47,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 222 transitions, 1989 flow, removed 22 selfloop flow, removed 10 redundant places. [2022-11-20 10:55:47,232 INFO L231 Difference]: Finished difference. Result has 156 places, 161 transitions, 1229 flow [2022-11-20 10:55:47,232 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=868, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1229, PETRI_PLACES=156, PETRI_TRANSITIONS=161} [2022-11-20 10:55:47,233 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 37 predicate places. [2022-11-20 10:55:47,233 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 161 transitions, 1229 flow [2022-11-20 10:55:47,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 85.375) internal successors, (1366), 16 states have internal predecessors, (1366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:47,234 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:55:47,234 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:55:47,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 10:55:47,235 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 10:55:47,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:47,236 INFO L85 PathProgramCache]: Analyzing trace with hash 503271126, now seen corresponding path program 3 times [2022-11-20 10:55:47,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:47,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726591517] [2022-11-20 10:55:47,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:47,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:47,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:48,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:55:48,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:55:48,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726591517] [2022-11-20 10:55:48,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726591517] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:55:48,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:55:48,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-20 10:55:48,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999232762] [2022-11-20 10:55:48,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:55:48,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 10:55:48,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:55:48,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 10:55:48,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-11-20 10:55:48,935 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 114 [2022-11-20 10:55:48,937 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 161 transitions, 1229 flow. Second operand has 13 states, 13 states have (on average 85.6923076923077) internal successors, (1114), 13 states have internal predecessors, (1114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:48,937 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:55:48,937 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 114 [2022-11-20 10:55:48,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:55:50,317 INFO L130 PetriNetUnfolder]: 795/1893 cut-off events. [2022-11-20 10:55:50,318 INFO L131 PetriNetUnfolder]: For 19437/31210 co-relation queries the response was YES. [2022-11-20 10:55:50,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11664 conditions, 1893 events. 795/1893 cut-off events. For 19437/31210 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 12693 event pairs, 87 based on Foata normal form. 200/1974 useless extension candidates. Maximal degree in co-relation 11567. Up to 1005 conditions per place. [2022-11-20 10:55:50,343 INFO L137 encePairwiseOnDemand]: 101/114 looper letters, 75 selfloop transitions, 34 changer transitions 51/243 dead transitions. [2022-11-20 10:55:50,344 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 243 transitions, 2864 flow [2022-11-20 10:55:50,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 10:55:50,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-20 10:55:50,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1247 transitions. [2022-11-20 10:55:50,348 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.781328320802005 [2022-11-20 10:55:50,348 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1247 transitions. [2022-11-20 10:55:50,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1247 transitions. [2022-11-20 10:55:50,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:55:50,350 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1247 transitions. [2022-11-20 10:55:50,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 89.07142857142857) internal successors, (1247), 14 states have internal predecessors, (1247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:50,356 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 114.0) internal successors, (1710), 15 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:50,357 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 114.0) internal successors, (1710), 15 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:50,357 INFO L175 Difference]: Start difference. First operand has 156 places, 161 transitions, 1229 flow. Second operand 14 states and 1247 transitions. [2022-11-20 10:55:50,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 243 transitions, 2864 flow [2022-11-20 10:55:50,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 243 transitions, 2696 flow, removed 58 selfloop flow, removed 11 redundant places. [2022-11-20 10:55:50,395 INFO L231 Difference]: Finished difference. Result has 159 places, 171 transitions, 1435 flow [2022-11-20 10:55:50,395 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1123, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1435, PETRI_PLACES=159, PETRI_TRANSITIONS=171} [2022-11-20 10:55:50,396 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 40 predicate places. [2022-11-20 10:55:50,396 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 171 transitions, 1435 flow [2022-11-20 10:55:50,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 85.6923076923077) internal successors, (1114), 13 states have internal predecessors, (1114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:50,397 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:55:50,397 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:55:50,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 10:55:50,398 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 10:55:50,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:50,398 INFO L85 PathProgramCache]: Analyzing trace with hash 268777792, now seen corresponding path program 4 times [2022-11-20 10:55:50,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:50,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706827118] [2022-11-20 10:55:50,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:50,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:50,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:52,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:55:52,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:55:52,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706827118] [2022-11-20 10:55:52,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706827118] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:55:52,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:55:52,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-20 10:55:52,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176205797] [2022-11-20 10:55:52,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:55:52,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-20 10:55:52,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:55:52,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-20 10:55:52,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2022-11-20 10:55:52,398 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 114 [2022-11-20 10:55:52,400 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 171 transitions, 1435 flow. Second operand has 15 states, 15 states have (on average 85.46666666666667) internal successors, (1282), 15 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:52,400 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:55:52,400 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 114 [2022-11-20 10:55:52,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:55:54,122 INFO L130 PetriNetUnfolder]: 863/2113 cut-off events. [2022-11-20 10:55:54,122 INFO L131 PetriNetUnfolder]: For 35214/47626 co-relation queries the response was YES. [2022-11-20 10:55:54,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14475 conditions, 2113 events. 863/2113 cut-off events. For 35214/47626 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 15178 event pairs, 60 based on Foata normal form. 227/2209 useless extension candidates. Maximal degree in co-relation 14376. Up to 1134 conditions per place. [2022-11-20 10:55:54,153 INFO L137 encePairwiseOnDemand]: 101/114 looper letters, 63 selfloop transitions, 50 changer transitions 85/281 dead transitions. [2022-11-20 10:55:54,153 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 281 transitions, 4106 flow [2022-11-20 10:55:54,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 10:55:54,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-11-20 10:55:54,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1684 transitions. [2022-11-20 10:55:54,159 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7774699907663897 [2022-11-20 10:55:54,159 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1684 transitions. [2022-11-20 10:55:54,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1684 transitions. [2022-11-20 10:55:54,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:55:54,161 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1684 transitions. [2022-11-20 10:55:54,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 88.63157894736842) internal successors, (1684), 19 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:54,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 114.0) internal successors, (2280), 20 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:54,171 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 114.0) internal successors, (2280), 20 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:54,172 INFO L175 Difference]: Start difference. First operand has 159 places, 171 transitions, 1435 flow. Second operand 19 states and 1684 transitions. [2022-11-20 10:55:54,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 281 transitions, 4106 flow [2022-11-20 10:55:54,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 281 transitions, 4004 flow, removed 24 selfloop flow, removed 10 redundant places. [2022-11-20 10:55:54,269 INFO L231 Difference]: Finished difference. Result has 172 places, 177 transitions, 1700 flow [2022-11-20 10:55:54,270 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1349, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1700, PETRI_PLACES=172, PETRI_TRANSITIONS=177} [2022-11-20 10:55:54,270 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 53 predicate places. [2022-11-20 10:55:54,271 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 177 transitions, 1700 flow [2022-11-20 10:55:54,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 85.46666666666667) internal successors, (1282), 15 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:54,272 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:55:54,272 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:55:54,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 10:55:54,272 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 10:55:54,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:54,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1826220808, now seen corresponding path program 1 times [2022-11-20 10:55:54,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:54,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243567709] [2022-11-20 10:55:54,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:54,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:54,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:55,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-20 10:55:55,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:55:55,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243567709] [2022-11-20 10:55:55,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243567709] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:55:56,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:55:56,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-11-20 10:55:56,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901936049] [2022-11-20 10:55:56,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:55:56,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-20 10:55:56,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:55:56,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-20 10:55:56,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-11-20 10:55:56,008 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 114 [2022-11-20 10:55:56,010 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 177 transitions, 1700 flow. Second operand has 16 states, 16 states have (on average 81.6875) internal successors, (1307), 16 states have internal predecessors, (1307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:56,010 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:55:56,010 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 114 [2022-11-20 10:55:56,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:55:57,309 INFO L130 PetriNetUnfolder]: 606/1629 cut-off events. [2022-11-20 10:55:57,310 INFO L131 PetriNetUnfolder]: For 24060/38928 co-relation queries the response was YES. [2022-11-20 10:55:57,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10711 conditions, 1629 events. 606/1629 cut-off events. For 24060/38928 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 11816 event pairs, 71 based on Foata normal form. 123/1630 useless extension candidates. Maximal degree in co-relation 10600. Up to 841 conditions per place. [2022-11-20 10:55:57,333 INFO L137 encePairwiseOnDemand]: 100/114 looper letters, 83 selfloop transitions, 27 changer transitions 49/237 dead transitions. [2022-11-20 10:55:57,333 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 237 transitions, 3009 flow [2022-11-20 10:55:57,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 10:55:57,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-11-20 10:55:57,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1434 transitions. [2022-11-20 10:55:57,338 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.739938080495356 [2022-11-20 10:55:57,339 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1434 transitions. [2022-11-20 10:55:57,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1434 transitions. [2022-11-20 10:55:57,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:55:57,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1434 transitions. [2022-11-20 10:55:57,344 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 84.3529411764706) internal successors, (1434), 17 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:57,348 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 114.0) internal successors, (2052), 18 states have internal predecessors, (2052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:57,349 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 114.0) internal successors, (2052), 18 states have internal predecessors, (2052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:57,349 INFO L175 Difference]: Start difference. First operand has 172 places, 177 transitions, 1700 flow. Second operand 17 states and 1434 transitions. [2022-11-20 10:55:57,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 237 transitions, 3009 flow [2022-11-20 10:55:57,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 237 transitions, 2878 flow, removed 54 selfloop flow, removed 16 redundant places. [2022-11-20 10:55:57,453 INFO L231 Difference]: Finished difference. Result has 171 places, 168 transitions, 1547 flow [2022-11-20 10:55:57,454 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1593, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1547, PETRI_PLACES=171, PETRI_TRANSITIONS=168} [2022-11-20 10:55:57,455 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 52 predicate places. [2022-11-20 10:55:57,455 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 168 transitions, 1547 flow [2022-11-20 10:55:57,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 81.6875) internal successors, (1307), 16 states have internal predecessors, (1307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:57,456 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:55:57,456 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:55:57,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 10:55:57,457 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 10:55:57,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:57,457 INFO L85 PathProgramCache]: Analyzing trace with hash -172558178, now seen corresponding path program 2 times [2022-11-20 10:55:57,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:57,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683126477] [2022-11-20 10:55:57,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:57,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:57,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:59,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:55:59,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:55:59,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683126477] [2022-11-20 10:55:59,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683126477] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:55:59,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:55:59,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-11-20 10:55:59,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632655070] [2022-11-20 10:55:59,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:55:59,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-20 10:55:59,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:55:59,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-20 10:55:59,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-11-20 10:55:59,280 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 114 [2022-11-20 10:55:59,281 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 168 transitions, 1547 flow. Second operand has 16 states, 16 states have (on average 86.375) internal successors, (1382), 16 states have internal predecessors, (1382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:59,281 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:55:59,281 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 114 [2022-11-20 10:55:59,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:56:00,257 INFO L130 PetriNetUnfolder]: 553/1527 cut-off events. [2022-11-20 10:56:00,257 INFO L131 PetriNetUnfolder]: For 23430/57942 co-relation queries the response was YES. [2022-11-20 10:56:00,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10168 conditions, 1527 events. 553/1527 cut-off events. For 23430/57942 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 11061 event pairs, 98 based on Foata normal form. 85/1514 useless extension candidates. Maximal degree in co-relation 10063. Up to 781 conditions per place. [2022-11-20 10:56:00,279 INFO L137 encePairwiseOnDemand]: 100/114 looper letters, 67 selfloop transitions, 38 changer transitions 34/222 dead transitions. [2022-11-20 10:56:00,280 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 222 transitions, 2902 flow [2022-11-20 10:56:00,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 10:56:00,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-20 10:56:00,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1247 transitions. [2022-11-20 10:56:00,283 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.781328320802005 [2022-11-20 10:56:00,284 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1247 transitions. [2022-11-20 10:56:00,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1247 transitions. [2022-11-20 10:56:00,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:56:00,285 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1247 transitions. [2022-11-20 10:56:00,288 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 89.07142857142857) internal successors, (1247), 14 states have internal predecessors, (1247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:00,291 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 114.0) internal successors, (1710), 15 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:00,292 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 114.0) internal successors, (1710), 15 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:00,293 INFO L175 Difference]: Start difference. First operand has 171 places, 168 transitions, 1547 flow. Second operand 14 states and 1247 transitions. [2022-11-20 10:56:00,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 222 transitions, 2902 flow [2022-11-20 10:56:00,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 222 transitions, 2684 flow, removed 76 selfloop flow, removed 16 redundant places. [2022-11-20 10:56:00,388 INFO L231 Difference]: Finished difference. Result has 166 places, 174 transitions, 1677 flow [2022-11-20 10:56:00,389 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1453, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1677, PETRI_PLACES=166, PETRI_TRANSITIONS=174} [2022-11-20 10:56:00,389 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 47 predicate places. [2022-11-20 10:56:00,390 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 174 transitions, 1677 flow [2022-11-20 10:56:00,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 86.375) internal successors, (1382), 16 states have internal predecessors, (1382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:00,391 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:56:00,392 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:56:00,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 10:56:00,392 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 10:56:00,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:56:00,393 INFO L85 PathProgramCache]: Analyzing trace with hash 2121529102, now seen corresponding path program 3 times [2022-11-20 10:56:00,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:56:00,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033720564] [2022-11-20 10:56:00,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:56:00,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:56:00,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:01,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:56:01,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:56:01,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033720564] [2022-11-20 10:56:01,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033720564] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:56:01,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:56:01,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-20 10:56:01,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952382395] [2022-11-20 10:56:01,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:56:01,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-20 10:56:01,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:56:01,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 10:56:01,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-11-20 10:56:01,342 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 114 [2022-11-20 10:56:01,344 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 174 transitions, 1677 flow. Second operand has 14 states, 14 states have (on average 85.64285714285714) internal successors, (1199), 14 states have internal predecessors, (1199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:01,344 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:56:01,344 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 114 [2022-11-20 10:56:01,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:56:02,364 INFO L130 PetriNetUnfolder]: 495/1439 cut-off events. [2022-11-20 10:56:02,364 INFO L131 PetriNetUnfolder]: For 17362/66709 co-relation queries the response was YES. [2022-11-20 10:56:02,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9124 conditions, 1439 events. 495/1439 cut-off events. For 17362/66709 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 10864 event pairs, 55 based on Foata normal form. 94/1436 useless extension candidates. Maximal degree in co-relation 9020. Up to 724 conditions per place. [2022-11-20 10:56:02,381 INFO L137 encePairwiseOnDemand]: 102/114 looper letters, 82 selfloop transitions, 15 changer transitions 46/223 dead transitions. [2022-11-20 10:56:02,381 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 223 transitions, 2833 flow [2022-11-20 10:56:02,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 10:56:02,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-20 10:56:02,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1408 transitions. [2022-11-20 10:56:02,388 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7719298245614035 [2022-11-20 10:56:02,389 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1408 transitions. [2022-11-20 10:56:02,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1408 transitions. [2022-11-20 10:56:02,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:56:02,390 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1408 transitions. [2022-11-20 10:56:02,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 88.0) internal successors, (1408), 16 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:02,397 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 114.0) internal successors, (1938), 17 states have internal predecessors, (1938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:02,398 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 114.0) internal successors, (1938), 17 states have internal predecessors, (1938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:02,398 INFO L175 Difference]: Start difference. First operand has 166 places, 174 transitions, 1677 flow. Second operand 16 states and 1408 transitions. [2022-11-20 10:56:02,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 223 transitions, 2833 flow [2022-11-20 10:56:02,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 223 transitions, 2661 flow, removed 48 selfloop flow, removed 13 redundant places. [2022-11-20 10:56:02,456 INFO L231 Difference]: Finished difference. Result has 171 places, 166 transitions, 1467 flow [2022-11-20 10:56:02,457 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1569, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1467, PETRI_PLACES=171, PETRI_TRANSITIONS=166} [2022-11-20 10:56:02,459 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 52 predicate places. [2022-11-20 10:56:02,459 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 166 transitions, 1467 flow [2022-11-20 10:56:02,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 85.64285714285714) internal successors, (1199), 14 states have internal predecessors, (1199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:02,460 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:56:02,460 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:56:02,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 10:56:02,461 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 10:56:02,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:56:02,461 INFO L85 PathProgramCache]: Analyzing trace with hash 2143782873, now seen corresponding path program 1 times [2022-11-20 10:56:02,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:56:02,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323455813] [2022-11-20 10:56:02,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:56:02,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:56:02,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:02,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:56:02,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:56:02,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323455813] [2022-11-20 10:56:02,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323455813] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:56:02,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:56:02,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 10:56:02,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305150795] [2022-11-20 10:56:02,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:56:02,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:56:02,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:56:02,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:56:02,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:56:02,781 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 114 [2022-11-20 10:56:02,781 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 166 transitions, 1467 flow. Second operand has 6 states, 6 states have (on average 90.66666666666667) internal successors, (544), 6 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:02,782 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:56:02,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 114 [2022-11-20 10:56:02,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:56:03,806 INFO L130 PetriNetUnfolder]: 1818/3677 cut-off events. [2022-11-20 10:56:03,807 INFO L131 PetriNetUnfolder]: For 63269/63912 co-relation queries the response was YES. [2022-11-20 10:56:03,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20160 conditions, 3677 events. 1818/3677 cut-off events. For 63269/63912 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 26817 event pairs, 90 based on Foata normal form. 186/3746 useless extension candidates. Maximal degree in co-relation 20061. Up to 1392 conditions per place. [2022-11-20 10:56:03,832 INFO L137 encePairwiseOnDemand]: 104/114 looper letters, 100 selfloop transitions, 7 changer transitions 138/328 dead transitions. [2022-11-20 10:56:03,832 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 328 transitions, 4448 flow [2022-11-20 10:56:03,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 10:56:03,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-20 10:56:03,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 977 transitions. [2022-11-20 10:56:03,835 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8570175438596491 [2022-11-20 10:56:03,835 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 977 transitions. [2022-11-20 10:56:03,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 977 transitions. [2022-11-20 10:56:03,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:56:03,836 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 977 transitions. [2022-11-20 10:56:03,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 97.7) internal successors, (977), 10 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:03,839 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:03,839 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:03,840 INFO L175 Difference]: Start difference. First operand has 171 places, 166 transitions, 1467 flow. Second operand 10 states and 977 transitions. [2022-11-20 10:56:03,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 328 transitions, 4448 flow [2022-11-20 10:56:03,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 328 transitions, 4174 flow, removed 109 selfloop flow, removed 19 redundant places. [2022-11-20 10:56:03,907 INFO L231 Difference]: Finished difference. Result has 159 places, 153 transitions, 1186 flow [2022-11-20 10:56:03,908 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1124, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1186, PETRI_PLACES=159, PETRI_TRANSITIONS=153} [2022-11-20 10:56:03,908 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 40 predicate places. [2022-11-20 10:56:03,909 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 153 transitions, 1186 flow [2022-11-20 10:56:03,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.66666666666667) internal successors, (544), 6 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:03,909 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:56:03,909 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:56:03,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 10:56:03,910 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 10:56:03,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:56:03,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1626016270, now seen corresponding path program 1 times [2022-11-20 10:56:03,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:56:03,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736650300] [2022-11-20 10:56:03,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:56:03,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:56:03,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:04,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:56:04,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:56:04,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736650300] [2022-11-20 10:56:04,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736650300] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:56:04,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:56:04,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 10:56:04,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070602724] [2022-11-20 10:56:04,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:56:04,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:56:04,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:56:04,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:56:04,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:56:04,143 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 114 [2022-11-20 10:56:04,143 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 153 transitions, 1186 flow. Second operand has 7 states, 7 states have (on average 90.42857142857143) internal successors, (633), 7 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:04,143 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:56:04,144 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 114 [2022-11-20 10:56:04,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:56:04,820 INFO L130 PetriNetUnfolder]: 747/1768 cut-off events. [2022-11-20 10:56:04,820 INFO L131 PetriNetUnfolder]: For 19551/19691 co-relation queries the response was YES. [2022-11-20 10:56:04,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10080 conditions, 1768 events. 747/1768 cut-off events. For 19551/19691 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 11966 event pairs, 78 based on Foata normal form. 100/1847 useless extension candidates. Maximal degree in co-relation 9990. Up to 636 conditions per place. [2022-11-20 10:56:04,830 INFO L137 encePairwiseOnDemand]: 104/114 looper letters, 82 selfloop transitions, 11 changer transitions 65/241 dead transitions. [2022-11-20 10:56:04,831 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 241 transitions, 2812 flow [2022-11-20 10:56:04,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 10:56:04,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-20 10:56:04,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1070 transitions. [2022-11-20 10:56:04,834 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8532695374800638 [2022-11-20 10:56:04,834 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1070 transitions. [2022-11-20 10:56:04,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1070 transitions. [2022-11-20 10:56:04,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:56:04,835 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1070 transitions. [2022-11-20 10:56:04,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 97.27272727272727) internal successors, (1070), 11 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:04,839 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:04,840 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:04,840 INFO L175 Difference]: Start difference. First operand has 159 places, 153 transitions, 1186 flow. Second operand 11 states and 1070 transitions. [2022-11-20 10:56:04,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 241 transitions, 2812 flow [2022-11-20 10:56:04,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 241 transitions, 2516 flow, removed 74 selfloop flow, removed 13 redundant places. [2022-11-20 10:56:04,874 INFO L231 Difference]: Finished difference. Result has 159 places, 143 transitions, 978 flow [2022-11-20 10:56:04,874 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=868, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=978, PETRI_PLACES=159, PETRI_TRANSITIONS=143} [2022-11-20 10:56:04,875 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 40 predicate places. [2022-11-20 10:56:04,875 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 143 transitions, 978 flow [2022-11-20 10:56:04,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.42857142857143) internal successors, (633), 7 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:04,876 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:56:04,876 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:56:04,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 10:56:04,876 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 10:56:04,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:56:04,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1511964811, now seen corresponding path program 1 times [2022-11-20 10:56:04,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:56:04,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263057383] [2022-11-20 10:56:04,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:56:04,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:56:04,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:05,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:56:05,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:56:05,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263057383] [2022-11-20 10:56:05,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263057383] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:56:05,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:56:05,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 10:56:05,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882884578] [2022-11-20 10:56:05,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:56:05,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 10:56:05,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:56:05,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 10:56:05,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:56:05,164 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 114 [2022-11-20 10:56:05,165 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 143 transitions, 978 flow. Second operand has 8 states, 8 states have (on average 90.375) internal successors, (723), 8 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:05,165 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:56:05,165 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 114 [2022-11-20 10:56:05,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:56:05,826 INFO L130 PetriNetUnfolder]: 591/1498 cut-off events. [2022-11-20 10:56:05,826 INFO L131 PetriNetUnfolder]: For 13269/13403 co-relation queries the response was YES. [2022-11-20 10:56:05,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8315 conditions, 1498 events. 591/1498 cut-off events. For 13269/13403 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 10733 event pairs, 77 based on Foata normal form. 57/1535 useless extension candidates. Maximal degree in co-relation 8259. Up to 571 conditions per place. [2022-11-20 10:56:05,833 INFO L137 encePairwiseOnDemand]: 105/114 looper letters, 71 selfloop transitions, 14 changer transitions 53/221 dead transitions. [2022-11-20 10:56:05,834 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 221 transitions, 2364 flow [2022-11-20 10:56:05,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 10:56:05,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-20 10:56:05,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1226 transitions. [2022-11-20 10:56:05,837 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8272604588394062 [2022-11-20 10:56:05,837 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1226 transitions. [2022-11-20 10:56:05,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1226 transitions. [2022-11-20 10:56:05,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:56:05,839 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1226 transitions. [2022-11-20 10:56:05,842 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 94.3076923076923) internal successors, (1226), 13 states have internal predecessors, (1226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:05,844 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:05,844 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:05,845 INFO L175 Difference]: Start difference. First operand has 159 places, 143 transitions, 978 flow. Second operand 13 states and 1226 transitions. [2022-11-20 10:56:05,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 221 transitions, 2364 flow [2022-11-20 10:56:05,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 221 transitions, 2263 flow, removed 26 selfloop flow, removed 8 redundant places. [2022-11-20 10:56:05,875 INFO L231 Difference]: Finished difference. Result has 166 places, 143 transitions, 950 flow [2022-11-20 10:56:05,876 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=900, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=950, PETRI_PLACES=166, PETRI_TRANSITIONS=143} [2022-11-20 10:56:05,877 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 47 predicate places. [2022-11-20 10:56:05,878 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 143 transitions, 950 flow [2022-11-20 10:56:05,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 90.375) internal successors, (723), 8 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:05,878 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:56:05,878 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] [2022-11-20 10:56:05,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 10:56:05,879 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 10:56:05,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:56:05,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1293133626, now seen corresponding path program 1 times [2022-11-20 10:56:05,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:56:05,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771202904] [2022-11-20 10:56:05,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:56:05,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:56:05,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:06,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:56:06,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:56:06,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771202904] [2022-11-20 10:56:06,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771202904] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:56:06,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:56:06,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 10:56:06,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894826383] [2022-11-20 10:56:06,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:56:06,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 10:56:06,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:56:06,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 10:56:06,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:56:06,481 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 114 [2022-11-20 10:56:06,482 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 143 transitions, 950 flow. Second operand has 9 states, 9 states have (on average 87.66666666666667) internal successors, (789), 9 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:06,482 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:56:06,482 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 114 [2022-11-20 10:56:06,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:56:06,919 INFO L130 PetriNetUnfolder]: 138/932 cut-off events. [2022-11-20 10:56:06,919 INFO L131 PetriNetUnfolder]: For 2994/3059 co-relation queries the response was YES. [2022-11-20 10:56:06,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3294 conditions, 932 events. 138/932 cut-off events. For 2994/3059 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 8290 event pairs, 8 based on Foata normal form. 6/883 useless extension candidates. Maximal degree in co-relation 3219. Up to 162 conditions per place. [2022-11-20 10:56:06,931 INFO L137 encePairwiseOnDemand]: 102/114 looper letters, 38 selfloop transitions, 22 changer transitions 13/162 dead transitions. [2022-11-20 10:56:06,931 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 162 transitions, 1295 flow [2022-11-20 10:56:06,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 10:56:06,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-20 10:56:06,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 896 transitions. [2022-11-20 10:56:06,934 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7859649122807018 [2022-11-20 10:56:06,934 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 896 transitions. [2022-11-20 10:56:06,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 896 transitions. [2022-11-20 10:56:06,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:56:06,935 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 896 transitions. [2022-11-20 10:56:06,937 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 89.6) internal successors, (896), 10 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:06,939 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:06,940 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:06,941 INFO L175 Difference]: Start difference. First operand has 166 places, 143 transitions, 950 flow. Second operand 10 states and 896 transitions. [2022-11-20 10:56:06,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 162 transitions, 1295 flow [2022-11-20 10:56:06,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 162 transitions, 1061 flow, removed 95 selfloop flow, removed 18 redundant places. [2022-11-20 10:56:06,969 INFO L231 Difference]: Finished difference. Result has 160 places, 148 transitions, 936 flow [2022-11-20 10:56:06,969 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=792, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=936, PETRI_PLACES=160, PETRI_TRANSITIONS=148} [2022-11-20 10:56:06,969 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 41 predicate places. [2022-11-20 10:56:06,972 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 148 transitions, 936 flow [2022-11-20 10:56:06,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 87.66666666666667) internal successors, (789), 9 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:06,972 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:56:06,973 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] [2022-11-20 10:56:06,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-20 10:56:06,973 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 10:56:06,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:56:06,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1588352434, now seen corresponding path program 2 times [2022-11-20 10:56:06,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:56:06,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340551377] [2022-11-20 10:56:06,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:56:06,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:56:07,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:07,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:56:07,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:56:07,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340551377] [2022-11-20 10:56:07,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340551377] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:56:07,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:56:07,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 10:56:07,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699565712] [2022-11-20 10:56:07,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:56:07,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 10:56:07,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:56:07,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 10:56:07,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-11-20 10:56:07,989 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 114 [2022-11-20 10:56:07,990 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 148 transitions, 936 flow. Second operand has 11 states, 11 states have (on average 86.27272727272727) internal successors, (949), 11 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:07,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:56:07,991 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 114 [2022-11-20 10:56:07,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:56:08,541 INFO L130 PetriNetUnfolder]: 143/973 cut-off events. [2022-11-20 10:56:08,542 INFO L131 PetriNetUnfolder]: For 1385/1407 co-relation queries the response was YES. [2022-11-20 10:56:08,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2893 conditions, 973 events. 143/973 cut-off events. For 1385/1407 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 8827 event pairs, 9 based on Foata normal form. 3/921 useless extension candidates. Maximal degree in co-relation 2864. Up to 143 conditions per place. [2022-11-20 10:56:08,547 INFO L137 encePairwiseOnDemand]: 101/114 looper letters, 31 selfloop transitions, 35 changer transitions 17/170 dead transitions. [2022-11-20 10:56:08,547 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 170 transitions, 1310 flow [2022-11-20 10:56:08,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 10:56:08,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-20 10:56:08,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1058 transitions. [2022-11-20 10:56:08,558 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7733918128654971 [2022-11-20 10:56:08,558 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1058 transitions. [2022-11-20 10:56:08,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1058 transitions. [2022-11-20 10:56:08,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:56:08,559 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1058 transitions. [2022-11-20 10:56:08,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 88.16666666666667) internal successors, (1058), 12 states have internal predecessors, (1058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:08,563 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:08,564 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:08,564 INFO L175 Difference]: Start difference. First operand has 160 places, 148 transitions, 936 flow. Second operand 12 states and 1058 transitions. [2022-11-20 10:56:08,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 170 transitions, 1310 flow [2022-11-20 10:56:08,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 170 transitions, 1257 flow, removed 26 selfloop flow, removed 6 redundant places. [2022-11-20 10:56:08,576 INFO L231 Difference]: Finished difference. Result has 167 places, 152 transitions, 1087 flow [2022-11-20 10:56:08,576 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=909, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1087, PETRI_PLACES=167, PETRI_TRANSITIONS=152} [2022-11-20 10:56:08,577 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 48 predicate places. [2022-11-20 10:56:08,577 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 152 transitions, 1087 flow [2022-11-20 10:56:08,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 86.27272727272727) internal successors, (949), 11 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:08,578 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:56:08,578 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] [2022-11-20 10:56:08,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-20 10:56:08,578 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 10:56:08,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:56:08,579 INFO L85 PathProgramCache]: Analyzing trace with hash -229315384, now seen corresponding path program 3 times [2022-11-20 10:56:08,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:56:08,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176137552] [2022-11-20 10:56:08,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:56:08,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:56:08,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:10,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:56:10,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:56:10,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176137552] [2022-11-20 10:56:10,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176137552] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:56:10,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:56:10,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 10:56:10,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545171643] [2022-11-20 10:56:10,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:56:10,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 10:56:10,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:56:10,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 10:56:10,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-11-20 10:56:10,069 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 114 [2022-11-20 10:56:10,070 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 152 transitions, 1087 flow. Second operand has 11 states, 11 states have (on average 85.36363636363636) internal successors, (939), 11 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:10,070 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:56:10,070 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 114 [2022-11-20 10:56:10,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:56:10,519 INFO L130 PetriNetUnfolder]: 110/742 cut-off events. [2022-11-20 10:56:10,520 INFO L131 PetriNetUnfolder]: For 1459/1476 co-relation queries the response was YES. [2022-11-20 10:56:10,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2388 conditions, 742 events. 110/742 cut-off events. For 1459/1476 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 5995 event pairs, 7 based on Foata normal form. 2/703 useless extension candidates. Maximal degree in co-relation 2357. Up to 106 conditions per place. [2022-11-20 10:56:10,523 INFO L137 encePairwiseOnDemand]: 104/114 looper letters, 25 selfloop transitions, 7 changer transitions 50/161 dead transitions. [2022-11-20 10:56:10,523 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 161 transitions, 1303 flow [2022-11-20 10:56:10,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 10:56:10,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-20 10:56:10,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 954 transitions. [2022-11-20 10:56:10,525 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7607655502392344 [2022-11-20 10:56:10,525 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 954 transitions. [2022-11-20 10:56:10,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 954 transitions. [2022-11-20 10:56:10,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:56:10,526 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 954 transitions. [2022-11-20 10:56:10,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 86.72727272727273) internal successors, (954), 11 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:10,529 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:10,529 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:10,530 INFO L175 Difference]: Start difference. First operand has 167 places, 152 transitions, 1087 flow. Second operand 11 states and 954 transitions. [2022-11-20 10:56:10,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 161 transitions, 1303 flow [2022-11-20 10:56:10,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 161 transitions, 1226 flow, removed 28 selfloop flow, removed 8 redundant places. [2022-11-20 10:56:10,541 INFO L231 Difference]: Finished difference. Result has 169 places, 110 transitions, 485 flow [2022-11-20 10:56:10,541 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1018, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=485, PETRI_PLACES=169, PETRI_TRANSITIONS=110} [2022-11-20 10:56:10,541 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 50 predicate places. [2022-11-20 10:56:10,542 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 110 transitions, 485 flow [2022-11-20 10:56:10,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 85.36363636363636) internal successors, (939), 11 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:56:10,542 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:56:10,542 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] [2022-11-20 10:56:10,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-20 10:56:10,543 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 10:56:10,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:56:10,543 INFO L85 PathProgramCache]: Analyzing trace with hash 856226190, now seen corresponding path program 4 times [2022-11-20 10:56:10,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:56:10,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48670553] [2022-11-20 10:56:10,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:56:10,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:56:10,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:56:10,589 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:56:10,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:56:10,671 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:56:10,671 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 10:56:10,672 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-20 10:56:10,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-20 10:56:10,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-20 10:56:10,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-20 10:56:10,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-20 10:56:10,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-20 10:56:10,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-20 10:56:10,676 INFO L444 BasicCegarLoop]: Path program histogram: [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:56:10,682 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-20 10:56:10,682 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 10:56:10,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 10:56:10 BasicIcfg [2022-11-20 10:56:10,786 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 10:56:10,787 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 10:56:10,787 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 10:56:10,787 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 10:56:10,787 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:55:29" (3/4) ... [2022-11-20 10:56:10,789 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-20 10:56:10,890 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e561d0-fa10-4054-9f11-d7c5e89a3415/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 10:56:10,891 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 10:56:10,891 INFO L158 Benchmark]: Toolchain (without parser) took 43405.94ms. Allocated memory was 178.3MB in the beginning and 721.4MB in the end (delta: 543.2MB). Free memory was 146.0MB in the beginning and 418.9MB in the end (delta: -272.9MB). Peak memory consumption was 273.3MB. Max. memory is 16.1GB. [2022-11-20 10:56:10,892 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 121.6MB. Free memory was 75.7MB in the beginning and 74.9MB in the end (delta: 796.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:56:10,892 INFO L158 Benchmark]: CACSL2BoogieTranslator took 745.54ms. Allocated memory is still 178.3MB. Free memory was 145.2MB in the beginning and 119.3MB in the end (delta: 25.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-20 10:56:10,892 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.01ms. Allocated memory is still 178.3MB. Free memory was 119.3MB in the beginning and 116.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:56:10,893 INFO L158 Benchmark]: Boogie Preprocessor took 40.82ms. Allocated memory is still 178.3MB. Free memory was 116.6MB in the beginning and 114.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:56:10,893 INFO L158 Benchmark]: RCFGBuilder took 1210.75ms. Allocated memory is still 178.3MB. Free memory was 114.5MB in the beginning and 142.7MB in the end (delta: -28.1MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2022-11-20 10:56:10,893 INFO L158 Benchmark]: TraceAbstraction took 41217.47ms. Allocated memory was 178.3MB in the beginning and 721.4MB in the end (delta: 543.2MB). Free memory was 141.6MB in the beginning and 443.1MB in the end (delta: -301.5MB). Peak memory consumption was 242.7MB. Max. memory is 16.1GB. [2022-11-20 10:56:10,894 INFO L158 Benchmark]: Witness Printer took 104.17ms. Allocated memory is still 721.4MB. Free memory was 443.1MB in the beginning and 418.9MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-20 10:56:10,895 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.32ms. Allocated memory is still 121.6MB. Free memory was 75.7MB in the beginning and 74.9MB in the end (delta: 796.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 745.54ms. Allocated memory is still 178.3MB. Free memory was 145.2MB in the beginning and 119.3MB in the end (delta: 25.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.01ms. Allocated memory is still 178.3MB. Free memory was 119.3MB in the beginning and 116.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.82ms. Allocated memory is still 178.3MB. Free memory was 116.6MB in the beginning and 114.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1210.75ms. Allocated memory is still 178.3MB. Free memory was 114.5MB in the beginning and 142.7MB in the end (delta: -28.1MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * TraceAbstraction took 41217.47ms. Allocated memory was 178.3MB in the beginning and 721.4MB in the end (delta: 543.2MB). Free memory was 141.6MB in the beginning and 443.1MB in the end (delta: -301.5MB). Peak memory consumption was 242.7MB. Max. memory is 16.1GB. * Witness Printer took 104.17ms. Allocated memory is still 721.4MB. Free memory was 443.1MB in the beginning and 418.9MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L715] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L716] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L718] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L719] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L720] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L721] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L722] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L723] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L724] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L725] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L726] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L727] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L728] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L729] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L730] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L731] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L732] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L733] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L734] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L736] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L737] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L738] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L849] 0 pthread_t t2537; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2537={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L850] FCALL, FORK 0 pthread_create(&t2537, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2537, ((void *)0), P0, ((void *)0))=-2, t2537={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L851] 0 pthread_t t2538; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2537={5:0}, t2538={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L852] FCALL, FORK 0 pthread_create(&t2538, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2538, ((void *)0), P1, ((void *)0))=-1, t2537={5:0}, t2538={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L853] 0 pthread_t t2539; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2537={5:0}, t2538={6:0}, t2539={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L854] FCALL, FORK 0 pthread_create(&t2539, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2539, ((void *)0), P2, ((void *)0))=0, t2537={5:0}, t2538={6:0}, t2539={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L812] 3 x$w_buff1 = x$w_buff0 [L813] 3 x$w_buff0 = 2 [L814] 3 x$w_buff1_used = x$w_buff0_used [L815] 3 x$w_buff0_used = (_Bool)1 [L816] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L816] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L817] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L818] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L819] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L820] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L824] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=67, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=67, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L772] 2 x = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=67, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=67, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 x$flush_delayed = weak$$choice2 [L785] 2 x$mem_tmp = x [L786] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = x [L794] 2 x = x$flush_delayed ? x$mem_tmp : x [L795] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L799] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L800] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L801] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L802] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=66, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=66, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537={5:0}, t2538={6:0}, t2539={3:0}, weak$$choice0=66, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=66, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537={5:0}, t2538={6:0}, t2539={3:0}, weak$$choice0=66, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L867] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L868] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L869] 0 x$flush_delayed = weak$$choice2 [L870] 0 x$mem_tmp = x [L871] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L872] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L873] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L874] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L875] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L877] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L879] 0 x = x$flush_delayed ? x$mem_tmp : x [L880] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537={5:0}, t2538={6:0}, t2539={3:0}, weak$$choice0=68, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L882] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=68, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=68, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 19]: 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: 852]: 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: 850]: 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: 854]: 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, 141 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.1s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 40.9s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 20.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1302 SdHoareTripleChecker+Valid, 6.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1302 mSDsluCounter, 1359 SdHoareTripleChecker+Invalid, 5.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1129 mSDsCounter, 365 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3536 IncrementalHoareTripleChecker+Invalid, 3901 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 365 mSolverCounterUnsat, 230 mSDtfsCounter, 3536 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 316 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 276 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 793 ImplicationChecksByTransitivity, 6.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1700occurred in iteration=9, InterpolantAutomatonStates: 232, 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, 1.0s SatisfiabilityAnalysisTime, 19.0s InterpolantComputationTime, 1540 NumberOfCodeBlocks, 1540 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1434 ConstructedInterpolants, 0 QuantifiedInterpolants, 10316 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-20 10:56:10,927 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e561d0-fa10-4054-9f11-d7c5e89a3415/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE