./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix050.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd03f0f-9c46-4244-977f-2fefebfd1086/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd03f0f-9c46-4244-977f-2fefebfd1086/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd03f0f-9c46-4244-977f-2fefebfd1086/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd03f0f-9c46-4244-977f-2fefebfd1086/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix050.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd03f0f-9c46-4244-977f-2fefebfd1086/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd03f0f-9c46-4244-977f-2fefebfd1086/bin/uautomizer-Dbtcem3rbc --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 a3c87384db48703a1f350b065ac4130898667537456cdd449d5c78c22c9ba26d --- 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-5e519f3 [2022-11-02 21:05:11,087 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 21:05:11,090 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 21:05:11,122 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 21:05:11,122 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 21:05:11,124 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 21:05:11,125 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 21:05:11,128 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 21:05:11,130 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 21:05:11,131 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 21:05:11,132 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 21:05:11,133 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 21:05:11,134 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 21:05:11,135 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 21:05:11,137 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 21:05:11,138 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 21:05:11,139 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 21:05:11,141 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 21:05:11,143 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 21:05:11,147 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 21:05:11,154 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 21:05:11,158 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 21:05:11,159 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 21:05:11,160 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 21:05:11,164 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 21:05:11,165 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 21:05:11,165 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 21:05:11,166 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 21:05:11,167 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 21:05:11,168 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 21:05:11,169 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 21:05:11,170 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 21:05:11,171 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 21:05:11,172 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 21:05:11,173 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 21:05:11,173 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 21:05:11,174 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 21:05:11,175 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 21:05:11,175 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 21:05:11,176 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 21:05:11,177 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 21:05:11,178 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd03f0f-9c46-4244-977f-2fefebfd1086/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 21:05:11,202 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 21:05:11,202 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 21:05:11,203 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 21:05:11,203 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 21:05:11,204 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 21:05:11,204 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 21:05:11,205 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 21:05:11,205 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 21:05:11,205 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 21:05:11,206 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 21:05:11,206 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 21:05:11,206 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 21:05:11,206 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 21:05:11,207 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 21:05:11,207 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 21:05:11,207 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 21:05:11,207 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 21:05:11,208 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 21:05:11,208 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 21:05:11,208 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 21:05:11,208 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 21:05:11,209 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 21:05:11,209 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 21:05:11,209 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 21:05:11,209 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:05:11,210 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 21:05:11,210 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 21:05:11,210 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 21:05:11,211 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 21:05:11,211 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 21:05:11,211 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 21:05:11,211 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 21:05:11,212 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 21:05:11,212 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_4dd03f0f-9c46-4244-977f-2fefebfd1086/bin/uautomizer-Dbtcem3rbc/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_4dd03f0f-9c46-4244-977f-2fefebfd1086/bin/uautomizer-Dbtcem3rbc 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 -> a3c87384db48703a1f350b065ac4130898667537456cdd449d5c78c22c9ba26d [2022-11-02 21:05:11,562 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 21:05:11,603 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 21:05:11,607 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 21:05:11,609 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 21:05:11,610 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 21:05:11,611 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd03f0f-9c46-4244-977f-2fefebfd1086/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/pthread-wmm/mix050.i [2022-11-02 21:05:11,701 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd03f0f-9c46-4244-977f-2fefebfd1086/bin/uautomizer-Dbtcem3rbc/data/71a825a61/86292443bb6c4dea8c244a849e8b95b6/FLAGcd9295f2e [2022-11-02 21:05:12,449 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 21:05:12,450 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd03f0f-9c46-4244-977f-2fefebfd1086/sv-benchmarks/c/pthread-wmm/mix050.i [2022-11-02 21:05:12,473 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd03f0f-9c46-4244-977f-2fefebfd1086/bin/uautomizer-Dbtcem3rbc/data/71a825a61/86292443bb6c4dea8c244a849e8b95b6/FLAGcd9295f2e [2022-11-02 21:05:12,487 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd03f0f-9c46-4244-977f-2fefebfd1086/bin/uautomizer-Dbtcem3rbc/data/71a825a61/86292443bb6c4dea8c244a849e8b95b6 [2022-11-02 21:05:12,490 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 21:05:12,492 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 21:05:12,494 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 21:05:12,494 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 21:05:12,498 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 21:05:12,499 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:05:12" (1/1) ... [2022-11-02 21:05:12,500 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77d92ece and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:12, skipping insertion in model container [2022-11-02 21:05:12,500 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:05:12" (1/1) ... [2022-11-02 21:05:12,509 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 21:05:12,553 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 21:05:12,776 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd03f0f-9c46-4244-977f-2fefebfd1086/sv-benchmarks/c/pthread-wmm/mix050.i[940,953] [2022-11-02 21:05:13,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:05:13,149 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 21:05:13,164 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd03f0f-9c46-4244-977f-2fefebfd1086/sv-benchmarks/c/pthread-wmm/mix050.i[940,953] [2022-11-02 21:05:13,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:05:13,283 INFO L208 MainTranslator]: Completed translation [2022-11-02 21:05:13,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:13 WrapperNode [2022-11-02 21:05:13,284 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 21:05:13,285 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 21:05:13,285 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 21:05:13,285 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 21:05:13,293 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:13" (1/1) ... [2022-11-02 21:05:13,334 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:13" (1/1) ... [2022-11-02 21:05:13,377 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 193 [2022-11-02 21:05:13,377 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 21:05:13,378 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 21:05:13,378 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 21:05:13,378 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 21:05:13,393 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:13" (1/1) ... [2022-11-02 21:05:13,393 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:13" (1/1) ... [2022-11-02 21:05:13,407 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:13" (1/1) ... [2022-11-02 21:05:13,408 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:13" (1/1) ... [2022-11-02 21:05:13,416 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:13" (1/1) ... [2022-11-02 21:05:13,436 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:13" (1/1) ... [2022-11-02 21:05:13,439 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:13" (1/1) ... [2022-11-02 21:05:13,453 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:13" (1/1) ... [2022-11-02 21:05:13,457 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 21:05:13,458 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 21:05:13,458 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 21:05:13,458 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 21:05:13,463 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:13" (1/1) ... [2022-11-02 21:05:13,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:05:13,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd03f0f-9c46-4244-977f-2fefebfd1086/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:05:13,498 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd03f0f-9c46-4244-977f-2fefebfd1086/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 21:05:13,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd03f0f-9c46-4244-977f-2fefebfd1086/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 21:05:13,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 21:05:13,560 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-02 21:05:13,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 21:05:13,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 21:05:13,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 21:05:13,561 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-02 21:05:13,561 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-02 21:05:13,561 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-02 21:05:13,562 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-02 21:05:13,562 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-02 21:05:13,563 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-02 21:05:13,563 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-02 21:05:13,563 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-02 21:05:13,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 21:05:13,563 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-02 21:05:13,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 21:05:13,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 21:05:13,567 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-02 21:05:13,787 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 21:05:13,790 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 21:05:14,595 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 21:05:15,196 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 21:05:15,197 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 21:05:15,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:05:15 BoogieIcfgContainer [2022-11-02 21:05:15,200 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 21:05:15,205 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 21:05:15,206 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 21:05:15,211 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 21:05:15,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 09:05:12" (1/3) ... [2022-11-02 21:05:15,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@662bf509 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:05:15, skipping insertion in model container [2022-11-02 21:05:15,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:13" (2/3) ... [2022-11-02 21:05:15,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@662bf509 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:05:15, skipping insertion in model container [2022-11-02 21:05:15,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:05:15" (3/3) ... [2022-11-02 21:05:15,215 INFO L112 eAbstractionObserver]: Analyzing ICFG mix050.i [2022-11-02 21:05:15,226 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 21:05:15,239 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 21:05:15,240 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-02 21:05:15,240 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 21:05:15,362 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-02 21:05:15,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 137 transitions, 294 flow [2022-11-02 21:05:15,487 INFO L130 PetriNetUnfolder]: 2/133 cut-off events. [2022-11-02 21:05:15,488 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 21:05:15,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 133 events. 2/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2022-11-02 21:05:15,493 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 137 transitions, 294 flow [2022-11-02 21:05:15,498 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 133 transitions, 278 flow [2022-11-02 21:05:15,517 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 21:05:15,527 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;@32fb6d52, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 21:05:15,527 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-02 21:05:15,549 INFO L130 PetriNetUnfolder]: 0/50 cut-off events. [2022-11-02 21:05:15,549 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 21:05:15,549 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:05:15,550 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:15,550 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 21:05:15,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:15,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1663018398, now seen corresponding path program 1 times [2022-11-02 21:05:15,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:15,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253281193] [2022-11-02 21:05:15,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:15,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:15,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:16,274 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-02 21:05:16,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:16,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253281193] [2022-11-02 21:05:16,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253281193] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:05:16,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:05:16,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:05:16,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424794079] [2022-11-02 21:05:16,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:05:16,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:05:16,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:16,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:05:16,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:05:16,327 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 137 [2022-11-02 21:05:16,330 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 133 transitions, 278 flow. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:16,331 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:05:16,331 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 137 [2022-11-02 21:05:16,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:05:16,791 INFO L130 PetriNetUnfolder]: 162/619 cut-off events. [2022-11-02 21:05:16,791 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-11-02 21:05:16,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 925 conditions, 619 events. 162/619 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3393 event pairs, 132 based on Foata normal form. 36/611 useless extension candidates. Maximal degree in co-relation 867. Up to 191 conditions per place. [2022-11-02 21:05:16,805 INFO L137 encePairwiseOnDemand]: 132/137 looper letters, 18 selfloop transitions, 2 changer transitions 0/137 dead transitions. [2022-11-02 21:05:16,805 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 137 transitions, 335 flow [2022-11-02 21:05:16,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:05:16,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:05:16,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2022-11-02 21:05:16,824 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9440389294403893 [2022-11-02 21:05:16,825 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 388 transitions. [2022-11-02 21:05:16,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions. [2022-11-02 21:05:16,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:05:16,834 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions. [2022-11-02 21:05:16,839 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:16,853 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:16,853 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:16,855 INFO L175 Difference]: Start difference. First operand has 144 places, 133 transitions, 278 flow. Second operand 3 states and 388 transitions. [2022-11-02 21:05:16,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 137 transitions, 335 flow [2022-11-02 21:05:16,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 137 transitions, 328 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 21:05:16,872 INFO L231 Difference]: Finished difference. Result has 140 places, 129 transitions, 270 flow [2022-11-02 21:05:16,875 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=270, PETRI_PLACES=140, PETRI_TRANSITIONS=129} [2022-11-02 21:05:16,882 INFO L287 CegarLoopForPetriNet]: 144 programPoint places, -4 predicate places. [2022-11-02 21:05:16,882 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 129 transitions, 270 flow [2022-11-02 21:05:16,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:16,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:05:16,883 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:16,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 21:05:16,884 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 21:05:16,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:16,885 INFO L85 PathProgramCache]: Analyzing trace with hash -280758603, now seen corresponding path program 1 times [2022-11-02 21:05:16,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:16,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879258834] [2022-11-02 21:05:16,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:16,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:17,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:17,576 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-02 21:05:17,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:17,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879258834] [2022-11-02 21:05:17,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879258834] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:05:17,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:05:17,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:05:17,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937376115] [2022-11-02 21:05:17,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:05:17,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:05:17,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:17,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:05:17,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:05:17,592 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 137 [2022-11-02 21:05:17,594 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 129 transitions, 270 flow. Second operand has 6 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:17,594 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:05:17,594 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 137 [2022-11-02 21:05:17,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:05:20,681 INFO L130 PetriNetUnfolder]: 4140/8971 cut-off events. [2022-11-02 21:05:20,681 INFO L131 PetriNetUnfolder]: For 397/397 co-relation queries the response was YES. [2022-11-02 21:05:20,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15292 conditions, 8971 events. 4140/8971 cut-off events. For 397/397 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 76740 event pairs, 187 based on Foata normal form. 0/8736 useless extension candidates. Maximal degree in co-relation 15235. Up to 2233 conditions per place. [2022-11-02 21:05:20,761 INFO L137 encePairwiseOnDemand]: 126/137 looper letters, 38 selfloop transitions, 7 changer transitions 60/211 dead transitions. [2022-11-02 21:05:20,762 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 211 transitions, 664 flow [2022-11-02 21:05:20,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 21:05:20,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-02 21:05:20,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1207 transitions. [2022-11-02 21:05:20,769 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.881021897810219 [2022-11-02 21:05:20,769 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1207 transitions. [2022-11-02 21:05:20,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1207 transitions. [2022-11-02 21:05:20,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:05:20,770 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1207 transitions. [2022-11-02 21:05:20,775 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 120.7) internal successors, (1207), 10 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-02 21:05:20,779 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 137.0) internal successors, (1507), 11 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:20,781 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 137.0) internal successors, (1507), 11 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:20,781 INFO L175 Difference]: Start difference. First operand has 140 places, 129 transitions, 270 flow. Second operand 10 states and 1207 transitions. [2022-11-02 21:05:20,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 211 transitions, 664 flow [2022-11-02 21:05:20,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 211 transitions, 646 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 21:05:20,793 INFO L231 Difference]: Finished difference. Result has 153 places, 132 transitions, 332 flow [2022-11-02 21:05:20,793 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=332, PETRI_PLACES=153, PETRI_TRANSITIONS=132} [2022-11-02 21:05:20,794 INFO L287 CegarLoopForPetriNet]: 144 programPoint places, 9 predicate places. [2022-11-02 21:05:20,794 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 132 transitions, 332 flow [2022-11-02 21:05:20,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:20,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:05:20,796 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:20,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 21:05:20,796 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 21:05:20,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:20,797 INFO L85 PathProgramCache]: Analyzing trace with hash -857977470, now seen corresponding path program 1 times [2022-11-02 21:05:20,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:20,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397218798] [2022-11-02 21:05:20,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:20,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:20,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:21,375 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-02 21:05:21,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:21,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397218798] [2022-11-02 21:05:21,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397218798] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:05:21,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:05:21,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 21:05:21,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251172587] [2022-11-02 21:05:21,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:05:21,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:05:21,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:21,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:05:21,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:05:21,385 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 137 [2022-11-02 21:05:21,387 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 132 transitions, 332 flow. Second operand has 7 states, 7 states have (on average 112.14285714285714) internal successors, (785), 7 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:21,388 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:05:21,388 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 137 [2022-11-02 21:05:21,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:05:23,155 INFO L130 PetriNetUnfolder]: 1872/4505 cut-off events. [2022-11-02 21:05:23,156 INFO L131 PetriNetUnfolder]: For 3694/3742 co-relation queries the response was YES. [2022-11-02 21:05:23,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10801 conditions, 4505 events. 1872/4505 cut-off events. For 3694/3742 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 35516 event pairs, 80 based on Foata normal form. 108/4544 useless extension candidates. Maximal degree in co-relation 10737. Up to 1002 conditions per place. [2022-11-02 21:05:23,195 INFO L137 encePairwiseOnDemand]: 127/137 looper letters, 46 selfloop transitions, 11 changer transitions 47/210 dead transitions. [2022-11-02 21:05:23,195 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 210 transitions, 869 flow [2022-11-02 21:05:23,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 21:05:23,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-02 21:05:23,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1206 transitions. [2022-11-02 21:05:23,200 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8802919708029197 [2022-11-02 21:05:23,201 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1206 transitions. [2022-11-02 21:05:23,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1206 transitions. [2022-11-02 21:05:23,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:05:23,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1206 transitions. [2022-11-02 21:05:23,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 120.6) internal successors, (1206), 10 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:23,208 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 137.0) internal successors, (1507), 11 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:23,210 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 137.0) internal successors, (1507), 11 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:23,210 INFO L175 Difference]: Start difference. First operand has 153 places, 132 transitions, 332 flow. Second operand 10 states and 1206 transitions. [2022-11-02 21:05:23,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 210 transitions, 869 flow [2022-11-02 21:05:23,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 210 transitions, 844 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-11-02 21:05:23,243 INFO L231 Difference]: Finished difference. Result has 157 places, 136 transitions, 420 flow [2022-11-02 21:05:23,243 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=420, PETRI_PLACES=157, PETRI_TRANSITIONS=136} [2022-11-02 21:05:23,246 INFO L287 CegarLoopForPetriNet]: 144 programPoint places, 13 predicate places. [2022-11-02 21:05:23,246 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 136 transitions, 420 flow [2022-11-02 21:05:23,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.14285714285714) internal successors, (785), 7 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:23,248 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:05:23,248 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:23,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 21:05:23,249 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 21:05:23,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:23,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1098840201, now seen corresponding path program 1 times [2022-11-02 21:05:23,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:23,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264853108] [2022-11-02 21:05:23,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:23,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:23,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:23,718 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-02 21:05:23,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:23,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264853108] [2022-11-02 21:05:23,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264853108] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:05:23,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:05:23,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:05:23,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974710109] [2022-11-02 21:05:23,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:05:23,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 21:05:23,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:23,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 21:05:23,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:05:23,723 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 137 [2022-11-02 21:05:23,725 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 136 transitions, 420 flow. Second operand has 8 states, 8 states have (on average 112.125) internal successors, (897), 8 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-02 21:05:23,725 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:05:23,725 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 137 [2022-11-02 21:05:23,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:05:24,865 INFO L130 PetriNetUnfolder]: 745/1914 cut-off events. [2022-11-02 21:05:24,866 INFO L131 PetriNetUnfolder]: For 3983/3995 co-relation queries the response was YES. [2022-11-02 21:05:24,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5597 conditions, 1914 events. 745/1914 cut-off events. For 3983/3995 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 12731 event pairs, 78 based on Foata normal form. 48/1933 useless extension candidates. Maximal degree in co-relation 5529. Up to 429 conditions per place. [2022-11-02 21:05:24,889 INFO L137 encePairwiseOnDemand]: 127/137 looper letters, 53 selfloop transitions, 15 changer transitions 47/221 dead transitions. [2022-11-02 21:05:24,890 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 221 transitions, 1148 flow [2022-11-02 21:05:24,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 21:05:24,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-02 21:05:24,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1327 transitions. [2022-11-02 21:05:24,896 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.880557398805574 [2022-11-02 21:05:24,897 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1327 transitions. [2022-11-02 21:05:24,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1327 transitions. [2022-11-02 21:05:24,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:05:24,904 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1327 transitions. [2022-11-02 21:05:24,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 120.63636363636364) internal successors, (1327), 11 states have internal predecessors, (1327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:24,914 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 137.0) internal successors, (1644), 12 states have internal predecessors, (1644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:24,915 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 137.0) internal successors, (1644), 12 states have internal predecessors, (1644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:24,916 INFO L175 Difference]: Start difference. First operand has 157 places, 136 transitions, 420 flow. Second operand 11 states and 1327 transitions. [2022-11-02 21:05:24,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 221 transitions, 1148 flow [2022-11-02 21:05:24,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 221 transitions, 968 flow, removed 79 selfloop flow, removed 9 redundant places. [2022-11-02 21:05:24,962 INFO L231 Difference]: Finished difference. Result has 160 places, 140 transitions, 470 flow [2022-11-02 21:05:24,963 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=470, PETRI_PLACES=160, PETRI_TRANSITIONS=140} [2022-11-02 21:05:24,964 INFO L287 CegarLoopForPetriNet]: 144 programPoint places, 16 predicate places. [2022-11-02 21:05:24,964 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 140 transitions, 470 flow [2022-11-02 21:05:24,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 112.125) internal successors, (897), 8 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-02 21:05:24,965 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:05:24,965 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:24,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 21:05:24,966 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 21:05:24,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:24,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1421548067, now seen corresponding path program 1 times [2022-11-02 21:05:24,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:24,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669531273] [2022-11-02 21:05:24,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:24,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:25,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:25,449 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-02 21:05:25,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:25,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669531273] [2022-11-02 21:05:25,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669531273] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:05:25,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:05:25,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 21:05:25,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89723957] [2022-11-02 21:05:25,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:05:25,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:05:25,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:25,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:05:25,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:05:25,454 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 137 [2022-11-02 21:05:25,455 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 140 transitions, 470 flow. Second operand has 7 states, 7 states have (on average 109.42857142857143) internal successors, (766), 7 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:25,456 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:05:25,456 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 137 [2022-11-02 21:05:25,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:05:26,900 INFO L130 PetriNetUnfolder]: 865/2971 cut-off events. [2022-11-02 21:05:26,901 INFO L131 PetriNetUnfolder]: For 3452/3780 co-relation queries the response was YES. [2022-11-02 21:05:26,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6491 conditions, 2971 events. 865/2971 cut-off events. For 3452/3780 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 23772 event pairs, 184 based on Foata normal form. 78/2947 useless extension candidates. Maximal degree in co-relation 6418. Up to 646 conditions per place. [2022-11-02 21:05:26,944 INFO L137 encePairwiseOnDemand]: 128/137 looper letters, 51 selfloop transitions, 5 changer transitions 43/212 dead transitions. [2022-11-02 21:05:26,944 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 212 transitions, 816 flow [2022-11-02 21:05:26,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 21:05:26,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-02 21:05:26,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1161 transitions. [2022-11-02 21:05:26,948 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8474452554744526 [2022-11-02 21:05:26,949 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1161 transitions. [2022-11-02 21:05:26,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1161 transitions. [2022-11-02 21:05:26,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:05:26,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1161 transitions. [2022-11-02 21:05:26,953 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 116.1) internal successors, (1161), 10 states have internal predecessors, (1161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:26,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 137.0) internal successors, (1507), 11 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:26,957 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 137.0) internal successors, (1507), 11 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:26,957 INFO L175 Difference]: Start difference. First operand has 160 places, 140 transitions, 470 flow. Second operand 10 states and 1161 transitions. [2022-11-02 21:05:26,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 212 transitions, 816 flow [2022-11-02 21:05:26,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 212 transitions, 731 flow, removed 29 selfloop flow, removed 10 redundant places. [2022-11-02 21:05:26,996 INFO L231 Difference]: Finished difference. Result has 163 places, 144 transitions, 452 flow [2022-11-02 21:05:26,996 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=452, PETRI_PLACES=163, PETRI_TRANSITIONS=144} [2022-11-02 21:05:26,997 INFO L287 CegarLoopForPetriNet]: 144 programPoint places, 19 predicate places. [2022-11-02 21:05:26,997 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 144 transitions, 452 flow [2022-11-02 21:05:26,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 109.42857142857143) internal successors, (766), 7 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:26,998 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:05:26,998 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:26,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 21:05:26,999 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 21:05:27,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:27,000 INFO L85 PathProgramCache]: Analyzing trace with hash -2132201443, now seen corresponding path program 2 times [2022-11-02 21:05:27,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:27,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984126787] [2022-11-02 21:05:27,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:27,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:27,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:27,418 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-02 21:05:27,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:27,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984126787] [2022-11-02 21:05:27,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984126787] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:05:27,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:05:27,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 21:05:27,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918353779] [2022-11-02 21:05:27,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:05:27,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 21:05:27,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:27,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 21:05:27,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:05:27,422 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 137 [2022-11-02 21:05:27,424 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 144 transitions, 452 flow. Second operand has 9 states, 9 states have (on average 112.11111111111111) internal successors, (1009), 9 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:27,424 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:05:27,424 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 137 [2022-11-02 21:05:27,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:05:28,652 INFO L130 PetriNetUnfolder]: 1223/2870 cut-off events. [2022-11-02 21:05:28,652 INFO L131 PetriNetUnfolder]: For 3057/3285 co-relation queries the response was YES. [2022-11-02 21:05:28,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7416 conditions, 2870 events. 1223/2870 cut-off events. For 3057/3285 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 21992 event pairs, 302 based on Foata normal form. 27/2720 useless extension candidates. Maximal degree in co-relation 7396. Up to 723 conditions per place. [2022-11-02 21:05:28,691 INFO L137 encePairwiseOnDemand]: 127/137 looper letters, 47 selfloop transitions, 21 changer transitions 37/200 dead transitions. [2022-11-02 21:05:28,692 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 200 transitions, 915 flow [2022-11-02 21:05:28,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 21:05:28,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-02 21:05:28,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1407 transitions. [2022-11-02 21:05:28,700 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8558394160583942 [2022-11-02 21:05:28,700 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1407 transitions. [2022-11-02 21:05:28,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1407 transitions. [2022-11-02 21:05:28,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:05:28,702 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1407 transitions. [2022-11-02 21:05:28,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 117.25) internal successors, (1407), 12 states have internal predecessors, (1407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:28,710 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 137.0) internal successors, (1781), 13 states have internal predecessors, (1781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:28,711 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 137.0) internal successors, (1781), 13 states have internal predecessors, (1781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:28,711 INFO L175 Difference]: Start difference. First operand has 163 places, 144 transitions, 452 flow. Second operand 12 states and 1407 transitions. [2022-11-02 21:05:28,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 200 transitions, 915 flow [2022-11-02 21:05:28,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 200 transitions, 878 flow, removed 18 selfloop flow, removed 4 redundant places. [2022-11-02 21:05:28,741 INFO L231 Difference]: Finished difference. Result has 170 places, 133 transitions, 491 flow [2022-11-02 21:05:28,741 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=491, PETRI_PLACES=170, PETRI_TRANSITIONS=133} [2022-11-02 21:05:28,742 INFO L287 CegarLoopForPetriNet]: 144 programPoint places, 26 predicate places. [2022-11-02 21:05:28,742 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 133 transitions, 491 flow [2022-11-02 21:05:28,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 112.11111111111111) internal successors, (1009), 9 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:28,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:05:28,743 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:28,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 21:05:28,744 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 21:05:28,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:28,745 INFO L85 PathProgramCache]: Analyzing trace with hash -788958388, now seen corresponding path program 1 times [2022-11-02 21:05:28,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:28,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276305169] [2022-11-02 21:05:28,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:28,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:28,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:29,262 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-02 21:05:29,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:29,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276305169] [2022-11-02 21:05:29,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276305169] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:05:29,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:05:29,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 21:05:29,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566168115] [2022-11-02 21:05:29,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:05:29,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:05:29,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:29,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:05:29,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:05:29,267 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 137 [2022-11-02 21:05:29,268 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 133 transitions, 491 flow. Second operand has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:29,269 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:05:29,269 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 137 [2022-11-02 21:05:29,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:05:30,188 INFO L130 PetriNetUnfolder]: 844/2716 cut-off events. [2022-11-02 21:05:30,189 INFO L131 PetriNetUnfolder]: For 3756/4064 co-relation queries the response was YES. [2022-11-02 21:05:30,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7182 conditions, 2716 events. 844/2716 cut-off events. For 3756/4064 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 24169 event pairs, 162 based on Foata normal form. 9/2574 useless extension candidates. Maximal degree in co-relation 7112. Up to 388 conditions per place. [2022-11-02 21:05:30,231 INFO L137 encePairwiseOnDemand]: 131/137 looper letters, 33 selfloop transitions, 3 changer transitions 5/151 dead transitions. [2022-11-02 21:05:30,231 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 151 transitions, 635 flow [2022-11-02 21:05:30,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:05:30,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-02 21:05:30,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 815 transitions. [2022-11-02 21:05:30,235 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8498435870698644 [2022-11-02 21:05:30,235 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 815 transitions. [2022-11-02 21:05:30,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 815 transitions. [2022-11-02 21:05:30,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:05:30,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 815 transitions. [2022-11-02 21:05:30,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 116.42857142857143) internal successors, (815), 7 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:30,242 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 137.0) internal successors, (1096), 8 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:30,243 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 137.0) internal successors, (1096), 8 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:30,243 INFO L175 Difference]: Start difference. First operand has 170 places, 133 transitions, 491 flow. Second operand 7 states and 815 transitions. [2022-11-02 21:05:30,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 151 transitions, 635 flow [2022-11-02 21:05:30,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 151 transitions, 532 flow, removed 39 selfloop flow, removed 12 redundant places. [2022-11-02 21:05:30,297 INFO L231 Difference]: Finished difference. Result has 153 places, 135 transitions, 433 flow [2022-11-02 21:05:30,298 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=433, PETRI_PLACES=153, PETRI_TRANSITIONS=135} [2022-11-02 21:05:30,299 INFO L287 CegarLoopForPetriNet]: 144 programPoint places, 9 predicate places. [2022-11-02 21:05:30,299 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 135 transitions, 433 flow [2022-11-02 21:05:30,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:30,300 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:05:30,300 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:30,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 21:05:30,301 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 21:05:30,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:30,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1103212264, now seen corresponding path program 2 times [2022-11-02 21:05:30,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:30,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276224540] [2022-11-02 21:05:30,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:30,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:30,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:32,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-02 21:05:32,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:32,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276224540] [2022-11-02 21:05:32,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276224540] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:05:32,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:05:32,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 21:05:32,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119858068] [2022-11-02 21:05:32,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:05:32,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 21:05:32,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:32,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 21:05:32,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-02 21:05:32,464 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 137 [2022-11-02 21:05:32,467 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 135 transitions, 433 flow. Second operand has 12 states, 12 states have (on average 102.66666666666667) internal successors, (1232), 12 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:32,467 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:05:32,467 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 137 [2022-11-02 21:05:32,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:05:34,305 INFO L130 PetriNetUnfolder]: 1480/5018 cut-off events. [2022-11-02 21:05:34,306 INFO L131 PetriNetUnfolder]: For 3138/3211 co-relation queries the response was YES. [2022-11-02 21:05:34,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11286 conditions, 5018 events. 1480/5018 cut-off events. For 3138/3211 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 52828 event pairs, 304 based on Foata normal form. 9/4859 useless extension candidates. Maximal degree in co-relation 11265. Up to 730 conditions per place. [2022-11-02 21:05:34,378 INFO L137 encePairwiseOnDemand]: 124/137 looper letters, 47 selfloop transitions, 9 changer transitions 30/183 dead transitions. [2022-11-02 21:05:34,378 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 183 transitions, 823 flow [2022-11-02 21:05:34,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 21:05:34,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-02 21:05:34,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1168 transitions. [2022-11-02 21:05:34,383 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7750497677504977 [2022-11-02 21:05:34,384 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1168 transitions. [2022-11-02 21:05:34,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1168 transitions. [2022-11-02 21:05:34,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:05:34,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1168 transitions. [2022-11-02 21:05:34,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 106.18181818181819) internal successors, (1168), 11 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:34,394 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 137.0) internal successors, (1644), 12 states have internal predecessors, (1644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:34,395 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 137.0) internal successors, (1644), 12 states have internal predecessors, (1644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:34,395 INFO L175 Difference]: Start difference. First operand has 153 places, 135 transitions, 433 flow. Second operand 11 states and 1168 transitions. [2022-11-02 21:05:34,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 183 transitions, 823 flow [2022-11-02 21:05:34,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 183 transitions, 785 flow, removed 8 selfloop flow, removed 7 redundant places. [2022-11-02 21:05:34,562 INFO L231 Difference]: Finished difference. Result has 160 places, 139 transitions, 455 flow [2022-11-02 21:05:34,563 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=455, PETRI_PLACES=160, PETRI_TRANSITIONS=139} [2022-11-02 21:05:34,564 INFO L287 CegarLoopForPetriNet]: 144 programPoint places, 16 predicate places. [2022-11-02 21:05:34,564 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 139 transitions, 455 flow [2022-11-02 21:05:34,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 102.66666666666667) internal successors, (1232), 12 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:34,565 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:05:34,566 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:34,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 21:05:34,566 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 21:05:34,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:34,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1669482116, now seen corresponding path program 3 times [2022-11-02 21:05:34,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:34,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642874491] [2022-11-02 21:05:34,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:34,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:34,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:35,083 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-02 21:05:35,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:35,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642874491] [2022-11-02 21:05:35,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642874491] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:05:35,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:05:35,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 21:05:35,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737505076] [2022-11-02 21:05:35,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:05:35,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:05:35,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:35,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:05:35,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:05:35,088 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 137 [2022-11-02 21:05:35,089 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 139 transitions, 455 flow. Second operand has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:35,090 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:05:35,090 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 137 [2022-11-02 21:05:35,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:05:36,251 INFO L130 PetriNetUnfolder]: 1053/4035 cut-off events. [2022-11-02 21:05:36,252 INFO L131 PetriNetUnfolder]: For 2040/2137 co-relation queries the response was YES. [2022-11-02 21:05:36,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8402 conditions, 4035 events. 1053/4035 cut-off events. For 2040/2137 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 41849 event pairs, 164 based on Foata normal form. 15/3881 useless extension candidates. Maximal degree in co-relation 8380. Up to 536 conditions per place. [2022-11-02 21:05:36,301 INFO L137 encePairwiseOnDemand]: 131/137 looper letters, 26 selfloop transitions, 1 changer transitions 31/168 dead transitions. [2022-11-02 21:05:36,301 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 168 transitions, 708 flow [2022-11-02 21:05:36,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:05:36,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-02 21:05:36,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 819 transitions. [2022-11-02 21:05:36,304 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8540145985401459 [2022-11-02 21:05:36,305 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 819 transitions. [2022-11-02 21:05:36,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 819 transitions. [2022-11-02 21:05:36,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:05:36,306 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 819 transitions. [2022-11-02 21:05:36,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.0) internal successors, (819), 7 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:36,311 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 137.0) internal successors, (1096), 8 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:36,312 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 137.0) internal successors, (1096), 8 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:36,312 INFO L175 Difference]: Start difference. First operand has 160 places, 139 transitions, 455 flow. Second operand 7 states and 819 transitions. [2022-11-02 21:05:36,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 168 transitions, 708 flow [2022-11-02 21:05:36,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 168 transitions, 679 flow, removed 13 selfloop flow, removed 8 redundant places. [2022-11-02 21:05:36,357 INFO L231 Difference]: Finished difference. Result has 157 places, 133 transitions, 408 flow [2022-11-02 21:05:36,358 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=408, PETRI_PLACES=157, PETRI_TRANSITIONS=133} [2022-11-02 21:05:36,360 INFO L287 CegarLoopForPetriNet]: 144 programPoint places, 13 predicate places. [2022-11-02 21:05:36,361 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 133 transitions, 408 flow [2022-11-02 21:05:36,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:36,362 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:05:36,362 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:36,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 21:05:36,362 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 21:05:36,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:36,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1666035706, now seen corresponding path program 4 times [2022-11-02 21:05:36,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:36,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468803162] [2022-11-02 21:05:36,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:36,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:36,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:05:36,450 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 21:05:36,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:05:36,614 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 21:05:36,614 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 21:05:36,616 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-11-02 21:05:36,618 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-02 21:05:36,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-11-02 21:05:36,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-11-02 21:05:36,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-11-02 21:05:36,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-11-02 21:05:36,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-02 21:05:36,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 21:05:36,626 INFO L444 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1] [2022-11-02 21:05:36,634 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-02 21:05:36,634 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 21:05:36,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 09:05:36 BasicIcfg [2022-11-02 21:05:36,859 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 21:05:36,860 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 21:05:36,860 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 21:05:36,860 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 21:05:36,861 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:05:15" (3/4) ... [2022-11-02 21:05:36,863 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-02 21:05:37,076 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd03f0f-9c46-4244-977f-2fefebfd1086/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 21:05:37,077 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 21:05:37,077 INFO L158 Benchmark]: Toolchain (without parser) took 24585.57ms. Allocated memory was 104.9MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 68.2MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 390.0MB. Max. memory is 16.1GB. [2022-11-02 21:05:37,078 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 79.7MB. Free memory was 52.4MB in the beginning and 52.4MB in the end (delta: 21.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 21:05:37,078 INFO L158 Benchmark]: CACSL2BoogieTranslator took 790.51ms. Allocated memory is still 104.9MB. Free memory was 68.0MB in the beginning and 65.7MB in the end (delta: 2.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-02 21:05:37,079 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.60ms. Allocated memory is still 104.9MB. Free memory was 65.2MB in the beginning and 62.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 21:05:37,079 INFO L158 Benchmark]: Boogie Preprocessor took 78.98ms. Allocated memory is still 104.9MB. Free memory was 62.6MB in the beginning and 60.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 21:05:37,080 INFO L158 Benchmark]: RCFGBuilder took 1742.71ms. Allocated memory was 104.9MB in the beginning and 130.0MB in the end (delta: 25.2MB). Free memory was 60.0MB in the beginning and 88.8MB in the end (delta: -28.8MB). Peak memory consumption was 34.6MB. Max. memory is 16.1GB. [2022-11-02 21:05:37,080 INFO L158 Benchmark]: TraceAbstraction took 21653.43ms. Allocated memory was 130.0MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 87.9MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 332.8MB. Max. memory is 16.1GB. [2022-11-02 21:05:37,081 INFO L158 Benchmark]: Witness Printer took 217.15ms. Allocated memory is still 1.6GB. Free memory was 1.2GB in the beginning and 1.1GB in the end (delta: 52.4MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2022-11-02 21:05:37,084 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.30ms. Allocated memory is still 79.7MB. Free memory was 52.4MB in the beginning and 52.4MB in the end (delta: 21.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 790.51ms. Allocated memory is still 104.9MB. Free memory was 68.0MB in the beginning and 65.7MB in the end (delta: 2.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.60ms. Allocated memory is still 104.9MB. Free memory was 65.2MB in the beginning and 62.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.98ms. Allocated memory is still 104.9MB. Free memory was 62.6MB in the beginning and 60.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1742.71ms. Allocated memory was 104.9MB in the beginning and 130.0MB in the end (delta: 25.2MB). Free memory was 60.0MB in the beginning and 88.8MB in the end (delta: -28.8MB). Peak memory consumption was 34.6MB. Max. memory is 16.1GB. * TraceAbstraction took 21653.43ms. Allocated memory was 130.0MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 87.9MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 332.8MB. Max. memory is 16.1GB. * Witness Printer took 217.15ms. Allocated memory is still 1.6GB. Free memory was 1.2GB in the beginning and 1.1GB in the end (delta: 52.4MB). Peak memory consumption was 52.4MB. 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: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L716] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L718] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0] [L720] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0] [L721] 0 _Bool a$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0] [L722] 0 int a$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0] [L723] 0 _Bool a$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0] [L724] 0 _Bool a$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0] [L725] 0 _Bool a$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0] [L726] 0 _Bool a$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0] [L727] 0 _Bool a$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0] [L728] 0 _Bool a$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0] [L729] 0 _Bool a$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0] [L730] 0 _Bool a$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0] [L731] 0 _Bool a$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0] [L732] 0 _Bool a$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0] [L733] 0 _Bool a$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0] [L734] 0 int *a$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}] [L735] 0 int a$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0] [L736] 0 _Bool a$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0] [L737] 0 int a$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0] [L738] 0 _Bool a$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0] [L739] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0] [L740] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0] [L742] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L744] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L746] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L747] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0] [L748] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L863] 0 pthread_t t1321; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t1321={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L864] FCALL, FORK 0 pthread_create(&t1321, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1321, ((void *)0), P0, ((void *)0))=-3, t1321={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L865] 0 pthread_t t1322; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t1321={5:0}, t1322={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L866] FCALL, FORK 0 pthread_create(&t1322, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1322, ((void *)0), P1, ((void *)0))=-2, t1321={5:0}, t1322={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L867] 0 pthread_t t1323; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1321={5:0}, t1322={6:0}, t1323={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L868] FCALL, FORK 0 pthread_create(&t1323, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1323, ((void *)0), P2, ((void *)0))=-1, t1321={5:0}, t1322={6:0}, t1323={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L869] 0 pthread_t t1324; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1321={5:0}, t1322={6:0}, t1323={7:0}, t1324={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L870] FCALL, FORK 0 pthread_create(&t1324, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1324, ((void *)0), P3, ((void *)0))=0, t1321={5:0}, t1322={6:0}, t1323={7:0}, t1324={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L782] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L802] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L805] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L822] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L825] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L826] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L827] 4 a$flush_delayed = weak$$choice2 [L828] 4 a$mem_tmp = a [L829] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L829] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L830] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L830] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0) [L830] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L830] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L831] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L831] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1) [L831] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L831] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L832] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L832] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used) [L832] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L832] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L833] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L833] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L833] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L833] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L834] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4) [L834] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L834] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L835] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L835] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L835] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L835] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L836] 4 __unbuffered_p3_EAX = a [L837] EXPR 4 a$flush_delayed ? a$mem_tmp : a [L837] 4 a = a$flush_delayed ? a$mem_tmp : a [L838] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L788] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L788] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L788] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L788] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L789] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L789] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L790] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L790] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L791] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L792] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L792] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L808] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L808] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L808] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L808] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L809] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L809] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L810] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L810] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L811] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L811] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L812] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L812] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L841] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L841] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L841] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L841] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L842] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L842] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L843] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L843] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L844] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L844] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L845] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L845] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L768] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L768] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L769] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L771] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L848] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L872] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1321={5:0}, t1322={6:0}, t1323={7:0}, t1324={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L874] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L874] RET 0 assume_abort_if_not(main$tmp_guard0) [L876] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L876] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L876] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L876] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L877] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L877] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L878] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L878] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L879] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L879] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L880] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L880] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L883] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1321={5:0}, t1322={6:0}, t1323={7:0}, t1324={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L885] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 870]: 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: 868]: 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: 866]: 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: 864]: 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 9 procedures, 173 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 21.2s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 14.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 608 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 608 mSDsluCounter, 454 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1067 mSDsCounter, 133 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1473 IncrementalHoareTripleChecker+Invalid, 1606 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 133 mSolverCounterUnsat, 90 mSDtfsCounter, 1473 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=491occurred in iteration=6, InterpolantAutomatonStates: 81, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 949 NumberOfCodeBlocks, 949 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 834 ConstructedInterpolants, 0 QuantifiedInterpolants, 2955 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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-02 21:05:37,157 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dd03f0f-9c46-4244-977f-2fefebfd1086/bin/uautomizer-Dbtcem3rbc/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