./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix002.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix002.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e77d530bbfcfe22638f8b89e94c23e25f591d8037158e571482779188378fc47 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 08:38:35,386 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 08:38:35,388 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 08:38:35,426 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 08:38:35,426 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 08:38:35,428 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 08:38:35,432 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 08:38:35,435 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 08:38:35,437 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 08:38:35,442 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 08:38:35,443 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 08:38:35,447 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 08:38:35,448 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 08:38:35,449 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 08:38:35,451 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 08:38:35,454 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 08:38:35,454 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 08:38:35,456 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 08:38:35,458 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 08:38:35,463 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 08:38:35,465 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 08:38:35,466 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 08:38:35,468 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 08:38:35,469 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 08:38:35,471 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 08:38:35,477 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 08:38:35,478 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 08:38:35,478 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 08:38:35,479 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 08:38:35,479 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 08:38:35,480 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 08:38:35,481 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 08:38:35,482 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 08:38:35,483 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 08:38:35,484 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 08:38:35,485 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 08:38:35,485 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 08:38:35,486 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 08:38:35,486 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 08:38:35,486 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 08:38:35,487 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 08:38:35,488 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 08:38:35,493 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 08:38:35,532 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 08:38:35,533 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 08:38:35,533 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 08:38:35,533 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 08:38:35,534 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 08:38:35,534 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 08:38:35,535 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 08:38:35,535 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 08:38:35,535 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 08:38:35,536 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 08:38:35,537 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 08:38:35,537 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 08:38:35,537 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 08:38:35,537 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 08:38:35,537 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 08:38:35,538 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 08:38:35,538 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 08:38:35,538 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 08:38:35,538 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 08:38:35,538 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 08:38:35,539 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 08:38:35,539 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 08:38:35,539 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 08:38:35,539 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 08:38:35,539 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 08:38:35,540 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 08:38:35,540 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 08:38:35,540 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 08:38:35,540 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 08:38:35,540 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 08:38:35,541 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 08:38:35,541 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 08:38:35,541 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 08:38:35,541 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 -> e77d530bbfcfe22638f8b89e94c23e25f591d8037158e571482779188378fc47 [2022-07-21 08:38:35,882 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 08:38:35,916 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 08:38:35,918 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 08:38:35,920 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 08:38:35,920 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 08:38:35,922 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix002.oepc.i [2022-07-21 08:38:35,985 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdc48aebf/d13ae6227bab45559a21f57b1c60f65e/FLAGb8afd10c6 [2022-07-21 08:38:36,570 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 08:38:36,570 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix002.oepc.i [2022-07-21 08:38:36,584 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdc48aebf/d13ae6227bab45559a21f57b1c60f65e/FLAGb8afd10c6 [2022-07-21 08:38:36,971 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdc48aebf/d13ae6227bab45559a21f57b1c60f65e [2022-07-21 08:38:36,973 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 08:38:36,974 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 08:38:36,975 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 08:38:36,975 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 08:38:36,982 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 08:38:36,982 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 08:38:36" (1/1) ... [2022-07-21 08:38:36,983 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f3e07be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:38:36, skipping insertion in model container [2022-07-21 08:38:36,984 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 08:38:36" (1/1) ... [2022-07-21 08:38:36,990 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 08:38:37,030 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 08:38:37,194 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/mix002.oepc.i[945,958] [2022-07-21 08:38:37,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 08:38:37,440 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 08:38:37,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/mix002.oepc.i[945,958] [2022-07-21 08:38:37,517 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 08:38:37,559 INFO L208 MainTranslator]: Completed translation [2022-07-21 08:38:37,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:38:37 WrapperNode [2022-07-21 08:38:37,561 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 08:38:37,562 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 08:38:37,562 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 08:38:37,562 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 08:38:37,572 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:38:37" (1/1) ... [2022-07-21 08:38:37,605 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:38:37" (1/1) ... [2022-07-21 08:38:37,637 INFO L137 Inliner]: procedures = 176, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 187 [2022-07-21 08:38:37,641 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 08:38:37,642 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 08:38:37,642 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 08:38:37,642 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 08:38:37,650 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:38:37" (1/1) ... [2022-07-21 08:38:37,650 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:38:37" (1/1) ... [2022-07-21 08:38:37,666 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:38:37" (1/1) ... [2022-07-21 08:38:37,666 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:38:37" (1/1) ... [2022-07-21 08:38:37,679 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:38:37" (1/1) ... [2022-07-21 08:38:37,689 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:38:37" (1/1) ... [2022-07-21 08:38:37,699 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:38:37" (1/1) ... [2022-07-21 08:38:37,702 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 08:38:37,709 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 08:38:37,709 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 08:38:37,709 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 08:38:37,710 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:38:37" (1/1) ... [2022-07-21 08:38:37,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 08:38:37,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:38:37,749 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-21 08:38:37,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-21 08:38:37,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 08:38:37,787 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-21 08:38:37,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 08:38:37,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 08:38:37,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 08:38:37,788 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-07-21 08:38:37,788 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-07-21 08:38:37,788 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-07-21 08:38:37,788 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-07-21 08:38:37,788 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-07-21 08:38:37,789 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-07-21 08:38:37,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 08:38:37,789 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-21 08:38:37,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 08:38:37,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 08:38:37,791 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-21 08:38:37,978 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 08:38:37,979 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 08:38:38,450 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 08:38:38,684 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 08:38:38,684 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-21 08:38:38,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 08:38:38 BoogieIcfgContainer [2022-07-21 08:38:38,687 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 08:38:38,688 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 08:38:38,688 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 08:38:38,691 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 08:38:38,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 08:38:36" (1/3) ... [2022-07-21 08:38:38,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b11bae3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 08:38:38, skipping insertion in model container [2022-07-21 08:38:38,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:38:37" (2/3) ... [2022-07-21 08:38:38,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b11bae3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 08:38:38, skipping insertion in model container [2022-07-21 08:38:38,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 08:38:38" (3/3) ... [2022-07-21 08:38:38,693 INFO L111 eAbstractionObserver]: Analyzing ICFG mix002.oepc.i [2022-07-21 08:38:38,698 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-21 08:38:38,706 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 08:38:38,706 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-21 08:38:38,706 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-21 08:38:38,757 INFO L135 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-07-21 08:38:38,795 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 132 places, 124 transitions, 263 flow [2022-07-21 08:38:38,831 INFO L129 PetriNetUnfolder]: 2/121 cut-off events. [2022-07-21 08:38:38,832 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-21 08:38:38,835 INFO L84 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 121 events. 2/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2022-07-21 08:38:38,835 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 124 transitions, 263 flow [2022-07-21 08:38:38,839 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 121 transitions, 251 flow [2022-07-21 08:38:38,848 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 08:38:38,853 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@2c4d042a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4a324e2b [2022-07-21 08:38:38,854 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-07-21 08:38:38,861 INFO L129 PetriNetUnfolder]: 0/50 cut-off events. [2022-07-21 08:38:38,862 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-21 08:38:38,862 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:38:38,863 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] [2022-07-21 08:38:38,863 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-21 08:38:38,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:38:38,867 INFO L85 PathProgramCache]: Analyzing trace with hash -109892917, now seen corresponding path program 1 times [2022-07-21 08:38:38,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:38:38,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505068404] [2022-07-21 08:38:38,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:38:38,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:38:39,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:38:39,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:38:39,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:38:39,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505068404] [2022-07-21 08:38:39,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505068404] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:38:39,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:38:39,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 08:38:39,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964174848] [2022-07-21 08:38:39,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:38:39,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 08:38:39,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:38:39,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 08:38:39,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 08:38:39,228 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 124 [2022-07-21 08:38:39,233 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 121 transitions, 251 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:38:39,233 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:38:39,233 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 124 [2022-07-21 08:38:39,235 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:38:39,417 INFO L129 PetriNetUnfolder]: 58/313 cut-off events. [2022-07-21 08:38:39,417 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-07-21 08:38:39,420 INFO L84 FinitePrefix]: Finished finitePrefix Result has 442 conditions, 313 events. 58/313 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1379 event pairs, 10 based on Foata normal form. 24/325 useless extension candidates. Maximal degree in co-relation 385. Up to 79 conditions per place. [2022-07-21 08:38:39,425 INFO L132 encePairwiseOnDemand]: 119/124 looper letters, 14 selfloop transitions, 2 changer transitions 0/123 dead transitions. [2022-07-21 08:38:39,425 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 123 transitions, 293 flow [2022-07-21 08:38:39,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 08:38:39,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-21 08:38:39,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 351 transitions. [2022-07-21 08:38:39,437 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9435483870967742 [2022-07-21 08:38:39,437 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 351 transitions. [2022-07-21 08:38:39,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 351 transitions. [2022-07-21 08:38:39,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:38:39,441 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 351 transitions. [2022-07-21 08:38:39,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:38:39,451 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 124.0) internal successors, (496), 4 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:38:39,452 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 124.0) internal successors, (496), 4 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:38:39,454 INFO L186 Difference]: Start difference. First operand has 129 places, 121 transitions, 251 flow. Second operand 3 states and 351 transitions. [2022-07-21 08:38:39,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 123 transitions, 293 flow [2022-07-21 08:38:39,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 123 transitions, 288 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-07-21 08:38:39,461 INFO L242 Difference]: Finished difference. Result has 126 places, 117 transitions, 244 flow [2022-07-21 08:38:39,463 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=244, PETRI_PLACES=126, PETRI_TRANSITIONS=117} [2022-07-21 08:38:39,467 INFO L279 CegarLoopForPetriNet]: 129 programPoint places, -3 predicate places. [2022-07-21 08:38:39,469 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 117 transitions, 244 flow [2022-07-21 08:38:39,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:38:39,470 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:38:39,470 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] [2022-07-21 08:38:39,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 08:38:39,470 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-21 08:38:39,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:38:39,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1185702391, now seen corresponding path program 1 times [2022-07-21 08:38:39,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:38:39,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407288102] [2022-07-21 08:38:39,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:38:39,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:38:39,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:38:39,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:38:39,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:38:39,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407288102] [2022-07-21 08:38:39,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407288102] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:38:39,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:38:39,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 08:38:39,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86355094] [2022-07-21 08:38:39,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:38:39,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 08:38:39,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:38:39,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 08:38:39,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-21 08:38:39,762 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 124 [2022-07-21 08:38:39,763 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 117 transitions, 244 flow. Second operand has 7 states, 7 states have (on average 95.28571428571429) internal successors, (667), 7 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:38:39,763 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:38:39,768 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 124 [2022-07-21 08:38:39,769 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:38:40,894 INFO L129 PetriNetUnfolder]: 1982/5016 cut-off events. [2022-07-21 08:38:40,894 INFO L130 PetriNetUnfolder]: For 189/189 co-relation queries the response was YES. [2022-07-21 08:38:40,910 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8195 conditions, 5016 events. 1982/5016 cut-off events. For 189/189 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 42453 event pairs, 686 based on Foata normal form. 0/4858 useless extension candidates. Maximal degree in co-relation 8133. Up to 1568 conditions per place. [2022-07-21 08:38:40,924 INFO L132 encePairwiseOnDemand]: 116/124 looper letters, 31 selfloop transitions, 4 changer transitions 72/186 dead transitions. [2022-07-21 08:38:40,925 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 186 transitions, 590 flow [2022-07-21 08:38:40,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 08:38:40,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-21 08:38:40,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1028 transitions. [2022-07-21 08:38:40,930 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8290322580645161 [2022-07-21 08:38:40,930 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1028 transitions. [2022-07-21 08:38:40,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1028 transitions. [2022-07-21 08:38:40,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:38:40,931 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1028 transitions. [2022-07-21 08:38:40,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 102.8) internal successors, (1028), 10 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:38:40,938 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 124.0) internal successors, (1364), 11 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:38:40,939 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 124.0) internal successors, (1364), 11 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:38:40,939 INFO L186 Difference]: Start difference. First operand has 126 places, 117 transitions, 244 flow. Second operand 10 states and 1028 transitions. [2022-07-21 08:38:40,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 186 transitions, 590 flow [2022-07-21 08:38:40,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 186 transitions, 572 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-21 08:38:40,944 INFO L242 Difference]: Finished difference. Result has 140 places, 105 transitions, 240 flow [2022-07-21 08:38:40,944 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=240, PETRI_PLACES=140, PETRI_TRANSITIONS=105} [2022-07-21 08:38:40,945 INFO L279 CegarLoopForPetriNet]: 129 programPoint places, 11 predicate places. [2022-07-21 08:38:40,945 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 105 transitions, 240 flow [2022-07-21 08:38:40,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.28571428571429) internal successors, (667), 7 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:38:40,946 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:38:40,946 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] [2022-07-21 08:38:40,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 08:38:40,947 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-21 08:38:40,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:38:40,948 INFO L85 PathProgramCache]: Analyzing trace with hash 125456927, now seen corresponding path program 1 times [2022-07-21 08:38:40,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:38:40,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712922952] [2022-07-21 08:38:40,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:38:40,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:38:41,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:38:41,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:38:41,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:38:41,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712922952] [2022-07-21 08:38:41,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712922952] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:38:41,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:38:41,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 08:38:41,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584221049] [2022-07-21 08:38:41,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:38:41,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 08:38:41,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:38:41,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 08:38:41,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-21 08:38:41,208 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 124 [2022-07-21 08:38:41,209 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 105 transitions, 240 flow. Second operand has 7 states, 7 states have (on average 95.42857142857143) internal successors, (668), 7 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:38:41,209 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:38:41,209 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 124 [2022-07-21 08:38:41,209 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:38:41,883 INFO L129 PetriNetUnfolder]: 1291/2347 cut-off events. [2022-07-21 08:38:41,883 INFO L130 PetriNetUnfolder]: For 609/609 co-relation queries the response was YES. [2022-07-21 08:38:41,891 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5020 conditions, 2347 events. 1291/2347 cut-off events. For 609/609 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 13536 event pairs, 268 based on Foata normal form. 60/2354 useless extension candidates. Maximal degree in co-relation 4949. Up to 1074 conditions per place. [2022-07-21 08:38:41,912 INFO L132 encePairwiseOnDemand]: 114/124 looper letters, 28 selfloop transitions, 6 changer transitions 52/165 dead transitions. [2022-07-21 08:38:41,913 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 165 transitions, 553 flow [2022-07-21 08:38:41,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 08:38:41,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-21 08:38:41,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1018 transitions. [2022-07-21 08:38:41,916 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8209677419354838 [2022-07-21 08:38:41,916 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1018 transitions. [2022-07-21 08:38:41,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1018 transitions. [2022-07-21 08:38:41,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:38:41,917 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1018 transitions. [2022-07-21 08:38:41,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 101.8) internal successors, (1018), 10 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:38:41,922 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 124.0) internal successors, (1364), 11 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:38:41,923 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 124.0) internal successors, (1364), 11 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:38:41,923 INFO L186 Difference]: Start difference. First operand has 140 places, 105 transitions, 240 flow. Second operand 10 states and 1018 transitions. [2022-07-21 08:38:41,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 165 transitions, 553 flow [2022-07-21 08:38:41,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 165 transitions, 515 flow, removed 14 selfloop flow, removed 9 redundant places. [2022-07-21 08:38:41,948 INFO L242 Difference]: Finished difference. Result has 129 places, 105 transitions, 248 flow [2022-07-21 08:38:41,949 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=248, PETRI_PLACES=129, PETRI_TRANSITIONS=105} [2022-07-21 08:38:41,951 INFO L279 CegarLoopForPetriNet]: 129 programPoint places, 0 predicate places. [2022-07-21 08:38:41,951 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 105 transitions, 248 flow [2022-07-21 08:38:41,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.42857142857143) internal successors, (668), 7 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:38:41,952 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:38:41,952 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] [2022-07-21 08:38:41,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 08:38:41,953 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-21 08:38:41,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:38:41,954 INFO L85 PathProgramCache]: Analyzing trace with hash -770910057, now seen corresponding path program 1 times [2022-07-21 08:38:41,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:38:41,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755967236] [2022-07-21 08:38:41,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:38:41,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:38:41,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:38:42,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:38:42,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:38:42,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755967236] [2022-07-21 08:38:42,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755967236] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:38:42,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:38:42,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 08:38:42,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456573553] [2022-07-21 08:38:42,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:38:42,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 08:38:42,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:38:42,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 08:38:42,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 08:38:42,104 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 124 [2022-07-21 08:38:42,105 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 105 transitions, 248 flow. Second operand has 6 states, 6 states have (on average 103.83333333333333) internal successors, (623), 6 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:38:42,105 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:38:42,105 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 124 [2022-07-21 08:38:42,105 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:38:42,463 INFO L129 PetriNetUnfolder]: 354/917 cut-off events. [2022-07-21 08:38:42,463 INFO L130 PetriNetUnfolder]: For 297/297 co-relation queries the response was YES. [2022-07-21 08:38:42,466 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1753 conditions, 917 events. 354/917 cut-off events. For 297/297 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4978 event pairs, 168 based on Foata normal form. 24/914 useless extension candidates. Maximal degree in co-relation 1684. Up to 239 conditions per place. [2022-07-21 08:38:42,470 INFO L132 encePairwiseOnDemand]: 118/124 looper letters, 21 selfloop transitions, 2 changer transitions 34/145 dead transitions. [2022-07-21 08:38:42,470 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 145 transitions, 466 flow [2022-07-21 08:38:42,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 08:38:42,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-21 08:38:42,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 977 transitions. [2022-07-21 08:38:42,473 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8754480286738351 [2022-07-21 08:38:42,474 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 977 transitions. [2022-07-21 08:38:42,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 977 transitions. [2022-07-21 08:38:42,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:38:42,475 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 977 transitions. [2022-07-21 08:38:42,477 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 108.55555555555556) internal successors, (977), 9 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:38:42,479 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 124.0) internal successors, (1240), 10 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:38:42,479 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 124.0) internal successors, (1240), 10 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:38:42,480 INFO L186 Difference]: Start difference. First operand has 129 places, 105 transitions, 248 flow. Second operand 9 states and 977 transitions. [2022-07-21 08:38:42,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 145 transitions, 466 flow [2022-07-21 08:38:42,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 145 transitions, 426 flow, removed 14 selfloop flow, removed 9 redundant places. [2022-07-21 08:38:42,485 INFO L242 Difference]: Finished difference. Result has 129 places, 105 transitions, 244 flow [2022-07-21 08:38:42,486 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=244, PETRI_PLACES=129, PETRI_TRANSITIONS=105} [2022-07-21 08:38:42,486 INFO L279 CegarLoopForPetriNet]: 129 programPoint places, 0 predicate places. [2022-07-21 08:38:42,486 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 105 transitions, 244 flow [2022-07-21 08:38:42,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 103.83333333333333) internal successors, (623), 6 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:38:42,487 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:38:42,487 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:38:42,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 08:38:42,488 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-21 08:38:42,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:38:42,488 INFO L85 PathProgramCache]: Analyzing trace with hash -2121742532, now seen corresponding path program 1 times [2022-07-21 08:38:42,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:38:42,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211461864] [2022-07-21 08:38:42,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:38:42,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:38:42,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:38:42,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:38:42,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:38:42,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211461864] [2022-07-21 08:38:42,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211461864] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:38:42,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:38:42,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 08:38:42,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116290160] [2022-07-21 08:38:42,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:38:42,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 08:38:42,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:38:42,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 08:38:42,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 08:38:42,602 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 124 [2022-07-21 08:38:42,603 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 105 transitions, 244 flow. Second operand has 6 states, 6 states have (on average 102.0) internal successors, (612), 6 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:38:42,603 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:38:42,603 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 124 [2022-07-21 08:38:42,603 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:38:43,104 INFO L129 PetriNetUnfolder]: 917/1935 cut-off events. [2022-07-21 08:38:43,105 INFO L130 PetriNetUnfolder]: For 145/145 co-relation queries the response was YES. [2022-07-21 08:38:43,113 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3645 conditions, 1935 events. 917/1935 cut-off events. For 145/145 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 12943 event pairs, 60 based on Foata normal form. 0/1896 useless extension candidates. Maximal degree in co-relation 3579. Up to 481 conditions per place. [2022-07-21 08:38:43,120 INFO L132 encePairwiseOnDemand]: 114/124 looper letters, 31 selfloop transitions, 6 changer transitions 50/172 dead transitions. [2022-07-21 08:38:43,120 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 172 transitions, 556 flow [2022-07-21 08:38:43,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 08:38:43,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-21 08:38:43,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1089 transitions. [2022-07-21 08:38:43,124 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8782258064516129 [2022-07-21 08:38:43,124 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1089 transitions. [2022-07-21 08:38:43,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1089 transitions. [2022-07-21 08:38:43,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:38:43,125 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1089 transitions. [2022-07-21 08:38:43,128 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 108.9) internal successors, (1089), 10 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:38:43,130 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 124.0) internal successors, (1364), 11 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:38:43,131 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 124.0) internal successors, (1364), 11 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:38:43,131 INFO L186 Difference]: Start difference. First operand has 129 places, 105 transitions, 244 flow. Second operand 10 states and 1089 transitions. [2022-07-21 08:38:43,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 172 transitions, 556 flow [2022-07-21 08:38:43,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 172 transitions, 540 flow, removed 6 selfloop flow, removed 8 redundant places. [2022-07-21 08:38:43,136 INFO L242 Difference]: Finished difference. Result has 130 places, 107 transitions, 282 flow [2022-07-21 08:38:43,137 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=282, PETRI_PLACES=130, PETRI_TRANSITIONS=107} [2022-07-21 08:38:43,139 INFO L279 CegarLoopForPetriNet]: 129 programPoint places, 1 predicate places. [2022-07-21 08:38:43,139 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 107 transitions, 282 flow [2022-07-21 08:38:43,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 102.0) internal successors, (612), 6 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:38:43,140 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:38:43,140 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:38:43,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 08:38:43,142 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-21 08:38:43,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:38:43,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1694801201, now seen corresponding path program 1 times [2022-07-21 08:38:43,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:38:43,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40657094] [2022-07-21 08:38:43,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:38:43,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:38:43,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:38:43,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:38:43,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:38:43,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40657094] [2022-07-21 08:38:43,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40657094] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:38:43,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:38:43,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 08:38:43,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817175856] [2022-07-21 08:38:43,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:38:43,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 08:38:43,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:38:43,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 08:38:43,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-21 08:38:43,312 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 124 [2022-07-21 08:38:43,313 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 107 transitions, 282 flow. Second operand has 7 states, 7 states have (on average 102.0) internal successors, (714), 7 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:38:43,313 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:38:43,313 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 124 [2022-07-21 08:38:43,314 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:38:43,696 INFO L129 PetriNetUnfolder]: 316/855 cut-off events. [2022-07-21 08:38:43,696 INFO L130 PetriNetUnfolder]: For 700/706 co-relation queries the response was YES. [2022-07-21 08:38:43,700 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2123 conditions, 855 events. 316/855 cut-off events. For 700/706 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4924 event pairs, 25 based on Foata normal form. 30/878 useless extension candidates. Maximal degree in co-relation 2056. Up to 182 conditions per place. [2022-07-21 08:38:43,703 INFO L132 encePairwiseOnDemand]: 115/124 looper letters, 37 selfloop transitions, 9 changer transitions 39/170 dead transitions. [2022-07-21 08:38:43,703 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 170 transitions, 711 flow [2022-07-21 08:38:43,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 08:38:43,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-21 08:38:43,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1087 transitions. [2022-07-21 08:38:43,710 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8766129032258064 [2022-07-21 08:38:43,710 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1087 transitions. [2022-07-21 08:38:43,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1087 transitions. [2022-07-21 08:38:43,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:38:43,711 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1087 transitions. [2022-07-21 08:38:43,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 108.7) internal successors, (1087), 10 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:38:43,715 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 124.0) internal successors, (1364), 11 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:38:43,717 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 124.0) internal successors, (1364), 11 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:38:43,717 INFO L186 Difference]: Start difference. First operand has 130 places, 107 transitions, 282 flow. Second operand 10 states and 1087 transitions. [2022-07-21 08:38:43,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 170 transitions, 711 flow [2022-07-21 08:38:43,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 170 transitions, 687 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-07-21 08:38:43,723 INFO L242 Difference]: Finished difference. Result has 134 places, 110 transitions, 350 flow [2022-07-21 08:38:43,724 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=350, PETRI_PLACES=134, PETRI_TRANSITIONS=110} [2022-07-21 08:38:43,726 INFO L279 CegarLoopForPetriNet]: 129 programPoint places, 5 predicate places. [2022-07-21 08:38:43,726 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 110 transitions, 350 flow [2022-07-21 08:38:43,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 102.0) internal successors, (714), 7 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:38:43,727 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:38:43,727 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:38:43,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 08:38:43,727 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-21 08:38:43,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:38:43,728 INFO L85 PathProgramCache]: Analyzing trace with hash -744956644, now seen corresponding path program 1 times [2022-07-21 08:38:43,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:38:43,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723294663] [2022-07-21 08:38:43,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:38:43,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:38:43,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:38:43,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:38:43,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:38:43,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723294663] [2022-07-21 08:38:43,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723294663] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:38:43,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:38:43,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 08:38:43,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085477073] [2022-07-21 08:38:43,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:38:43,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 08:38:43,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:38:43,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 08:38:43,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 08:38:43,923 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 124 [2022-07-21 08:38:43,924 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 110 transitions, 350 flow. Second operand has 7 states, 7 states have (on average 94.71428571428571) internal successors, (663), 7 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:38:43,924 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:38:43,924 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 124 [2022-07-21 08:38:43,924 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:38:44,359 INFO L129 PetriNetUnfolder]: 342/1136 cut-off events. [2022-07-21 08:38:44,359 INFO L130 PetriNetUnfolder]: For 1198/1258 co-relation queries the response was YES. [2022-07-21 08:38:44,365 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2777 conditions, 1136 events. 342/1136 cut-off events. For 1198/1258 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 7123 event pairs, 39 based on Foata normal form. 29/1142 useless extension candidates. Maximal degree in co-relation 2700. Up to 379 conditions per place. [2022-07-21 08:38:44,370 INFO L132 encePairwiseOnDemand]: 108/124 looper letters, 38 selfloop transitions, 12 changer transitions 28/160 dead transitions. [2022-07-21 08:38:44,371 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 160 transitions, 620 flow [2022-07-21 08:38:44,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 08:38:44,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-07-21 08:38:44,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1081 transitions. [2022-07-21 08:38:44,375 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7925219941348973 [2022-07-21 08:38:44,375 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1081 transitions. [2022-07-21 08:38:44,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1081 transitions. [2022-07-21 08:38:44,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:38:44,376 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1081 transitions. [2022-07-21 08:38:44,379 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 98.27272727272727) internal successors, (1081), 11 states have internal predecessors, (1081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:38:44,382 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 124.0) internal successors, (1488), 12 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:38:44,382 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 124.0) internal successors, (1488), 12 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:38:44,382 INFO L186 Difference]: Start difference. First operand has 134 places, 110 transitions, 350 flow. Second operand 11 states and 1081 transitions. [2022-07-21 08:38:44,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 160 transitions, 620 flow [2022-07-21 08:38:44,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 160 transitions, 564 flow, removed 20 selfloop flow, removed 9 redundant places. [2022-07-21 08:38:44,392 INFO L242 Difference]: Finished difference. Result has 139 places, 115 transitions, 377 flow [2022-07-21 08:38:44,393 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=377, PETRI_PLACES=139, PETRI_TRANSITIONS=115} [2022-07-21 08:38:44,393 INFO L279 CegarLoopForPetriNet]: 129 programPoint places, 10 predicate places. [2022-07-21 08:38:44,394 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 115 transitions, 377 flow [2022-07-21 08:38:44,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 94.71428571428571) internal successors, (663), 7 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:38:44,394 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:38:44,394 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:38:44,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 08:38:44,395 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-21 08:38:44,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:38:44,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1816089236, now seen corresponding path program 2 times [2022-07-21 08:38:44,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:38:44,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755493304] [2022-07-21 08:38:44,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:38:44,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:38:44,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:38:44,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:38:44,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:38:44,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755493304] [2022-07-21 08:38:44,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755493304] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:38:44,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:38:44,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 08:38:44,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795002916] [2022-07-21 08:38:44,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:38:44,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 08:38:44,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:38:44,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 08:38:44,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 08:38:44,551 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 124 [2022-07-21 08:38:44,552 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 115 transitions, 377 flow. Second operand has 7 states, 7 states have (on average 94.71428571428571) internal successors, (663), 7 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:38:44,552 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:38:44,552 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 124 [2022-07-21 08:38:44,553 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:38:45,008 INFO L129 PetriNetUnfolder]: 432/1490 cut-off events. [2022-07-21 08:38:45,008 INFO L130 PetriNetUnfolder]: For 1386/1428 co-relation queries the response was YES. [2022-07-21 08:38:45,019 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3826 conditions, 1490 events. 432/1490 cut-off events. For 1386/1428 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 10413 event pairs, 95 based on Foata normal form. 37/1498 useless extension candidates. Maximal degree in co-relation 3742. Up to 432 conditions per place. [2022-07-21 08:38:45,028 INFO L132 encePairwiseOnDemand]: 108/124 looper letters, 44 selfloop transitions, 13 changer transitions 28/167 dead transitions. [2022-07-21 08:38:45,028 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 167 transitions, 766 flow [2022-07-21 08:38:45,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 08:38:45,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-07-21 08:38:45,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1080 transitions. [2022-07-21 08:38:45,032 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7917888563049853 [2022-07-21 08:38:45,032 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1080 transitions. [2022-07-21 08:38:45,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1080 transitions. [2022-07-21 08:38:45,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:38:45,033 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1080 transitions. [2022-07-21 08:38:45,035 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 98.18181818181819) internal successors, (1080), 11 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:38:45,038 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 124.0) internal successors, (1488), 12 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:38:45,039 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 124.0) internal successors, (1488), 12 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:38:45,039 INFO L186 Difference]: Start difference. First operand has 139 places, 115 transitions, 377 flow. Second operand 11 states and 1080 transitions. [2022-07-21 08:38:45,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 167 transitions, 766 flow [2022-07-21 08:38:45,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 167 transitions, 733 flow, removed 10 selfloop flow, removed 5 redundant places. [2022-07-21 08:38:45,048 INFO L242 Difference]: Finished difference. Result has 146 places, 121 transitions, 475 flow [2022-07-21 08:38:45,049 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=475, PETRI_PLACES=146, PETRI_TRANSITIONS=121} [2022-07-21 08:38:45,051 INFO L279 CegarLoopForPetriNet]: 129 programPoint places, 17 predicate places. [2022-07-21 08:38:45,051 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 121 transitions, 475 flow [2022-07-21 08:38:45,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 94.71428571428571) internal successors, (663), 7 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:38:45,052 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:38:45,052 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:38:45,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 08:38:45,053 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-21 08:38:45,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:38:45,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1239859386, now seen corresponding path program 3 times [2022-07-21 08:38:45,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:38:45,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823060907] [2022-07-21 08:38:45,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:38:45,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:38:45,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:38:45,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:38:45,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:38:45,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823060907] [2022-07-21 08:38:45,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823060907] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:38:45,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:38:45,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 08:38:45,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065190033] [2022-07-21 08:38:45,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:38:45,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 08:38:45,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:38:45,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 08:38:45,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:38:45,202 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 124 [2022-07-21 08:38:45,202 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 121 transitions, 475 flow. Second operand has 8 states, 8 states have (on average 102.0) internal successors, (816), 8 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:38:45,203 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:38:45,203 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 124 [2022-07-21 08:38:45,203 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:38:45,582 INFO L129 PetriNetUnfolder]: 406/1312 cut-off events. [2022-07-21 08:38:45,582 INFO L130 PetriNetUnfolder]: For 2415/2437 co-relation queries the response was YES. [2022-07-21 08:38:45,591 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3689 conditions, 1312 events. 406/1312 cut-off events. For 2415/2437 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 9522 event pairs, 90 based on Foata normal form. 36/1294 useless extension candidates. Maximal degree in co-relation 3661. Up to 236 conditions per place. [2022-07-21 08:38:45,595 INFO L132 encePairwiseOnDemand]: 115/124 looper letters, 33 selfloop transitions, 14 changer transitions 24/165 dead transitions. [2022-07-21 08:38:45,596 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 165 transitions, 900 flow [2022-07-21 08:38:45,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 08:38:45,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-07-21 08:38:45,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1163 transitions. [2022-07-21 08:38:45,599 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8526392961876833 [2022-07-21 08:38:45,600 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1163 transitions. [2022-07-21 08:38:45,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1163 transitions. [2022-07-21 08:38:45,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:38:45,601 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1163 transitions. [2022-07-21 08:38:45,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 105.72727272727273) internal successors, (1163), 11 states have internal predecessors, (1163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:38:45,606 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 124.0) internal successors, (1488), 12 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:38:45,607 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 124.0) internal successors, (1488), 12 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:38:45,607 INFO L186 Difference]: Start difference. First operand has 146 places, 121 transitions, 475 flow. Second operand 11 states and 1163 transitions. [2022-07-21 08:38:45,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 165 transitions, 900 flow [2022-07-21 08:38:45,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 165 transitions, 787 flow, removed 45 selfloop flow, removed 8 redundant places. [2022-07-21 08:38:45,618 INFO L242 Difference]: Finished difference. Result has 148 places, 124 transitions, 475 flow [2022-07-21 08:38:45,619 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=475, PETRI_PLACES=148, PETRI_TRANSITIONS=124} [2022-07-21 08:38:45,620 INFO L279 CegarLoopForPetriNet]: 129 programPoint places, 19 predicate places. [2022-07-21 08:38:45,620 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 124 transitions, 475 flow [2022-07-21 08:38:45,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 102.0) internal successors, (816), 8 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:38:45,621 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:38:45,621 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:38:45,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 08:38:45,622 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:38:45,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:38:45,622 INFO L85 PathProgramCache]: Analyzing trace with hash 229234905, now seen corresponding path program 1 times [2022-07-21 08:38:45,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:38:45,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120683508] [2022-07-21 08:38:45,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:38:45,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:38:45,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 08:38:45,676 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-21 08:38:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 08:38:45,764 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-21 08:38:45,765 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-21 08:38:45,766 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-07-21 08:38:45,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-07-21 08:38:45,768 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-07-21 08:38:45,768 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-07-21 08:38:45,768 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-07-21 08:38:45,768 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-07-21 08:38:45,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-21 08:38:45,769 INFO L356 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:38:45,775 INFO L226 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-07-21 08:38:45,775 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 08:38:45,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 08:38:45 BasicIcfg [2022-07-21 08:38:45,967 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 08:38:45,968 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 08:38:45,968 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 08:38:45,968 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 08:38:45,969 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 08:38:38" (3/4) ... [2022-07-21 08:38:45,970 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-21 08:38:46,154 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-21 08:38:46,154 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 08:38:46,155 INFO L158 Benchmark]: Toolchain (without parser) took 9181.05ms. Allocated memory was 54.5MB in the beginning and 438.3MB in the end (delta: 383.8MB). Free memory was 29.7MB in the beginning and 136.5MB in the end (delta: -106.7MB). Peak memory consumption was 275.5MB. Max. memory is 16.1GB. [2022-07-21 08:38:46,156 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 54.5MB. Free memory was 36.1MB in the beginning and 36.1MB in the end (delta: 37.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 08:38:46,156 INFO L158 Benchmark]: CACSL2BoogieTranslator took 585.84ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 29.4MB in the beginning and 36.5MB in the end (delta: -7.1MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. [2022-07-21 08:38:46,156 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.49ms. Allocated memory is still 67.1MB. Free memory was 36.5MB in the beginning and 47.1MB in the end (delta: -10.6MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. [2022-07-21 08:38:46,157 INFO L158 Benchmark]: Boogie Preprocessor took 65.84ms. Allocated memory is still 67.1MB. Free memory was 47.1MB in the beginning and 44.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 08:38:46,157 INFO L158 Benchmark]: RCFGBuilder took 978.09ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 44.8MB in the beginning and 46.8MB in the end (delta: -2.0MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. [2022-07-21 08:38:46,157 INFO L158 Benchmark]: TraceAbstraction took 7279.04ms. Allocated memory was 81.8MB in the beginning and 438.3MB in the end (delta: 356.5MB). Free memory was 46.4MB in the beginning and 177.3MB in the end (delta: -130.9MB). Peak memory consumption was 226.6MB. Max. memory is 16.1GB. [2022-07-21 08:38:46,158 INFO L158 Benchmark]: Witness Printer took 186.58ms. Allocated memory is still 438.3MB. Free memory was 177.3MB in the beginning and 136.5MB in the end (delta: 40.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2022-07-21 08:38:46,160 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.22ms. Allocated memory is still 54.5MB. Free memory was 36.1MB in the beginning and 36.1MB in the end (delta: 37.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 585.84ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 29.4MB in the beginning and 36.5MB in the end (delta: -7.1MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.49ms. Allocated memory is still 67.1MB. Free memory was 36.5MB in the beginning and 47.1MB in the end (delta: -10.6MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.84ms. Allocated memory is still 67.1MB. Free memory was 47.1MB in the beginning and 44.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 978.09ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 44.8MB in the beginning and 46.8MB in the end (delta: -2.0MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. * TraceAbstraction took 7279.04ms. Allocated memory was 81.8MB in the beginning and 438.3MB in the end (delta: 356.5MB). Free memory was 46.4MB in the beginning and 177.3MB in the end (delta: -130.9MB). Peak memory consumption was 226.6MB. Max. memory is 16.1GB. * Witness Printer took 186.58ms. Allocated memory is still 438.3MB. Free memory was 177.3MB in the beginning and 136.5MB in the end (delta: 40.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L715] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L717] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L719] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0] [L721] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L723] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L724] 0 _Bool a$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0] [L725] 0 int a$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0] [L726] 0 _Bool a$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0] [L727] 0 _Bool a$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0] [L728] 0 _Bool a$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0] [L729] 0 _Bool a$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0] [L730] 0 _Bool a$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0] [L731] 0 _Bool a$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0] [L732] 0 _Bool a$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0] [L733] 0 _Bool a$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0] [L734] 0 _Bool a$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0] [L735] 0 int *a$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}] [L736] 0 int a$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0] [L737] 0 _Bool a$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0] [L738] 0 int a$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0] [L739] 0 _Bool a$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0] [L740] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0] [L741] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0] [L743] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L745] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L747] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L748] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0] [L749] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L855] 0 pthread_t t38; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t38={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L856] FCALL, FORK 0 pthread_create(&t38, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t38, ((void *)0), P0, ((void *)0))=-2, t38={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L857] 0 pthread_t t39; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t38={5:0}, t39={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L858] FCALL, FORK 0 pthread_create(&t39, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t39, ((void *)0), P1, ((void *)0))=-1, t38={5:0}, t39={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L859] 0 pthread_t t40; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t38={5:0}, t39={6:0}, t40={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L860] FCALL, FORK 0 pthread_create(&t40, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t40, ((void *)0), P2, ((void *)0))=0, t38={5:0}, t39={6:0}, t40={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L753] 1 a$w_buff1 = a$w_buff0 [L754] 1 a$w_buff0 = 1 [L755] 1 a$w_buff1_used = a$w_buff0_used [L756] 1 a$w_buff0_used = (_Bool)1 [L757] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L757] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L758] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L759] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L760] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L761] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L768] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L771] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L788] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L791] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L794] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L811] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L814] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L817] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 3 a$flush_delayed = weak$$choice2 [L820] 3 a$mem_tmp = a [L821] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L821] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L822] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L822] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L823] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L823] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L824] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L824] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L825] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] EXPR 3 weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L826] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L827] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L827] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L828] 3 __unbuffered_p2_EBX = a [L829] EXPR 3 a$flush_delayed ? a$mem_tmp : a [L829] 3 a = a$flush_delayed ? a$mem_tmp : a [L830] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L774] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L774] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L775] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L775] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L776] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L776] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L777] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L777] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L778] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L778] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L797] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L797] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L797] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L797] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L798] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L798] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L799] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L799] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L800] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L800] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L801] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L801] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L833] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L833] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L833] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L833] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L834] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L834] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L835] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L835] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L836] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L836] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L837] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L837] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L781] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L840] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L862] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t38={5:0}, t39={6:0}, t40={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L864] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L864] RET 0 assume_abort_if_not(main$tmp_guard0) [L866] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L866] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L866] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L866] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L867] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L867] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L868] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L868] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L869] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L869] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L870] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L870] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L873] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t38={5:0}, t39={6:0}, t40={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L875] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 860]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 155 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.0s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 530 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 530 mSDsluCounter, 539 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1008 mSDsCounter, 69 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1204 IncrementalHoareTripleChecker+Invalid, 1273 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 69 mSolverCounterUnsat, 132 mSDtfsCounter, 1204 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 104 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=475occurred 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, 1.1s InterpolantComputationTime, 860 NumberOfCodeBlocks, 860 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 753 ConstructedInterpolants, 0 QuantifiedInterpolants, 4301 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-21 08:38:46,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE