./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix036.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 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/mix036.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 e3d3e405a2d3cb3ab8b02ed87788ef59412b7b81517118cc37c044f334087868 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 08:41:19,515 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 08:41:19,517 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 08:41:19,548 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 08:41:19,549 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 08:41:19,550 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 08:41:19,553 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 08:41:19,556 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 08:41:19,557 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 08:41:19,561 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 08:41:19,562 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 08:41:19,564 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 08:41:19,564 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 08:41:19,565 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 08:41:19,566 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 08:41:19,568 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 08:41:19,569 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 08:41:19,570 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 08:41:19,574 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 08:41:19,578 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 08:41:19,579 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 08:41:19,580 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 08:41:19,581 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 08:41:19,582 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 08:41:19,583 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 08:41:19,588 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 08:41:19,588 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 08:41:19,589 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 08:41:19,589 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 08:41:19,590 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 08:41:19,590 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 08:41:19,590 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 08:41:19,592 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 08:41:19,592 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 08:41:19,593 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 08:41:19,594 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 08:41:19,594 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 08:41:19,594 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 08:41:19,594 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 08:41:19,595 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 08:41:19,595 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 08:41:19,596 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 08:41:19,600 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 08:41:19,627 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 08:41:19,627 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 08:41:19,628 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 08:41:19,628 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 08:41:19,628 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 08:41:19,628 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 08:41:19,629 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 08:41:19,629 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 08:41:19,629 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 08:41:19,630 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 08:41:19,630 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 08:41:19,630 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 08:41:19,630 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 08:41:19,630 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 08:41:19,638 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 08:41:19,638 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 08:41:19,638 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 08:41:19,638 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 08:41:19,639 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 08:41:19,639 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 08:41:19,639 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 08:41:19,639 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 08:41:19,639 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 08:41:19,639 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 08:41:19,640 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 08:41:19,640 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 08:41:19,640 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 08:41:19,640 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 08:41:19,640 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 08:41:19,640 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 08:41:19,641 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 08:41:19,641 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 08:41:19,641 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 08:41:19,641 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 -> e3d3e405a2d3cb3ab8b02ed87788ef59412b7b81517118cc37c044f334087868 [2022-07-21 08:41:19,898 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 08:41:19,911 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 08:41:19,913 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 08:41:19,914 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 08:41:19,914 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 08:41:19,915 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix036.oepc.i [2022-07-21 08:41:19,972 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69b24ab4e/09db42378234431f808b4627be026b83/FLAGa8a1126cc [2022-07-21 08:41:20,363 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 08:41:20,365 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix036.oepc.i [2022-07-21 08:41:20,382 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69b24ab4e/09db42378234431f808b4627be026b83/FLAGa8a1126cc [2022-07-21 08:41:20,753 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69b24ab4e/09db42378234431f808b4627be026b83 [2022-07-21 08:41:20,755 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 08:41:20,756 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 08:41:20,757 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 08:41:20,757 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 08:41:20,760 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 08:41:20,760 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 08:41:20" (1/1) ... [2022-07-21 08:41:20,761 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a6279ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:41:20, skipping insertion in model container [2022-07-21 08:41:20,761 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 08:41:20" (1/1) ... [2022-07-21 08:41:20,766 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 08:41:20,789 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 08:41:20,885 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/mix036.oepc.i[945,958] [2022-07-21 08:41:21,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 08:41:21,068 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 08:41:21,080 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/mix036.oepc.i[945,958] [2022-07-21 08:41:21,135 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 08:41:21,172 INFO L208 MainTranslator]: Completed translation [2022-07-21 08:41:21,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:41:21 WrapperNode [2022-07-21 08:41:21,173 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 08:41:21,174 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 08:41:21,174 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 08:41:21,174 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 08:41:21,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:41:21" (1/1) ... [2022-07-21 08:41:21,205 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:41:21" (1/1) ... [2022-07-21 08:41:21,232 INFO L137 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 195 [2022-07-21 08:41:21,232 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 08:41:21,233 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 08:41:21,233 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 08:41:21,233 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 08:41:21,238 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:41:21" (1/1) ... [2022-07-21 08:41:21,239 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:41:21" (1/1) ... [2022-07-21 08:41:21,251 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:41:21" (1/1) ... [2022-07-21 08:41:21,251 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:41:21" (1/1) ... [2022-07-21 08:41:21,262 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:41:21" (1/1) ... [2022-07-21 08:41:21,275 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:41:21" (1/1) ... [2022-07-21 08:41:21,281 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:41:21" (1/1) ... [2022-07-21 08:41:21,287 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 08:41:21,291 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 08:41:21,291 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 08:41:21,291 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 08:41:21,292 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:41:21" (1/1) ... [2022-07-21 08:41:21,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 08:41:21,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:41:21,329 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-21 08:41:21,344 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-21 08:41:21,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 08:41:21,361 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-21 08:41:21,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 08:41:21,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 08:41:21,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 08:41:21,361 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-07-21 08:41:21,362 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-07-21 08:41:21,362 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-07-21 08:41:21,362 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-07-21 08:41:21,362 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-07-21 08:41:21,362 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-07-21 08:41:21,362 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-07-21 08:41:21,362 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-07-21 08:41:21,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 08:41:21,362 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-21 08:41:21,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 08:41:21,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 08:41:21,364 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-21 08:41:21,451 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 08:41:21,453 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 08:41:21,921 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 08:41:22,139 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 08:41:22,140 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-21 08:41:22,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 08:41:22 BoogieIcfgContainer [2022-07-21 08:41:22,142 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 08:41:22,143 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 08:41:22,143 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 08:41:22,145 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 08:41:22,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 08:41:20" (1/3) ... [2022-07-21 08:41:22,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46f964cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 08:41:22, skipping insertion in model container [2022-07-21 08:41:22,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:41:21" (2/3) ... [2022-07-21 08:41:22,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46f964cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 08:41:22, skipping insertion in model container [2022-07-21 08:41:22,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 08:41:22" (3/3) ... [2022-07-21 08:41:22,147 INFO L111 eAbstractionObserver]: Analyzing ICFG mix036.oepc.i [2022-07-21 08:41:22,151 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-21 08:41:22,157 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 08:41:22,157 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-21 08:41:22,157 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-21 08:41:22,227 INFO L135 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-07-21 08:41:22,265 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 152 places, 141 transitions, 302 flow [2022-07-21 08:41:22,314 INFO L129 PetriNetUnfolder]: 2/137 cut-off events. [2022-07-21 08:41:22,314 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-21 08:41:22,319 INFO L84 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 137 events. 2/137 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 77 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2022-07-21 08:41:22,319 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 141 transitions, 302 flow [2022-07-21 08:41:22,325 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 137 transitions, 286 flow [2022-07-21 08:41:22,336 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 08:41:22,342 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@4a6b09c3, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@11417b09 [2022-07-21 08:41:22,342 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-07-21 08:41:22,356 INFO L129 PetriNetUnfolder]: 0/53 cut-off events. [2022-07-21 08:41:22,356 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-21 08:41:22,357 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:41:22,358 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] [2022-07-21 08:41:22,358 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-21 08:41:22,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:41:22,363 INFO L85 PathProgramCache]: Analyzing trace with hash -947019558, now seen corresponding path program 1 times [2022-07-21 08:41:22,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:41:22,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641058795] [2022-07-21 08:41:22,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:41:22,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:41:22,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:41:22,585 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-21 08:41:22,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:41:22,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641058795] [2022-07-21 08:41:22,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641058795] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:41:22,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:41:22,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 08:41:22,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142650003] [2022-07-21 08:41:22,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:41:22,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 08:41:22,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:41:22,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 08:41:22,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 08:41:22,613 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 141 [2022-07-21 08:41:22,615 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 137 transitions, 286 flow. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 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-21 08:41:22,616 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:41:22,616 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 141 [2022-07-21 08:41:22,617 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:41:22,773 INFO L129 PetriNetUnfolder]: 162/551 cut-off events. [2022-07-21 08:41:22,773 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-07-21 08:41:22,776 INFO L84 FinitePrefix]: Finished finitePrefix Result has 857 conditions, 551 events. 162/551 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2850 event pairs, 34 based on Foata normal form. 53/575 useless extension candidates. Maximal degree in co-relation 797. Up to 191 conditions per place. [2022-07-21 08:41:22,779 INFO L132 encePairwiseOnDemand]: 136/141 looper letters, 18 selfloop transitions, 2 changer transitions 0/141 dead transitions. [2022-07-21 08:41:22,779 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 141 transitions, 343 flow [2022-07-21 08:41:22,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 08:41:22,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-21 08:41:22,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 400 transitions. [2022-07-21 08:41:22,790 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9456264775413712 [2022-07-21 08:41:22,790 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 400 transitions. [2022-07-21 08:41:22,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 400 transitions. [2022-07-21 08:41:22,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:41:22,793 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 400 transitions. [2022-07-21 08:41:22,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 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-21 08:41:22,800 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 0 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-21 08:41:22,801 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 0 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-21 08:41:22,802 INFO L186 Difference]: Start difference. First operand has 148 places, 137 transitions, 286 flow. Second operand 3 states and 400 transitions. [2022-07-21 08:41:22,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 141 transitions, 343 flow [2022-07-21 08:41:22,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 141 transitions, 336 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-07-21 08:41:22,807 INFO L242 Difference]: Finished difference. Result has 144 places, 133 transitions, 278 flow [2022-07-21 08:41:22,809 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=278, PETRI_PLACES=144, PETRI_TRANSITIONS=133} [2022-07-21 08:41:22,811 INFO L279 CegarLoopForPetriNet]: 148 programPoint places, -4 predicate places. [2022-07-21 08:41:22,812 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 133 transitions, 278 flow [2022-07-21 08:41:22,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 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-21 08:41:22,812 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:41:22,812 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] [2022-07-21 08:41:22,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 08:41:22,813 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-21 08:41:22,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:41:22,813 INFO L85 PathProgramCache]: Analyzing trace with hash 487594024, now seen corresponding path program 1 times [2022-07-21 08:41:22,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:41:22,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537350374] [2022-07-21 08:41:22,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:41:22,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:41:22,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:41:23,069 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-21 08:41:23,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:41:23,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537350374] [2022-07-21 08:41:23,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537350374] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:41:23,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:41:23,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 08:41:23,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603687444] [2022-07-21 08:41:23,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:41:23,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 08:41:23,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:41:23,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 08:41:23,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-21 08:41:23,074 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 141 [2022-07-21 08:41:23,075 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 133 transitions, 278 flow. Second operand has 7 states, 7 states have (on average 112.28571428571429) internal successors, (786), 7 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:41:23,075 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:41:23,075 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 141 [2022-07-21 08:41:23,075 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:41:24,528 INFO L129 PetriNetUnfolder]: 4482/10316 cut-off events. [2022-07-21 08:41:24,528 INFO L130 PetriNetUnfolder]: For 427/427 co-relation queries the response was YES. [2022-07-21 08:41:24,553 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17049 conditions, 10316 events. 4482/10316 cut-off events. For 427/427 co-relation queries the response was YES. Maximal size of possible extension queue 487. Compared 94637 event pairs, 642 based on Foata normal form. 0/10127 useless extension candidates. Maximal degree in co-relation 16986. Up to 3208 conditions per place. [2022-07-21 08:41:24,577 INFO L132 encePairwiseOnDemand]: 135/141 looper letters, 32 selfloop transitions, 2 changer transitions 74/201 dead transitions. [2022-07-21 08:41:24,578 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 201 transitions, 618 flow [2022-07-21 08:41:24,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 08:41:24,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-21 08:41:24,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1087 transitions. [2022-07-21 08:41:24,581 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8565799842395587 [2022-07-21 08:41:24,582 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1087 transitions. [2022-07-21 08:41:24,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1087 transitions. [2022-07-21 08:41:24,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:41:24,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1087 transitions. [2022-07-21 08:41:24,585 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 120.77777777777777) internal successors, (1087), 9 states have internal predecessors, (1087), 0 states have call successors, (0), 0 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-21 08:41:24,587 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 141.0) internal successors, (1410), 10 states have internal predecessors, (1410), 0 states have call successors, (0), 0 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-21 08:41:24,588 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 141.0) internal successors, (1410), 10 states have internal predecessors, (1410), 0 states have call successors, (0), 0 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-21 08:41:24,588 INFO L186 Difference]: Start difference. First operand has 144 places, 133 transitions, 278 flow. Second operand 9 states and 1087 transitions. [2022-07-21 08:41:24,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 201 transitions, 618 flow [2022-07-21 08:41:24,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 201 transitions, 600 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-21 08:41:24,592 INFO L242 Difference]: Finished difference. Result has 157 places, 119 transitions, 266 flow [2022-07-21 08:41:24,593 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=266, PETRI_PLACES=157, PETRI_TRANSITIONS=119} [2022-07-21 08:41:24,593 INFO L279 CegarLoopForPetriNet]: 148 programPoint places, 9 predicate places. [2022-07-21 08:41:24,593 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 119 transitions, 266 flow [2022-07-21 08:41:24,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.28571428571429) internal successors, (786), 7 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:41:24,594 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:41:24,594 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] [2022-07-21 08:41:24,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 08:41:24,595 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-21 08:41:24,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:41:24,595 INFO L85 PathProgramCache]: Analyzing trace with hash 66080678, now seen corresponding path program 1 times [2022-07-21 08:41:24,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:41:24,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340997429] [2022-07-21 08:41:24,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:41:24,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:41:24,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:41:24,724 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-21 08:41:24,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:41:24,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340997429] [2022-07-21 08:41:24,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340997429] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:41:24,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:41:24,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 08:41:24,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850527142] [2022-07-21 08:41:24,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:41:24,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 08:41:24,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:41:24,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 08:41:24,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 08:41:24,727 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 141 [2022-07-21 08:41:24,728 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 119 transitions, 266 flow. Second operand has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 0 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-21 08:41:24,728 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:41:24,728 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 141 [2022-07-21 08:41:24,728 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:41:25,689 INFO L129 PetriNetUnfolder]: 4140/7475 cut-off events. [2022-07-21 08:41:25,689 INFO L130 PetriNetUnfolder]: For 325/325 co-relation queries the response was YES. [2022-07-21 08:41:25,706 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14164 conditions, 7475 events. 4140/7475 cut-off events. For 325/325 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 57270 event pairs, 187 based on Foata normal form. 0/7338 useless extension candidates. Maximal degree in co-relation 14098. Up to 2233 conditions per place. [2022-07-21 08:41:25,723 INFO L132 encePairwiseOnDemand]: 130/141 looper letters, 38 selfloop transitions, 7 changer transitions 60/201 dead transitions. [2022-07-21 08:41:25,723 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 201 transitions, 646 flow [2022-07-21 08:41:25,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 08:41:25,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-21 08:41:25,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1247 transitions. [2022-07-21 08:41:25,726 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8843971631205674 [2022-07-21 08:41:25,726 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1247 transitions. [2022-07-21 08:41:25,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1247 transitions. [2022-07-21 08:41:25,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:41:25,727 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1247 transitions. [2022-07-21 08:41:25,729 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 124.7) internal successors, (1247), 10 states have internal predecessors, (1247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:41:25,731 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 141.0) internal successors, (1551), 11 states have internal predecessors, (1551), 0 states have call successors, (0), 0 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-21 08:41:25,732 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 141.0) internal successors, (1551), 11 states have internal predecessors, (1551), 0 states have call successors, (0), 0 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-21 08:41:25,732 INFO L186 Difference]: Start difference. First operand has 157 places, 119 transitions, 266 flow. Second operand 10 states and 1247 transitions. [2022-07-21 08:41:25,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 201 transitions, 646 flow [2022-07-21 08:41:25,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 201 transitions, 630 flow, removed 6 selfloop flow, removed 8 redundant places. [2022-07-21 08:41:25,747 INFO L242 Difference]: Finished difference. Result has 144 places, 122 transitions, 316 flow [2022-07-21 08:41:25,748 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=316, PETRI_PLACES=144, PETRI_TRANSITIONS=122} [2022-07-21 08:41:25,748 INFO L279 CegarLoopForPetriNet]: 148 programPoint places, -4 predicate places. [2022-07-21 08:41:25,748 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 122 transitions, 316 flow [2022-07-21 08:41:25,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 0 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-21 08:41:25,749 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:41:25,749 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, 1] [2022-07-21 08:41:25,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 08:41:25,749 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-21 08:41:25,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:41:25,750 INFO L85 PathProgramCache]: Analyzing trace with hash -328790990, now seen corresponding path program 1 times [2022-07-21 08:41:25,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:41:25,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243824906] [2022-07-21 08:41:25,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:41:25,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:41:25,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:41:25,882 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-21 08:41:25,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:41:25,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243824906] [2022-07-21 08:41:25,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243824906] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:41:25,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:41:25,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 08:41:25,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907166031] [2022-07-21 08:41:25,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:41:25,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 08:41:25,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:41:25,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 08:41:25,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-21 08:41:25,885 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 141 [2022-07-21 08:41:25,886 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 122 transitions, 316 flow. Second operand has 7 states, 7 states have (on average 116.14285714285714) internal successors, (813), 7 states have internal predecessors, (813), 0 states have call successors, (0), 0 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-21 08:41:25,886 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:41:25,886 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 141 [2022-07-21 08:41:25,886 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:41:26,449 INFO L129 PetriNetUnfolder]: 1872/3837 cut-off events. [2022-07-21 08:41:26,450 INFO L130 PetriNetUnfolder]: For 3694/3742 co-relation queries the response was YES. [2022-07-21 08:41:26,462 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10183 conditions, 3837 events. 1872/3837 cut-off events. For 3694/3742 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 28484 event pairs, 80 based on Foata normal form. 108/3921 useless extension candidates. Maximal degree in co-relation 10116. Up to 1002 conditions per place. [2022-07-21 08:41:26,473 INFO L132 encePairwiseOnDemand]: 131/141 looper letters, 46 selfloop transitions, 11 changer transitions 47/200 dead transitions. [2022-07-21 08:41:26,474 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 200 transitions, 853 flow [2022-07-21 08:41:26,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 08:41:26,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-21 08:41:26,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1246 transitions. [2022-07-21 08:41:26,476 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8836879432624114 [2022-07-21 08:41:26,476 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1246 transitions. [2022-07-21 08:41:26,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1246 transitions. [2022-07-21 08:41:26,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:41:26,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1246 transitions. [2022-07-21 08:41:26,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 124.6) internal successors, (1246), 10 states have internal predecessors, (1246), 0 states have call successors, (0), 0 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-21 08:41:26,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 141.0) internal successors, (1551), 11 states have internal predecessors, (1551), 0 states have call successors, (0), 0 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-21 08:41:26,481 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 141.0) internal successors, (1551), 11 states have internal predecessors, (1551), 0 states have call successors, (0), 0 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-21 08:41:26,481 INFO L186 Difference]: Start difference. First operand has 144 places, 122 transitions, 316 flow. Second operand 10 states and 1246 transitions. [2022-07-21 08:41:26,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 200 transitions, 853 flow [2022-07-21 08:41:26,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 200 transitions, 828 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-07-21 08:41:26,492 INFO L242 Difference]: Finished difference. Result has 148 places, 126 transitions, 404 flow [2022-07-21 08:41:26,493 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=404, PETRI_PLACES=148, PETRI_TRANSITIONS=126} [2022-07-21 08:41:26,493 INFO L279 CegarLoopForPetriNet]: 148 programPoint places, 0 predicate places. [2022-07-21 08:41:26,493 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 126 transitions, 404 flow [2022-07-21 08:41:26,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.14285714285714) internal successors, (813), 7 states have internal predecessors, (813), 0 states have call successors, (0), 0 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-21 08:41:26,494 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:41:26,494 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, 1, 1, 1, 1, 1, 1] [2022-07-21 08:41:26,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 08:41:26,494 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-21 08:41:26,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:41:26,495 INFO L85 PathProgramCache]: Analyzing trace with hash 550197853, now seen corresponding path program 1 times [2022-07-21 08:41:26,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:41:26,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337295859] [2022-07-21 08:41:26,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:41:26,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:41:26,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:41:26,618 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-21 08:41:26,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:41:26,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337295859] [2022-07-21 08:41:26,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337295859] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:41:26,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:41:26,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 08:41:26,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526164132] [2022-07-21 08:41:26,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:41:26,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 08:41:26,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:41:26,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 08:41:26,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:41:26,621 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 141 [2022-07-21 08:41:26,622 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 126 transitions, 404 flow. Second operand has 8 states, 8 states have (on average 116.25) internal successors, (930), 8 states have internal predecessors, (930), 0 states have call successors, (0), 0 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-21 08:41:26,622 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:41:26,622 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 141 [2022-07-21 08:41:26,622 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:41:27,125 INFO L129 PetriNetUnfolder]: 745/1764 cut-off events. [2022-07-21 08:41:27,125 INFO L130 PetriNetUnfolder]: For 3983/3995 co-relation queries the response was YES. [2022-07-21 08:41:27,144 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5460 conditions, 1764 events. 745/1764 cut-off events. For 3983/3995 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 11787 event pairs, 78 based on Foata normal form. 48/1791 useless extension candidates. Maximal degree in co-relation 5389. Up to 429 conditions per place. [2022-07-21 08:41:27,161 INFO L132 encePairwiseOnDemand]: 131/141 looper letters, 53 selfloop transitions, 15 changer transitions 47/211 dead transitions. [2022-07-21 08:41:27,161 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 211 transitions, 1132 flow [2022-07-21 08:41:27,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 08:41:27,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-07-21 08:41:27,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1371 transitions. [2022-07-21 08:41:27,169 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8839458413926499 [2022-07-21 08:41:27,174 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1371 transitions. [2022-07-21 08:41:27,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1371 transitions. [2022-07-21 08:41:27,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:41:27,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1371 transitions. [2022-07-21 08:41:27,181 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 124.63636363636364) internal successors, (1371), 11 states have internal predecessors, (1371), 0 states have call successors, (0), 0 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-21 08:41:27,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 141.0) internal successors, (1692), 12 states have internal predecessors, (1692), 0 states have call successors, (0), 0 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-21 08:41:27,187 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 141.0) internal successors, (1692), 12 states have internal predecessors, (1692), 0 states have call successors, (0), 0 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-21 08:41:27,187 INFO L186 Difference]: Start difference. First operand has 148 places, 126 transitions, 404 flow. Second operand 11 states and 1371 transitions. [2022-07-21 08:41:27,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 211 transitions, 1132 flow [2022-07-21 08:41:27,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 211 transitions, 952 flow, removed 79 selfloop flow, removed 9 redundant places. [2022-07-21 08:41:27,231 INFO L242 Difference]: Finished difference. Result has 151 places, 130 transitions, 454 flow [2022-07-21 08:41:27,231 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=454, PETRI_PLACES=151, PETRI_TRANSITIONS=130} [2022-07-21 08:41:27,234 INFO L279 CegarLoopForPetriNet]: 148 programPoint places, 3 predicate places. [2022-07-21 08:41:27,234 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 130 transitions, 454 flow [2022-07-21 08:41:27,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 116.25) internal successors, (930), 8 states have internal predecessors, (930), 0 states have call successors, (0), 0 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-21 08:41:27,235 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:41:27,241 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:41:27,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 08:41:27,242 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-21 08:41:27,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:41:27,244 INFO L85 PathProgramCache]: Analyzing trace with hash -503644966, now seen corresponding path program 1 times [2022-07-21 08:41:27,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:41:27,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330025406] [2022-07-21 08:41:27,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:41:27,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:41:27,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:41:27,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-21 08:41:27,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:41:27,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330025406] [2022-07-21 08:41:27,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330025406] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:41:27,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:41:27,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 08:41:27,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107067195] [2022-07-21 08:41:27,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:41:27,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 08:41:27,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:41:27,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 08:41:27,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 08:41:27,491 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 141 [2022-07-21 08:41:27,492 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 130 transitions, 454 flow. Second operand has 7 states, 7 states have (on average 117.85714285714286) internal successors, (825), 7 states have internal predecessors, (825), 0 states have call successors, (0), 0 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-21 08:41:27,492 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:41:27,492 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 141 [2022-07-21 08:41:27,493 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:41:27,828 INFO L129 PetriNetUnfolder]: 434/1503 cut-off events. [2022-07-21 08:41:27,828 INFO L130 PetriNetUnfolder]: For 2126/2344 co-relation queries the response was YES. [2022-07-21 08:41:27,835 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3688 conditions, 1503 events. 434/1503 cut-off events. For 2126/2344 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 10607 event pairs, 51 based on Foata normal form. 55/1503 useless extension candidates. Maximal degree in co-relation 3615. Up to 310 conditions per place. [2022-07-21 08:41:27,841 INFO L132 encePairwiseOnDemand]: 135/141 looper letters, 44 selfloop transitions, 2 changer transitions 20/175 dead transitions. [2022-07-21 08:41:27,841 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 175 transitions, 688 flow [2022-07-21 08:41:27,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 08:41:27,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-21 08:41:27,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 872 transitions. [2022-07-21 08:41:27,844 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8834853090172239 [2022-07-21 08:41:27,845 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 872 transitions. [2022-07-21 08:41:27,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 872 transitions. [2022-07-21 08:41:27,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:41:27,845 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 872 transitions. [2022-07-21 08:41:27,847 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.57142857142857) internal successors, (872), 7 states have internal predecessors, (872), 0 states have call successors, (0), 0 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-21 08:41:27,848 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 141.0) internal successors, (1128), 8 states have internal predecessors, (1128), 0 states have call successors, (0), 0 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-21 08:41:27,849 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 141.0) internal successors, (1128), 8 states have internal predecessors, (1128), 0 states have call successors, (0), 0 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-21 08:41:27,849 INFO L186 Difference]: Start difference. First operand has 151 places, 130 transitions, 454 flow. Second operand 7 states and 872 transitions. [2022-07-21 08:41:27,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 175 transitions, 688 flow [2022-07-21 08:41:27,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 175 transitions, 603 flow, removed 29 selfloop flow, removed 10 redundant places. [2022-07-21 08:41:27,860 INFO L242 Difference]: Finished difference. Result has 148 places, 131 transitions, 388 flow [2022-07-21 08:41:27,861 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=369, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=388, PETRI_PLACES=148, PETRI_TRANSITIONS=131} [2022-07-21 08:41:27,861 INFO L279 CegarLoopForPetriNet]: 148 programPoint places, 0 predicate places. [2022-07-21 08:41:27,861 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 131 transitions, 388 flow [2022-07-21 08:41:27,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 117.85714285714286) internal successors, (825), 7 states have internal predecessors, (825), 0 states have call successors, (0), 0 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-21 08:41:27,862 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:41:27,862 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:41:27,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 08:41:27,863 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-21 08:41:27,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:41:27,863 INFO L85 PathProgramCache]: Analyzing trace with hash 202033076, now seen corresponding path program 2 times [2022-07-21 08:41:27,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:41:27,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685780717] [2022-07-21 08:41:27,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:41:27,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:41:27,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:41:27,989 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-21 08:41:27,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:41:27,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685780717] [2022-07-21 08:41:27,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685780717] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:41:27,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:41:27,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 08:41:27,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759613784] [2022-07-21 08:41:27,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:41:27,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 08:41:27,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:41:27,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 08:41:27,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-21 08:41:27,992 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 141 [2022-07-21 08:41:27,993 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 131 transitions, 388 flow. Second operand has 9 states, 9 states have (on average 116.22222222222223) internal successors, (1046), 9 states have internal predecessors, (1046), 0 states have call successors, (0), 0 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-21 08:41:27,994 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:41:27,994 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 141 [2022-07-21 08:41:27,994 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:41:28,409 INFO L129 PetriNetUnfolder]: 682/1730 cut-off events. [2022-07-21 08:41:28,410 INFO L130 PetriNetUnfolder]: For 992/992 co-relation queries the response was YES. [2022-07-21 08:41:28,417 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4065 conditions, 1730 events. 682/1730 cut-off events. For 992/992 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 12305 event pairs, 120 based on Foata normal form. 21/1699 useless extension candidates. Maximal degree in co-relation 4048. Up to 383 conditions per place. [2022-07-21 08:41:28,421 INFO L132 encePairwiseOnDemand]: 131/141 looper letters, 38 selfloop transitions, 19 changer transitions 28/182 dead transitions. [2022-07-21 08:41:28,421 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 182 transitions, 769 flow [2022-07-21 08:41:28,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 08:41:28,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-07-21 08:41:28,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1455 transitions. [2022-07-21 08:41:28,425 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8599290780141844 [2022-07-21 08:41:28,425 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1455 transitions. [2022-07-21 08:41:28,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1455 transitions. [2022-07-21 08:41:28,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:41:28,426 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1455 transitions. [2022-07-21 08:41:28,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 121.25) internal successors, (1455), 12 states have internal predecessors, (1455), 0 states have call successors, (0), 0 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-21 08:41:28,431 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 141.0) internal successors, (1833), 13 states have internal predecessors, (1833), 0 states have call successors, (0), 0 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-21 08:41:28,431 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 141.0) internal successors, (1833), 13 states have internal predecessors, (1833), 0 states have call successors, (0), 0 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-21 08:41:28,431 INFO L186 Difference]: Start difference. First operand has 148 places, 131 transitions, 388 flow. Second operand 12 states and 1455 transitions. [2022-07-21 08:41:28,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 182 transitions, 769 flow [2022-07-21 08:41:28,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 182 transitions, 734 flow, removed 16 selfloop flow, removed 5 redundant places. [2022-07-21 08:41:28,442 INFO L242 Difference]: Finished difference. Result has 157 places, 131 transitions, 432 flow [2022-07-21 08:41:28,442 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=369, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=432, PETRI_PLACES=157, PETRI_TRANSITIONS=131} [2022-07-21 08:41:28,443 INFO L279 CegarLoopForPetriNet]: 148 programPoint places, 9 predicate places. [2022-07-21 08:41:28,443 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 131 transitions, 432 flow [2022-07-21 08:41:28,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 116.22222222222223) internal successors, (1046), 9 states have internal predecessors, (1046), 0 states have call successors, (0), 0 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-21 08:41:28,444 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:41:28,444 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:41:28,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 08:41:28,444 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-21 08:41:28,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:41:28,445 INFO L85 PathProgramCache]: Analyzing trace with hash -46537160, now seen corresponding path program 1 times [2022-07-21 08:41:28,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:41:28,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132775217] [2022-07-21 08:41:28,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:41:28,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:41:28,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:41:28,578 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-21 08:41:28,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:41:28,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132775217] [2022-07-21 08:41:28,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132775217] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:41:28,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:41:28,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 08:41:28,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222305844] [2022-07-21 08:41:28,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:41:28,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 08:41:28,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:41:28,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 08:41:28,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 08:41:28,581 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 141 [2022-07-21 08:41:28,582 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 131 transitions, 432 flow. Second operand has 7 states, 7 states have (on average 112.0) internal successors, (784), 7 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-21 08:41:28,582 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:41:28,582 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 141 [2022-07-21 08:41:28,582 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:41:28,987 INFO L129 PetriNetUnfolder]: 1125/2995 cut-off events. [2022-07-21 08:41:28,988 INFO L130 PetriNetUnfolder]: For 2003/2212 co-relation queries the response was YES. [2022-07-21 08:41:28,999 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6799 conditions, 2995 events. 1125/2995 cut-off events. For 2003/2212 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 24328 event pairs, 197 based on Foata normal form. 1/2911 useless extension candidates. Maximal degree in co-relation 6732. Up to 747 conditions per place. [2022-07-21 08:41:29,003 INFO L132 encePairwiseOnDemand]: 129/141 looper letters, 37 selfloop transitions, 9 changer transitions 6/154 dead transitions. [2022-07-21 08:41:29,004 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 154 transitions, 596 flow [2022-07-21 08:41:29,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 08:41:29,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-07-21 08:41:29,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 914 transitions. [2022-07-21 08:41:29,006 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8102836879432624 [2022-07-21 08:41:29,006 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 914 transitions. [2022-07-21 08:41:29,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 914 transitions. [2022-07-21 08:41:29,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:41:29,006 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 914 transitions. [2022-07-21 08:41:29,008 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 114.25) internal successors, (914), 8 states have internal predecessors, (914), 0 states have call successors, (0), 0 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-21 08:41:29,009 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 141.0) internal successors, (1269), 9 states have internal predecessors, (1269), 0 states have call successors, (0), 0 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-21 08:41:29,010 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 141.0) internal successors, (1269), 9 states have internal predecessors, (1269), 0 states have call successors, (0), 0 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-21 08:41:29,010 INFO L186 Difference]: Start difference. First operand has 157 places, 131 transitions, 432 flow. Second operand 8 states and 914 transitions. [2022-07-21 08:41:29,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 154 transitions, 596 flow [2022-07-21 08:41:29,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 154 transitions, 478 flow, removed 27 selfloop flow, removed 17 redundant places. [2022-07-21 08:41:29,029 INFO L242 Difference]: Finished difference. Result has 148 places, 137 transitions, 383 flow [2022-07-21 08:41:29,030 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=383, PETRI_PLACES=148, PETRI_TRANSITIONS=137} [2022-07-21 08:41:29,030 INFO L279 CegarLoopForPetriNet]: 148 programPoint places, 0 predicate places. [2022-07-21 08:41:29,030 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 137 transitions, 383 flow [2022-07-21 08:41:29,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.0) internal successors, (784), 7 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-21 08:41:29,031 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:41:29,031 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:41:29,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 08:41:29,031 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-21 08:41:29,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:41:29,032 INFO L85 PathProgramCache]: Analyzing trace with hash -848927624, now seen corresponding path program 2 times [2022-07-21 08:41:29,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:41:29,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379008170] [2022-07-21 08:41:29,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:41:29,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:41:29,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:41:29,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:41:29,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:41:29,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379008170] [2022-07-21 08:41:29,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379008170] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:41:29,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:41:29,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 08:41:29,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816187422] [2022-07-21 08:41:29,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:41:29,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 08:41:29,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:41:29,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 08:41:29,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:41:29,142 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 141 [2022-07-21 08:41:29,142 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 137 transitions, 383 flow. Second operand has 8 states, 8 states have (on average 111.5) internal successors, (892), 8 states have internal predecessors, (892), 0 states have call successors, (0), 0 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-21 08:41:29,143 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:41:29,143 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 141 [2022-07-21 08:41:29,143 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:41:29,688 INFO L129 PetriNetUnfolder]: 1920/5309 cut-off events. [2022-07-21 08:41:29,688 INFO L130 PetriNetUnfolder]: For 1617/1638 co-relation queries the response was YES. [2022-07-21 08:41:29,709 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10650 conditions, 5309 events. 1920/5309 cut-off events. For 1617/1638 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 50756 event pairs, 334 based on Foata normal form. 2/5139 useless extension candidates. Maximal degree in co-relation 10636. Up to 1144 conditions per place. [2022-07-21 08:41:29,715 INFO L132 encePairwiseOnDemand]: 133/141 looper letters, 36 selfloop transitions, 5 changer transitions 23/166 dead transitions. [2022-07-21 08:41:29,715 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 166 transitions, 629 flow [2022-07-21 08:41:29,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 08:41:29,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-07-21 08:41:29,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 917 transitions. [2022-07-21 08:41:29,718 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8129432624113475 [2022-07-21 08:41:29,718 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 917 transitions. [2022-07-21 08:41:29,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 917 transitions. [2022-07-21 08:41:29,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:41:29,718 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 917 transitions. [2022-07-21 08:41:29,720 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 114.625) internal successors, (917), 8 states have internal predecessors, (917), 0 states have call successors, (0), 0 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-21 08:41:29,721 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 141.0) internal successors, (1269), 9 states have internal predecessors, (1269), 0 states have call successors, (0), 0 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-21 08:41:29,722 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 141.0) internal successors, (1269), 9 states have internal predecessors, (1269), 0 states have call successors, (0), 0 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-21 08:41:29,722 INFO L186 Difference]: Start difference. First operand has 148 places, 137 transitions, 383 flow. Second operand 8 states and 917 transitions. [2022-07-21 08:41:29,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 166 transitions, 629 flow [2022-07-21 08:41:29,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 166 transitions, 614 flow, removed 5 selfloop flow, removed 5 redundant places. [2022-07-21 08:41:29,727 INFO L242 Difference]: Finished difference. Result has 152 places, 135 transitions, 375 flow [2022-07-21 08:41:29,728 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=375, PETRI_PLACES=152, PETRI_TRANSITIONS=135} [2022-07-21 08:41:29,728 INFO L279 CegarLoopForPetriNet]: 148 programPoint places, 4 predicate places. [2022-07-21 08:41:29,728 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 135 transitions, 375 flow [2022-07-21 08:41:29,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 111.5) internal successors, (892), 8 states have internal predecessors, (892), 0 states have call successors, (0), 0 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-21 08:41:29,729 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:41:29,729 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:41:29,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 08:41:29,730 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-21 08:41:29,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:41:29,730 INFO L85 PathProgramCache]: Analyzing trace with hash 671495662, now seen corresponding path program 3 times [2022-07-21 08:41:29,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:41:29,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073007091] [2022-07-21 08:41:29,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:41:29,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:41:29,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:41:29,925 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-21 08:41:29,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:41:29,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073007091] [2022-07-21 08:41:29,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073007091] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:41:29,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:41:29,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-21 08:41:29,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532851070] [2022-07-21 08:41:29,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:41:29,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-21 08:41:29,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:41:29,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-21 08:41:29,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-07-21 08:41:29,928 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 141 [2022-07-21 08:41:29,929 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 135 transitions, 375 flow. Second operand has 13 states, 13 states have (on average 110.15384615384616) internal successors, (1432), 13 states have internal predecessors, (1432), 0 states have call successors, (0), 0 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-21 08:41:29,929 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:41:29,929 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 141 [2022-07-21 08:41:29,929 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:41:30,447 INFO L129 PetriNetUnfolder]: 824/3089 cut-off events. [2022-07-21 08:41:30,447 INFO L130 PetriNetUnfolder]: For 272/289 co-relation queries the response was YES. [2022-07-21 08:41:30,458 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5291 conditions, 3089 events. 824/3089 cut-off events. For 272/289 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 30502 event pairs, 141 based on Foata normal form. 1/2921 useless extension candidates. Maximal degree in co-relation 5275. Up to 442 conditions per place. [2022-07-21 08:41:30,462 INFO L132 encePairwiseOnDemand]: 130/141 looper letters, 37 selfloop transitions, 8 changer transitions 8/159 dead transitions. [2022-07-21 08:41:30,462 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 159 transitions, 563 flow [2022-07-21 08:41:30,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 08:41:30,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-07-21 08:41:30,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1347 transitions. [2022-07-21 08:41:30,465 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7960992907801419 [2022-07-21 08:41:30,465 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1347 transitions. [2022-07-21 08:41:30,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1347 transitions. [2022-07-21 08:41:30,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:41:30,466 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1347 transitions. [2022-07-21 08:41:30,468 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 112.25) internal successors, (1347), 12 states have internal predecessors, (1347), 0 states have call successors, (0), 0 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-21 08:41:30,470 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 141.0) internal successors, (1833), 13 states have internal predecessors, (1833), 0 states have call successors, (0), 0 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-21 08:41:30,470 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 141.0) internal successors, (1833), 13 states have internal predecessors, (1833), 0 states have call successors, (0), 0 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-21 08:41:30,471 INFO L186 Difference]: Start difference. First operand has 152 places, 135 transitions, 375 flow. Second operand 12 states and 1347 transitions. [2022-07-21 08:41:30,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 159 transitions, 563 flow [2022-07-21 08:41:30,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 159 transitions, 544 flow, removed 7 selfloop flow, removed 6 redundant places. [2022-07-21 08:41:30,474 INFO L242 Difference]: Finished difference. Result has 158 places, 137 transitions, 404 flow [2022-07-21 08:41:30,475 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=404, PETRI_PLACES=158, PETRI_TRANSITIONS=137} [2022-07-21 08:41:30,475 INFO L279 CegarLoopForPetriNet]: 148 programPoint places, 10 predicate places. [2022-07-21 08:41:30,475 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 137 transitions, 404 flow [2022-07-21 08:41:30,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 110.15384615384616) internal successors, (1432), 13 states have internal predecessors, (1432), 0 states have call successors, (0), 0 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-21 08:41:30,476 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:41:30,476 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:41:30,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-21 08:41:30,476 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-21 08:41:30,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:41:30,477 INFO L85 PathProgramCache]: Analyzing trace with hash -354630498, now seen corresponding path program 4 times [2022-07-21 08:41:30,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:41:30,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078774744] [2022-07-21 08:41:30,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:41:30,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:41:30,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 08:41:30,513 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-21 08:41:30,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 08:41:30,600 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-21 08:41:30,601 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-21 08:41:30,602 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-07-21 08:41:30,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-07-21 08:41:30,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-07-21 08:41:30,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-07-21 08:41:30,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-07-21 08:41:30,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-07-21 08:41:30,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-07-21 08:41:30,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-21 08:41:30,605 INFO L356 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1] [2022-07-21 08:41:30,610 INFO L226 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-07-21 08:41:30,610 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 08:41:30,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 08:41:30 BasicIcfg [2022-07-21 08:41:30,738 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 08:41:30,738 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 08:41:30,738 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 08:41:30,739 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 08:41:30,739 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 08:41:22" (3/4) ... [2022-07-21 08:41:30,740 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-21 08:41:30,821 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-21 08:41:30,821 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 08:41:30,822 INFO L158 Benchmark]: Toolchain (without parser) took 10065.75ms. Allocated memory was 58.7MB in the beginning and 1.0GB in the end (delta: 950.0MB). Free memory was 35.5MB in the beginning and 586.1MB in the end (delta: -550.6MB). Peak memory consumption was 398.4MB. Max. memory is 16.1GB. [2022-07-21 08:41:30,822 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 58.7MB. Free memory was 40.4MB in the beginning and 40.3MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 08:41:30,822 INFO L158 Benchmark]: CACSL2BoogieTranslator took 416.69ms. Allocated memory was 58.7MB in the beginning and 77.6MB in the end (delta: 18.9MB). Free memory was 35.3MB in the beginning and 47.1MB in the end (delta: -11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-21 08:41:30,823 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.23ms. Allocated memory is still 77.6MB. Free memory was 47.1MB in the beginning and 44.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 08:41:30,823 INFO L158 Benchmark]: Boogie Preprocessor took 57.41ms. Allocated memory is still 77.6MB. Free memory was 44.5MB in the beginning and 42.2MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-21 08:41:30,823 INFO L158 Benchmark]: RCFGBuilder took 850.96ms. Allocated memory was 77.6MB in the beginning and 96.5MB in the end (delta: 18.9MB). Free memory was 42.0MB in the beginning and 50.4MB in the end (delta: -8.5MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. [2022-07-21 08:41:30,823 INFO L158 Benchmark]: TraceAbstraction took 8595.32ms. Allocated memory was 96.5MB in the beginning and 1.0GB in the end (delta: 912.3MB). Free memory was 49.9MB in the beginning and 640.8MB in the end (delta: -590.9MB). Peak memory consumption was 321.3MB. Max. memory is 16.1GB. [2022-07-21 08:41:30,824 INFO L158 Benchmark]: Witness Printer took 83.12ms. Allocated memory is still 1.0GB. Free memory was 640.8MB in the beginning and 586.1MB in the end (delta: 54.7MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. [2022-07-21 08:41:30,825 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.15ms. Allocated memory is still 58.7MB. Free memory was 40.4MB in the beginning and 40.3MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 416.69ms. Allocated memory was 58.7MB in the beginning and 77.6MB in the end (delta: 18.9MB). Free memory was 35.3MB in the beginning and 47.1MB in the end (delta: -11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.23ms. Allocated memory is still 77.6MB. Free memory was 47.1MB in the beginning and 44.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.41ms. Allocated memory is still 77.6MB. Free memory was 44.5MB in the beginning and 42.2MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 850.96ms. Allocated memory was 77.6MB in the beginning and 96.5MB in the end (delta: 18.9MB). Free memory was 42.0MB in the beginning and 50.4MB in the end (delta: -8.5MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. * TraceAbstraction took 8595.32ms. Allocated memory was 96.5MB in the beginning and 1.0GB in the end (delta: 912.3MB). Free memory was 49.9MB in the beginning and 640.8MB in the end (delta: -590.9MB). Peak memory consumption was 321.3MB. Max. memory is 16.1GB. * Witness Printer took 83.12ms. Allocated memory is still 1.0GB. Free memory was 640.8MB in the beginning and 586.1MB in the end (delta: 54.7MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L716] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L718] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0] [L720] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L722] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L724] 0 int b = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0] [L725] 0 _Bool b$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0] [L726] 0 int b$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0] [L727] 0 _Bool b$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0] [L728] 0 _Bool b$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0] [L729] 0 _Bool b$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0] [L730] 0 _Bool b$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0] [L731] 0 _Bool b$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0] [L732] 0 _Bool b$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0] [L733] 0 _Bool b$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0] [L734] 0 _Bool b$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0] [L735] 0 _Bool b$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0] [L736] 0 _Bool b$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0] [L737] 0 _Bool b$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0] [L738] 0 int *b$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}] [L739] 0 int b$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0] [L740] 0 _Bool b$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0] [L741] 0 int b$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0] [L742] 0 _Bool b$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0] [L743] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0] [L744] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0] [L746] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L748] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L750] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L751] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0] [L752] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t937; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t937={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L874] FCALL, FORK 0 pthread_create(&t937, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t937, ((void *)0), P0, ((void *)0))=-3, t937={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t938; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t937={5:0}, t938={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L876] FCALL, FORK 0 pthread_create(&t938, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t938, ((void *)0), P1, ((void *)0))=-2, t937={5:0}, t938={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L756] 1 b$w_buff1 = b$w_buff0 [L757] 1 b$w_buff0 = 1 [L758] 1 b$w_buff1_used = b$w_buff0_used [L759] 1 b$w_buff0_used = (_Bool)1 [L760] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L760] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L761] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L762] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L763] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L764] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L765] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L766] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L769] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L786] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L789] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L877] 0 pthread_t t939; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t937={5:0}, t938={6:0}, t939={7:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L878] FCALL, FORK 0 pthread_create(&t939, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t939, ((void *)0), P2, ((void *)0))=-1, t937={5:0}, t938={6:0}, t939={7:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L806] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L809] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L879] 0 pthread_t t940; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t937={5:0}, t938={6:0}, t939={7:0}, t940={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L880] FCALL, FORK 0 pthread_create(&t940, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t940, ((void *)0), P3, ((void *)0))=0, t937={5:0}, t938={6:0}, t939={7:0}, t940={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L826] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L829] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L832] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L835] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L836] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L837] 4 b$flush_delayed = weak$$choice2 [L838] 4 b$mem_tmp = b [L839] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L839] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L840] EXPR 4 weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L840] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L841] EXPR 4 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L841] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L842] EXPR 4 weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L842] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L843] EXPR 4 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L843] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] EXPR 4 weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L844] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L845] EXPR 4 weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L845] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L846] 4 __unbuffered_p3_EBX = b [L847] EXPR 4 b$flush_delayed ? b$mem_tmp : b [L847] 4 b = b$flush_delayed ? b$mem_tmp : b [L848] 4 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, z=1] [L792] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L792] EXPR 2 b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b [L792] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L792] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L793] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L793] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L794] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L794] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L795] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L795] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L796] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L796] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L812] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L812] EXPR 3 b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b [L812] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L812] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L813] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L813] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L814] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L814] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L815] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L815] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L816] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L816] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L851] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L851] EXPR 4 b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b [L851] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L851] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L852] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L852] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L853] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L853] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L854] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L854] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L855] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 [L855] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 [L772] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L772] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L773] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L773] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L774] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L774] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L775] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L775] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L776] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L776] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, z=1] [L819] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, z=1] [L858] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, z=1] [L882] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, t937={5:0}, t938={6:0}, t939={7:0}, t940={3:0}, weak$$choice0=3, weak$$choice2=1, x=1, y=1, z=1] [L884] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, z=1] [L884] RET 0 assume_abort_if_not(main$tmp_guard0) [L886] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L886] EXPR 0 b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b [L886] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L886] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L887] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L887] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L888] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L888] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L889] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L889] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L890] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 [L890] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 [L893] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, t937={5:0}, t938={6:0}, t939={7:0}, t940={3:0}, weak$$choice0=3, weak$$choice2=1, x=1, y=1, z=1] [L895] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 876]: 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: 878]: 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: 880]: 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: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 179 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.3s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 656 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 656 mSDsluCounter, 567 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1237 mSDsCounter, 147 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1644 IncrementalHoareTripleChecker+Invalid, 1791 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 147 mSolverCounterUnsat, 117 mSDtfsCounter, 1644 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=454occurred in iteration=5, InterpolantAutomatonStates: 90, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1077 NumberOfCodeBlocks, 1077 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 957 ConstructedInterpolants, 0 QuantifiedInterpolants, 4791 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-21 08:41:30,855 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