./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix003.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix003.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 929f303f9fec34ceeaa6ac57212036dd2a2b082a21c34f6b9e4e20069df7c744 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 21:05:38,244 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 21:05:38,247 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 21:05:38,294 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 21:05:38,295 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 21:05:38,296 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 21:05:38,298 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 21:05:38,300 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 21:05:38,303 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 21:05:38,307 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 21:05:38,308 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 21:05:38,310 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 21:05:38,311 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 21:05:38,313 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 21:05:38,314 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 21:05:38,317 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 21:05:38,318 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 21:05:38,320 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 21:05:38,322 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 21:05:38,327 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 21:05:38,329 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 21:05:38,331 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 21:05:38,331 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 21:05:38,332 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 21:05:38,334 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 21:05:38,339 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 21:05:38,339 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 21:05:38,340 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 21:05:38,341 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 21:05:38,341 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 21:05:38,342 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 21:05:38,343 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 21:05:38,344 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 21:05:38,345 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 21:05:38,345 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 21:05:38,346 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 21:05:38,346 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 21:05:38,348 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 21:05:38,348 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 21:05:38,348 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 21:05:38,349 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 21:05:38,351 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 21:05:38,352 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 21:05:38,381 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 21:05:38,383 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 21:05:38,384 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 21:05:38,384 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 21:05:38,385 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 21:05:38,385 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 21:05:38,385 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 21:05:38,386 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 21:05:38,386 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 21:05:38,387 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 21:05:38,387 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 21:05:38,387 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 21:05:38,387 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 21:05:38,388 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 21:05:38,388 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 21:05:38,388 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 21:05:38,388 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 21:05:38,388 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 21:05:38,389 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 21:05:38,390 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 21:05:38,390 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 21:05:38,390 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 21:05:38,390 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 21:05:38,391 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 21:05:38,391 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 21:05:38,391 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 21:05:38,391 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 21:05:38,391 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 21:05:38,392 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 21:05:38,392 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 21:05:38,392 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 21:05:38,392 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 21:05:38,393 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 21:05:38,393 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 929f303f9fec34ceeaa6ac57212036dd2a2b082a21c34f6b9e4e20069df7c744 [2022-07-19 21:05:38,622 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 21:05:38,655 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 21:05:38,658 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 21:05:38,659 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 21:05:38,660 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 21:05:38,662 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix003.oepc.i [2022-07-19 21:05:38,729 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aec7bc3c5/573264a452194940892249f58fa2c796/FLAG255b92e12 [2022-07-19 21:05:39,194 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 21:05:39,195 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix003.oepc.i [2022-07-19 21:05:39,212 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aec7bc3c5/573264a452194940892249f58fa2c796/FLAG255b92e12 [2022-07-19 21:05:39,546 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aec7bc3c5/573264a452194940892249f58fa2c796 [2022-07-19 21:05:39,548 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 21:05:39,549 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 21:05:39,551 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 21:05:39,551 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 21:05:39,554 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 21:05:39,555 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 09:05:39" (1/1) ... [2022-07-19 21:05:39,556 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@472243c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:05:39, skipping insertion in model container [2022-07-19 21:05:39,556 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 09:05:39" (1/1) ... [2022-07-19 21:05:39,562 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 21:05:39,627 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 21:05:39,815 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix003.oepc.i[945,958] [2022-07-19 21:05:40,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 21:05:40,065 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 21:05:40,078 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix003.oepc.i[945,958] [2022-07-19 21:05:40,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 21:05:40,157 INFO L208 MainTranslator]: Completed translation [2022-07-19 21:05:40,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:05:40 WrapperNode [2022-07-19 21:05:40,159 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 21:05:40,161 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 21:05:40,161 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 21:05:40,161 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 21:05:40,168 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:05:40" (1/1) ... [2022-07-19 21:05:40,206 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:05:40" (1/1) ... [2022-07-19 21:05:40,241 INFO L137 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 179 [2022-07-19 21:05:40,241 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 21:05:40,243 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 21:05:40,243 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 21:05:40,243 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 21:05:40,250 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:05:40" (1/1) ... [2022-07-19 21:05:40,251 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:05:40" (1/1) ... [2022-07-19 21:05:40,266 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:05:40" (1/1) ... [2022-07-19 21:05:40,267 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:05:40" (1/1) ... [2022-07-19 21:05:40,279 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:05:40" (1/1) ... [2022-07-19 21:05:40,296 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:05:40" (1/1) ... [2022-07-19 21:05:40,299 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:05:40" (1/1) ... [2022-07-19 21:05:40,302 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 21:05:40,313 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 21:05:40,313 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 21:05:40,313 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 21:05:40,315 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:05:40" (1/1) ... [2022-07-19 21:05:40,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 21:05:40,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:05:40,342 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 21:05:40,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 21:05:40,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 21:05:40,372 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-19 21:05:40,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 21:05:40,373 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 21:05:40,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 21:05:40,375 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-07-19 21:05:40,380 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-07-19 21:05:40,380 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-07-19 21:05:40,380 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-07-19 21:05:40,381 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-07-19 21:05:40,381 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-07-19 21:05:40,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 21:05:40,381 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-19 21:05:40,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 21:05:40,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 21:05:40,383 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-19 21:05:40,508 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 21:05:40,510 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 21:05:40,978 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 21:05:41,318 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 21:05:41,318 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-19 21:05:41,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:05:41 BoogieIcfgContainer [2022-07-19 21:05:41,321 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 21:05:41,325 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 21:05:41,325 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 21:05:41,329 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 21:05:41,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 09:05:39" (1/3) ... [2022-07-19 21:05:41,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ae404d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 09:05:41, skipping insertion in model container [2022-07-19 21:05:41,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:05:40" (2/3) ... [2022-07-19 21:05:41,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ae404d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 09:05:41, skipping insertion in model container [2022-07-19 21:05:41,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:05:41" (3/3) ... [2022-07-19 21:05:41,332 INFO L111 eAbstractionObserver]: Analyzing ICFG mix003.oepc.i [2022-07-19 21:05:41,338 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-19 21:05:41,346 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 21:05:41,346 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-19 21:05:41,346 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-19 21:05:41,409 INFO L135 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-07-19 21:05:41,456 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 128 places, 120 transitions, 255 flow [2022-07-19 21:05:41,510 INFO L129 PetriNetUnfolder]: 2/117 cut-off events. [2022-07-19 21:05:41,510 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-19 21:05:41,516 INFO L84 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 117 events. 2/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2022-07-19 21:05:41,517 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 120 transitions, 255 flow [2022-07-19 21:05:41,523 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 117 transitions, 243 flow [2022-07-19 21:05:41,539 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 21:05:41,548 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@13dd2a38, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@24277041 [2022-07-19 21:05:41,549 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-07-19 21:05:41,558 INFO L129 PetriNetUnfolder]: 0/49 cut-off events. [2022-07-19 21:05:41,559 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-19 21:05:41,561 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:05:41,562 INFO L200 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] [2022-07-19 21:05:41,563 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-19 21:05:41,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:05:41,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1818972421, now seen corresponding path program 1 times [2022-07-19 21:05:41,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:05:41,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711269435] [2022-07-19 21:05:41,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:05:41,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:05:41,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:05:41,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:05:41,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:05:41,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711269435] [2022-07-19 21:05:41,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711269435] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:05:41,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:05:41,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 21:05:41,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647806864] [2022-07-19 21:05:41,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:05:41,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 21:05:41,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:05:41,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 21:05:41,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 21:05:41,943 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 120 [2022-07-19 21:05:41,949 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 117 transitions, 243 flow. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:05:41,949 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:05:41,950 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 120 [2022-07-19 21:05:41,951 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:05:42,160 INFO L129 PetriNetUnfolder]: 58/327 cut-off events. [2022-07-19 21:05:42,160 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-07-19 21:05:42,163 INFO L84 FinitePrefix]: Finished finitePrefix Result has 456 conditions, 327 events. 58/327 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1396 event pairs, 44 based on Foata normal form. 18/323 useless extension candidates. Maximal degree in co-relation 401. Up to 79 conditions per place. [2022-07-19 21:05:42,166 INFO L132 encePairwiseOnDemand]: 115/120 looper letters, 14 selfloop transitions, 2 changer transitions 0/119 dead transitions. [2022-07-19 21:05:42,167 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 119 transitions, 285 flow [2022-07-19 21:05:42,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 21:05:42,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-19 21:05:42,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 339 transitions. [2022-07-19 21:05:42,181 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9416666666666667 [2022-07-19 21:05:42,182 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 339 transitions. [2022-07-19 21:05:42,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 339 transitions. [2022-07-19 21:05:42,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:05:42,187 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 339 transitions. [2022-07-19 21:05:42,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:05:42,199 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:05:42,200 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:05:42,202 INFO L186 Difference]: Start difference. First operand has 125 places, 117 transitions, 243 flow. Second operand 3 states and 339 transitions. [2022-07-19 21:05:42,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 119 transitions, 285 flow [2022-07-19 21:05:42,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 119 transitions, 280 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-07-19 21:05:42,209 INFO L242 Difference]: Finished difference. Result has 122 places, 113 transitions, 236 flow [2022-07-19 21:05:42,212 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=236, PETRI_PLACES=122, PETRI_TRANSITIONS=113} [2022-07-19 21:05:42,215 INFO L279 CegarLoopForPetriNet]: 125 programPoint places, -3 predicate places. [2022-07-19 21:05:42,216 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 113 transitions, 236 flow [2022-07-19 21:05:42,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:05:42,216 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:05:42,217 INFO L200 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] [2022-07-19 21:05:42,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 21:05:42,217 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-19 21:05:42,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:05:42,218 INFO L85 PathProgramCache]: Analyzing trace with hash -141212877, now seen corresponding path program 1 times [2022-07-19 21:05:42,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:05:42,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859115113] [2022-07-19 21:05:42,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:05:42,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:05:42,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:05:42,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:05:42,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:05:42,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859115113] [2022-07-19 21:05:42,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859115113] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:05:42,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:05:42,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 21:05:42,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735550527] [2022-07-19 21:05:42,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:05:42,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 21:05:42,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:05:42,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 21:05:42,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-19 21:05:42,499 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 120 [2022-07-19 21:05:42,500 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 113 transitions, 236 flow. Second operand has 7 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:05:42,501 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:05:42,505 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 120 [2022-07-19 21:05:42,506 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:05:43,455 INFO L129 PetriNetUnfolder]: 1548/3915 cut-off events. [2022-07-19 21:05:43,455 INFO L130 PetriNetUnfolder]: For 189/189 co-relation queries the response was YES. [2022-07-19 21:05:43,466 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6460 conditions, 3915 events. 1548/3915 cut-off events. For 189/189 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 31767 event pairs, 231 based on Foata normal form. 0/3815 useless extension candidates. Maximal degree in co-relation 6401. Up to 1235 conditions per place. [2022-07-19 21:05:43,478 INFO L132 encePairwiseOnDemand]: 114/120 looper letters, 30 selfloop transitions, 2 changer transitions 66/175 dead transitions. [2022-07-19 21:05:43,478 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 175 transitions, 550 flow [2022-07-19 21:05:43,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 21:05:43,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-19 21:05:43,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 908 transitions. [2022-07-19 21:05:43,485 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8407407407407408 [2022-07-19 21:05:43,485 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 908 transitions. [2022-07-19 21:05:43,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 908 transitions. [2022-07-19 21:05:43,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:05:43,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 908 transitions. [2022-07-19 21:05:43,489 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 100.88888888888889) internal successors, (908), 9 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:05:43,493 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 120.0) internal successors, (1200), 10 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:05:43,494 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 120.0) internal successors, (1200), 10 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:05:43,494 INFO L186 Difference]: Start difference. First operand has 122 places, 113 transitions, 236 flow. Second operand 9 states and 908 transitions. [2022-07-19 21:05:43,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 175 transitions, 550 flow [2022-07-19 21:05:43,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 175 transitions, 532 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-19 21:05:43,501 INFO L242 Difference]: Finished difference. Result has 135 places, 101 transitions, 228 flow [2022-07-19 21:05:43,501 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=228, PETRI_PLACES=135, PETRI_TRANSITIONS=101} [2022-07-19 21:05:43,502 INFO L279 CegarLoopForPetriNet]: 125 programPoint places, 10 predicate places. [2022-07-19 21:05:43,502 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 101 transitions, 228 flow [2022-07-19 21:05:43,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:05:43,503 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:05:43,503 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:05:43,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 21:05:43,504 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-19 21:05:43,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:05:43,505 INFO L85 PathProgramCache]: Analyzing trace with hash 802957555, now seen corresponding path program 1 times [2022-07-19 21:05:43,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:05:43,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535515275] [2022-07-19 21:05:43,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:05:43,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:05:43,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:05:43,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:05:43,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:05:43,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535515275] [2022-07-19 21:05:43,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535515275] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:05:43,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:05:43,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 21:05:43,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72222088] [2022-07-19 21:05:43,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:05:43,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 21:05:43,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:05:43,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 21:05:43,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-19 21:05:43,728 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 120 [2022-07-19 21:05:43,729 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 101 transitions, 228 flow. Second operand has 7 states, 7 states have (on average 93.28571428571429) internal successors, (653), 7 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:05:43,730 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:05:43,730 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 120 [2022-07-19 21:05:43,730 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:05:44,289 INFO L129 PetriNetUnfolder]: 1007/1866 cut-off events. [2022-07-19 21:05:44,289 INFO L130 PetriNetUnfolder]: For 501/501 co-relation queries the response was YES. [2022-07-19 21:05:44,295 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3980 conditions, 1866 events. 1007/1866 cut-off events. For 501/501 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 10225 event pairs, 180 based on Foata normal form. 48/1861 useless extension candidates. Maximal degree in co-relation 3914. Up to 846 conditions per place. [2022-07-19 21:05:44,302 INFO L132 encePairwiseOnDemand]: 112/120 looper letters, 27 selfloop transitions, 4 changer transitions 46/154 dead transitions. [2022-07-19 21:05:44,303 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 154 transitions, 509 flow [2022-07-19 21:05:44,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 21:05:44,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-19 21:05:44,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 989 transitions. [2022-07-19 21:05:44,306 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8241666666666667 [2022-07-19 21:05:44,306 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 989 transitions. [2022-07-19 21:05:44,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 989 transitions. [2022-07-19 21:05:44,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:05:44,308 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 989 transitions. [2022-07-19 21:05:44,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 98.9) internal successors, (989), 10 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:05:44,312 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:05:44,313 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:05:44,313 INFO L186 Difference]: Start difference. First operand has 135 places, 101 transitions, 228 flow. Second operand 10 states and 989 transitions. [2022-07-19 21:05:44,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 154 transitions, 509 flow [2022-07-19 21:05:44,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 154 transitions, 475 flow, removed 14 selfloop flow, removed 8 redundant places. [2022-07-19 21:05:44,330 INFO L242 Difference]: Finished difference. Result has 125 places, 101 transitions, 236 flow [2022-07-19 21:05:44,330 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=236, PETRI_PLACES=125, PETRI_TRANSITIONS=101} [2022-07-19 21:05:44,331 INFO L279 CegarLoopForPetriNet]: 125 programPoint places, 0 predicate places. [2022-07-19 21:05:44,331 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 101 transitions, 236 flow [2022-07-19 21:05:44,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.28571428571429) internal successors, (653), 7 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:05:44,332 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:05:44,332 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:05:44,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 21:05:44,333 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-19 21:05:44,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:05:44,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1803079659, now seen corresponding path program 1 times [2022-07-19 21:05:44,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:05:44,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949441030] [2022-07-19 21:05:44,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:05:44,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:05:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:05:44,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:05:44,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:05:44,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949441030] [2022-07-19 21:05:44,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949441030] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:05:44,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:05:44,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 21:05:44,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332724595] [2022-07-19 21:05:44,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:05:44,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 21:05:44,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:05:44,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 21:05:44,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 21:05:44,431 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 120 [2022-07-19 21:05:44,432 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 101 transitions, 236 flow. Second operand has 6 states, 6 states have (on average 97.83333333333333) internal successors, (587), 6 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:05:44,432 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:05:44,432 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 120 [2022-07-19 21:05:44,433 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:05:44,883 INFO L129 PetriNetUnfolder]: 917/1963 cut-off events. [2022-07-19 21:05:44,884 INFO L130 PetriNetUnfolder]: For 121/121 co-relation queries the response was YES. [2022-07-19 21:05:44,889 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3687 conditions, 1963 events. 917/1963 cut-off events. For 121/121 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 13378 event pairs, 60 based on Foata normal form. 0/1923 useless extension candidates. Maximal degree in co-relation 3622. Up to 481 conditions per place. [2022-07-19 21:05:44,895 INFO L132 encePairwiseOnDemand]: 110/120 looper letters, 31 selfloop transitions, 6 changer transitions 50/168 dead transitions. [2022-07-19 21:05:44,895 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 168 transitions, 548 flow [2022-07-19 21:05:44,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 21:05:44,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-19 21:05:44,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1049 transitions. [2022-07-19 21:05:44,899 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8741666666666666 [2022-07-19 21:05:44,899 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1049 transitions. [2022-07-19 21:05:44,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1049 transitions. [2022-07-19 21:05:44,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:05:44,900 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1049 transitions. [2022-07-19 21:05:44,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 104.9) internal successors, (1049), 10 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:05:44,905 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:05:44,906 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:05:44,906 INFO L186 Difference]: Start difference. First operand has 125 places, 101 transitions, 236 flow. Second operand 10 states and 1049 transitions. [2022-07-19 21:05:44,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 168 transitions, 548 flow [2022-07-19 21:05:44,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 168 transitions, 528 flow, removed 6 selfloop flow, removed 9 redundant places. [2022-07-19 21:05:44,911 INFO L242 Difference]: Finished difference. Result has 125 places, 103 transitions, 270 flow [2022-07-19 21:05:44,912 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=270, PETRI_PLACES=125, PETRI_TRANSITIONS=103} [2022-07-19 21:05:44,913 INFO L279 CegarLoopForPetriNet]: 125 programPoint places, 0 predicate places. [2022-07-19 21:05:44,913 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 103 transitions, 270 flow [2022-07-19 21:05:44,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 97.83333333333333) internal successors, (587), 6 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:05:44,913 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:05:44,914 INFO L200 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-07-19 21:05:44,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 21:05:44,914 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-19 21:05:44,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:05:44,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1052983942, now seen corresponding path program 1 times [2022-07-19 21:05:44,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:05:44,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799000292] [2022-07-19 21:05:44,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:05:44,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:05:44,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:05:45,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:05:45,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:05:45,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799000292] [2022-07-19 21:05:45,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799000292] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:05:45,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:05:45,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 21:05:45,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884590497] [2022-07-19 21:05:45,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:05:45,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 21:05:45,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:05:45,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 21:05:45,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 21:05:45,033 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 120 [2022-07-19 21:05:45,034 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 103 transitions, 270 flow. Second operand has 7 states, 7 states have (on average 97.28571428571429) internal successors, (681), 7 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:05:45,034 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:05:45,034 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 120 [2022-07-19 21:05:45,034 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:05:45,515 INFO L129 PetriNetUnfolder]: 700/1881 cut-off events. [2022-07-19 21:05:45,516 INFO L130 PetriNetUnfolder]: For 813/900 co-relation queries the response was YES. [2022-07-19 21:05:45,540 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4063 conditions, 1881 events. 700/1881 cut-off events. For 813/900 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 13991 event pairs, 160 based on Foata normal form. 26/1829 useless extension candidates. Maximal degree in co-relation 3998. Up to 474 conditions per place. [2022-07-19 21:05:45,549 INFO L132 encePairwiseOnDemand]: 114/120 looper letters, 50 selfloop transitions, 5 changer transitions 0/138 dead transitions. [2022-07-19 21:05:45,550 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 138 transitions, 455 flow [2022-07-19 21:05:45,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 21:05:45,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-19 21:05:45,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 721 transitions. [2022-07-19 21:05:45,552 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8583333333333333 [2022-07-19 21:05:45,552 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 721 transitions. [2022-07-19 21:05:45,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 721 transitions. [2022-07-19 21:05:45,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:05:45,553 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 721 transitions. [2022-07-19 21:05:45,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 103.0) internal successors, (721), 7 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:05:45,557 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 120.0) internal successors, (960), 8 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:05:45,557 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 120.0) internal successors, (960), 8 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:05:45,557 INFO L186 Difference]: Start difference. First operand has 125 places, 103 transitions, 270 flow. Second operand 7 states and 721 transitions. [2022-07-19 21:05:45,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 138 transitions, 455 flow [2022-07-19 21:05:45,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 138 transitions, 441 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-07-19 21:05:45,562 INFO L242 Difference]: Finished difference. Result has 125 places, 107 transitions, 297 flow [2022-07-19 21:05:45,563 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=297, PETRI_PLACES=125, PETRI_TRANSITIONS=107} [2022-07-19 21:05:45,563 INFO L279 CegarLoopForPetriNet]: 125 programPoint places, 0 predicate places. [2022-07-19 21:05:45,564 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 107 transitions, 297 flow [2022-07-19 21:05:45,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 97.28571428571429) internal successors, (681), 7 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:05:45,564 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:05:45,565 INFO L200 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-07-19 21:05:45,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 21:05:45,565 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-19 21:05:45,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:05:45,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1397433336, now seen corresponding path program 2 times [2022-07-19 21:05:45,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:05:45,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569686785] [2022-07-19 21:05:45,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:05:45,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:05:45,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:05:45,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:05:45,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:05:45,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569686785] [2022-07-19 21:05:45,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569686785] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:05:45,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:05:45,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 21:05:45,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555469279] [2022-07-19 21:05:45,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:05:45,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 21:05:45,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:05:45,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 21:05:45,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-19 21:05:45,746 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 120 [2022-07-19 21:05:45,746 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 107 transitions, 297 flow. Second operand has 7 states, 7 states have (on average 97.85714285714286) internal successors, (685), 7 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:05:45,747 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:05:45,747 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 120 [2022-07-19 21:05:45,747 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:05:46,182 INFO L129 PetriNetUnfolder]: 612/1552 cut-off events. [2022-07-19 21:05:46,183 INFO L130 PetriNetUnfolder]: For 1081/1085 co-relation queries the response was YES. [2022-07-19 21:05:46,188 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3771 conditions, 1552 events. 612/1552 cut-off events. For 1081/1085 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 10692 event pairs, 60 based on Foata normal form. 59/1582 useless extension candidates. Maximal degree in co-relation 3706. Up to 354 conditions per place. [2022-07-19 21:05:46,191 INFO L132 encePairwiseOnDemand]: 111/120 looper letters, 37 selfloop transitions, 9 changer transitions 42/170 dead transitions. [2022-07-19 21:05:46,191 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 170 transitions, 716 flow [2022-07-19 21:05:46,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 21:05:46,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-19 21:05:46,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1047 transitions. [2022-07-19 21:05:46,195 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8725 [2022-07-19 21:05:46,195 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1047 transitions. [2022-07-19 21:05:46,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1047 transitions. [2022-07-19 21:05:46,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:05:46,196 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1047 transitions. [2022-07-19 21:05:46,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 104.7) internal successors, (1047), 10 states have internal predecessors, (1047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:05:46,200 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:05:46,200 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:05:46,201 INFO L186 Difference]: Start difference. First operand has 125 places, 107 transitions, 297 flow. Second operand 10 states and 1047 transitions. [2022-07-19 21:05:46,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 170 transitions, 716 flow [2022-07-19 21:05:46,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 170 transitions, 713 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-07-19 21:05:46,207 INFO L242 Difference]: Finished difference. Result has 139 places, 107 transitions, 356 flow [2022-07-19 21:05:46,208 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=356, PETRI_PLACES=139, PETRI_TRANSITIONS=107} [2022-07-19 21:05:46,210 INFO L279 CegarLoopForPetriNet]: 125 programPoint places, 14 predicate places. [2022-07-19 21:05:46,211 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 107 transitions, 356 flow [2022-07-19 21:05:46,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 97.85714285714286) internal successors, (685), 7 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:05:46,211 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:05:46,211 INFO L200 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] [2022-07-19 21:05:46,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 21:05:46,212 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-19 21:05:46,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:05:46,213 INFO L85 PathProgramCache]: Analyzing trace with hash 637071747, now seen corresponding path program 1 times [2022-07-19 21:05:46,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:05:46,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406596982] [2022-07-19 21:05:46,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:05:46,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:05:46,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:05:46,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:05:46,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:05:46,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406596982] [2022-07-19 21:05:46,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406596982] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:05:46,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:05:46,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 21:05:46,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195340484] [2022-07-19 21:05:46,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:05:46,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 21:05:46,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:05:46,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 21:05:46,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-19 21:05:46,404 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 120 [2022-07-19 21:05:46,405 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 107 transitions, 356 flow. Second operand has 8 states, 8 states have (on average 98.0) internal successors, (784), 8 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:05:46,405 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:05:46,405 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 120 [2022-07-19 21:05:46,405 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:05:46,736 INFO L129 PetriNetUnfolder]: 196/632 cut-off events. [2022-07-19 21:05:46,736 INFO L130 PetriNetUnfolder]: For 1107/1107 co-relation queries the response was YES. [2022-07-19 21:05:46,738 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1753 conditions, 632 events. 196/632 cut-off events. For 1107/1107 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3475 event pairs, 46 based on Foata normal form. 18/627 useless extension candidates. Maximal degree in co-relation 1731. Up to 132 conditions per place. [2022-07-19 21:05:46,740 INFO L132 encePairwiseOnDemand]: 111/120 looper letters, 26 selfloop transitions, 12 changer transitions 23/143 dead transitions. [2022-07-19 21:05:46,740 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 143 transitions, 656 flow [2022-07-19 21:05:46,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 21:05:46,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-07-19 21:05:46,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1119 transitions. [2022-07-19 21:05:46,744 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8477272727272728 [2022-07-19 21:05:46,744 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1119 transitions. [2022-07-19 21:05:46,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1119 transitions. [2022-07-19 21:05:46,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:05:46,745 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1119 transitions. [2022-07-19 21:05:46,747 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 101.72727272727273) internal successors, (1119), 11 states have internal predecessors, (1119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:05:46,750 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 120.0) internal successors, (1440), 12 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:05:46,750 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 120.0) internal successors, (1440), 12 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:05:46,750 INFO L186 Difference]: Start difference. First operand has 139 places, 107 transitions, 356 flow. Second operand 11 states and 1119 transitions. [2022-07-19 21:05:46,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 143 transitions, 656 flow [2022-07-19 21:05:46,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 143 transitions, 547 flow, removed 43 selfloop flow, removed 14 redundant places. [2022-07-19 21:05:46,757 INFO L242 Difference]: Finished difference. Result has 134 places, 107 transitions, 332 flow [2022-07-19 21:05:46,757 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=332, PETRI_PLACES=134, PETRI_TRANSITIONS=107} [2022-07-19 21:05:46,758 INFO L279 CegarLoopForPetriNet]: 125 programPoint places, 9 predicate places. [2022-07-19 21:05:46,758 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 107 transitions, 332 flow [2022-07-19 21:05:46,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 98.0) internal successors, (784), 8 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:05:46,759 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:05:46,759 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:05:46,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-19 21:05:46,760 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-19 21:05:46,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:05:46,760 INFO L85 PathProgramCache]: Analyzing trace with hash -568492, now seen corresponding path program 1 times [2022-07-19 21:05:46,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:05:46,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996468188] [2022-07-19 21:05:46,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:05:46,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:05:46,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:05:46,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:05:46,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:05:46,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996468188] [2022-07-19 21:05:46,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996468188] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:05:46,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:05:46,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-19 21:05:46,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052689152] [2022-07-19 21:05:46,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:05:46,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 21:05:46,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:05:46,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 21:05:46,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-19 21:05:46,961 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 120 [2022-07-19 21:05:46,962 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 107 transitions, 332 flow. Second operand has 9 states, 9 states have (on average 95.44444444444444) internal successors, (859), 9 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:05:46,962 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:05:46,963 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 120 [2022-07-19 21:05:46,963 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:05:47,243 INFO L129 PetriNetUnfolder]: 95/582 cut-off events. [2022-07-19 21:05:47,243 INFO L130 PetriNetUnfolder]: For 638/682 co-relation queries the response was YES. [2022-07-19 21:05:47,246 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1327 conditions, 582 events. 95/582 cut-off events. For 638/682 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3546 event pairs, 10 based on Foata normal form. 1/565 useless extension candidates. Maximal degree in co-relation 1252. Up to 99 conditions per place. [2022-07-19 21:05:47,247 INFO L132 encePairwiseOnDemand]: 110/120 looper letters, 27 selfloop transitions, 6 changer transitions 10/128 dead transitions. [2022-07-19 21:05:47,248 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 128 transitions, 470 flow [2022-07-19 21:05:47,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 21:05:47,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-19 21:05:47,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 974 transitions. [2022-07-19 21:05:47,250 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8116666666666666 [2022-07-19 21:05:47,251 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 974 transitions. [2022-07-19 21:05:47,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 974 transitions. [2022-07-19 21:05:47,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:05:47,252 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 974 transitions. [2022-07-19 21:05:47,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 97.4) internal successors, (974), 10 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:05:47,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:05:47,256 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:05:47,257 INFO L186 Difference]: Start difference. First operand has 134 places, 107 transitions, 332 flow. Second operand 10 states and 974 transitions. [2022-07-19 21:05:47,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 128 transitions, 470 flow [2022-07-19 21:05:47,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 128 transitions, 388 flow, removed 22 selfloop flow, removed 15 redundant places. [2022-07-19 21:05:47,262 INFO L242 Difference]: Finished difference. Result has 131 places, 111 transitions, 294 flow [2022-07-19 21:05:47,263 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=294, PETRI_PLACES=131, PETRI_TRANSITIONS=111} [2022-07-19 21:05:47,263 INFO L279 CegarLoopForPetriNet]: 125 programPoint places, 6 predicate places. [2022-07-19 21:05:47,264 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 111 transitions, 294 flow [2022-07-19 21:05:47,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 95.44444444444444) internal successors, (859), 9 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:05:47,264 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:05:47,265 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:05:47,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 21:05:47,265 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-19 21:05:47,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:05:47,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1055679416, now seen corresponding path program 2 times [2022-07-19 21:05:47,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:05:47,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343576278] [2022-07-19 21:05:47,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:05:47,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:05:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:05:47,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:05:47,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:05:47,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343576278] [2022-07-19 21:05:47,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343576278] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:05:47,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:05:47,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-19 21:05:47,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142143380] [2022-07-19 21:05:47,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:05:47,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 21:05:47,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:05:47,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 21:05:47,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-19 21:05:47,558 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 120 [2022-07-19 21:05:47,559 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 111 transitions, 294 flow. Second operand has 11 states, 11 states have (on average 93.18181818181819) internal successors, (1025), 11 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:05:47,559 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:05:47,560 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 120 [2022-07-19 21:05:47,560 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:05:47,837 INFO L129 PetriNetUnfolder]: 80/498 cut-off events. [2022-07-19 21:05:47,838 INFO L130 PetriNetUnfolder]: For 117/142 co-relation queries the response was YES. [2022-07-19 21:05:47,840 INFO L84 FinitePrefix]: Finished finitePrefix Result has 893 conditions, 498 events. 80/498 cut-off events. For 117/142 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2834 event pairs, 5 based on Foata normal form. 14/498 useless extension candidates. Maximal degree in co-relation 877. Up to 56 conditions per place. [2022-07-19 21:05:47,841 INFO L132 encePairwiseOnDemand]: 110/120 looper letters, 26 selfloop transitions, 7 changer transitions 10/125 dead transitions. [2022-07-19 21:05:47,841 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 125 transitions, 430 flow [2022-07-19 21:05:47,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 21:05:47,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-07-19 21:05:47,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1042 transitions. [2022-07-19 21:05:47,844 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7893939393939394 [2022-07-19 21:05:47,844 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1042 transitions. [2022-07-19 21:05:47,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1042 transitions. [2022-07-19 21:05:47,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:05:47,845 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1042 transitions. [2022-07-19 21:05:47,847 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 94.72727272727273) internal successors, (1042), 11 states have internal predecessors, (1042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:05:47,849 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 120.0) internal successors, (1440), 12 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:05:47,850 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 120.0) internal successors, (1440), 12 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:05:47,850 INFO L186 Difference]: Start difference. First operand has 131 places, 111 transitions, 294 flow. Second operand 11 states and 1042 transitions. [2022-07-19 21:05:47,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 125 transitions, 430 flow [2022-07-19 21:05:47,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 125 transitions, 411 flow, removed 9 selfloop flow, removed 6 redundant places. [2022-07-19 21:05:47,854 INFO L242 Difference]: Finished difference. Result has 135 places, 110 transitions, 305 flow [2022-07-19 21:05:47,854 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=305, PETRI_PLACES=135, PETRI_TRANSITIONS=110} [2022-07-19 21:05:47,855 INFO L279 CegarLoopForPetriNet]: 125 programPoint places, 10 predicate places. [2022-07-19 21:05:47,855 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 110 transitions, 305 flow [2022-07-19 21:05:47,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 93.18181818181819) internal successors, (1025), 11 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:05:47,856 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:05:47,856 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:05:47,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-19 21:05:47,857 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-19 21:05:47,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:05:47,857 INFO L85 PathProgramCache]: Analyzing trace with hash 931170220, now seen corresponding path program 3 times [2022-07-19 21:05:47,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:05:47,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816293616] [2022-07-19 21:05:47,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:05:47,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:05:47,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:05:48,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:05:48,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:05:48,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816293616] [2022-07-19 21:05:48,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816293616] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:05:48,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:05:48,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 21:05:48,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767434277] [2022-07-19 21:05:48,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:05:48,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 21:05:48,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:05:48,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 21:05:48,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 21:05:48,015 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 120 [2022-07-19 21:05:48,016 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 110 transitions, 305 flow. Second operand has 7 states, 7 states have (on average 97.85714285714286) internal successors, (685), 7 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:05:48,016 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:05:48,016 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 120 [2022-07-19 21:05:48,016 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:05:48,240 INFO L129 PetriNetUnfolder]: 140/596 cut-off events. [2022-07-19 21:05:48,240 INFO L130 PetriNetUnfolder]: For 438/444 co-relation queries the response was YES. [2022-07-19 21:05:48,243 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1276 conditions, 596 events. 140/596 cut-off events. For 438/444 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3405 event pairs, 21 based on Foata normal form. 1/571 useless extension candidates. Maximal degree in co-relation 1260. Up to 125 conditions per place. [2022-07-19 21:05:48,244 INFO L132 encePairwiseOnDemand]: 114/120 looper letters, 22 selfloop transitions, 1 changer transitions 20/129 dead transitions. [2022-07-19 21:05:48,245 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 129 transitions, 484 flow [2022-07-19 21:05:48,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 21:05:48,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-19 21:05:48,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 703 transitions. [2022-07-19 21:05:48,247 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8369047619047619 [2022-07-19 21:05:48,247 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 703 transitions. [2022-07-19 21:05:48,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 703 transitions. [2022-07-19 21:05:48,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:05:48,248 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 703 transitions. [2022-07-19 21:05:48,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 100.42857142857143) internal successors, (703), 7 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:05:48,251 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 120.0) internal successors, (960), 8 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:05:48,252 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 120.0) internal successors, (960), 8 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:05:48,252 INFO L186 Difference]: Start difference. First operand has 135 places, 110 transitions, 305 flow. Second operand 7 states and 703 transitions. [2022-07-19 21:05:48,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 129 transitions, 484 flow [2022-07-19 21:05:48,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 129 transitions, 436 flow, removed 12 selfloop flow, removed 10 redundant places. [2022-07-19 21:05:48,257 INFO L242 Difference]: Finished difference. Result has 130 places, 108 transitions, 282 flow [2022-07-19 21:05:48,258 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=282, PETRI_PLACES=130, PETRI_TRANSITIONS=108} [2022-07-19 21:05:48,258 INFO L279 CegarLoopForPetriNet]: 125 programPoint places, 5 predicate places. [2022-07-19 21:05:48,259 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 108 transitions, 282 flow [2022-07-19 21:05:48,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 97.85714285714286) internal successors, (685), 7 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:05:48,259 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:05:48,260 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:05:48,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-19 21:05:48,261 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-19 21:05:48,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:05:48,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1432944410, now seen corresponding path program 4 times [2022-07-19 21:05:48,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:05:48,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676485921] [2022-07-19 21:05:48,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:05:48,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:05:48,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 21:05:48,357 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-19 21:05:48,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 21:05:48,461 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-19 21:05:48,461 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-19 21:05:48,462 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-07-19 21:05:48,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-07-19 21:05:48,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-07-19 21:05:48,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-07-19 21:05:48,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-07-19 21:05:48,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-07-19 21:05:48,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-19 21:05:48,468 INFO L356 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1] [2022-07-19 21:05:48,475 INFO L226 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-07-19 21:05:48,475 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 21:05:48,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 09:05:48 BasicIcfg [2022-07-19 21:05:48,618 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 21:05:48,618 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 21:05:48,618 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 21:05:48,619 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 21:05:48,619 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:05:41" (3/4) ... [2022-07-19 21:05:48,621 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-19 21:05:48,723 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 21:05:48,723 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 21:05:48,724 INFO L158 Benchmark]: Toolchain (without parser) took 9174.66ms. Allocated memory was 88.1MB in the beginning and 302.0MB in the end (delta: 213.9MB). Free memory was 51.7MB in the beginning and 158.1MB in the end (delta: -106.3MB). Peak memory consumption was 107.1MB. Max. memory is 16.1GB. [2022-07-19 21:05:48,724 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 88.1MB. Free memory is still 69.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 21:05:48,725 INFO L158 Benchmark]: CACSL2BoogieTranslator took 609.05ms. Allocated memory was 88.1MB in the beginning and 117.4MB in the end (delta: 29.4MB). Free memory was 51.5MB in the beginning and 79.7MB in the end (delta: -28.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-19 21:05:48,725 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.98ms. Allocated memory is still 117.4MB. Free memory was 79.7MB in the beginning and 77.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 21:05:48,725 INFO L158 Benchmark]: Boogie Preprocessor took 69.21ms. Allocated memory is still 117.4MB. Free memory was 77.2MB in the beginning and 75.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 21:05:48,726 INFO L158 Benchmark]: RCFGBuilder took 1008.72ms. Allocated memory is still 117.4MB. Free memory was 75.2MB in the beginning and 87.1MB in the end (delta: -12.0MB). Peak memory consumption was 43.1MB. Max. memory is 16.1GB. [2022-07-19 21:05:48,726 INFO L158 Benchmark]: TraceAbstraction took 7292.71ms. Allocated memory was 117.4MB in the beginning and 302.0MB in the end (delta: 184.5MB). Free memory was 86.4MB in the beginning and 195.8MB in the end (delta: -109.4MB). Peak memory consumption was 74.5MB. Max. memory is 16.1GB. [2022-07-19 21:05:48,726 INFO L158 Benchmark]: Witness Printer took 105.34ms. Allocated memory is still 302.0MB. Free memory was 195.8MB in the beginning and 158.1MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-07-19 21:05:48,728 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.23ms. Allocated memory is still 88.1MB. Free memory is still 69.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 609.05ms. Allocated memory was 88.1MB in the beginning and 117.4MB in the end (delta: 29.4MB). Free memory was 51.5MB in the beginning and 79.7MB in the end (delta: -28.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.98ms. Allocated memory is still 117.4MB. Free memory was 79.7MB in the beginning and 77.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.21ms. Allocated memory is still 117.4MB. Free memory was 77.2MB in the beginning and 75.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1008.72ms. Allocated memory is still 117.4MB. Free memory was 75.2MB in the beginning and 87.1MB in the end (delta: -12.0MB). Peak memory consumption was 43.1MB. Max. memory is 16.1GB. * TraceAbstraction took 7292.71ms. Allocated memory was 117.4MB in the beginning and 302.0MB in the end (delta: 184.5MB). Free memory was 86.4MB in the beginning and 195.8MB in the end (delta: -109.4MB). Peak memory consumption was 74.5MB. Max. memory is 16.1GB. * Witness Printer took 105.34ms. Allocated memory is still 302.0MB. Free memory was 195.8MB in the beginning and 158.1MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L715] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L717] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0] [L719] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L720] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L721] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L723] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L725] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L727] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L728] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L729] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L730] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L731] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L732] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L733] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L734] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0] [L735] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L736] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L737] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L738] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L739] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L740] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L741] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L742] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L743] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L744] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L745] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] 0 pthread_t t62; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t62={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] FCALL, FORK 0 pthread_create(&t62, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t62, ((void *)0), P0, ((void *)0))=-2, t62={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] 0 pthread_t t63; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t62={5:0}, t63={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] FCALL, FORK 0 pthread_create(&t63, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t63, ((void *)0), P1, ((void *)0))=-1, t62={5:0}, t63={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] 0 pthread_t t64; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t62={5:0}, t63={6:0}, t64={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] FCALL, FORK 0 pthread_create(&t64, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t64, ((void *)0), P2, ((void *)0))=0, t62={5:0}, t63={6:0}, t64={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 z$w_buff1 = z$w_buff0 [L750] 1 z$w_buff0 = 1 [L751] 1 z$w_buff1_used = z$w_buff0_used [L752] 1 z$w_buff0_used = (_Bool)1 [L753] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L753] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L754] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L755] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L756] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L757] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L758] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L761] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L801] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L804] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L807] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L808] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L809] 3 z$flush_delayed = weak$$choice2 [L810] 3 z$mem_tmp = z [L811] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L811] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L812] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L812] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0) [L812] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L812] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L813] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L813] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1) [L813] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L813] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L814] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L814] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used) [L814] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L814] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L815] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L815] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L816] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3) [L816] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L816] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L817] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L817] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] 3 __unbuffered_p2_EBX = z [L819] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L819] 3 z = z$flush_delayed ? z$mem_tmp : z [L820] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L764] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L765] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L765] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L766] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L766] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L767] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L767] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L768] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L768] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L787] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L787] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L787] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L787] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L788] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L788] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L789] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L789] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L790] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L790] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L791] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L791] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L823] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L823] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L823] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L823] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L824] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L824] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L825] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L825] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L826] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L826] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L827] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L827] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L830] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t62={5:0}, t63={6:0}, t64={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] RET 0 assume_abort_if_not(main$tmp_guard0) [L856] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L856] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L856] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L856] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L857] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L858] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L858] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L859] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L860] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L863] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t62={5:0}, t63={6:0}, t64={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L865] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 846]: 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: 848]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 149 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.0s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 483 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 483 mSDsluCounter, 507 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 996 mSDsCounter, 85 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1347 IncrementalHoareTripleChecker+Invalid, 1432 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 85 mSolverCounterUnsat, 111 mSDtfsCounter, 1347 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 118 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=356occurred in iteration=6, InterpolantAutomatonStates: 88, 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.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 925 NumberOfCodeBlocks, 925 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 821 ConstructedInterpolants, 0 QuantifiedInterpolants, 3753 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-07-19 21:05:48,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE