./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix015.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa2c3be-9f61-4aaf-9272-680cddca5df2/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa2c3be-9f61-4aaf-9272-680cddca5df2/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_9aa2c3be-9f61-4aaf-9272-680cddca5df2/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa2c3be-9f61-4aaf-9272-680cddca5df2/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix015.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa2c3be-9f61-4aaf-9272-680cddca5df2/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_9aa2c3be-9f61-4aaf-9272-680cddca5df2/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 4f8371a34a183593aa0efc399c0d4d9ea84f8dd0da99bba9eb7bddd73e7a457d --- 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:42:25,109 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 12:42:25,113 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 12:42:25,170 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 12:42:25,171 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 12:42:25,172 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 12:42:25,175 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 12:42:25,178 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 12:42:25,183 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 12:42:25,185 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 12:42:25,187 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 12:42:25,190 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 12:42:25,192 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 12:42:25,196 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 12:42:25,199 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 12:42:25,202 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 12:42:25,205 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 12:42:25,212 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 12:42:25,214 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 12:42:25,216 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 12:42:25,222 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 12:42:25,224 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 12:42:25,225 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 12:42:25,226 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 12:42:25,231 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 12:42:25,231 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 12:42:25,232 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 12:42:25,233 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 12:42:25,234 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 12:42:25,235 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 12:42:25,235 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 12:42:25,236 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 12:42:25,238 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 12:42:25,239 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 12:42:25,240 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 12:42:25,240 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 12:42:25,242 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 12:42:25,242 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 12:42:25,242 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 12:42:25,244 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 12:42:25,245 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 12:42:25,246 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa2c3be-9f61-4aaf-9272-680cddca5df2/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 12:42:25,273 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 12:42:25,273 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 12:42:25,274 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 12:42:25,274 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 12:42:25,275 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 12:42:25,275 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 12:42:25,276 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 12:42:25,277 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 12:42:25,277 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 12:42:25,277 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 12:42:25,278 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 12:42:25,278 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 12:42:25,278 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 12:42:25,279 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 12:42:25,279 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 12:42:25,279 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 12:42:25,279 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 12:42:25,280 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 12:42:25,280 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 12:42:25,280 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 12:42:25,280 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 12:42:25,281 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 12:42:25,281 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 12:42:25,281 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 12:42:25,282 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:42:25,282 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 12:42:25,282 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 12:42:25,283 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 12:42:25,283 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 12:42:25,283 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 12:42:25,284 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 12:42:25,284 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 12:42:25,284 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 12:42:25,285 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_9aa2c3be-9f61-4aaf-9272-680cddca5df2/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_9aa2c3be-9f61-4aaf-9272-680cddca5df2/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 -> 4f8371a34a183593aa0efc399c0d4d9ea84f8dd0da99bba9eb7bddd73e7a457d [2022-11-20 12:42:25,619 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 12:42:25,650 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 12:42:25,654 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 12:42:25,655 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 12:42:25,659 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 12:42:25,661 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa2c3be-9f61-4aaf-9272-680cddca5df2/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/pthread-wmm/mix015.opt.i [2022-11-20 12:42:29,427 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 12:42:29,768 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 12:42:29,769 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa2c3be-9f61-4aaf-9272-680cddca5df2/sv-benchmarks/c/pthread-wmm/mix015.opt.i [2022-11-20 12:42:29,784 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa2c3be-9f61-4aaf-9272-680cddca5df2/bin/uautomizer-ug76WZFUDN/data/d52e9fa96/ba15999e15fe405e96e8a132b30c7fbb/FLAGd7c5bad01 [2022-11-20 12:42:29,803 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa2c3be-9f61-4aaf-9272-680cddca5df2/bin/uautomizer-ug76WZFUDN/data/d52e9fa96/ba15999e15fe405e96e8a132b30c7fbb [2022-11-20 12:42:29,806 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 12:42:29,808 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 12:42:29,810 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 12:42:29,810 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 12:42:29,821 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 12:42:29,822 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:42:29" (1/1) ... [2022-11-20 12:42:29,824 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33d823e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:42:29, skipping insertion in model container [2022-11-20 12:42:29,824 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:42:29" (1/1) ... [2022-11-20 12:42:29,834 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 12:42:29,906 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 12:42:30,181 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_9aa2c3be-9f61-4aaf-9272-680cddca5df2/sv-benchmarks/c/pthread-wmm/mix015.opt.i[944,957] [2022-11-20 12:42:30,574 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:42:30,596 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 12:42:30,612 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_9aa2c3be-9f61-4aaf-9272-680cddca5df2/sv-benchmarks/c/pthread-wmm/mix015.opt.i[944,957] [2022-11-20 12:42:30,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:42:30,753 INFO L208 MainTranslator]: Completed translation [2022-11-20 12:42:30,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:42:30 WrapperNode [2022-11-20 12:42:30,754 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 12:42:30,755 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 12:42:30,755 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 12:42:30,756 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 12:42:30,765 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:42:30" (1/1) ... [2022-11-20 12:42:30,785 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:42:30" (1/1) ... [2022-11-20 12:42:30,816 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 150 [2022-11-20 12:42:30,817 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 12:42:30,817 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 12:42:30,818 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 12:42:30,818 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 12:42:30,829 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:42:30" (1/1) ... [2022-11-20 12:42:30,830 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:42:30" (1/1) ... [2022-11-20 12:42:30,834 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:42:30" (1/1) ... [2022-11-20 12:42:30,835 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:42:30" (1/1) ... [2022-11-20 12:42:30,846 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:42:30" (1/1) ... [2022-11-20 12:42:30,849 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:42:30" (1/1) ... [2022-11-20 12:42:30,852 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:42:30" (1/1) ... [2022-11-20 12:42:30,853 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:42:30" (1/1) ... [2022-11-20 12:42:30,858 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 12:42:30,859 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 12:42:30,859 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 12:42:30,859 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 12:42:30,860 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:42:30" (1/1) ... [2022-11-20 12:42:30,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:42:30,884 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa2c3be-9f61-4aaf-9272-680cddca5df2/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:42:30,900 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa2c3be-9f61-4aaf-9272-680cddca5df2/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 12:42:30,929 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa2c3be-9f61-4aaf-9272-680cddca5df2/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 12:42:30,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 12:42:30,968 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 12:42:30,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 12:42:30,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 12:42:30,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 12:42:30,968 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-20 12:42:30,969 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-20 12:42:30,969 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-20 12:42:30,969 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-20 12:42:30,969 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-20 12:42:30,969 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-20 12:42:30,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 12:42:30,970 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 12:42:30,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 12:42:30,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 12:42:30,972 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:42:31,136 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 12:42:31,138 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 12:42:31,636 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 12:42:32,051 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 12:42:32,052 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 12:42:32,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:42:32 BoogieIcfgContainer [2022-11-20 12:42:32,055 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 12:42:32,058 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 12:42:32,058 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 12:42:32,062 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 12:42:32,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:42:29" (1/3) ... [2022-11-20 12:42:32,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61979e20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:42:32, skipping insertion in model container [2022-11-20 12:42:32,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:42:30" (2/3) ... [2022-11-20 12:42:32,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61979e20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:42:32, skipping insertion in model container [2022-11-20 12:42:32,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:42:32" (3/3) ... [2022-11-20 12:42:32,065 INFO L112 eAbstractionObserver]: Analyzing ICFG mix015.opt.i [2022-11-20 12:42:32,080 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 12:42:32,093 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 12:42:32,094 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-20 12:42:32,094 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 12:42:32,179 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-20 12:42:32,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 120 transitions, 255 flow [2022-11-20 12:42:32,291 INFO L130 PetriNetUnfolder]: 2/117 cut-off events. [2022-11-20 12:42:32,291 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 12:42:32,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 117 events. 2/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2022-11-20 12:42:32,302 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 120 transitions, 255 flow [2022-11-20 12:42:32,306 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 117 transitions, 243 flow [2022-11-20 12:42:32,332 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 12:42:32,340 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;@3f5500fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 12:42:32,340 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-20 12:42:32,397 INFO L130 PetriNetUnfolder]: 0/77 cut-off events. [2022-11-20 12:42:32,397 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 12:42:32,397 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:42:32,399 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] [2022-11-20 12:42:32,401 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 12:42:32,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:42:32,408 INFO L85 PathProgramCache]: Analyzing trace with hash -72354617, now seen corresponding path program 1 times [2022-11-20 12:42:32,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:42:32,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172185489] [2022-11-20 12:42:32,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:42:32,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:42:32,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:42:33,319 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:42:33,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:42:33,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172185489] [2022-11-20 12:42:33,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172185489] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:42:33,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:42:33,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:42:33,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572755862] [2022-11-20 12:42:33,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:42:33,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:42:33,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:42:33,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:42:33,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:42:33,372 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 120 [2022-11-20 12:42:33,376 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 117 transitions, 243 flow. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states 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:42:33,377 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:42:33,377 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 120 [2022-11-20 12:42:33,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:42:33,566 INFO L130 PetriNetUnfolder]: 14/194 cut-off events. [2022-11-20 12:42:33,567 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-20 12:42:33,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241 conditions, 194 events. 14/194 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 421 event pairs, 6 based on Foata normal form. 5/188 useless extension candidates. Maximal degree in co-relation 185. Up to 25 conditions per place. [2022-11-20 12:42:33,574 INFO L137 encePairwiseOnDemand]: 115/120 looper letters, 9 selfloop transitions, 2 changer transitions 0/115 dead transitions. [2022-11-20 12:42:33,574 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 115 transitions, 261 flow [2022-11-20 12:42:33,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:42:33,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:42:33,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 337 transitions. [2022-11-20 12:42:33,597 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9361111111111111 [2022-11-20 12:42:33,598 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 337 transitions. [2022-11-20 12:42:33,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 337 transitions. [2022-11-20 12:42:33,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:42:33,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 337 transitions. [2022-11-20 12:42:33,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states 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:42:33,618 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states 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:42:33,618 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states 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:42:33,621 INFO L175 Difference]: Start difference. First operand has 125 places, 117 transitions, 243 flow. Second operand 3 states and 337 transitions. [2022-11-20 12:42:33,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 115 transitions, 261 flow [2022-11-20 12:42:33,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 115 transitions, 258 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-20 12:42:33,635 INFO L231 Difference]: Finished difference. Result has 122 places, 113 transitions, 236 flow [2022-11-20 12:42:33,637 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=236, PETRI_PLACES=122, PETRI_TRANSITIONS=113} [2022-11-20 12:42:33,641 INFO L288 CegarLoopForPetriNet]: 125 programPoint places, -3 predicate places. [2022-11-20 12:42:33,641 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 113 transitions, 236 flow [2022-11-20 12:42:33,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states 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:42:33,642 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:42:33,642 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:42:33,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 12:42:33,643 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 12:42:33,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:42:33,644 INFO L85 PathProgramCache]: Analyzing trace with hash -991439696, now seen corresponding path program 1 times [2022-11-20 12:42:33,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:42:33,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181166778] [2022-11-20 12:42:33,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:42:33,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:42:33,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:42:34,192 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:42:34,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:42:34,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181166778] [2022-11-20 12:42:34,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181166778] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:42:34,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:42:34,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:42:34,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289000286] [2022-11-20 12:42:34,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:42:34,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:42:34,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:42:34,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:42:34,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:42:34,210 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 120 [2022-11-20 12:42:34,211 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 113 transitions, 236 flow. Second operand has 7 states, 7 states have (on average 95.14285714285714) internal successors, (666), 7 states have internal predecessors, (666), 0 states have call successors, (0), 0 states 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:42:34,211 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:42:34,218 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 120 [2022-11-20 12:42:34,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:42:35,026 INFO L130 PetriNetUnfolder]: 589/1725 cut-off events. [2022-11-20 12:42:35,027 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2022-11-20 12:42:35,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2749 conditions, 1725 events. 589/1725 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 12519 event pairs, 78 based on Foata normal form. 0/1681 useless extension candidates. Maximal degree in co-relation 2689. Up to 463 conditions per place. [2022-11-20 12:42:35,039 INFO L137 encePairwiseOnDemand]: 114/120 looper letters, 28 selfloop transitions, 2 changer transitions 57/166 dead transitions. [2022-11-20 12:42:35,039 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 166 transitions, 512 flow [2022-11-20 12:42:35,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 12:42:35,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-20 12:42:35,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 915 transitions. [2022-11-20 12:42:35,043 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8472222222222222 [2022-11-20 12:42:35,043 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 915 transitions. [2022-11-20 12:42:35,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 915 transitions. [2022-11-20 12:42:35,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:42:35,044 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 915 transitions. [2022-11-20 12:42:35,047 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 101.66666666666667) internal successors, (915), 9 states have internal predecessors, (915), 0 states have call successors, (0), 0 states 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:42:35,051 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 120.0) internal successors, (1200), 10 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:42:35,052 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 120.0) internal successors, (1200), 10 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:42:35,052 INFO L175 Difference]: Start difference. First operand has 122 places, 113 transitions, 236 flow. Second operand 9 states and 915 transitions. [2022-11-20 12:42:35,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 166 transitions, 512 flow [2022-11-20 12:42:35,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 166 transitions, 494 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 12:42:35,057 INFO L231 Difference]: Finished difference. Result has 135 places, 101 transitions, 228 flow [2022-11-20 12:42:35,057 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=228, PETRI_PLACES=135, PETRI_TRANSITIONS=101} [2022-11-20 12:42:35,058 INFO L288 CegarLoopForPetriNet]: 125 programPoint places, 10 predicate places. [2022-11-20 12:42:35,058 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 101 transitions, 228 flow [2022-11-20 12:42:35,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.14285714285714) internal successors, (666), 7 states have internal predecessors, (666), 0 states have call successors, (0), 0 states 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:42:35,059 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:42:35,060 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:42:35,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 12:42:35,060 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 12:42:35,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:42:35,061 INFO L85 PathProgramCache]: Analyzing trace with hash 782821102, now seen corresponding path program 1 times [2022-11-20 12:42:35,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:42:35,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592752932] [2022-11-20 12:42:35,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:42:35,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:42:35,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:42:35,419 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:42:35,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:42:35,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592752932] [2022-11-20 12:42:35,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592752932] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:42:35,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:42:35,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:42:35,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94144841] [2022-11-20 12:42:35,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:42:35,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:42:35,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:42:35,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:42:35,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:42:35,426 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 120 [2022-11-20 12:42:35,427 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 101 transitions, 228 flow. Second operand has 7 states, 7 states have (on average 95.28571428571429) internal successors, (667), 7 states have internal predecessors, (667), 0 states have call successors, (0), 0 states 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:42:35,427 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:42:35,427 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 120 [2022-11-20 12:42:35,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:42:35,963 INFO L130 PetriNetUnfolder]: 330/777 cut-off events. [2022-11-20 12:42:35,964 INFO L131 PetriNetUnfolder]: For 253/253 co-relation queries the response was YES. [2022-11-20 12:42:35,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1571 conditions, 777 events. 330/777 cut-off events. For 253/253 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4130 event pairs, 78 based on Foata normal form. 20/771 useless extension candidates. Maximal degree in co-relation 1504. Up to 259 conditions per place. [2022-11-20 12:42:35,973 INFO L137 encePairwiseOnDemand]: 112/120 looper letters, 22 selfloop transitions, 4 changer transitions 31/136 dead transitions. [2022-11-20 12:42:35,973 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 136 transitions, 433 flow [2022-11-20 12:42:35,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 12:42:35,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-20 12:42:35,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 989 transitions. [2022-11-20 12:42:35,978 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8241666666666667 [2022-11-20 12:42:35,979 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 989 transitions. [2022-11-20 12:42:35,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 989 transitions. [2022-11-20 12:42:35,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:42:35,982 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 989 transitions. [2022-11-20 12:42:35,985 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 98.9) internal successors, (989), 10 states have internal predecessors, (989), 0 states have call successors, (0), 0 states 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:42:35,988 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states 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:42:35,989 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states 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:42:35,989 INFO L175 Difference]: Start difference. First operand has 135 places, 101 transitions, 228 flow. Second operand 10 states and 989 transitions. [2022-11-20 12:42:35,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 136 transitions, 433 flow [2022-11-20 12:42:35,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 136 transitions, 399 flow, removed 14 selfloop flow, removed 8 redundant places. [2022-11-20 12:42:36,000 INFO L231 Difference]: Finished difference. Result has 125 places, 101 transitions, 236 flow [2022-11-20 12:42:36,001 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=236, PETRI_PLACES=125, PETRI_TRANSITIONS=101} [2022-11-20 12:42:36,003 INFO L288 CegarLoopForPetriNet]: 125 programPoint places, 0 predicate places. [2022-11-20 12:42:36,004 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 101 transitions, 236 flow [2022-11-20 12:42:36,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.28571428571429) internal successors, (667), 7 states have internal predecessors, (667), 0 states have call successors, (0), 0 states 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:42:36,006 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:42:36,006 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:42:36,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 12:42:36,007 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 12:42:36,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:42:36,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1211867851, now seen corresponding path program 1 times [2022-11-20 12:42:36,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:42:36,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267250113] [2022-11-20 12:42:36,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:42:36,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:42:36,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:42:36,454 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:42:36,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:42:36,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267250113] [2022-11-20 12:42:36,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267250113] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:42:36,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:42:36,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 12:42:36,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800205435] [2022-11-20 12:42:36,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:42:36,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:42:36,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:42:36,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:42:36,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:42:36,466 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 120 [2022-11-20 12:42:36,468 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 101 transitions, 236 flow. Second operand has 6 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 0 states have call successors, (0), 0 states 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:42:36,468 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:42:36,468 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 120 [2022-11-20 12:42:36,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:42:37,035 INFO L130 PetriNetUnfolder]: 556/1227 cut-off events. [2022-11-20 12:42:37,035 INFO L131 PetriNetUnfolder]: For 119/119 co-relation queries the response was YES. [2022-11-20 12:42:37,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2400 conditions, 1227 events. 556/1227 cut-off events. For 119/119 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 8035 event pairs, 16 based on Foata normal form. 0/1203 useless extension candidates. Maximal degree in co-relation 2334. Up to 343 conditions per place. [2022-11-20 12:42:37,044 INFO L137 encePairwiseOnDemand]: 110/120 looper letters, 28 selfloop transitions, 6 changer transitions 45/161 dead transitions. [2022-11-20 12:42:37,044 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 161 transitions, 539 flow [2022-11-20 12:42:37,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 12:42:37,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-20 12:42:37,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1051 transitions. [2022-11-20 12:42:37,049 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8758333333333334 [2022-11-20 12:42:37,049 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1051 transitions. [2022-11-20 12:42:37,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1051 transitions. [2022-11-20 12:42:37,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:42:37,050 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1051 transitions. [2022-11-20 12:42:37,053 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 105.1) internal successors, (1051), 10 states have internal predecessors, (1051), 0 states have call successors, (0), 0 states 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:42:37,057 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states 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:42:37,058 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states 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:42:37,058 INFO L175 Difference]: Start difference. First operand has 125 places, 101 transitions, 236 flow. Second operand 10 states and 1051 transitions. [2022-11-20 12:42:37,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 161 transitions, 539 flow [2022-11-20 12:42:37,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 161 transitions, 505 flow, removed 6 selfloop flow, removed 9 redundant places. [2022-11-20 12:42:37,064 INFO L231 Difference]: Finished difference. Result has 125 places, 103 transitions, 270 flow [2022-11-20 12:42:37,065 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=270, PETRI_PLACES=125, PETRI_TRANSITIONS=103} [2022-11-20 12:42:37,066 INFO L288 CegarLoopForPetriNet]: 125 programPoint places, 0 predicate places. [2022-11-20 12:42:37,066 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 103 transitions, 270 flow [2022-11-20 12:42:37,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 0 states have call successors, (0), 0 states 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:42:37,067 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:42:37,067 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:42:37,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 12:42:37,068 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 12:42:37,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:42:37,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1310234686, now seen corresponding path program 1 times [2022-11-20 12:42:37,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:42:37,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63495061] [2022-11-20 12:42:37,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:42:37,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:42:37,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:42:37,422 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:42:37,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:42:37,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63495061] [2022-11-20 12:42:37,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63495061] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:42:37,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:42:37,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:42:37,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454814279] [2022-11-20 12:42:37,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:42:37,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:42:37,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:42:37,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:42:37,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:42:37,428 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 120 [2022-11-20 12:42:37,430 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 103 transitions, 270 flow. Second operand has 7 states, 7 states have (on average 99.0) internal successors, (693), 7 states have internal predecessors, (693), 0 states have call successors, (0), 0 states 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:42:37,430 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:42:37,430 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 120 [2022-11-20 12:42:37,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:42:37,892 INFO L130 PetriNetUnfolder]: 212/598 cut-off events. [2022-11-20 12:42:37,893 INFO L131 PetriNetUnfolder]: For 607/607 co-relation queries the response was YES. [2022-11-20 12:42:37,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1589 conditions, 598 events. 212/598 cut-off events. For 607/607 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3207 event pairs, 21 based on Foata normal form. 22/618 useless extension candidates. Maximal degree in co-relation 1524. Up to 154 conditions per place. [2022-11-20 12:42:37,898 INFO L137 encePairwiseOnDemand]: 111/120 looper letters, 33 selfloop transitions, 9 changer transitions 35/159 dead transitions. [2022-11-20 12:42:37,899 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 159 transitions, 676 flow [2022-11-20 12:42:37,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 12:42:37,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-20 12:42:37,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1049 transitions. [2022-11-20 12:42:37,904 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8741666666666666 [2022-11-20 12:42:37,904 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1049 transitions. [2022-11-20 12:42:37,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1049 transitions. [2022-11-20 12:42:37,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:42:37,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1049 transitions. [2022-11-20 12:42:37,910 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 104.9) internal successors, (1049), 10 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states 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:42:37,913 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states 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:42:37,914 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states 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:42:37,915 INFO L175 Difference]: Start difference. First operand has 125 places, 103 transitions, 270 flow. Second operand 10 states and 1049 transitions. [2022-11-20 12:42:37,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 159 transitions, 676 flow [2022-11-20 12:42:37,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 159 transitions, 652 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-11-20 12:42:37,924 INFO L231 Difference]: Finished difference. Result has 129 places, 106 transitions, 338 flow [2022-11-20 12:42:37,925 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=338, PETRI_PLACES=129, PETRI_TRANSITIONS=106} [2022-11-20 12:42:37,928 INFO L288 CegarLoopForPetriNet]: 125 programPoint places, 4 predicate places. [2022-11-20 12:42:37,928 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 106 transitions, 338 flow [2022-11-20 12:42:37,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 99.0) internal successors, (693), 7 states have internal predecessors, (693), 0 states have call successors, (0), 0 states 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:42:37,929 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:42:37,929 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:42:37,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 12:42:37,930 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 12:42:37,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:42:37,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1830766477, now seen corresponding path program 1 times [2022-11-20 12:42:37,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:42:37,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301441823] [2022-11-20 12:42:37,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:42:37,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:42:38,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:42:38,992 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:42:38,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:42:38,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301441823] [2022-11-20 12:42:38,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301441823] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:42:38,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:42:38,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 12:42:38,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395125358] [2022-11-20 12:42:38,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:42:38,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 12:42:38,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:42:38,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 12:42:38,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:42:38,997 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 120 [2022-11-20 12:42:38,999 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 106 transitions, 338 flow. Second operand has 10 states, 10 states have (on average 89.7) internal successors, (897), 10 states have internal predecessors, (897), 0 states have call successors, (0), 0 states 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:42:38,999 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:42:38,999 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 120 [2022-11-20 12:42:38,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:42:39,635 INFO L130 PetriNetUnfolder]: 153/701 cut-off events. [2022-11-20 12:42:39,636 INFO L131 PetriNetUnfolder]: For 963/1020 co-relation queries the response was YES. [2022-11-20 12:42:39,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1726 conditions, 701 events. 153/701 cut-off events. For 963/1020 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3979 event pairs, 7 based on Foata normal form. 19/710 useless extension candidates. Maximal degree in co-relation 1648. Up to 159 conditions per place. [2022-11-20 12:42:39,644 INFO L137 encePairwiseOnDemand]: 104/120 looper letters, 42 selfloop transitions, 18 changer transitions 16/154 dead transitions. [2022-11-20 12:42:39,644 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 154 transitions, 605 flow [2022-11-20 12:42:39,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 12:42:39,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-20 12:42:39,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1296 transitions. [2022-11-20 12:42:39,649 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7714285714285715 [2022-11-20 12:42:39,650 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1296 transitions. [2022-11-20 12:42:39,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1296 transitions. [2022-11-20 12:42:39,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:42:39,651 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1296 transitions. [2022-11-20 12:42:39,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 92.57142857142857) internal successors, (1296), 14 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states 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:42:39,661 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 120.0) internal successors, (1800), 15 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states 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:42:39,662 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 120.0) internal successors, (1800), 15 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states 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:42:39,662 INFO L175 Difference]: Start difference. First operand has 129 places, 106 transitions, 338 flow. Second operand 14 states and 1296 transitions. [2022-11-20 12:42:39,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 154 transitions, 605 flow [2022-11-20 12:42:39,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 154 transitions, 549 flow, removed 20 selfloop flow, removed 9 redundant places. [2022-11-20 12:42:39,675 INFO L231 Difference]: Finished difference. Result has 138 places, 120 transitions, 404 flow [2022-11-20 12:42:39,675 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=404, PETRI_PLACES=138, PETRI_TRANSITIONS=120} [2022-11-20 12:42:39,678 INFO L288 CegarLoopForPetriNet]: 125 programPoint places, 13 predicate places. [2022-11-20 12:42:39,678 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 120 transitions, 404 flow [2022-11-20 12:42:39,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 89.7) internal successors, (897), 10 states have internal predecessors, (897), 0 states have call successors, (0), 0 states 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:42:39,679 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:42:39,680 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:42:39,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 12:42:39,681 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 12:42:39,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:42:39,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1532083499, now seen corresponding path program 2 times [2022-11-20 12:42:39,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:42:39,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277324111] [2022-11-20 12:42:39,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:42:39,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:42:39,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:42:40,796 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:42:40,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:42:40,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277324111] [2022-11-20 12:42:40,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277324111] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:42:40,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:42:40,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 12:42:40,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767061090] [2022-11-20 12:42:40,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:42:40,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 12:42:40,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:42:40,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 12:42:40,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:42:40,808 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 120 [2022-11-20 12:42:40,809 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 120 transitions, 404 flow. Second operand has 10 states, 10 states have (on average 95.1) internal successors, (951), 10 states have internal predecessors, (951), 0 states have call successors, (0), 0 states 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:42:40,810 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:42:40,810 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 120 [2022-11-20 12:42:40,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:42:41,509 INFO L130 PetriNetUnfolder]: 149/745 cut-off events. [2022-11-20 12:42:41,509 INFO L131 PetriNetUnfolder]: For 737/766 co-relation queries the response was YES. [2022-11-20 12:42:41,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1797 conditions, 745 events. 149/745 cut-off events. For 737/766 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 4629 event pairs, 33 based on Foata normal form. 20/742 useless extension candidates. Maximal degree in co-relation 1716. Up to 122 conditions per place. [2022-11-20 12:42:41,517 INFO L137 encePairwiseOnDemand]: 109/120 looper letters, 33 selfloop transitions, 21 changer transitions 15/153 dead transitions. [2022-11-20 12:42:41,517 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 153 transitions, 668 flow [2022-11-20 12:42:41,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 12:42:41,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-20 12:42:41,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1177 transitions. [2022-11-20 12:42:41,556 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8173611111111111 [2022-11-20 12:42:41,557 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1177 transitions. [2022-11-20 12:42:41,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1177 transitions. [2022-11-20 12:42:41,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:42:41,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1177 transitions. [2022-11-20 12:42:41,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 98.08333333333333) internal successors, (1177), 12 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states 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:42:41,567 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 120.0) internal successors, (1560), 13 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states 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:42:41,570 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 120.0) internal successors, (1560), 13 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states 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:42:41,570 INFO L175 Difference]: Start difference. First operand has 138 places, 120 transitions, 404 flow. Second operand 12 states and 1177 transitions. [2022-11-20 12:42:41,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 153 transitions, 668 flow [2022-11-20 12:42:41,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 153 transitions, 648 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-11-20 12:42:41,580 INFO L231 Difference]: Finished difference. Result has 146 places, 128 transitions, 504 flow [2022-11-20 12:42:41,581 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=504, PETRI_PLACES=146, PETRI_TRANSITIONS=128} [2022-11-20 12:42:41,582 INFO L288 CegarLoopForPetriNet]: 125 programPoint places, 21 predicate places. [2022-11-20 12:42:41,583 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 128 transitions, 504 flow [2022-11-20 12:42:41,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 95.1) internal successors, (951), 10 states have internal predecessors, (951), 0 states have call successors, (0), 0 states 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:42:41,584 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:42:41,584 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:42:41,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 12:42:41,585 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 12:42:41,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:42:41,586 INFO L85 PathProgramCache]: Analyzing trace with hash -603711827, now seen corresponding path program 3 times [2022-11-20 12:42:41,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:42:41,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382924735] [2022-11-20 12:42:41,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:42:41,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:42:41,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:42:42,031 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:42:42,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:42:42,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382924735] [2022-11-20 12:42:42,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382924735] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:42:42,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:42:42,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 12:42:42,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613071561] [2022-11-20 12:42:42,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:42:42,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 12:42:42,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:42:42,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 12:42:42,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:42:42,036 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 120 [2022-11-20 12:42:42,038 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 128 transitions, 504 flow. Second operand has 8 states, 8 states have (on average 99.0) internal successors, (792), 8 states have internal predecessors, (792), 0 states have call successors, (0), 0 states 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:42:42,038 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:42:42,038 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 120 [2022-11-20 12:42:42,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:42:42,486 INFO L130 PetriNetUnfolder]: 141/566 cut-off events. [2022-11-20 12:42:42,487 INFO L131 PetriNetUnfolder]: For 726/742 co-relation queries the response was YES. [2022-11-20 12:42:42,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1617 conditions, 566 events. 141/566 cut-off events. For 726/742 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3039 event pairs, 3 based on Foata normal form. 30/582 useless extension candidates. Maximal degree in co-relation 1590. Up to 100 conditions per place. [2022-11-20 12:42:42,492 INFO L137 encePairwiseOnDemand]: 111/120 looper letters, 26 selfloop transitions, 12 changer transitions 54/176 dead transitions. [2022-11-20 12:42:42,492 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 176 transitions, 993 flow [2022-11-20 12:42:42,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 12:42:42,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-20 12:42:42,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1125 transitions. [2022-11-20 12:42:42,497 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8522727272727273 [2022-11-20 12:42:42,497 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1125 transitions. [2022-11-20 12:42:42,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1125 transitions. [2022-11-20 12:42:42,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:42:42,498 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1125 transitions. [2022-11-20 12:42:42,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 102.27272727272727) internal successors, (1125), 11 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states 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:42:42,505 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 120.0) internal successors, (1440), 12 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states 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:42:42,506 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 120.0) internal successors, (1440), 12 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states 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:42:42,506 INFO L175 Difference]: Start difference. First operand has 146 places, 128 transitions, 504 flow. Second operand 11 states and 1125 transitions. [2022-11-20 12:42:42,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 176 transitions, 993 flow [2022-11-20 12:42:42,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 176 transitions, 899 flow, removed 25 selfloop flow, removed 10 redundant places. [2022-11-20 12:42:42,520 INFO L231 Difference]: Finished difference. Result has 149 places, 113 transitions, 391 flow [2022-11-20 12:42:42,520 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=391, PETRI_PLACES=149, PETRI_TRANSITIONS=113} [2022-11-20 12:42:42,524 INFO L288 CegarLoopForPetriNet]: 125 programPoint places, 24 predicate places. [2022-11-20 12:42:42,524 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 113 transitions, 391 flow [2022-11-20 12:42:42,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 99.0) internal successors, (792), 8 states have internal predecessors, (792), 0 states have call successors, (0), 0 states 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:42:42,525 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:42:42,525 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:42:42,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 12:42:42,526 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 12:42:42,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:42:42,526 INFO L85 PathProgramCache]: Analyzing trace with hash -613909003, now seen corresponding path program 1 times [2022-11-20 12:42:42,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:42:42,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423329953] [2022-11-20 12:42:42,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:42:42,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:42:42,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:42:43,007 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:42:43,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:42:43,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423329953] [2022-11-20 12:42:43,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423329953] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:42:43,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:42:43,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:42:43,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704060712] [2022-11-20 12:42:43,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:42:43,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:42:43,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:42:43,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:42:43,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:42:43,011 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 120 [2022-11-20 12:42:43,012 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 113 transitions, 391 flow. Second operand has 7 states, 7 states have (on average 94.42857142857143) internal successors, (661), 7 states have internal predecessors, (661), 0 states have call successors, (0), 0 states 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:42:43,012 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:42:43,013 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 120 [2022-11-20 12:42:43,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:42:43,342 INFO L130 PetriNetUnfolder]: 53/342 cut-off events. [2022-11-20 12:42:43,342 INFO L131 PetriNetUnfolder]: For 259/261 co-relation queries the response was YES. [2022-11-20 12:42:43,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 799 conditions, 342 events. 53/342 cut-off events. For 259/261 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1529 event pairs, 3 based on Foata normal form. 1/339 useless extension candidates. Maximal degree in co-relation 779. Up to 63 conditions per place. [2022-11-20 12:42:43,345 INFO L137 encePairwiseOnDemand]: 109/120 looper letters, 26 selfloop transitions, 7 changer transitions 13/128 dead transitions. [2022-11-20 12:42:43,346 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 128 transitions, 531 flow [2022-11-20 12:42:43,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 12:42:43,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-20 12:42:43,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 768 transitions. [2022-11-20 12:42:43,349 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8 [2022-11-20 12:42:43,349 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 768 transitions. [2022-11-20 12:42:43,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 768 transitions. [2022-11-20 12:42:43,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:42:43,350 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 768 transitions. [2022-11-20 12:42:43,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 96.0) internal successors, (768), 8 states have internal predecessors, (768), 0 states have call successors, (0), 0 states 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:42:43,355 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 120.0) internal successors, (1080), 9 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states 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:42:43,356 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 120.0) internal successors, (1080), 9 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states 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:42:43,356 INFO L175 Difference]: Start difference. First operand has 149 places, 113 transitions, 391 flow. Second operand 8 states and 768 transitions. [2022-11-20 12:42:43,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 128 transitions, 531 flow [2022-11-20 12:42:43,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 128 transitions, 442 flow, removed 25 selfloop flow, removed 17 redundant places. [2022-11-20 12:42:43,362 INFO L231 Difference]: Finished difference. Result has 135 places, 108 transitions, 300 flow [2022-11-20 12:42:43,362 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=300, PETRI_PLACES=135, PETRI_TRANSITIONS=108} [2022-11-20 12:42:43,363 INFO L288 CegarLoopForPetriNet]: 125 programPoint places, 10 predicate places. [2022-11-20 12:42:43,364 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 108 transitions, 300 flow [2022-11-20 12:42:43,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 94.42857142857143) internal successors, (661), 7 states have internal predecessors, (661), 0 states have call successors, (0), 0 states 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:42:43,364 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:42:43,365 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:42:43,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 12:42:43,365 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 12:42:43,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:42:43,366 INFO L85 PathProgramCache]: Analyzing trace with hash -347478233, now seen corresponding path program 2 times [2022-11-20 12:42:43,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:42:43,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104261799] [2022-11-20 12:42:43,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:42:43,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:42:43,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:42:43,754 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:42:43,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:42:43,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104261799] [2022-11-20 12:42:43,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104261799] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:42:43,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:42:43,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:42:43,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434379067] [2022-11-20 12:42:43,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:42:43,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:42:43,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:42:43,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:42:43,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:42:43,761 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 120 [2022-11-20 12:42:43,763 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 108 transitions, 300 flow. Second operand has 7 states, 7 states have (on average 99.57142857142857) internal successors, (697), 7 states have internal predecessors, (697), 0 states have call successors, (0), 0 states 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:42:43,763 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:42:43,763 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 120 [2022-11-20 12:42:43,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:42:44,016 INFO L130 PetriNetUnfolder]: 32/281 cut-off events. [2022-11-20 12:42:44,016 INFO L131 PetriNetUnfolder]: For 65/77 co-relation queries the response was YES. [2022-11-20 12:42:44,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 491 conditions, 281 events. 32/281 cut-off events. For 65/77 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1174 event pairs, 1 based on Foata normal form. 6/282 useless extension candidates. Maximal degree in co-relation 478. Up to 30 conditions per place. [2022-11-20 12:42:44,019 INFO L137 encePairwiseOnDemand]: 114/120 looper letters, 18 selfloop transitions, 1 changer transitions 11/118 dead transitions. [2022-11-20 12:42:44,019 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 118 transitions, 396 flow [2022-11-20 12:42:44,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 12:42:44,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-20 12:42:44,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 710 transitions. [2022-11-20 12:42:44,022 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8452380952380952 [2022-11-20 12:42:44,022 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 710 transitions. [2022-11-20 12:42:44,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 710 transitions. [2022-11-20 12:42:44,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:42:44,023 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 710 transitions. [2022-11-20 12:42:44,026 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 101.42857142857143) internal successors, (710), 7 states have internal predecessors, (710), 0 states have call successors, (0), 0 states 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:42:44,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 120.0) internal successors, (960), 8 states have internal predecessors, (960), 0 states have call successors, (0), 0 states 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:42:44,029 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 120.0) internal successors, (960), 8 states have internal predecessors, (960), 0 states have call successors, (0), 0 states 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:42:44,029 INFO L175 Difference]: Start difference. First operand has 135 places, 108 transitions, 300 flow. Second operand 7 states and 710 transitions. [2022-11-20 12:42:44,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 118 transitions, 396 flow [2022-11-20 12:42:44,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 118 transitions, 357 flow, removed 6 selfloop flow, removed 10 redundant places. [2022-11-20 12:42:44,033 INFO L231 Difference]: Finished difference. Result has 130 places, 106 transitions, 270 flow [2022-11-20 12:42:44,034 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=270, PETRI_PLACES=130, PETRI_TRANSITIONS=106} [2022-11-20 12:42:44,035 INFO L288 CegarLoopForPetriNet]: 125 programPoint places, 5 predicate places. [2022-11-20 12:42:44,035 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 106 transitions, 270 flow [2022-11-20 12:42:44,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 99.57142857142857) internal successors, (697), 7 states have internal predecessors, (697), 0 states have call successors, (0), 0 states 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:42:44,036 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:42:44,036 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:42:44,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 12:42:44,037 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 12:42:44,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:42:44,038 INFO L85 PathProgramCache]: Analyzing trace with hash -178940169, now seen corresponding path program 3 times [2022-11-20 12:42:44,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:42:44,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395251724] [2022-11-20 12:42:44,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:42:44,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:42:44,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:42:46,219 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:42:46,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:42:46,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395251724] [2022-11-20 12:42:46,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395251724] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:42:46,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:42:46,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-20 12:42:46,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070305525] [2022-11-20 12:42:46,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:42:46,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 12:42:46,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:42:46,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 12:42:46,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-11-20 12:42:46,224 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 120 [2022-11-20 12:42:46,226 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 106 transitions, 270 flow. Second operand has 13 states, 13 states have (on average 92.84615384615384) internal successors, (1207), 13 states have internal predecessors, (1207), 0 states have call successors, (0), 0 states 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:42:46,226 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:42:46,226 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 120 [2022-11-20 12:42:46,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:42:46,657 INFO L130 PetriNetUnfolder]: 13/196 cut-off events. [2022-11-20 12:42:46,657 INFO L131 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2022-11-20 12:42:46,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 323 conditions, 196 events. 13/196 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 540 event pairs, 0 based on Foata normal form. 1/196 useless extension candidates. Maximal degree in co-relation 311. Up to 18 conditions per place. [2022-11-20 12:42:46,658 INFO L137 encePairwiseOnDemand]: 106/120 looper letters, 15 selfloop transitions, 9 changer transitions 6/112 dead transitions. [2022-11-20 12:42:46,659 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 112 transitions, 354 flow [2022-11-20 12:42:46,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 12:42:46,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-20 12:42:46,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1305 transitions. [2022-11-20 12:42:46,665 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7767857142857143 [2022-11-20 12:42:46,665 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1305 transitions. [2022-11-20 12:42:46,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1305 transitions. [2022-11-20 12:42:46,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:42:46,668 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1305 transitions. [2022-11-20 12:42:46,673 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 93.21428571428571) internal successors, (1305), 14 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states 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:42:46,678 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 120.0) internal successors, (1800), 15 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states 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:42:46,679 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 120.0) internal successors, (1800), 15 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states 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:42:46,679 INFO L175 Difference]: Start difference. First operand has 130 places, 106 transitions, 270 flow. Second operand 14 states and 1305 transitions. [2022-11-20 12:42:46,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 112 transitions, 354 flow [2022-11-20 12:42:46,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 112 transitions, 331 flow, removed 11 selfloop flow, removed 6 redundant places. [2022-11-20 12:42:46,683 INFO L231 Difference]: Finished difference. Result has 137 places, 106 transitions, 289 flow [2022-11-20 12:42:46,683 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=289, PETRI_PLACES=137, PETRI_TRANSITIONS=106} [2022-11-20 12:42:46,684 INFO L288 CegarLoopForPetriNet]: 125 programPoint places, 12 predicate places. [2022-11-20 12:42:46,684 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 106 transitions, 289 flow [2022-11-20 12:42:46,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 92.84615384615384) internal successors, (1207), 13 states have internal predecessors, (1207), 0 states have call successors, (0), 0 states 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:42:46,685 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:42:46,686 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:42:46,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 12:42:46,686 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 12:42:46,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:42:46,687 INFO L85 PathProgramCache]: Analyzing trace with hash -584639805, now seen corresponding path program 4 times [2022-11-20 12:42:46,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:42:46,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839138777] [2022-11-20 12:42:46,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:42:46,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:42:46,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:42:46,752 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 12:42:46,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:42:46,857 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 12:42:46,858 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 12:42:46,859 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-20 12:42:46,862 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-20 12:42:46,862 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-20 12:42:46,862 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-20 12:42:46,863 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-20 12:42:46,863 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-20 12:42:46,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 12:42:46,864 INFO L444 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1] [2022-11-20 12:42:46,872 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-20 12:42:46,873 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 12:42:47,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 12:42:47 BasicIcfg [2022-11-20 12:42:47,047 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 12:42:47,048 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 12:42:47,048 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 12:42:47,048 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 12:42:47,049 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:42:32" (3/4) ... [2022-11-20 12:42:47,063 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-20 12:42:47,228 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa2c3be-9f61-4aaf-9272-680cddca5df2/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 12:42:47,228 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 12:42:47,229 INFO L158 Benchmark]: Toolchain (without parser) took 17421.09ms. Allocated memory was 176.2MB in the beginning and 371.2MB in the end (delta: 195.0MB). Free memory was 134.2MB in the beginning and 244.7MB in the end (delta: -110.6MB). Peak memory consumption was 87.3MB. Max. memory is 16.1GB. [2022-11-20 12:42:47,229 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 127.9MB. Free memory was 69.2MB in the beginning and 69.1MB in the end (delta: 117.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 12:42:47,230 INFO L158 Benchmark]: CACSL2BoogieTranslator took 945.14ms. Allocated memory is still 176.2MB. Free memory was 133.5MB in the beginning and 109.8MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-20 12:42:47,230 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.45ms. Allocated memory is still 176.2MB. Free memory was 109.8MB in the beginning and 107.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 12:42:47,231 INFO L158 Benchmark]: Boogie Preprocessor took 40.63ms. Allocated memory is still 176.2MB. Free memory was 107.6MB in the beginning and 105.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 12:42:47,231 INFO L158 Benchmark]: RCFGBuilder took 1195.85ms. Allocated memory is still 176.2MB. Free memory was 105.6MB in the beginning and 130.9MB in the end (delta: -25.3MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. [2022-11-20 12:42:47,232 INFO L158 Benchmark]: TraceAbstraction took 14989.62ms. Allocated memory was 176.2MB in the beginning and 371.2MB in the end (delta: 195.0MB). Free memory was 129.8MB in the beginning and 269.9MB in the end (delta: -140.0MB). Peak memory consumption was 55.0MB. Max. memory is 16.1GB. [2022-11-20 12:42:47,232 INFO L158 Benchmark]: Witness Printer took 180.49ms. Allocated memory is still 371.2MB. Free memory was 269.9MB in the beginning and 244.7MB in the end (delta: 25.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-20 12:42:47,234 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 127.9MB. Free memory was 69.2MB in the beginning and 69.1MB in the end (delta: 117.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 945.14ms. Allocated memory is still 176.2MB. Free memory was 133.5MB in the beginning and 109.8MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.45ms. Allocated memory is still 176.2MB. Free memory was 109.8MB in the beginning and 107.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.63ms. Allocated memory is still 176.2MB. Free memory was 107.6MB in the beginning and 105.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1195.85ms. Allocated memory is still 176.2MB. Free memory was 105.6MB in the beginning and 130.9MB in the end (delta: -25.3MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. * TraceAbstraction took 14989.62ms. Allocated memory was 176.2MB in the beginning and 371.2MB in the end (delta: 195.0MB). Free memory was 129.8MB in the beginning and 269.9MB in the end (delta: -140.0MB). Peak memory consumption was 55.0MB. Max. memory is 16.1GB. * Witness Printer took 180.49ms. Allocated memory is still 371.2MB. Free memory was 269.9MB in the beginning and 244.7MB in the end (delta: 25.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L715] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L717] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L719] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L721] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L722] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L723] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L725] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L727] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L729] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L730] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L731] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L732] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L733] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L734] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L735] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L736] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0] [L737] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L738] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L739] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L740] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L741] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L742] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L743] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L744] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L745] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L747] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L853] 0 pthread_t t388; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t388={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] FCALL, FORK 0 pthread_create(&t388, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t388, ((void *)0), P0, ((void *)0))=-2, t388={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 pthread_t t389; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t388={5:0}, t389={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] FCALL, FORK 0 pthread_create(&t389, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t389, ((void *)0), P1, ((void *)0))=-1, t388={5:0}, t389={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] 0 pthread_t t390; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t388={5:0}, t389={6:0}, t390={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] FCALL, FORK 0 pthread_create(&t390, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t390, ((void *)0), P2, ((void *)0))=0, t388={5:0}, t389={6:0}, t390={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 z$w_buff1 = z$w_buff0 [L801] 3 z$w_buff0 = 1 [L802] 3 z$w_buff1_used = z$w_buff0_used [L803] 3 z$w_buff0_used = (_Bool)1 [L804] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L804] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L805] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 3 z$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 z$flush_delayed = weak$$choice2 [L815] 3 z$mem_tmp = z [L816] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L817] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L818] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L819] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L820] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L822] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 __unbuffered_p2_EAX = z [L824] 3 z = z$flush_delayed ? z$mem_tmp : z [L825] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L828] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 z$flush_delayed = weak$$choice2 [L778] 2 z$mem_tmp = z [L779] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L780] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L781] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L782] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L783] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L785] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EAX = z [L787] 2 z = z$flush_delayed ? z$mem_tmp : z [L788] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L831] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L832] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L833] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L834] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L835] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t388={5:0}, t389={6:0}, t390={3:0}, weak$$choice0=3, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L865] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L866] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L867] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L868] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t388={5:0}, t389={6:0}, t390={3:0}, weak$$choice0=3, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L871] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t388={5:0}, t389={6:0}, t390={3:0}, weak$$choice0=3, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L873] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - 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: 858]: 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: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 148 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.1s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 14.6s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 523 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 523 mSDsluCounter, 659 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 530 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1405 IncrementalHoareTripleChecker+Invalid, 1437 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 129 mSDtfsCounter, 1405 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 146 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=504occurred in iteration=7, InterpolantAutomatonStates: 108, 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.8s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 1041 NumberOfCodeBlocks, 1041 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 936 ConstructedInterpolants, 0 QuantifiedInterpolants, 5122 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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:42:47,270 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa2c3be-9f61-4aaf-9272-680cddca5df2/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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