./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87fa01bb-31cb-4938-9449-1d97e5d1482c/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87fa01bb-31cb-4938-9449-1d97e5d1482c/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_87fa01bb-31cb-4938-9449-1d97e5d1482c/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87fa01bb-31cb-4938-9449-1d97e5d1482c/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87fa01bb-31cb-4938-9449-1d97e5d1482c/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_87fa01bb-31cb-4938-9449-1d97e5d1482c/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 9df54eb091d78e0f82ec179542e5b1e4fed45243a056538ca557e474796bb018 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 12:20:47,408 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 12:20:47,410 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 12:20:47,434 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 12:20:47,437 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 12:20:47,441 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 12:20:47,444 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 12:20:47,447 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 12:20:47,448 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 12:20:47,454 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 12:20:47,455 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 12:20:47,457 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 12:20:47,457 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 12:20:47,460 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 12:20:47,462 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 12:20:47,464 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 12:20:47,466 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 12:20:47,467 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 12:20:47,468 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 12:20:47,474 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 12:20:47,476 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 12:20:47,478 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 12:20:47,480 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 12:20:47,481 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 12:20:47,490 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 12:20:47,491 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 12:20:47,491 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 12:20:47,493 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 12:20:47,493 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 12:20:47,495 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 12:20:47,496 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 12:20:47,497 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 12:20:47,498 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 12:20:47,500 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 12:20:47,501 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 12:20:47,501 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 12:20:47,502 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 12:20:47,502 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 12:20:47,502 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 12:20:47,504 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 12:20:47,505 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 12:20:47,506 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87fa01bb-31cb-4938-9449-1d97e5d1482c/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 12:20:47,547 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 12:20:47,548 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 12:20:47,549 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 12:20:47,549 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 12:20:47,550 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 12:20:47,551 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 12:20:47,551 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 12:20:47,552 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 12:20:47,552 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 12:20:47,552 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 12:20:47,553 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 12:20:47,553 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 12:20:47,554 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 12:20:47,554 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 12:20:47,554 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 12:20:47,554 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 12:20:47,555 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 12:20:47,555 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 12:20:47,555 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 12:20:47,555 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 12:20:47,555 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 12:20:47,556 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 12:20:47,556 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 12:20:47,556 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 12:20:47,556 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:20:47,557 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 12:20:47,557 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 12:20:47,557 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 12:20:47,558 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 12:20:47,558 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 12:20:47,558 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 12:20:47,559 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 12:20:47,559 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 12:20:47,559 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_87fa01bb-31cb-4938-9449-1d97e5d1482c/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_87fa01bb-31cb-4938-9449-1d97e5d1482c/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 -> 9df54eb091d78e0f82ec179542e5b1e4fed45243a056538ca557e474796bb018 [2022-11-20 12:20:47,800 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 12:20:47,823 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 12:20:47,826 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 12:20:47,828 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 12:20:47,828 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 12:20:47,829 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87fa01bb-31cb-4938-9449-1d97e5d1482c/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2022-11-20 12:20:50,863 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 12:20:51,186 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 12:20:51,187 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87fa01bb-31cb-4938-9449-1d97e5d1482c/sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2022-11-20 12:20:51,205 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87fa01bb-31cb-4938-9449-1d97e5d1482c/bin/uautomizer-ug76WZFUDN/data/ae7e3e000/6fb0faf5d4864651a879491b048bd0d3/FLAGc88190b8c [2022-11-20 12:20:51,219 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87fa01bb-31cb-4938-9449-1d97e5d1482c/bin/uautomizer-ug76WZFUDN/data/ae7e3e000/6fb0faf5d4864651a879491b048bd0d3 [2022-11-20 12:20:51,222 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 12:20:51,224 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 12:20:51,225 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 12:20:51,225 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 12:20:51,229 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 12:20:51,230 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:20:51" (1/1) ... [2022-11-20 12:20:51,231 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2022c2f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:20:51, skipping insertion in model container [2022-11-20 12:20:51,231 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:20:51" (1/1) ... [2022-11-20 12:20:51,239 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 12:20:51,281 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 12:20:51,450 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_87fa01bb-31cb-4938-9449-1d97e5d1482c/sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i[967,980] [2022-11-20 12:20:51,638 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:20:51,652 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 12:20:51,671 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_87fa01bb-31cb-4938-9449-1d97e5d1482c/sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i[967,980] [2022-11-20 12:20:51,753 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:20:51,805 INFO L208 MainTranslator]: Completed translation [2022-11-20 12:20:51,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:20:51 WrapperNode [2022-11-20 12:20:51,806 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 12:20:51,807 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 12:20:51,807 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 12:20:51,808 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 12:20:51,816 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:20:51" (1/1) ... [2022-11-20 12:20:51,853 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:20:51" (1/1) ... [2022-11-20 12:20:51,896 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 126 [2022-11-20 12:20:51,897 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 12:20:51,898 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 12:20:51,898 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 12:20:51,898 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 12:20:51,914 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:20:51" (1/1) ... [2022-11-20 12:20:51,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:20:51" (1/1) ... [2022-11-20 12:20:51,929 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:20:51" (1/1) ... [2022-11-20 12:20:51,929 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:20:51" (1/1) ... [2022-11-20 12:20:51,936 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:20:51" (1/1) ... [2022-11-20 12:20:51,938 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:20:51" (1/1) ... [2022-11-20 12:20:51,953 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:20:51" (1/1) ... [2022-11-20 12:20:51,955 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:20:51" (1/1) ... [2022-11-20 12:20:51,958 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 12:20:51,959 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 12:20:51,959 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 12:20:51,959 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 12:20:51,960 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:20:51" (1/1) ... [2022-11-20 12:20:51,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:20:51,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87fa01bb-31cb-4938-9449-1d97e5d1482c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:20:52,001 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87fa01bb-31cb-4938-9449-1d97e5d1482c/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 12:20:52,036 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87fa01bb-31cb-4938-9449-1d97e5d1482c/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 12:20:52,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 12:20:52,056 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 12:20:52,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 12:20:52,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 12:20:52,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 12:20:52,056 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-20 12:20:52,057 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-20 12:20:52,057 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-20 12:20:52,057 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-20 12:20:52,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 12:20:52,058 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 12:20:52,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 12:20:52,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 12:20:52,060 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 12:20:52,274 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 12:20:52,276 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 12:20:52,543 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 12:20:52,757 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 12:20:52,757 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 12:20:52,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:20:52 BoogieIcfgContainer [2022-11-20 12:20:52,760 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 12:20:52,762 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 12:20:52,762 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 12:20:52,766 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 12:20:52,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:20:51" (1/3) ... [2022-11-20 12:20:52,767 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50dd9fe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:20:52, skipping insertion in model container [2022-11-20 12:20:52,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:20:51" (2/3) ... [2022-11-20 12:20:52,767 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50dd9fe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:20:52, skipping insertion in model container [2022-11-20 12:20:52,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:20:52" (3/3) ... [2022-11-20 12:20:52,769 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_power.opt_pso.opt_rmo.opt.i [2022-11-20 12:20:52,778 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 12:20:52,790 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 12:20:52,790 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-20 12:20:52,790 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 12:20:52,834 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-20 12:20:52,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 93 transitions, 196 flow [2022-11-20 12:20:52,918 INFO L130 PetriNetUnfolder]: 2/91 cut-off events. [2022-11-20 12:20:52,918 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 12:20:52,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 91 events. 2/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2022-11-20 12:20:52,923 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 93 transitions, 196 flow [2022-11-20 12:20:52,927 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 91 transitions, 188 flow [2022-11-20 12:20:52,937 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 12:20:52,944 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;@1cf92eb8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 12:20:52,944 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-20 12:20:52,959 INFO L130 PetriNetUnfolder]: 0/55 cut-off events. [2022-11-20 12:20:52,959 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 12:20:52,959 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:20:52,960 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] [2022-11-20 12:20:52,960 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-20 12:20:52,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:20:52,966 INFO L85 PathProgramCache]: Analyzing trace with hash 76104434, now seen corresponding path program 1 times [2022-11-20 12:20:52,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:20:52,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448652516] [2022-11-20 12:20:52,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:20:52,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:20:53,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:20:53,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:20:53,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:20:53,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448652516] [2022-11-20 12:20:53,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448652516] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:20:53,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:20:53,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:20:53,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394340806] [2022-11-20 12:20:53,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:20:53,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:20:53,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:20:53,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:20:53,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:20:53,725 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 93 [2022-11-20 12:20:53,728 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 91 transitions, 188 flow. Second operand has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:20:53,728 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:20:53,728 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 93 [2022-11-20 12:20:53,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:20:53,905 INFO L130 PetriNetUnfolder]: 17/213 cut-off events. [2022-11-20 12:20:53,905 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-20 12:20:53,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261 conditions, 213 events. 17/213 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 679 event pairs, 7 based on Foata normal form. 8/209 useless extension candidates. Maximal degree in co-relation 215. Up to 27 conditions per place. [2022-11-20 12:20:53,909 INFO L137 encePairwiseOnDemand]: 88/93 looper letters, 9 selfloop transitions, 2 changer transitions 0/90 dead transitions. [2022-11-20 12:20:53,909 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 90 transitions, 208 flow [2022-11-20 12:20:53,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:20:53,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:20:53,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 259 transitions. [2022-11-20 12:20:53,922 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9283154121863799 [2022-11-20 12:20:53,922 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 259 transitions. [2022-11-20 12:20:53,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 259 transitions. [2022-11-20 12:20:53,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:20:53,927 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 259 transitions. [2022-11-20 12:20:53,929 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:20:53,934 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:20:53,935 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:20:53,937 INFO L175 Difference]: Start difference. First operand has 96 places, 91 transitions, 188 flow. Second operand 3 states and 259 transitions. [2022-11-20 12:20:53,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 90 transitions, 208 flow [2022-11-20 12:20:53,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 90 transitions, 206 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 12:20:53,944 INFO L231 Difference]: Finished difference. Result has 94 places, 87 transitions, 182 flow [2022-11-20 12:20:53,946 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=182, PETRI_PLACES=94, PETRI_TRANSITIONS=87} [2022-11-20 12:20:53,950 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, -2 predicate places. [2022-11-20 12:20:53,950 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 87 transitions, 182 flow [2022-11-20 12:20:53,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:20:53,951 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:20:53,951 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] [2022-11-20 12:20:53,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 12:20:53,952 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-20 12:20:53,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:20:53,953 INFO L85 PathProgramCache]: Analyzing trace with hash -480828024, now seen corresponding path program 1 times [2022-11-20 12:20:53,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:20:53,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35628748] [2022-11-20 12:20:53,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:20:53,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:20:54,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:20:54,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:20:54,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:20:54,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35628748] [2022-11-20 12:20:54,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35628748] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:20:54,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:20:54,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 12:20:54,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688521738] [2022-11-20 12:20:54,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:20:54,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 12:20:54,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:20:54,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 12:20:54,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:20:54,932 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 93 [2022-11-20 12:20:54,933 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 87 transitions, 182 flow. Second operand has 9 states, 9 states have (on average 73.33333333333333) internal successors, (660), 9 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:20:54,934 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:20:54,934 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 93 [2022-11-20 12:20:54,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:20:55,446 INFO L130 PetriNetUnfolder]: 132/540 cut-off events. [2022-11-20 12:20:55,446 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-11-20 12:20:55,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 836 conditions, 540 events. 132/540 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3006 event pairs, 47 based on Foata normal form. 0/524 useless extension candidates. Maximal degree in co-relation 787. Up to 147 conditions per place. [2022-11-20 12:20:55,450 INFO L137 encePairwiseOnDemand]: 82/93 looper letters, 15 selfloop transitions, 9 changer transitions 47/132 dead transitions. [2022-11-20 12:20:55,450 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 132 transitions, 412 flow [2022-11-20 12:20:55,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 12:20:55,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-20 12:20:55,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1073 transitions. [2022-11-20 12:20:55,456 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8241167434715821 [2022-11-20 12:20:55,456 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1073 transitions. [2022-11-20 12:20:55,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1073 transitions. [2022-11-20 12:20:55,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:20:55,457 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1073 transitions. [2022-11-20 12:20:55,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 76.64285714285714) internal successors, (1073), 14 states have internal predecessors, (1073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:20:55,465 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 93.0) internal successors, (1395), 15 states have internal predecessors, (1395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:20:55,466 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 93.0) internal successors, (1395), 15 states have internal predecessors, (1395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:20:55,466 INFO L175 Difference]: Start difference. First operand has 94 places, 87 transitions, 182 flow. Second operand 14 states and 1073 transitions. [2022-11-20 12:20:55,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 132 transitions, 412 flow [2022-11-20 12:20:55,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 132 transitions, 394 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 12:20:55,470 INFO L231 Difference]: Finished difference. Result has 116 places, 83 transitions, 240 flow [2022-11-20 12:20:55,471 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=240, PETRI_PLACES=116, PETRI_TRANSITIONS=83} [2022-11-20 12:20:55,471 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, 20 predicate places. [2022-11-20 12:20:55,472 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 83 transitions, 240 flow [2022-11-20 12:20:55,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 73.33333333333333) internal successors, (660), 9 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:20:55,472 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:20:55,473 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] [2022-11-20 12:20:55,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 12:20:55,473 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-20 12:20:55,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:20:55,474 INFO L85 PathProgramCache]: Analyzing trace with hash 2078844166, now seen corresponding path program 1 times [2022-11-20 12:20:55,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:20:55,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573543371] [2022-11-20 12:20:55,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:20:55,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:20:55,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:20:56,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:20:56,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:20:56,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573543371] [2022-11-20 12:20:56,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573543371] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:20:56,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:20:56,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 12:20:56,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458063046] [2022-11-20 12:20:56,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:20:56,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 12:20:56,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:20:56,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 12:20:56,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-20 12:20:56,244 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 93 [2022-11-20 12:20:56,245 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 83 transitions, 240 flow. Second operand has 11 states, 11 states have (on average 69.36363636363636) internal successors, (763), 11 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:20:56,245 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:20:56,245 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 93 [2022-11-20 12:20:56,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:20:57,188 INFO L130 PetriNetUnfolder]: 288/713 cut-off events. [2022-11-20 12:20:57,189 INFO L131 PetriNetUnfolder]: For 1310/1390 co-relation queries the response was YES. [2022-11-20 12:20:57,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2142 conditions, 713 events. 288/713 cut-off events. For 1310/1390 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3597 event pairs, 43 based on Foata normal form. 36/735 useless extension candidates. Maximal degree in co-relation 2077. Up to 176 conditions per place. [2022-11-20 12:20:57,195 INFO L137 encePairwiseOnDemand]: 79/93 looper letters, 33 selfloop transitions, 24 changer transitions 74/188 dead transitions. [2022-11-20 12:20:57,195 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 188 transitions, 1008 flow [2022-11-20 12:20:57,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-20 12:20:57,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-11-20 12:20:57,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1756 transitions. [2022-11-20 12:20:57,200 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7867383512544803 [2022-11-20 12:20:57,201 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 1756 transitions. [2022-11-20 12:20:57,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 1756 transitions. [2022-11-20 12:20:57,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:20:57,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 1756 transitions. [2022-11-20 12:20:57,207 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 73.16666666666667) internal successors, (1756), 24 states have internal predecessors, (1756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:20:57,212 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 93.0) internal successors, (2325), 25 states have internal predecessors, (2325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:20:57,213 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 93.0) internal successors, (2325), 25 states have internal predecessors, (2325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:20:57,213 INFO L175 Difference]: Start difference. First operand has 116 places, 83 transitions, 240 flow. Second operand 24 states and 1756 transitions. [2022-11-20 12:20:57,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 188 transitions, 1008 flow [2022-11-20 12:20:57,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 188 transitions, 974 flow, removed 16 selfloop flow, removed 4 redundant places. [2022-11-20 12:20:57,224 INFO L231 Difference]: Finished difference. Result has 137 places, 102 transitions, 499 flow [2022-11-20 12:20:57,225 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=499, PETRI_PLACES=137, PETRI_TRANSITIONS=102} [2022-11-20 12:20:57,225 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, 41 predicate places. [2022-11-20 12:20:57,226 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 102 transitions, 499 flow [2022-11-20 12:20:57,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 69.36363636363636) internal successors, (763), 11 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:20:57,226 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:20:57,227 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] [2022-11-20 12:20:57,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 12:20:57,227 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-20 12:20:57,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:20:57,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1542349574, now seen corresponding path program 1 times [2022-11-20 12:20:57,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:20:57,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450365438] [2022-11-20 12:20:57,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:20:57,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:20:57,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:20:57,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:20:57,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:20:57,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450365438] [2022-11-20 12:20:57,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450365438] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:20:57,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:20:57,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 12:20:57,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658832158] [2022-11-20 12:20:57,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:20:57,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 12:20:57,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:20:57,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 12:20:57,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:20:57,864 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 93 [2022-11-20 12:20:57,865 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 102 transitions, 499 flow. Second operand has 10 states, 10 states have (on average 72.4) internal successors, (724), 10 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:20:57,866 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:20:57,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 93 [2022-11-20 12:20:57,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:20:58,278 INFO L130 PetriNetUnfolder]: 133/408 cut-off events. [2022-11-20 12:20:58,278 INFO L131 PetriNetUnfolder]: For 5308/5629 co-relation queries the response was YES. [2022-11-20 12:20:58,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2170 conditions, 408 events. 133/408 cut-off events. For 5308/5629 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1816 event pairs, 33 based on Foata normal form. 19/415 useless extension candidates. Maximal degree in co-relation 2082. Up to 191 conditions per place. [2022-11-20 12:20:58,284 INFO L137 encePairwiseOnDemand]: 84/93 looper letters, 31 selfloop transitions, 9 changer transitions 19/124 dead transitions. [2022-11-20 12:20:58,284 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 124 transitions, 833 flow [2022-11-20 12:20:58,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 12:20:58,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-20 12:20:58,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 896 transitions. [2022-11-20 12:20:58,288 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8028673835125448 [2022-11-20 12:20:58,288 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 896 transitions. [2022-11-20 12:20:58,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 896 transitions. [2022-11-20 12:20:58,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:20:58,289 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 896 transitions. [2022-11-20 12:20:58,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 74.66666666666667) internal successors, (896), 12 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 12:20:58,293 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 93.0) internal successors, (1209), 13 states have internal predecessors, (1209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:20:58,294 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 93.0) internal successors, (1209), 13 states have internal predecessors, (1209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:20:58,294 INFO L175 Difference]: Start difference. First operand has 137 places, 102 transitions, 499 flow. Second operand 12 states and 896 transitions. [2022-11-20 12:20:58,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 124 transitions, 833 flow [2022-11-20 12:20:58,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 124 transitions, 719 flow, removed 56 selfloop flow, removed 13 redundant places. [2022-11-20 12:20:58,309 INFO L231 Difference]: Finished difference. Result has 127 places, 102 transitions, 476 flow [2022-11-20 12:20:58,309 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=476, PETRI_PLACES=127, PETRI_TRANSITIONS=102} [2022-11-20 12:20:58,310 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, 31 predicate places. [2022-11-20 12:20:58,310 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 102 transitions, 476 flow [2022-11-20 12:20:58,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 72.4) internal successors, (724), 10 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:20:58,311 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:20:58,311 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] [2022-11-20 12:20:58,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 12:20:58,312 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-20 12:20:58,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:20:58,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1026892407, now seen corresponding path program 1 times [2022-11-20 12:20:58,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:20:58,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452230724] [2022-11-20 12:20:58,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:20:58,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:20:58,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:20:58,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:20:58,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:20:58,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452230724] [2022-11-20 12:20:58,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452230724] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:20:58,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:20:58,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 12:20:58,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409870433] [2022-11-20 12:20:58,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:20:58,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 12:20:58,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:20:59,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 12:20:59,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:20:59,002 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 93 [2022-11-20 12:20:59,004 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 102 transitions, 476 flow. Second operand has 10 states, 10 states have (on average 70.6) internal successors, (706), 10 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:20:59,005 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:20:59,005 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 93 [2022-11-20 12:20:59,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:20:59,431 INFO L130 PetriNetUnfolder]: 131/425 cut-off events. [2022-11-20 12:20:59,431 INFO L131 PetriNetUnfolder]: For 3369/3582 co-relation queries the response was YES. [2022-11-20 12:20:59,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1915 conditions, 425 events. 131/425 cut-off events. For 3369/3582 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2020 event pairs, 47 based on Foata normal form. 26/438 useless extension candidates. Maximal degree in co-relation 1827. Up to 151 conditions per place. [2022-11-20 12:20:59,436 INFO L137 encePairwiseOnDemand]: 82/93 looper letters, 21 selfloop transitions, 19 changer transitions 24/127 dead transitions. [2022-11-20 12:20:59,437 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 127 transitions, 920 flow [2022-11-20 12:20:59,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 12:20:59,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-20 12:20:59,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 947 transitions. [2022-11-20 12:20:59,441 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7832919768403639 [2022-11-20 12:20:59,441 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 947 transitions. [2022-11-20 12:20:59,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 947 transitions. [2022-11-20 12:20:59,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:20:59,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 947 transitions. [2022-11-20 12:20:59,445 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 72.84615384615384) internal successors, (947), 13 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:20:59,447 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 93.0) internal successors, (1302), 14 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:20:59,448 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 93.0) internal successors, (1302), 14 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:20:59,448 INFO L175 Difference]: Start difference. First operand has 127 places, 102 transitions, 476 flow. Second operand 13 states and 947 transitions. [2022-11-20 12:20:59,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 127 transitions, 920 flow [2022-11-20 12:20:59,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 127 transitions, 795 flow, removed 55 selfloop flow, removed 16 redundant places. [2022-11-20 12:20:59,461 INFO L231 Difference]: Finished difference. Result has 124 places, 102 transitions, 520 flow [2022-11-20 12:20:59,461 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=520, PETRI_PLACES=124, PETRI_TRANSITIONS=102} [2022-11-20 12:20:59,463 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, 28 predicate places. [2022-11-20 12:20:59,464 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 102 transitions, 520 flow [2022-11-20 12:20:59,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 70.6) internal successors, (706), 10 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:20:59,464 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:20:59,465 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] [2022-11-20 12:20:59,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 12:20:59,465 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-20 12:20:59,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:20:59,467 INFO L85 PathProgramCache]: Analyzing trace with hash 151579050, now seen corresponding path program 1 times [2022-11-20 12:20:59,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:20:59,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841087749] [2022-11-20 12:20:59,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:20:59,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:20:59,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:21:00,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:21:00,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:21:00,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841087749] [2022-11-20 12:21:00,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841087749] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:21:00,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:21:00,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 12:21:00,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559248625] [2022-11-20 12:21:00,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:21:00,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 12:21:00,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:21:00,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 12:21:00,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-11-20 12:21:00,138 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 93 [2022-11-20 12:21:00,139 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 102 transitions, 520 flow. Second operand has 11 states, 11 states have (on average 71.45454545454545) internal successors, (786), 11 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:00,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:21:00,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 93 [2022-11-20 12:21:00,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:21:00,517 INFO L130 PetriNetUnfolder]: 96/345 cut-off events. [2022-11-20 12:21:00,517 INFO L131 PetriNetUnfolder]: For 2666/2963 co-relation queries the response was YES. [2022-11-20 12:21:00,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1458 conditions, 345 events. 96/345 cut-off events. For 2666/2963 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1459 event pairs, 35 based on Foata normal form. 21/353 useless extension candidates. Maximal degree in co-relation 1375. Up to 150 conditions per place. [2022-11-20 12:21:00,521 INFO L137 encePairwiseOnDemand]: 81/93 looper letters, 32 selfloop transitions, 13 changer transitions 11/120 dead transitions. [2022-11-20 12:21:00,521 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 120 transitions, 798 flow [2022-11-20 12:21:00,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 12:21:00,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-20 12:21:00,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 738 transitions. [2022-11-20 12:21:00,524 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7935483870967742 [2022-11-20 12:21:00,524 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 738 transitions. [2022-11-20 12:21:00,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 738 transitions. [2022-11-20 12:21:00,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:21:00,525 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 738 transitions. [2022-11-20 12:21:00,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 73.8) internal successors, (738), 10 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:00,529 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 93.0) internal successors, (1023), 11 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:00,530 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 93.0) internal successors, (1023), 11 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:00,530 INFO L175 Difference]: Start difference. First operand has 124 places, 102 transitions, 520 flow. Second operand 10 states and 738 transitions. [2022-11-20 12:21:00,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 120 transitions, 798 flow [2022-11-20 12:21:00,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 120 transitions, 682 flow, removed 44 selfloop flow, removed 12 redundant places. [2022-11-20 12:21:00,539 INFO L231 Difference]: Finished difference. Result has 119 places, 106 transitions, 507 flow [2022-11-20 12:21:00,540 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=507, PETRI_PLACES=119, PETRI_TRANSITIONS=106} [2022-11-20 12:21:00,542 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, 23 predicate places. [2022-11-20 12:21:00,542 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 106 transitions, 507 flow [2022-11-20 12:21:00,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 71.45454545454545) internal successors, (786), 11 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:00,543 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:21:00,543 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] [2022-11-20 12:21:00,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 12:21:00,544 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-20 12:21:00,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:21:00,544 INFO L85 PathProgramCache]: Analyzing trace with hash -374179948, now seen corresponding path program 2 times [2022-11-20 12:21:00,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:21:00,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366223210] [2022-11-20 12:21:00,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:21:00,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:21:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:21:01,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:21:01,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:21:01,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366223210] [2022-11-20 12:21:01,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366223210] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:21:01,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:21:01,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 12:21:01,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384143945] [2022-11-20 12:21:01,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:21:01,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 12:21:01,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:21:01,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 12:21:01,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:21:01,376 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 93 [2022-11-20 12:21:01,377 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 106 transitions, 507 flow. Second operand has 10 states, 10 states have (on average 71.6) internal successors, (716), 10 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:01,377 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:21:01,378 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 93 [2022-11-20 12:21:01,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:21:01,752 INFO L130 PetriNetUnfolder]: 96/352 cut-off events. [2022-11-20 12:21:01,752 INFO L131 PetriNetUnfolder]: For 1514/1890 co-relation queries the response was YES. [2022-11-20 12:21:01,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1304 conditions, 352 events. 96/352 cut-off events. For 1514/1890 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1523 event pairs, 34 based on Foata normal form. 25/365 useless extension candidates. Maximal degree in co-relation 1225. Up to 152 conditions per place. [2022-11-20 12:21:01,756 INFO L137 encePairwiseOnDemand]: 82/93 looper letters, 35 selfloop transitions, 14 changer transitions 20/133 dead transitions. [2022-11-20 12:21:01,756 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 133 transitions, 869 flow [2022-11-20 12:21:01,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 12:21:01,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-20 12:21:01,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 889 transitions. [2022-11-20 12:21:01,759 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.796594982078853 [2022-11-20 12:21:01,759 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 889 transitions. [2022-11-20 12:21:01,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 889 transitions. [2022-11-20 12:21:01,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:21:01,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 889 transitions. [2022-11-20 12:21:01,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 74.08333333333333) internal successors, (889), 12 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:01,765 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 93.0) internal successors, (1209), 13 states have internal predecessors, (1209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:01,766 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 93.0) internal successors, (1209), 13 states have internal predecessors, (1209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:01,766 INFO L175 Difference]: Start difference. First operand has 119 places, 106 transitions, 507 flow. Second operand 12 states and 889 transitions. [2022-11-20 12:21:01,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 133 transitions, 869 flow [2022-11-20 12:21:01,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 133 transitions, 846 flow, removed 10 selfloop flow, removed 5 redundant places. [2022-11-20 12:21:01,775 INFO L231 Difference]: Finished difference. Result has 130 places, 111 transitions, 594 flow [2022-11-20 12:21:01,775 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=594, PETRI_PLACES=130, PETRI_TRANSITIONS=111} [2022-11-20 12:21:01,776 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, 34 predicate places. [2022-11-20 12:21:01,777 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 111 transitions, 594 flow [2022-11-20 12:21:01,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 71.6) internal successors, (716), 10 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:01,777 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:21:01,777 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] [2022-11-20 12:21:01,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 12:21:01,778 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-20 12:21:01,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:21:01,779 INFO L85 PathProgramCache]: Analyzing trace with hash -316194936, now seen corresponding path program 3 times [2022-11-20 12:21:01,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:21:01,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055844336] [2022-11-20 12:21:01,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:21:01,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:21:01,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:21:02,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:21:02,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:21:02,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055844336] [2022-11-20 12:21:02,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055844336] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:21:02,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:21:02,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 12:21:02,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766136761] [2022-11-20 12:21:02,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:21:02,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 12:21:02,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:21:02,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 12:21:02,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:21:02,767 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 93 [2022-11-20 12:21:02,768 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 111 transitions, 594 flow. Second operand has 10 states, 10 states have (on average 68.8) internal successors, (688), 10 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:02,768 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:21:02,768 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 93 [2022-11-20 12:21:02,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:21:03,407 INFO L130 PetriNetUnfolder]: 126/429 cut-off events. [2022-11-20 12:21:03,408 INFO L131 PetriNetUnfolder]: For 3442/4072 co-relation queries the response was YES. [2022-11-20 12:21:03,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2043 conditions, 429 events. 126/429 cut-off events. For 3442/4072 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2011 event pairs, 15 based on Foata normal form. 32/445 useless extension candidates. Maximal degree in co-relation 1957. Up to 121 conditions per place. [2022-11-20 12:21:03,412 INFO L137 encePairwiseOnDemand]: 81/93 looper letters, 47 selfloop transitions, 25 changer transitions 39/167 dead transitions. [2022-11-20 12:21:03,412 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 167 transitions, 1438 flow [2022-11-20 12:21:03,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 12:21:03,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-20 12:21:03,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1148 transitions. [2022-11-20 12:21:03,416 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.771505376344086 [2022-11-20 12:21:03,416 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1148 transitions. [2022-11-20 12:21:03,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1148 transitions. [2022-11-20 12:21:03,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:21:03,417 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1148 transitions. [2022-11-20 12:21:03,420 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 71.75) internal successors, (1148), 16 states have internal predecessors, (1148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:03,423 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 93.0) internal successors, (1581), 17 states have internal predecessors, (1581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:03,424 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 93.0) internal successors, (1581), 17 states have internal predecessors, (1581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:03,424 INFO L175 Difference]: Start difference. First operand has 130 places, 111 transitions, 594 flow. Second operand 16 states and 1148 transitions. [2022-11-20 12:21:03,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 167 transitions, 1438 flow [2022-11-20 12:21:03,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 167 transitions, 1388 flow, removed 19 selfloop flow, removed 5 redundant places. [2022-11-20 12:21:03,438 INFO L231 Difference]: Finished difference. Result has 145 places, 117 transitions, 765 flow [2022-11-20 12:21:03,438 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=765, PETRI_PLACES=145, PETRI_TRANSITIONS=117} [2022-11-20 12:21:03,439 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, 49 predicate places. [2022-11-20 12:21:03,439 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 117 transitions, 765 flow [2022-11-20 12:21:03,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 68.8) internal successors, (688), 10 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:03,440 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:21:03,440 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] [2022-11-20 12:21:03,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 12:21:03,440 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-20 12:21:03,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:21:03,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1214828588, now seen corresponding path program 1 times [2022-11-20 12:21:03,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:21:03,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419881561] [2022-11-20 12:21:03,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:21:03,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:21:03,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:21:04,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:21:04,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:21:04,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419881561] [2022-11-20 12:21:04,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419881561] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:21:04,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:21:04,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-20 12:21:04,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826542320] [2022-11-20 12:21:04,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:21:04,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-20 12:21:04,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:21:04,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-20 12:21:04,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-11-20 12:21:04,860 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 93 [2022-11-20 12:21:04,862 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 117 transitions, 765 flow. Second operand has 12 states, 12 states have (on average 65.83333333333333) internal successors, (790), 12 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:04,862 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:21:04,862 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 93 [2022-11-20 12:21:04,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:21:05,466 INFO L130 PetriNetUnfolder]: 78/339 cut-off events. [2022-11-20 12:21:05,466 INFO L131 PetriNetUnfolder]: For 3049/3223 co-relation queries the response was YES. [2022-11-20 12:21:05,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1675 conditions, 339 events. 78/339 cut-off events. For 3049/3223 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1485 event pairs, 20 based on Foata normal form. 23/347 useless extension candidates. Maximal degree in co-relation 1577. Up to 132 conditions per place. [2022-11-20 12:21:05,471 INFO L137 encePairwiseOnDemand]: 78/93 looper letters, 45 selfloop transitions, 30 changer transitions 20/148 dead transitions. [2022-11-20 12:21:05,471 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 148 transitions, 1326 flow [2022-11-20 12:21:05,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 12:21:05,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-11-20 12:21:05,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1023 transitions. [2022-11-20 12:21:05,475 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2022-11-20 12:21:05,476 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1023 transitions. [2022-11-20 12:21:05,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1023 transitions. [2022-11-20 12:21:05,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:21:05,478 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1023 transitions. [2022-11-20 12:21:05,483 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 68.2) internal successors, (1023), 15 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:05,487 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 93.0) internal successors, (1488), 16 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:05,487 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 93.0) internal successors, (1488), 16 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:05,488 INFO L175 Difference]: Start difference. First operand has 145 places, 117 transitions, 765 flow. Second operand 15 states and 1023 transitions. [2022-11-20 12:21:05,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 148 transitions, 1326 flow [2022-11-20 12:21:05,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 148 transitions, 1221 flow, removed 47 selfloop flow, removed 12 redundant places. [2022-11-20 12:21:05,509 INFO L231 Difference]: Finished difference. Result has 148 places, 121 transitions, 875 flow [2022-11-20 12:21:05,509 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=715, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=875, PETRI_PLACES=148, PETRI_TRANSITIONS=121} [2022-11-20 12:21:05,510 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, 52 predicate places. [2022-11-20 12:21:05,511 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 121 transitions, 875 flow [2022-11-20 12:21:05,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 65.83333333333333) internal successors, (790), 12 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:05,512 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:21:05,512 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] [2022-11-20 12:21:05,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 12:21:05,512 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-20 12:21:05,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:21:05,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1836567044, now seen corresponding path program 2 times [2022-11-20 12:21:05,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:21:05,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270827642] [2022-11-20 12:21:05,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:21:05,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:21:05,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:21:06,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:21:06,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:21:06,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270827642] [2022-11-20 12:21:06,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270827642] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:21:06,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:21:06,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-20 12:21:06,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358341569] [2022-11-20 12:21:06,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:21:06,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-20 12:21:06,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:21:06,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 12:21:06,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-11-20 12:21:06,788 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 93 [2022-11-20 12:21:06,789 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 121 transitions, 875 flow. Second operand has 14 states, 14 states have (on average 69.35714285714286) internal successors, (971), 14 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:06,789 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:21:06,789 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 93 [2022-11-20 12:21:06,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:21:07,341 INFO L130 PetriNetUnfolder]: 63/307 cut-off events. [2022-11-20 12:21:07,341 INFO L131 PetriNetUnfolder]: For 3535/3806 co-relation queries the response was YES. [2022-11-20 12:21:07,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1548 conditions, 307 events. 63/307 cut-off events. For 3535/3806 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1310 event pairs, 19 based on Foata normal form. 24/319 useless extension candidates. Maximal degree in co-relation 1448. Up to 116 conditions per place. [2022-11-20 12:21:07,345 INFO L137 encePairwiseOnDemand]: 81/93 looper letters, 34 selfloop transitions, 8 changer transitions 26/134 dead transitions. [2022-11-20 12:21:07,345 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 134 transitions, 1213 flow [2022-11-20 12:21:07,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 12:21:07,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-11-20 12:21:07,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1061 transitions. [2022-11-20 12:21:07,348 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.760573476702509 [2022-11-20 12:21:07,348 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1061 transitions. [2022-11-20 12:21:07,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1061 transitions. [2022-11-20 12:21:07,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:21:07,349 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1061 transitions. [2022-11-20 12:21:07,351 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 70.73333333333333) internal successors, (1061), 15 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:07,354 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 93.0) internal successors, (1488), 16 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:07,354 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 93.0) internal successors, (1488), 16 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:07,355 INFO L175 Difference]: Start difference. First operand has 148 places, 121 transitions, 875 flow. Second operand 15 states and 1061 transitions. [2022-11-20 12:21:07,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 134 transitions, 1213 flow [2022-11-20 12:21:07,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 134 transitions, 1134 flow, removed 28 selfloop flow, removed 12 redundant places. [2022-11-20 12:21:07,370 INFO L231 Difference]: Finished difference. Result has 151 places, 108 transitions, 735 flow [2022-11-20 12:21:07,370 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=735, PETRI_PLACES=151, PETRI_TRANSITIONS=108} [2022-11-20 12:21:07,371 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, 55 predicate places. [2022-11-20 12:21:07,371 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 108 transitions, 735 flow [2022-11-20 12:21:07,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 69.35714285714286) internal successors, (971), 14 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:07,372 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:21:07,372 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] [2022-11-20 12:21:07,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 12:21:07,373 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-20 12:21:07,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:21:07,373 INFO L85 PathProgramCache]: Analyzing trace with hash 798766626, now seen corresponding path program 3 times [2022-11-20 12:21:07,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:21:07,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46708616] [2022-11-20 12:21:07,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:21:07,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:21:07,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:21:08,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:21:08,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:21:08,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46708616] [2022-11-20 12:21:08,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46708616] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:21:08,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:21:08,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-20 12:21:08,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531572480] [2022-11-20 12:21:08,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:21:08,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-20 12:21:08,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:21:08,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-20 12:21:08,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-11-20 12:21:08,477 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 93 [2022-11-20 12:21:08,479 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 108 transitions, 735 flow. Second operand has 15 states, 15 states have (on average 64.46666666666667) internal successors, (967), 15 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:08,479 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:21:08,479 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 93 [2022-11-20 12:21:08,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:21:09,435 INFO L130 PetriNetUnfolder]: 241/701 cut-off events. [2022-11-20 12:21:09,435 INFO L131 PetriNetUnfolder]: For 6540/6671 co-relation queries the response was YES. [2022-11-20 12:21:09,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2968 conditions, 701 events. 241/701 cut-off events. For 6540/6671 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4070 event pairs, 7 based on Foata normal form. 43/740 useless extension candidates. Maximal degree in co-relation 2864. Up to 118 conditions per place. [2022-11-20 12:21:09,443 INFO L137 encePairwiseOnDemand]: 79/93 looper letters, 54 selfloop transitions, 20 changer transitions 57/189 dead transitions. [2022-11-20 12:21:09,443 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 189 transitions, 1826 flow [2022-11-20 12:21:09,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-20 12:21:09,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-11-20 12:21:09,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1555 transitions. [2022-11-20 12:21:09,446 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7269752220663862 [2022-11-20 12:21:09,447 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 1555 transitions. [2022-11-20 12:21:09,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 1555 transitions. [2022-11-20 12:21:09,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:21:09,448 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 1555 transitions. [2022-11-20 12:21:09,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 67.6086956521739) internal successors, (1555), 23 states have internal predecessors, (1555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:09,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 93.0) internal successors, (2232), 24 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:09,455 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 93.0) internal successors, (2232), 24 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:09,456 INFO L175 Difference]: Start difference. First operand has 151 places, 108 transitions, 735 flow. Second operand 23 states and 1555 transitions. [2022-11-20 12:21:09,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 189 transitions, 1826 flow [2022-11-20 12:21:09,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 189 transitions, 1517 flow, removed 140 selfloop flow, removed 20 redundant places. [2022-11-20 12:21:09,476 INFO L231 Difference]: Finished difference. Result has 154 places, 108 transitions, 762 flow [2022-11-20 12:21:09,477 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=762, PETRI_PLACES=154, PETRI_TRANSITIONS=108} [2022-11-20 12:21:09,477 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, 58 predicate places. [2022-11-20 12:21:09,478 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 108 transitions, 762 flow [2022-11-20 12:21:09,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 64.46666666666667) internal successors, (967), 15 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:09,478 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:21:09,478 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] [2022-11-20 12:21:09,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 12:21:09,479 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-20 12:21:09,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:21:09,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1170273642, now seen corresponding path program 1 times [2022-11-20 12:21:09,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:21:09,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905064611] [2022-11-20 12:21:09,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:21:09,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:21:09,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:21:09,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:21:09,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:21:09,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905064611] [2022-11-20 12:21:09,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905064611] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:21:09,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:21:09,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 12:21:09,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978360645] [2022-11-20 12:21:09,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:21:09,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 12:21:09,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:21:09,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 12:21:09,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:21:09,861 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 93 [2022-11-20 12:21:09,862 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 108 transitions, 762 flow. Second operand has 8 states, 8 states have (on average 71.0) internal successors, (568), 8 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:09,862 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:21:09,862 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 93 [2022-11-20 12:21:09,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:21:10,311 INFO L130 PetriNetUnfolder]: 208/581 cut-off events. [2022-11-20 12:21:10,311 INFO L131 PetriNetUnfolder]: For 6546/6702 co-relation queries the response was YES. [2022-11-20 12:21:10,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2822 conditions, 581 events. 208/581 cut-off events. For 6546/6702 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2989 event pairs, 9 based on Foata normal form. 48/613 useless extension candidates. Maximal degree in co-relation 2722. Up to 128 conditions per place. [2022-11-20 12:21:10,317 INFO L137 encePairwiseOnDemand]: 80/93 looper letters, 21 selfloop transitions, 12 changer transitions 64/156 dead transitions. [2022-11-20 12:21:10,317 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 156 transitions, 1423 flow [2022-11-20 12:21:10,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 12:21:10,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-20 12:21:10,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1183 transitions. [2022-11-20 12:21:10,320 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7950268817204301 [2022-11-20 12:21:10,320 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1183 transitions. [2022-11-20 12:21:10,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1183 transitions. [2022-11-20 12:21:10,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:21:10,321 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1183 transitions. [2022-11-20 12:21:10,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 73.9375) internal successors, (1183), 16 states have internal predecessors, (1183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:10,325 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 93.0) internal successors, (1581), 17 states have internal predecessors, (1581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:10,326 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 93.0) internal successors, (1581), 17 states have internal predecessors, (1581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:10,326 INFO L175 Difference]: Start difference. First operand has 154 places, 108 transitions, 762 flow. Second operand 16 states and 1183 transitions. [2022-11-20 12:21:10,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 156 transitions, 1423 flow [2022-11-20 12:21:10,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 156 transitions, 1123 flow, removed 101 selfloop flow, removed 31 redundant places. [2022-11-20 12:21:10,341 INFO L231 Difference]: Finished difference. Result has 138 places, 87 transitions, 448 flow [2022-11-20 12:21:10,342 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=448, PETRI_PLACES=138, PETRI_TRANSITIONS=87} [2022-11-20 12:21:10,342 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, 42 predicate places. [2022-11-20 12:21:10,342 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 87 transitions, 448 flow [2022-11-20 12:21:10,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 71.0) internal successors, (568), 8 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:10,343 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:21:10,343 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] [2022-11-20 12:21:10,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 12:21:10,344 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-20 12:21:10,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:21:10,344 INFO L85 PathProgramCache]: Analyzing trace with hash 826099005, now seen corresponding path program 1 times [2022-11-20 12:21:10,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:21:10,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896887994] [2022-11-20 12:21:10,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:21:10,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:21:10,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:21:10,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:21:10,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:21:10,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896887994] [2022-11-20 12:21:10,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896887994] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:21:10,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:21:10,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:21:10,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011824898] [2022-11-20 12:21:10,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:21:10,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:21:10,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:21:10,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:21:10,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:21:10,592 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 93 [2022-11-20 12:21:10,593 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 87 transitions, 448 flow. Second operand has 7 states, 7 states have (on average 74.0) internal successors, (518), 7 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:10,593 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:21:10,593 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 93 [2022-11-20 12:21:10,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:21:10,813 INFO L130 PetriNetUnfolder]: 27/181 cut-off events. [2022-11-20 12:21:10,813 INFO L131 PetriNetUnfolder]: For 953/957 co-relation queries the response was YES. [2022-11-20 12:21:10,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 715 conditions, 181 events. 27/181 cut-off events. For 953/957 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 556 event pairs, 1 based on Foata normal form. 13/194 useless extension candidates. Maximal degree in co-relation 636. Up to 22 conditions per place. [2022-11-20 12:21:10,815 INFO L137 encePairwiseOnDemand]: 85/93 looper letters, 15 selfloop transitions, 8 changer transitions 22/105 dead transitions. [2022-11-20 12:21:10,816 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 105 transitions, 731 flow [2022-11-20 12:21:10,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 12:21:10,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-20 12:21:10,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 757 transitions. [2022-11-20 12:21:10,818 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8139784946236559 [2022-11-20 12:21:10,819 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 757 transitions. [2022-11-20 12:21:10,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 757 transitions. [2022-11-20 12:21:10,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:21:10,819 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 757 transitions. [2022-11-20 12:21:10,821 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 75.7) internal successors, (757), 10 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:10,823 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 93.0) internal successors, (1023), 11 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:10,824 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 93.0) internal successors, (1023), 11 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:10,824 INFO L175 Difference]: Start difference. First operand has 138 places, 87 transitions, 448 flow. Second operand 10 states and 757 transitions. [2022-11-20 12:21:10,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 105 transitions, 731 flow [2022-11-20 12:21:10,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 105 transitions, 534 flow, removed 84 selfloop flow, removed 21 redundant places. [2022-11-20 12:21:10,831 INFO L231 Difference]: Finished difference. Result has 122 places, 82 transitions, 318 flow [2022-11-20 12:21:10,832 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=318, PETRI_PLACES=122, PETRI_TRANSITIONS=82} [2022-11-20 12:21:10,832 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, 26 predicate places. [2022-11-20 12:21:10,832 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 82 transitions, 318 flow [2022-11-20 12:21:10,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 74.0) internal successors, (518), 7 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:10,833 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:21:10,833 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] [2022-11-20 12:21:10,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 12:21:10,834 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-20 12:21:10,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:21:10,834 INFO L85 PathProgramCache]: Analyzing trace with hash -712284181, now seen corresponding path program 1 times [2022-11-20 12:21:10,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:21:10,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894457078] [2022-11-20 12:21:10,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:21:10,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:21:10,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:21:10,872 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 12:21:10,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:21:10,955 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 12:21:10,955 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 12:21:10,957 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-11-20 12:21:10,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-11-20 12:21:10,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-11-20 12:21:10,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-11-20 12:21:10,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-11-20 12:21:10,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 12:21:10,961 INFO L444 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:21:10,968 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-20 12:21:10,968 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 12:21:11,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 12:21:11 BasicIcfg [2022-11-20 12:21:11,061 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 12:21:11,061 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 12:21:11,062 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 12:21:11,062 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 12:21:11,062 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:20:52" (3/4) ... [2022-11-20 12:21:11,064 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-20 12:21:11,138 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87fa01bb-31cb-4938-9449-1d97e5d1482c/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 12:21:11,138 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 12:21:11,138 INFO L158 Benchmark]: Toolchain (without parser) took 19915.11ms. Allocated memory was 192.9MB in the beginning and 509.6MB in the end (delta: 316.7MB). Free memory was 161.6MB in the beginning and 346.6MB in the end (delta: -185.1MB). Peak memory consumption was 133.3MB. Max. memory is 16.1GB. [2022-11-20 12:21:11,139 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 134.2MB. Free memory is still 78.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 12:21:11,139 INFO L158 Benchmark]: CACSL2BoogieTranslator took 581.42ms. Allocated memory is still 192.9MB. Free memory was 161.6MB in the beginning and 138.5MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-20 12:21:11,139 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.83ms. Allocated memory is still 192.9MB. Free memory was 138.5MB in the beginning and 136.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 12:21:11,140 INFO L158 Benchmark]: Boogie Preprocessor took 60.23ms. Allocated memory is still 192.9MB. Free memory was 136.4MB in the beginning and 134.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 12:21:11,140 INFO L158 Benchmark]: RCFGBuilder took 801.48ms. Allocated memory is still 192.9MB. Free memory was 134.3MB in the beginning and 102.9MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-11-20 12:21:11,140 INFO L158 Benchmark]: TraceAbstraction took 18298.90ms. Allocated memory was 192.9MB in the beginning and 509.6MB in the end (delta: 316.7MB). Free memory was 102.4MB in the beginning and 360.2MB in the end (delta: -257.8MB). Peak memory consumption was 62.0MB. Max. memory is 16.1GB. [2022-11-20 12:21:11,141 INFO L158 Benchmark]: Witness Printer took 76.55ms. Allocated memory is still 509.6MB. Free memory was 360.2MB in the beginning and 346.6MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-20 12:21:11,142 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.28ms. Allocated memory is still 134.2MB. Free memory is still 78.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 581.42ms. Allocated memory is still 192.9MB. Free memory was 161.6MB in the beginning and 138.5MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 89.83ms. Allocated memory is still 192.9MB. Free memory was 138.5MB in the beginning and 136.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.23ms. Allocated memory is still 192.9MB. Free memory was 136.4MB in the beginning and 134.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 801.48ms. Allocated memory is still 192.9MB. Free memory was 134.3MB in the beginning and 102.9MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 18298.90ms. Allocated memory was 192.9MB in the beginning and 509.6MB in the end (delta: 316.7MB). Free memory was 102.4MB in the beginning and 360.2MB in the end (delta: -257.8MB). Peak memory consumption was 62.0MB. Max. memory is 16.1GB. * Witness Printer took 76.55ms. Allocated memory is still 509.6MB. Free memory was 360.2MB in the beginning and 346.6MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L709] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L710] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L712] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L713] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L714] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L715] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L716] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=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] [L717] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=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] [L718] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=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_buff1_thd0=0] [L719] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=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_buff1_thd0=0, x$r_buff1_thd1=0] [L720] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L721] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L722] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L723] 0 int x$w_buff0; VAL [__unbuffered_cnt=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L724] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L725] 0 int x$w_buff1; VAL [__unbuffered_cnt=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L726] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L728] 0 int y = 0; VAL [__unbuffered_cnt=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L729] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L730] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L790] 0 pthread_t t2475; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2475={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L791] FCALL, FORK 0 pthread_create(&t2475, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2475, ((void *)0), P0, ((void *)0))=-1, t2475={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L792] 0 pthread_t t2476; VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2475={5:0}, t2476={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L793] FCALL, FORK 0 pthread_create(&t2476, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2476, ((void *)0), P1, ((void *)0))=0, t2475={5:0}, t2476={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L754] 2 x$w_buff1 = x$w_buff0 [L755] 2 x$w_buff0 = 2 [L756] 2 x$w_buff1_used = x$w_buff0_used [L757] 2 x$w_buff0_used = (_Bool)1 [L758] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L758] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L759] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L760] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L761] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L762] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=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=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L765] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L734] 1 y = 2 VAL [__unbuffered_cnt=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=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L737] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, 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=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L768] 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) [L769] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L770] 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 [L771] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L772] 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=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L740] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L743] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L744] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475={5:0}, t2476={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L797] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L797] RET 0 assume_abort_if_not(main$tmp_guard0) [L799] 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) [L800] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L801] 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 [L802] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L803] 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=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475={5:0}, t2476={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 x$flush_delayed = weak$$choice2 [L809] 0 x$mem_tmp = x [L810] 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) [L811] 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)) [L812] 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)) [L813] 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)) [L814] 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)) [L815] 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)) [L816] 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)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] 0 x = x$flush_delayed ? x$mem_tmp : x [L819] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475={5:0}, t2476={3:0}, weak$$choice0=49, 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=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L821] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, 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=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, 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=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 791]: 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: 793]: 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 5 procedures, 111 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 18.1s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 813 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 813 mSDsluCounter, 910 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 751 mSDsCounter, 153 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1880 IncrementalHoareTripleChecker+Invalid, 2033 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 153 mSolverCounterUnsat, 159 mSDtfsCounter, 1880 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 234 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=875occurred in iteration=9, InterpolantAutomatonStates: 183, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 10.0s InterpolantComputationTime, 918 NumberOfCodeBlocks, 918 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 833 ConstructedInterpolants, 0 QuantifiedInterpolants, 6120 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-20 12:21:11,166 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87fa01bb-31cb-4938-9449-1d97e5d1482c/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