./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.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 ea86164637dd5d5bd9745ca8d3f5dc708b98bc3f75b645830d494ea6e5cae6ff --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 21:07:16,349 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 21:07:16,351 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 21:07:16,387 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 21:07:16,387 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 21:07:16,388 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 21:07:16,390 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 21:07:16,392 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 21:07:16,393 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 21:07:16,396 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 21:07:16,397 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 21:07:16,398 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 21:07:16,399 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 21:07:16,400 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 21:07:16,401 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 21:07:16,403 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 21:07:16,404 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 21:07:16,405 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 21:07:16,406 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 21:07:16,410 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 21:07:16,411 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 21:07:16,412 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 21:07:16,412 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 21:07:16,413 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 21:07:16,414 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 21:07:16,419 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 21:07:16,420 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 21:07:16,420 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 21:07:16,421 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 21:07:16,421 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 21:07:16,422 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 21:07:16,423 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 21:07:16,424 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 21:07:16,424 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 21:07:16,425 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 21:07:16,425 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 21:07:16,425 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 21:07:16,426 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 21:07:16,426 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 21:07:16,426 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 21:07:16,427 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 21:07:16,428 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 21:07:16,429 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 21:07:16,449 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 21:07:16,450 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 21:07:16,450 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 21:07:16,450 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 21:07:16,451 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 21:07:16,451 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 21:07:16,451 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 21:07:16,451 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 21:07:16,451 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 21:07:16,452 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 21:07:16,452 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 21:07:16,452 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 21:07:16,453 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 21:07:16,453 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 21:07:16,453 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 21:07:16,453 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 21:07:16,453 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 21:07:16,453 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 21:07:16,453 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 21:07:16,454 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 21:07:16,454 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 21:07:16,454 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 21:07:16,455 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 21:07:16,455 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 21:07:16,455 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 21:07:16,455 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 21:07:16,455 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 21:07:16,455 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 21:07:16,455 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 21:07:16,456 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 21:07:16,456 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 21:07:16,456 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 21:07:16,456 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 21:07:16,456 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 -> ea86164637dd5d5bd9745ca8d3f5dc708b98bc3f75b645830d494ea6e5cae6ff [2022-07-19 21:07:16,658 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 21:07:16,674 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 21:07:16,676 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 21:07:16,676 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 21:07:16,677 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 21:07:16,678 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2022-07-19 21:07:16,716 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01db4e82f/ab5d4386f6bd4a53be70bdbf7d3833fc/FLAGa43dc7eac [2022-07-19 21:07:17,109 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 21:07:17,109 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2022-07-19 21:07:17,125 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01db4e82f/ab5d4386f6bd4a53be70bdbf7d3833fc/FLAGa43dc7eac [2022-07-19 21:07:17,133 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01db4e82f/ab5d4386f6bd4a53be70bdbf7d3833fc [2022-07-19 21:07:17,135 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 21:07:17,136 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 21:07:17,148 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 21:07:17,148 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 21:07:17,150 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 21:07:17,150 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 09:07:17" (1/1) ... [2022-07-19 21:07:17,151 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@608577f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:07:17, skipping insertion in model container [2022-07-19 21:07:17,151 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 09:07:17" (1/1) ... [2022-07-19 21:07:17,155 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 21:07:17,202 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 21:07:17,305 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/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i[996,1009] [2022-07-19 21:07:17,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 21:07:17,440 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 21:07:17,454 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/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i[996,1009] [2022-07-19 21:07:17,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 21:07:17,531 INFO L208 MainTranslator]: Completed translation [2022-07-19 21:07:17,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:07:17 WrapperNode [2022-07-19 21:07:17,532 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 21:07:17,533 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 21:07:17,533 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 21:07:17,533 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 21:07:17,538 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:07:17" (1/1) ... [2022-07-19 21:07:17,559 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:07:17" (1/1) ... [2022-07-19 21:07:17,591 INFO L137 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 177 [2022-07-19 21:07:17,592 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 21:07:17,594 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 21:07:17,594 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 21:07:17,594 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 21:07:17,599 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:07:17" (1/1) ... [2022-07-19 21:07:17,600 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:07:17" (1/1) ... [2022-07-19 21:07:17,613 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:07:17" (1/1) ... [2022-07-19 21:07:17,616 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:07:17" (1/1) ... [2022-07-19 21:07:17,621 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:07:17" (1/1) ... [2022-07-19 21:07:17,623 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:07:17" (1/1) ... [2022-07-19 21:07:17,625 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:07:17" (1/1) ... [2022-07-19 21:07:17,628 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 21:07:17,628 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 21:07:17,628 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 21:07:17,629 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 21:07:17,629 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:07:17" (1/1) ... [2022-07-19 21:07:17,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 21:07:17,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:07:17,665 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 21:07:17,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 21:07:17,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 21:07:17,693 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-19 21:07:17,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 21:07:17,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 21:07:17,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 21:07:17,694 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-07-19 21:07:17,694 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-07-19 21:07:17,694 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-07-19 21:07:17,694 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-07-19 21:07:17,694 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-07-19 21:07:17,694 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-07-19 21:07:17,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 21:07:17,694 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-19 21:07:17,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 21:07:17,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 21:07:17,696 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-19 21:07:17,815 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 21:07:17,816 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 21:07:18,212 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 21:07:18,532 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 21:07:18,532 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-19 21:07:18,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:07:18 BoogieIcfgContainer [2022-07-19 21:07:18,534 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 21:07:18,536 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 21:07:18,536 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 21:07:18,539 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 21:07:18,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 09:07:17" (1/3) ... [2022-07-19 21:07:18,539 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bc7e902 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 09:07:18, skipping insertion in model container [2022-07-19 21:07:18,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:07:17" (2/3) ... [2022-07-19 21:07:18,540 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bc7e902 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 09:07:18, skipping insertion in model container [2022-07-19 21:07:18,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:07:18" (3/3) ... [2022-07-19 21:07:18,541 INFO L111 eAbstractionObserver]: Analyzing ICFG mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2022-07-19 21:07:18,545 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-19 21:07:18,551 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 21:07:18,552 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-19 21:07:18,552 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-19 21:07:18,599 INFO L135 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-07-19 21:07:18,645 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 125 places, 117 transitions, 249 flow [2022-07-19 21:07:18,698 INFO L129 PetriNetUnfolder]: 2/114 cut-off events. [2022-07-19 21:07:18,698 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-19 21:07:18,701 INFO L84 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2022-07-19 21:07:18,701 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 117 transitions, 249 flow [2022-07-19 21:07:18,704 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 114 transitions, 237 flow [2022-07-19 21:07:18,710 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 21:07:18,715 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@432e9a16, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@d58b168 [2022-07-19 21:07:18,715 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-07-19 21:07:18,721 INFO L129 PetriNetUnfolder]: 0/46 cut-off events. [2022-07-19 21:07:18,721 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-19 21:07:18,721 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:07:18,722 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] [2022-07-19 21:07:18,722 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-19 21:07:18,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:07:18,726 INFO L85 PathProgramCache]: Analyzing trace with hash -438048260, now seen corresponding path program 1 times [2022-07-19 21:07:18,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:07:18,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159033263] [2022-07-19 21:07:18,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:07:18,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:07:18,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:07:18,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:07:18,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:07:18,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159033263] [2022-07-19 21:07:18,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159033263] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:07:18,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:07:18,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 21:07:18,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199311493] [2022-07-19 21:07:18,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:07:18,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 21:07:18,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:07:18,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 21:07:18,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 21:07:18,988 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 117 [2022-07-19 21:07:18,991 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 114 transitions, 237 flow. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:07:18,992 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:07:18,992 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 117 [2022-07-19 21:07:18,993 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:07:19,137 INFO L129 PetriNetUnfolder]: 58/278 cut-off events. [2022-07-19 21:07:19,138 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-07-19 21:07:19,140 INFO L84 FinitePrefix]: Finished finitePrefix Result has 407 conditions, 278 events. 58/278 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1112 event pairs, 10 based on Foata normal form. 20/280 useless extension candidates. Maximal degree in co-relation 354. Up to 79 conditions per place. [2022-07-19 21:07:19,143 INFO L132 encePairwiseOnDemand]: 112/117 looper letters, 14 selfloop transitions, 2 changer transitions 0/116 dead transitions. [2022-07-19 21:07:19,144 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 116 transitions, 279 flow [2022-07-19 21:07:19,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 21:07:19,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-19 21:07:19,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 330 transitions. [2022-07-19 21:07:19,174 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9401709401709402 [2022-07-19 21:07:19,175 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 330 transitions. [2022-07-19 21:07:19,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 330 transitions. [2022-07-19 21:07:19,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:07:19,180 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 330 transitions. [2022-07-19 21:07:19,200 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:07:19,206 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:07:19,206 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:07:19,208 INFO L186 Difference]: Start difference. First operand has 122 places, 114 transitions, 237 flow. Second operand 3 states and 330 transitions. [2022-07-19 21:07:19,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 116 transitions, 279 flow [2022-07-19 21:07:19,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 116 transitions, 274 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-07-19 21:07:19,225 INFO L242 Difference]: Finished difference. Result has 119 places, 110 transitions, 230 flow [2022-07-19 21:07:19,227 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=230, PETRI_PLACES=119, PETRI_TRANSITIONS=110} [2022-07-19 21:07:19,230 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -3 predicate places. [2022-07-19 21:07:19,230 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 110 transitions, 230 flow [2022-07-19 21:07:19,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:07:19,231 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:07:19,231 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] [2022-07-19 21:07:19,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 21:07:19,232 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-19 21:07:19,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:07:19,234 INFO L85 PathProgramCache]: Analyzing trace with hash 975051986, now seen corresponding path program 1 times [2022-07-19 21:07:19,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:07:19,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920485437] [2022-07-19 21:07:19,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:07:19,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:07:19,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:07:19,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:07:19,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:07:19,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920485437] [2022-07-19 21:07:19,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920485437] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:07:19,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:07:19,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 21:07:19,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159086912] [2022-07-19 21:07:19,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:07:19,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 21:07:19,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:07:19,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 21:07:19,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-19 21:07:19,497 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 117 [2022-07-19 21:07:19,497 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 110 transitions, 230 flow. Second operand has 7 states, 7 states have (on average 91.0) internal successors, (637), 7 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:07:19,497 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:07:19,501 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 117 [2022-07-19 21:07:19,501 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:07:20,355 INFO L129 PetriNetUnfolder]: 1856/4539 cut-off events. [2022-07-19 21:07:20,356 INFO L130 PetriNetUnfolder]: For 241/241 co-relation queries the response was YES. [2022-07-19 21:07:20,366 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7643 conditions, 4539 events. 1856/4539 cut-off events. For 241/241 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 37593 event pairs, 257 based on Foata normal form. 0/4414 useless extension candidates. Maximal degree in co-relation 7587. Up to 894 conditions per place. [2022-07-19 21:07:20,376 INFO L132 encePairwiseOnDemand]: 108/117 looper letters, 35 selfloop transitions, 5 changer transitions 87/202 dead transitions. [2022-07-19 21:07:20,376 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 202 transitions, 668 flow [2022-07-19 21:07:20,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 21:07:20,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-19 21:07:20,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1276 transitions. [2022-07-19 21:07:20,380 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8389217619986851 [2022-07-19 21:07:20,381 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1276 transitions. [2022-07-19 21:07:20,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1276 transitions. [2022-07-19 21:07:20,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:07:20,381 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1276 transitions. [2022-07-19 21:07:20,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 98.15384615384616) internal successors, (1276), 13 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:07:20,387 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:07:20,388 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:07:20,388 INFO L186 Difference]: Start difference. First operand has 119 places, 110 transitions, 230 flow. Second operand 13 states and 1276 transitions. [2022-07-19 21:07:20,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 202 transitions, 668 flow [2022-07-19 21:07:20,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 202 transitions, 642 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-19 21:07:20,393 INFO L242 Difference]: Finished difference. Result has 141 places, 101 transitions, 274 flow [2022-07-19 21:07:20,393 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=274, PETRI_PLACES=141, PETRI_TRANSITIONS=101} [2022-07-19 21:07:20,394 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 19 predicate places. [2022-07-19 21:07:20,394 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 101 transitions, 274 flow [2022-07-19 21:07:20,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.0) internal successors, (637), 7 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:07:20,395 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:07:20,395 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] [2022-07-19 21:07:20,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 21:07:20,395 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-19 21:07:20,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:07:20,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1032499181, now seen corresponding path program 1 times [2022-07-19 21:07:20,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:07:20,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939736726] [2022-07-19 21:07:20,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:07:20,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:07:20,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:07:20,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:07:20,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:07:20,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939736726] [2022-07-19 21:07:20,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939736726] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:07:20,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:07:20,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 21:07:20,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645937497] [2022-07-19 21:07:20,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:07:20,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 21:07:20,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:07:20,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 21:07:20,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 21:07:20,512 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 117 [2022-07-19 21:07:20,512 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 101 transitions, 274 flow. Second operand has 6 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:07:20,513 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:07:20,513 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 117 [2022-07-19 21:07:20,513 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:07:21,197 INFO L129 PetriNetUnfolder]: 2421/4657 cut-off events. [2022-07-19 21:07:21,198 INFO L130 PetriNetUnfolder]: For 3855/4136 co-relation queries the response was YES. [2022-07-19 21:07:21,210 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10480 conditions, 4657 events. 2421/4657 cut-off events. For 3855/4136 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 34791 event pairs, 205 based on Foata normal form. 14/4422 useless extension candidates. Maximal degree in co-relation 10415. Up to 1249 conditions per place. [2022-07-19 21:07:21,221 INFO L132 encePairwiseOnDemand]: 107/117 looper letters, 62 selfloop transitions, 15 changer transitions 18/175 dead transitions. [2022-07-19 21:07:21,222 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 175 transitions, 700 flow [2022-07-19 21:07:21,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 21:07:21,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-19 21:07:21,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1019 transitions. [2022-07-19 21:07:21,225 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.870940170940171 [2022-07-19 21:07:21,225 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1019 transitions. [2022-07-19 21:07:21,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1019 transitions. [2022-07-19 21:07:21,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:07:21,226 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1019 transitions. [2022-07-19 21:07:21,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 101.9) internal successors, (1019), 10 states have internal predecessors, (1019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:07:21,229 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 117.0) internal successors, (1287), 11 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:07:21,230 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 117.0) internal successors, (1287), 11 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:07:21,230 INFO L186 Difference]: Start difference. First operand has 141 places, 101 transitions, 274 flow. Second operand 10 states and 1019 transitions. [2022-07-19 21:07:21,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 175 transitions, 700 flow [2022-07-19 21:07:21,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 175 transitions, 686 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-07-19 21:07:21,243 INFO L242 Difference]: Finished difference. Result has 131 places, 114 transitions, 369 flow [2022-07-19 21:07:21,243 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=369, PETRI_PLACES=131, PETRI_TRANSITIONS=114} [2022-07-19 21:07:21,245 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 9 predicate places. [2022-07-19 21:07:21,245 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 114 transitions, 369 flow [2022-07-19 21:07:21,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:07:21,245 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:07:21,246 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] [2022-07-19 21:07:21,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 21:07:21,246 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-19 21:07:21,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:07:21,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1269110767, now seen corresponding path program 1 times [2022-07-19 21:07:21,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:07:21,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062387308] [2022-07-19 21:07:21,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:07:21,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:07:21,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:07:21,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:07:21,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:07:21,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062387308] [2022-07-19 21:07:21,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062387308] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:07:21,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:07:21,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 21:07:21,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620479288] [2022-07-19 21:07:21,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:07:21,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 21:07:21,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:07:21,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 21:07:21,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-19 21:07:21,443 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 117 [2022-07-19 21:07:21,443 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 114 transitions, 369 flow. Second operand has 7 states, 7 states have (on average 95.0) internal successors, (665), 7 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:07:21,443 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:07:21,443 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 117 [2022-07-19 21:07:21,444 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:07:22,131 INFO L129 PetriNetUnfolder]: 2139/4266 cut-off events. [2022-07-19 21:07:22,131 INFO L130 PetriNetUnfolder]: For 6429/6711 co-relation queries the response was YES. [2022-07-19 21:07:22,146 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12322 conditions, 4266 events. 2139/4266 cut-off events. For 6429/6711 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 33297 event pairs, 165 based on Foata normal form. 95/4210 useless extension candidates. Maximal degree in co-relation 12252. Up to 683 conditions per place. [2022-07-19 21:07:22,154 INFO L132 encePairwiseOnDemand]: 107/117 looper letters, 68 selfloop transitions, 28 changer transitions 36/212 dead transitions. [2022-07-19 21:07:22,154 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 212 transitions, 1109 flow [2022-07-19 21:07:22,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 21:07:22,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-19 21:07:22,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1326 transitions. [2022-07-19 21:07:22,158 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8717948717948718 [2022-07-19 21:07:22,158 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1326 transitions. [2022-07-19 21:07:22,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1326 transitions. [2022-07-19 21:07:22,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:07:22,159 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1326 transitions. [2022-07-19 21:07:22,161 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 102.0) internal successors, (1326), 13 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:07:22,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:07:22,163 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:07:22,163 INFO L186 Difference]: Start difference. First operand has 131 places, 114 transitions, 369 flow. Second operand 13 states and 1326 transitions. [2022-07-19 21:07:22,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 212 transitions, 1109 flow [2022-07-19 21:07:22,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 212 transitions, 1101 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-07-19 21:07:22,183 INFO L242 Difference]: Finished difference. Result has 145 places, 131 transitions, 587 flow [2022-07-19 21:07:22,184 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=587, PETRI_PLACES=145, PETRI_TRANSITIONS=131} [2022-07-19 21:07:22,184 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 23 predicate places. [2022-07-19 21:07:22,184 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 131 transitions, 587 flow [2022-07-19 21:07:22,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.0) internal successors, (665), 7 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:07:22,185 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:07:22,185 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:07:22,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 21:07:22,186 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-19 21:07:22,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:07:22,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1085821204, now seen corresponding path program 1 times [2022-07-19 21:07:22,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:07:22,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370070164] [2022-07-19 21:07:22,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:07:22,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:07:22,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:07:22,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:07:22,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:07:22,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370070164] [2022-07-19 21:07:22,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370070164] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:07:22,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:07:22,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-19 21:07:22,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182896814] [2022-07-19 21:07:22,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:07:22,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 21:07:22,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:07:22,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 21:07:22,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-19 21:07:22,380 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 117 [2022-07-19 21:07:22,381 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 131 transitions, 587 flow. Second operand has 9 states, 9 states have (on average 92.33333333333333) internal successors, (831), 9 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:07:22,381 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:07:22,381 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 117 [2022-07-19 21:07:22,381 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:07:22,823 INFO L129 PetriNetUnfolder]: 565/2614 cut-off events. [2022-07-19 21:07:22,823 INFO L130 PetriNetUnfolder]: For 6388/7214 co-relation queries the response was YES. [2022-07-19 21:07:22,837 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8134 conditions, 2614 events. 565/2614 cut-off events. For 6388/7214 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 28010 event pairs, 29 based on Foata normal form. 17/2508 useless extension candidates. Maximal degree in co-relation 8053. Up to 568 conditions per place. [2022-07-19 21:07:22,844 INFO L132 encePairwiseOnDemand]: 107/117 looper letters, 40 selfloop transitions, 8 changer transitions 16/172 dead transitions. [2022-07-19 21:07:22,844 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 172 transitions, 857 flow [2022-07-19 21:07:22,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 21:07:22,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-19 21:07:22,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 962 transitions. [2022-07-19 21:07:22,846 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8222222222222222 [2022-07-19 21:07:22,846 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 962 transitions. [2022-07-19 21:07:22,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 962 transitions. [2022-07-19 21:07:22,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:07:22,847 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 962 transitions. [2022-07-19 21:07:22,848 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 96.2) internal successors, (962), 10 states have internal predecessors, (962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:07:22,849 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 117.0) internal successors, (1287), 11 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:07:22,850 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 117.0) internal successors, (1287), 11 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:07:22,850 INFO L186 Difference]: Start difference. First operand has 145 places, 131 transitions, 587 flow. Second operand 10 states and 962 transitions. [2022-07-19 21:07:22,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 172 transitions, 857 flow [2022-07-19 21:07:22,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 172 transitions, 797 flow, removed 23 selfloop flow, removed 4 redundant places. [2022-07-19 21:07:22,893 INFO L242 Difference]: Finished difference. Result has 156 places, 137 transitions, 589 flow [2022-07-19 21:07:22,893 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=527, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=589, PETRI_PLACES=156, PETRI_TRANSITIONS=137} [2022-07-19 21:07:22,894 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 34 predicate places. [2022-07-19 21:07:22,894 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 137 transitions, 589 flow [2022-07-19 21:07:22,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 92.33333333333333) internal successors, (831), 9 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:07:22,895 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:07:22,895 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:07:22,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 21:07:22,895 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-19 21:07:22,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:07:22,896 INFO L85 PathProgramCache]: Analyzing trace with hash 704080436, now seen corresponding path program 2 times [2022-07-19 21:07:22,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:07:22,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328377292] [2022-07-19 21:07:22,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:07:22,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:07:22,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:07:22,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:07:22,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:07:22,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328377292] [2022-07-19 21:07:22,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328377292] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:07:22,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:07:22,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 21:07:22,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17862353] [2022-07-19 21:07:22,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:07:22,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 21:07:22,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:07:22,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 21:07:22,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-19 21:07:23,000 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 117 [2022-07-19 21:07:23,001 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 137 transitions, 589 flow. Second operand has 8 states, 8 states have (on average 95.125) internal successors, (761), 8 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:07:23,001 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:07:23,001 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 117 [2022-07-19 21:07:23,001 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:07:23,869 INFO L129 PetriNetUnfolder]: 2761/6051 cut-off events. [2022-07-19 21:07:23,869 INFO L130 PetriNetUnfolder]: For 15085/15690 co-relation queries the response was YES. [2022-07-19 21:07:23,895 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20956 conditions, 6051 events. 2761/6051 cut-off events. For 15085/15690 co-relation queries the response was YES. Maximal size of possible extension queue 554. Compared 56015 event pairs, 132 based on Foata normal form. 107/6011 useless extension candidates. Maximal degree in co-relation 20925. Up to 822 conditions per place. [2022-07-19 21:07:23,907 INFO L132 encePairwiseOnDemand]: 107/117 looper letters, 69 selfloop transitions, 32 changer transitions 58/239 dead transitions. [2022-07-19 21:07:23,907 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 239 transitions, 1573 flow [2022-07-19 21:07:23,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-19 21:07:23,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-07-19 21:07:23,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1592 transitions. [2022-07-19 21:07:23,911 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8504273504273504 [2022-07-19 21:07:23,911 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1592 transitions. [2022-07-19 21:07:23,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1592 transitions. [2022-07-19 21:07:23,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:07:23,912 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1592 transitions. [2022-07-19 21:07:23,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 99.5) internal successors, (1592), 16 states have internal predecessors, (1592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:07:23,980 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 117.0) internal successors, (1989), 17 states have internal predecessors, (1989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:07:23,980 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 117.0) internal successors, (1989), 17 states have internal predecessors, (1989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:07:23,980 INFO L186 Difference]: Start difference. First operand has 156 places, 137 transitions, 589 flow. Second operand 16 states and 1592 transitions. [2022-07-19 21:07:23,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 239 transitions, 1573 flow [2022-07-19 21:07:24,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 239 transitions, 1500 flow, removed 35 selfloop flow, removed 6 redundant places. [2022-07-19 21:07:24,048 INFO L242 Difference]: Finished difference. Result has 168 places, 136 transitions, 658 flow [2022-07-19 21:07:24,049 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=559, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=658, PETRI_PLACES=168, PETRI_TRANSITIONS=136} [2022-07-19 21:07:24,049 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 46 predicate places. [2022-07-19 21:07:24,050 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 136 transitions, 658 flow [2022-07-19 21:07:24,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 95.125) internal successors, (761), 8 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:07:24,050 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:07:24,050 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] [2022-07-19 21:07:24,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 21:07:24,051 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-19 21:07:24,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:07:24,051 INFO L85 PathProgramCache]: Analyzing trace with hash 885956177, now seen corresponding path program 1 times [2022-07-19 21:07:24,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:07:24,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495379103] [2022-07-19 21:07:24,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:07:24,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:07:24,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:07:24,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:07:24,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:07:24,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495379103] [2022-07-19 21:07:24,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495379103] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:07:24,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:07:24,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 21:07:24,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151774044] [2022-07-19 21:07:24,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:07:24,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 21:07:24,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:07:24,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 21:07:24,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 21:07:24,168 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 117 [2022-07-19 21:07:24,168 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 136 transitions, 658 flow. Second operand has 7 states, 7 states have (on average 90.57142857142857) internal successors, (634), 7 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:07:24,168 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:07:24,168 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 117 [2022-07-19 21:07:24,169 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:07:24,552 INFO L129 PetriNetUnfolder]: 584/2741 cut-off events. [2022-07-19 21:07:24,552 INFO L130 PetriNetUnfolder]: For 7152/7475 co-relation queries the response was YES. [2022-07-19 21:07:24,569 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8926 conditions, 2741 events. 584/2741 cut-off events. For 7152/7475 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 31272 event pairs, 11 based on Foata normal form. 1/2593 useless extension candidates. Maximal degree in co-relation 8837. Up to 345 conditions per place. [2022-07-19 21:07:24,578 INFO L132 encePairwiseOnDemand]: 104/117 looper letters, 46 selfloop transitions, 14 changer transitions 6/170 dead transitions. [2022-07-19 21:07:24,578 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 170 transitions, 954 flow [2022-07-19 21:07:24,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 21:07:24,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-07-19 21:07:24,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 751 transitions. [2022-07-19 21:07:24,580 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8023504273504274 [2022-07-19 21:07:24,580 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 751 transitions. [2022-07-19 21:07:24,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 751 transitions. [2022-07-19 21:07:24,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:07:24,581 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 751 transitions. [2022-07-19 21:07:24,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 93.875) internal successors, (751), 8 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:07:24,584 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 117.0) internal successors, (1053), 9 states have internal predecessors, (1053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:07:24,584 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 117.0) internal successors, (1053), 9 states have internal predecessors, (1053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:07:24,584 INFO L186 Difference]: Start difference. First operand has 168 places, 136 transitions, 658 flow. Second operand 8 states and 751 transitions. [2022-07-19 21:07:24,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 170 transitions, 954 flow [2022-07-19 21:07:24,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 170 transitions, 815 flow, removed 36 selfloop flow, removed 18 redundant places. [2022-07-19 21:07:24,651 INFO L242 Difference]: Finished difference. Result has 159 places, 145 transitions, 657 flow [2022-07-19 21:07:24,651 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=549, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=657, PETRI_PLACES=159, PETRI_TRANSITIONS=145} [2022-07-19 21:07:24,652 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 37 predicate places. [2022-07-19 21:07:24,652 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 145 transitions, 657 flow [2022-07-19 21:07:24,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.57142857142857) internal successors, (634), 7 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:07:24,653 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:07:24,653 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] [2022-07-19 21:07:24,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-19 21:07:24,653 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-19 21:07:24,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:07:24,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1321267555, now seen corresponding path program 2 times [2022-07-19 21:07:24,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:07:24,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250915541] [2022-07-19 21:07:24,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:07:24,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:07:24,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:07:24,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:07:24,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:07:24,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250915541] [2022-07-19 21:07:24,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250915541] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:07:24,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:07:24,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-19 21:07:24,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890304844] [2022-07-19 21:07:24,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:07:24,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 21:07:24,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:07:24,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 21:07:24,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-19 21:07:24,824 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 117 [2022-07-19 21:07:24,824 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 145 transitions, 657 flow. Second operand has 10 states, 10 states have (on average 85.9) internal successors, (859), 10 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:07:24,824 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:07:24,824 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 117 [2022-07-19 21:07:24,824 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:07:25,443 INFO L129 PetriNetUnfolder]: 875/4430 cut-off events. [2022-07-19 21:07:25,443 INFO L130 PetriNetUnfolder]: For 6233/6311 co-relation queries the response was YES. [2022-07-19 21:07:25,464 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12261 conditions, 4430 events. 875/4430 cut-off events. For 6233/6311 co-relation queries the response was YES. Maximal size of possible extension queue 580. Compared 56826 event pairs, 15 based on Foata normal form. 13/4225 useless extension candidates. Maximal degree in co-relation 12233. Up to 493 conditions per place. [2022-07-19 21:07:25,472 INFO L132 encePairwiseOnDemand]: 100/117 looper letters, 48 selfloop transitions, 34 changer transitions 26/209 dead transitions. [2022-07-19 21:07:25,472 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 209 transitions, 1242 flow [2022-07-19 21:07:25,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 21:07:25,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-07-19 21:07:25,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1075 transitions. [2022-07-19 21:07:25,475 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7656695156695157 [2022-07-19 21:07:25,475 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1075 transitions. [2022-07-19 21:07:25,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1075 transitions. [2022-07-19 21:07:25,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:07:25,475 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1075 transitions. [2022-07-19 21:07:25,477 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 89.58333333333333) internal successors, (1075), 12 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:07:25,479 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 117.0) internal successors, (1521), 13 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:07:25,479 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 117.0) internal successors, (1521), 13 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:07:25,479 INFO L186 Difference]: Start difference. First operand has 159 places, 145 transitions, 657 flow. Second operand 12 states and 1075 transitions. [2022-07-19 21:07:25,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 209 transitions, 1242 flow [2022-07-19 21:07:25,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 209 transitions, 1230 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-07-19 21:07:25,595 INFO L242 Difference]: Finished difference. Result has 172 places, 167 transitions, 946 flow [2022-07-19 21:07:25,596 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=649, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=946, PETRI_PLACES=172, PETRI_TRANSITIONS=167} [2022-07-19 21:07:25,596 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 50 predicate places. [2022-07-19 21:07:25,596 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 167 transitions, 946 flow [2022-07-19 21:07:25,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 85.9) internal successors, (859), 10 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:07:25,597 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:07:25,597 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] [2022-07-19 21:07:25,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 21:07:25,598 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-19 21:07:25,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:07:25,598 INFO L85 PathProgramCache]: Analyzing trace with hash -792802585, now seen corresponding path program 3 times [2022-07-19 21:07:25,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:07:25,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229196937] [2022-07-19 21:07:25,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:07:25,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:07:25,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 21:07:25,632 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-19 21:07:25,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 21:07:25,690 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-19 21:07:25,691 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-19 21:07:25,692 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-07-19 21:07:25,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-07-19 21:07:25,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-07-19 21:07:25,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-07-19 21:07:25,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-07-19 21:07:25,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-07-19 21:07:25,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-19 21:07:25,697 INFO L356 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1] [2022-07-19 21:07:25,707 INFO L226 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-07-19 21:07:25,707 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 21:07:25,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 09:07:25 BasicIcfg [2022-07-19 21:07:25,828 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 21:07:25,829 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 21:07:25,829 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 21:07:25,829 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 21:07:25,829 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:07:18" (3/4) ... [2022-07-19 21:07:25,831 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-19 21:07:25,925 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 21:07:25,925 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 21:07:25,926 INFO L158 Benchmark]: Toolchain (without parser) took 8790.17ms. Allocated memory was 86.0MB in the beginning and 935.3MB in the end (delta: 849.3MB). Free memory was 46.1MB in the beginning and 422.8MB in the end (delta: -376.8MB). Peak memory consumption was 472.9MB. Max. memory is 16.1GB. [2022-07-19 21:07:25,926 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 86.0MB. Free memory is still 64.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 21:07:25,927 INFO L158 Benchmark]: CACSL2BoogieTranslator took 384.37ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 45.9MB in the beginning and 68.1MB in the end (delta: -22.2MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. [2022-07-19 21:07:25,927 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.97ms. Allocated memory is still 104.9MB. Free memory was 68.1MB in the beginning and 65.5MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-19 21:07:25,927 INFO L158 Benchmark]: Boogie Preprocessor took 34.28ms. Allocated memory is still 104.9MB. Free memory was 65.5MB in the beginning and 63.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 21:07:25,927 INFO L158 Benchmark]: RCFGBuilder took 906.12ms. Allocated memory is still 104.9MB. Free memory was 63.5MB in the beginning and 74.4MB in the end (delta: -10.9MB). Peak memory consumption was 44.9MB. Max. memory is 16.1GB. [2022-07-19 21:07:25,927 INFO L158 Benchmark]: TraceAbstraction took 7292.17ms. Allocated memory was 104.9MB in the beginning and 935.3MB in the end (delta: 830.5MB). Free memory was 73.7MB in the beginning and 457.5MB in the end (delta: -383.7MB). Peak memory consumption was 446.5MB. Max. memory is 16.1GB. [2022-07-19 21:07:25,928 INFO L158 Benchmark]: Witness Printer took 96.70ms. Allocated memory is still 935.3MB. Free memory was 457.5MB in the beginning and 422.8MB in the end (delta: 34.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-07-19 21:07:25,929 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 86.0MB. Free memory is still 64.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 384.37ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 45.9MB in the beginning and 68.1MB in the end (delta: -22.2MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.97ms. Allocated memory is still 104.9MB. Free memory was 68.1MB in the beginning and 65.5MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.28ms. Allocated memory is still 104.9MB. Free memory was 65.5MB in the beginning and 63.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 906.12ms. Allocated memory is still 104.9MB. Free memory was 63.5MB in the beginning and 74.4MB in the end (delta: -10.9MB). Peak memory consumption was 44.9MB. Max. memory is 16.1GB. * TraceAbstraction took 7292.17ms. Allocated memory was 104.9MB in the beginning and 935.3MB in the end (delta: 830.5MB). Free memory was 73.7MB in the beginning and 457.5MB in the end (delta: -383.7MB). Peak memory consumption was 446.5MB. Max. memory is 16.1GB. * Witness Printer took 96.70ms. Allocated memory is still 935.3MB. Free memory was 457.5MB in the beginning and 422.8MB in the end (delta: 34.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0] [L715] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L716] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L717] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L719] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L721] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L723] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L724] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L725] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L726] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L727] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L728] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L729] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L730] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0] [L731] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L732] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L733] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L734] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L735] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L736] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L737] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L738] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L739] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L740] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L741] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t657; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t657={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] FCALL, FORK 0 pthread_create(&t657, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t657, ((void *)0), P0, ((void *)0))=-2, t657={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L745] 1 z$w_buff1 = z$w_buff0 [L746] 1 z$w_buff0 = 1 [L747] 1 z$w_buff1_used = z$w_buff0_used [L748] 1 z$w_buff0_used = (_Bool)1 [L749] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L749] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L750] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L751] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L752] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L753] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L754] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t658; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t657={5:0}, t658={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L841] FCALL, FORK 0 pthread_create(&t658, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t658, ((void *)0), P1, ((void *)0))=-1, t657={5:0}, t658={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L842] 0 pthread_t t659; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t657={5:0}, t658={6:0}, t659={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L843] FCALL, FORK 0 pthread_create(&t659, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t659, ((void *)0), P2, ((void *)0))=0, t657={5:0}, t658={6:0}, t659={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L780] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L780] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L781] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L782] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L782] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L783] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L783] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L784] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L784] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L794] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L801] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L802] 3 z$flush_delayed = weak$$choice2 [L803] 3 z$mem_tmp = z [L804] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L804] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L805] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L805] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0) [L805] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L805] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L806] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L806] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1) [L806] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L806] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L807] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L807] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used) [L807] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L807] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L808] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L808] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L809] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3) [L809] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L809] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L810] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L810] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L810] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L810] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 __unbuffered_p2_EBX = z [L812] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L812] 3 z = z$flush_delayed ? z$mem_tmp : z [L813] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L816] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L816] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L816] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L816] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L817] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L817] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L818] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L818] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L819] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L819] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L820] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L820] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L760] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L761] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L761] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L762] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L762] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L763] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L763] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L764] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L764] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L823] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t657={5:0}, t658={6:0}, t659={3:0}, weak$$choice0=66, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] RET 0 assume_abort_if_not(main$tmp_guard0) [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L849] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L849] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L850] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L851] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L851] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L852] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L852] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L853] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L853] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L856] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t657={5:0}, t658={6:0}, t659={3:0}, weak$$choice0=66, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 841]: 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: 839]: 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: 843]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 145 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.1s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 552 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 552 mSDsluCounter, 505 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 858 mSDsCounter, 118 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1187 IncrementalHoareTripleChecker+Invalid, 1305 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 118 mSolverCounterUnsat, 101 mSDtfsCounter, 1187 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 105 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=946occurred in iteration=8, InterpolantAutomatonStates: 85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 725 NumberOfCodeBlocks, 725 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 626 ConstructedInterpolants, 0 QuantifiedInterpolants, 3161 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-19 21:07:25,965 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