./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix019_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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/mix019_tso.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 d6f4376125179246714b78f2e2f349c8b75c8c24c937ac142dcf7789f615522d --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 10:05:21,344 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 10:05:21,346 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 10:05:21,397 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 10:05:21,397 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 10:05:21,398 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 10:05:21,399 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 10:05:21,406 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 10:05:21,408 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 10:05:21,409 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 10:05:21,410 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 10:05:21,411 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 10:05:21,412 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 10:05:21,414 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 10:05:21,415 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 10:05:21,416 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 10:05:21,418 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 10:05:21,422 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 10:05:21,424 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 10:05:21,425 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 10:05:21,428 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 10:05:21,430 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 10:05:21,430 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 10:05:21,431 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 10:05:21,432 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 10:05:21,434 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 10:05:21,435 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 10:05:21,436 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 10:05:21,436 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 10:05:21,437 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 10:05:21,437 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 10:05:21,438 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 10:05:21,439 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 10:05:21,439 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 10:05:21,440 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 10:05:21,441 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 10:05:21,441 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 10:05:21,441 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 10:05:21,441 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 10:05:21,442 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 10:05:21,442 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 10:05:21,443 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 10:05:21,444 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 10:05:21,464 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 10:05:21,465 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 10:05:21,465 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 10:05:21,465 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 10:05:21,466 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 10:05:21,466 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 10:05:21,466 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 10:05:21,466 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 10:05:21,466 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 10:05:21,467 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 10:05:21,467 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 10:05:21,468 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 10:05:21,468 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 10:05:21,468 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 10:05:21,468 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 10:05:21,468 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 10:05:21,468 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 10:05:21,469 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 10:05:21,469 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 10:05:21,470 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 10:05:21,470 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 10:05:21,470 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 10:05:21,470 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 10:05:21,471 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 10:05:21,471 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:05:21,471 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 10:05:21,471 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 10:05:21,471 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 10:05:21,471 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 10:05:21,472 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 10:05:21,472 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 10:05:21,472 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 10:05:21,472 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 10:05:21,472 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 -> d6f4376125179246714b78f2e2f349c8b75c8c24c937ac142dcf7789f615522d [2022-07-12 10:05:21,650 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 10:05:21,674 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 10:05:21,676 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 10:05:21,677 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 10:05:21,678 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 10:05:21,679 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix019_tso.oepc.i [2022-07-12 10:05:21,721 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c012f1912/cf88fbc9638c48438a78cb39b575c49d/FLAG2b175db62 [2022-07-12 10:05:22,074 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 10:05:22,077 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix019_tso.oepc.i [2022-07-12 10:05:22,096 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c012f1912/cf88fbc9638c48438a78cb39b575c49d/FLAG2b175db62 [2022-07-12 10:05:22,465 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c012f1912/cf88fbc9638c48438a78cb39b575c49d [2022-07-12 10:05:22,467 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 10:05:22,470 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 10:05:22,472 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 10:05:22,472 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 10:05:22,474 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 10:05:22,474 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:05:22" (1/1) ... [2022-07-12 10:05:22,476 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7876f8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:05:22, skipping insertion in model container [2022-07-12 10:05:22,476 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:05:22" (1/1) ... [2022-07-12 10:05:22,480 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 10:05:22,522 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 10:05:22,674 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/mix019_tso.oepc.i[949,962] [2022-07-12 10:05:22,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:05:22,873 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 10:05:22,884 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/mix019_tso.oepc.i[949,962] [2022-07-12 10:05:22,932 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:05:22,960 INFO L208 MainTranslator]: Completed translation [2022-07-12 10:05:22,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:05:22 WrapperNode [2022-07-12 10:05:22,961 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 10:05:22,962 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 10:05:22,962 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 10:05:22,962 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 10:05:22,967 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:05:22" (1/1) ... [2022-07-12 10:05:22,993 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:05:22" (1/1) ... [2022-07-12 10:05:23,026 INFO L137 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 276 [2022-07-12 10:05:23,027 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 10:05:23,028 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 10:05:23,028 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 10:05:23,028 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 10:05:23,034 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:05:22" (1/1) ... [2022-07-12 10:05:23,034 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:05:22" (1/1) ... [2022-07-12 10:05:23,047 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:05:22" (1/1) ... [2022-07-12 10:05:23,050 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:05:22" (1/1) ... [2022-07-12 10:05:23,059 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:05:22" (1/1) ... [2022-07-12 10:05:23,068 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:05:22" (1/1) ... [2022-07-12 10:05:23,069 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:05:22" (1/1) ... [2022-07-12 10:05:23,080 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 10:05:23,080 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 10:05:23,081 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 10:05:23,081 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 10:05:23,087 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:05:22" (1/1) ... [2022-07-12 10:05:23,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:05:23,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:05:23,121 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-12 10:05:23,128 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-12 10:05:23,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 10:05:23,172 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-12 10:05:23,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 10:05:23,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 10:05:23,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 10:05:23,183 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-07-12 10:05:23,183 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-07-12 10:05:23,184 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-07-12 10:05:23,184 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-07-12 10:05:23,184 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-07-12 10:05:23,184 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-07-12 10:05:23,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 10:05:23,184 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-12 10:05:23,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 10:05:23,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 10:05:23,186 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-12 10:05:23,316 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 10:05:23,318 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 10:05:23,652 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 10:05:23,938 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 10:05:23,938 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 10:05:23,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:05:23 BoogieIcfgContainer [2022-07-12 10:05:23,941 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 10:05:23,943 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 10:05:23,943 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 10:05:23,945 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 10:05:23,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 10:05:22" (1/3) ... [2022-07-12 10:05:23,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a47e3b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:05:23, skipping insertion in model container [2022-07-12 10:05:23,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:05:22" (2/3) ... [2022-07-12 10:05:23,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a47e3b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:05:23, skipping insertion in model container [2022-07-12 10:05:23,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:05:23" (3/3) ... [2022-07-12 10:05:23,948 INFO L111 eAbstractionObserver]: Analyzing ICFG mix019_tso.oepc.i [2022-07-12 10:05:23,954 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-12 10:05:23,961 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 10:05:23,961 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-12 10:05:23,961 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-12 10:05:24,004 INFO L135 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-07-12 10:05:24,042 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 125 places, 117 transitions, 249 flow [2022-07-12 10:05:24,123 INFO L129 PetriNetUnfolder]: 2/114 cut-off events. [2022-07-12 10:05:24,123 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-12 10:05:24,127 INFO L84 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2022-07-12 10:05:24,128 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 117 transitions, 249 flow [2022-07-12 10:05:24,131 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 114 transitions, 237 flow [2022-07-12 10:05:24,143 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 10:05:24,151 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@241565b9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1d290e45 [2022-07-12 10:05:24,152 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-07-12 10:05:24,172 INFO L129 PetriNetUnfolder]: 0/60 cut-off events. [2022-07-12 10:05:24,174 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-12 10:05:24,174 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:05:24,175 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] [2022-07-12 10:05:24,175 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:05:24,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:05:24,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1971532455, now seen corresponding path program 1 times [2022-07-12 10:05:24,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:05:24,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416710527] [2022-07-12 10:05:24,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:05:24,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:05:24,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:05:24,458 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-12 10:05:24,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:05:24,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416710527] [2022-07-12 10:05:24,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416710527] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:05:24,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:05:24,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 10:05:24,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465492372] [2022-07-12 10:05:24,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:05:24,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 10:05:24,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:05:24,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 10:05:24,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 10:05:24,504 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 117 [2022-07-12 10:05:24,509 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 114 transitions, 237 flow. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 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-12 10:05:24,509 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:05:24,510 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 117 [2022-07-12 10:05:24,511 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:05:24,675 INFO L129 PetriNetUnfolder]: 57/326 cut-off events. [2022-07-12 10:05:24,676 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-07-12 10:05:24,678 INFO L84 FinitePrefix]: Finished finitePrefix Result has 451 conditions, 326 events. 57/326 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1323 event pairs, 11 based on Foata normal form. 14/321 useless extension candidates. Maximal degree in co-relation 398. Up to 75 conditions per place. [2022-07-12 10:05:24,682 INFO L132 encePairwiseOnDemand]: 112/117 looper letters, 13 selfloop transitions, 2 changer transitions 0/115 dead transitions. [2022-07-12 10:05:24,683 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 115 transitions, 272 flow [2022-07-12 10:05:24,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 10:05:24,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-12 10:05:24,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 329 transitions. [2022-07-12 10:05:24,701 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9373219373219374 [2022-07-12 10:05:24,702 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 329 transitions. [2022-07-12 10:05:24,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 329 transitions. [2022-07-12 10:05:24,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:05:24,707 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 329 transitions. [2022-07-12 10:05:24,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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-12 10:05:24,719 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:24,720 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:24,721 INFO L186 Difference]: Start difference. First operand has 122 places, 114 transitions, 237 flow. Second operand 3 states and 329 transitions. [2022-07-12 10:05:24,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 115 transitions, 272 flow [2022-07-12 10:05:24,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 115 transitions, 268 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-07-12 10:05:24,729 INFO L242 Difference]: Finished difference. Result has 119 places, 110 transitions, 230 flow [2022-07-12 10:05:24,731 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=230, PETRI_PLACES=119, PETRI_TRANSITIONS=110} [2022-07-12 10:05:24,734 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -3 predicate places. [2022-07-12 10:05:24,734 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 110 transitions, 230 flow [2022-07-12 10:05:24,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 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-12 10:05:24,735 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:05:24,735 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:05:24,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 10:05:24,736 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:05:24,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:05:24,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1797647236, now seen corresponding path program 1 times [2022-07-12 10:05:24,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:05:24,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881111108] [2022-07-12 10:05:24,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:05:24,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:05:24,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:05:25,037 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-12 10:05:25,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:05:25,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881111108] [2022-07-12 10:05:25,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881111108] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:05:25,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:05:25,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 10:05:25,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256876127] [2022-07-12 10:05:25,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:05:25,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:05:25,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:05:25,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:05:25,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:05:25,044 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 117 [2022-07-12 10:05:25,044 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 110 transitions, 230 flow. Second operand has 6 states, 6 states have (on average 97.83333333333333) internal successors, (587), 6 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:25,045 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:05:25,048 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 117 [2022-07-12 10:05:25,048 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:05:25,368 INFO L129 PetriNetUnfolder]: 330/1071 cut-off events. [2022-07-12 10:05:25,368 INFO L130 PetriNetUnfolder]: For 68/68 co-relation queries the response was YES. [2022-07-12 10:05:25,371 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1699 conditions, 1071 events. 330/1071 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 7181 event pairs, 59 based on Foata normal form. 0/1039 useless extension candidates. Maximal degree in co-relation 1646. Up to 257 conditions per place. [2022-07-12 10:05:25,373 INFO L132 encePairwiseOnDemand]: 111/117 looper letters, 18 selfloop transitions, 2 changer transitions 45/147 dead transitions. [2022-07-12 10:05:25,373 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 147 transitions, 426 flow [2022-07-12 10:05:25,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:05:25,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-12 10:05:25,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 920 transitions. [2022-07-12 10:05:25,376 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8736942070275404 [2022-07-12 10:05:25,376 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 920 transitions. [2022-07-12 10:05:25,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 920 transitions. [2022-07-12 10:05:25,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:05:25,376 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 920 transitions. [2022-07-12 10:05:25,378 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 102.22222222222223) internal successors, (920), 9 states have internal predecessors, (920), 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-12 10:05:25,380 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 117.0) internal successors, (1170), 10 states have internal predecessors, (1170), 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-12 10:05:25,381 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 117.0) internal successors, (1170), 10 states have internal predecessors, (1170), 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-12 10:05:25,381 INFO L186 Difference]: Start difference. First operand has 119 places, 110 transitions, 230 flow. Second operand 9 states and 920 transitions. [2022-07-12 10:05:25,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 147 transitions, 426 flow [2022-07-12 10:05:25,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 147 transitions, 408 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-12 10:05:25,384 INFO L242 Difference]: Finished difference. Result has 132 places, 98 transitions, 222 flow [2022-07-12 10:05:25,384 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=222, PETRI_PLACES=132, PETRI_TRANSITIONS=98} [2022-07-12 10:05:25,385 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 10 predicate places. [2022-07-12 10:05:25,385 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 98 transitions, 222 flow [2022-07-12 10:05:25,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 97.83333333333333) internal successors, (587), 6 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:25,386 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:05:25,386 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:05:25,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 10:05:25,386 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:05:25,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:05:25,387 INFO L85 PathProgramCache]: Analyzing trace with hash 370340767, now seen corresponding path program 1 times [2022-07-12 10:05:25,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:05:25,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482641348] [2022-07-12 10:05:25,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:05:25,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:05:25,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:05:25,575 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-12 10:05:25,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:05:25,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482641348] [2022-07-12 10:05:25,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482641348] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:05:25,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:05:25,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 10:05:25,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741229006] [2022-07-12 10:05:25,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:05:25,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 10:05:25,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:05:25,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 10:05:25,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-07-12 10:05:25,578 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 117 [2022-07-12 10:05:25,579 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 98 transitions, 222 flow. Second operand has 10 states, 10 states have (on average 94.4) internal successors, (944), 10 states have internal predecessors, (944), 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-12 10:05:25,579 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:05:25,579 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 117 [2022-07-12 10:05:25,579 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:05:25,949 INFO L129 PetriNetUnfolder]: 333/804 cut-off events. [2022-07-12 10:05:25,949 INFO L130 PetriNetUnfolder]: For 213/213 co-relation queries the response was YES. [2022-07-12 10:05:25,951 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1580 conditions, 804 events. 333/804 cut-off events. For 213/213 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4408 event pairs, 83 based on Foata normal form. 19/803 useless extension candidates. Maximal degree in co-relation 1517. Up to 330 conditions per place. [2022-07-12 10:05:25,953 INFO L132 encePairwiseOnDemand]: 104/117 looper letters, 20 selfloop transitions, 11 changer transitions 43/153 dead transitions. [2022-07-12 10:05:25,954 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 153 transitions, 514 flow [2022-07-12 10:05:25,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 10:05:25,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-07-12 10:05:25,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1472 transitions. [2022-07-12 10:05:25,957 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8387464387464387 [2022-07-12 10:05:25,957 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1472 transitions. [2022-07-12 10:05:25,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1472 transitions. [2022-07-12 10:05:25,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:05:25,958 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1472 transitions. [2022-07-12 10:05:25,960 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 98.13333333333334) internal successors, (1472), 15 states have internal predecessors, (1472), 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-12 10:05:25,962 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 117.0) internal successors, (1872), 16 states have internal predecessors, (1872), 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-12 10:05:25,963 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 117.0) internal successors, (1872), 16 states have internal predecessors, (1872), 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-12 10:05:25,963 INFO L186 Difference]: Start difference. First operand has 132 places, 98 transitions, 222 flow. Second operand 15 states and 1472 transitions. [2022-07-12 10:05:25,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 153 transitions, 514 flow [2022-07-12 10:05:25,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 153 transitions, 474 flow, removed 18 selfloop flow, removed 8 redundant places. [2022-07-12 10:05:25,967 INFO L242 Difference]: Finished difference. Result has 131 places, 105 transitions, 305 flow [2022-07-12 10:05:25,968 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=305, PETRI_PLACES=131, PETRI_TRANSITIONS=105} [2022-07-12 10:05:25,968 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 9 predicate places. [2022-07-12 10:05:25,968 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 105 transitions, 305 flow [2022-07-12 10:05:25,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 94.4) internal successors, (944), 10 states have internal predecessors, (944), 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-12 10:05:25,969 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:05:25,969 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:05:25,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 10:05:25,969 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:05:25,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:05:25,969 INFO L85 PathProgramCache]: Analyzing trace with hash 315863241, now seen corresponding path program 1 times [2022-07-12 10:05:25,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:05:25,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690551887] [2022-07-12 10:05:25,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:05:25,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:05:26,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:05:26,135 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-12 10:05:26,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:05:26,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690551887] [2022-07-12 10:05:26,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690551887] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:05:26,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:05:26,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 10:05:26,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203906495] [2022-07-12 10:05:26,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:05:26,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 10:05:26,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:05:26,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 10:05:26,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-12 10:05:26,138 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 117 [2022-07-12 10:05:26,139 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 105 transitions, 305 flow. Second operand has 9 states, 9 states have (on average 95.55555555555556) internal successors, (860), 9 states have internal predecessors, (860), 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-12 10:05:26,139 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:05:26,139 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 117 [2022-07-12 10:05:26,140 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:05:26,389 INFO L129 PetriNetUnfolder]: 264/696 cut-off events. [2022-07-12 10:05:26,389 INFO L130 PetriNetUnfolder]: For 1641/1729 co-relation queries the response was YES. [2022-07-12 10:05:26,392 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2226 conditions, 696 events. 264/696 cut-off events. For 1641/1729 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3656 event pairs, 147 based on Foata normal form. 12/680 useless extension candidates. Maximal degree in co-relation 2155. Up to 313 conditions per place. [2022-07-12 10:05:26,395 INFO L132 encePairwiseOnDemand]: 107/117 looper letters, 26 selfloop transitions, 10 changer transitions 29/145 dead transitions. [2022-07-12 10:05:26,395 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 145 transitions, 698 flow [2022-07-12 10:05:26,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 10:05:26,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-07-12 10:05:26,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1089 transitions. [2022-07-12 10:05:26,397 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8461538461538461 [2022-07-12 10:05:26,397 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1089 transitions. [2022-07-12 10:05:26,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1089 transitions. [2022-07-12 10:05:26,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:05:26,398 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1089 transitions. [2022-07-12 10:05:26,400 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 99.0) internal successors, (1089), 11 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-12 10:05:26,401 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 117.0) internal successors, (1404), 12 states have internal predecessors, (1404), 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-12 10:05:26,402 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 117.0) internal successors, (1404), 12 states have internal predecessors, (1404), 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-12 10:05:26,402 INFO L186 Difference]: Start difference. First operand has 131 places, 105 transitions, 305 flow. Second operand 11 states and 1089 transitions. [2022-07-12 10:05:26,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 145 transitions, 698 flow [2022-07-12 10:05:26,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 145 transitions, 680 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-07-12 10:05:26,406 INFO L242 Difference]: Finished difference. Result has 134 places, 111 transitions, 408 flow [2022-07-12 10:05:26,406 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=408, PETRI_PLACES=134, PETRI_TRANSITIONS=111} [2022-07-12 10:05:26,407 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 12 predicate places. [2022-07-12 10:05:26,407 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 111 transitions, 408 flow [2022-07-12 10:05:26,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 95.55555555555556) internal successors, (860), 9 states have internal predecessors, (860), 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-12 10:05:26,408 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:05:26,408 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:05:26,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 10:05:26,408 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:05:26,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:05:26,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1246691471, now seen corresponding path program 1 times [2022-07-12 10:05:26,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:05:26,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400439755] [2022-07-12 10:05:26,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:05:26,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:05:26,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:05:26,568 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-12 10:05:26,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:05:26,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400439755] [2022-07-12 10:05:26,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400439755] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:05:26,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:05:26,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 10:05:26,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051740955] [2022-07-12 10:05:26,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:05:26,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 10:05:26,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:05:26,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 10:05:26,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-07-12 10:05:26,571 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 117 [2022-07-12 10:05:26,572 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 111 transitions, 408 flow. Second operand has 11 states, 11 states have (on average 93.45454545454545) internal successors, (1028), 11 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-12 10:05:26,572 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:05:26,572 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 117 [2022-07-12 10:05:26,572 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:05:26,860 INFO L129 PetriNetUnfolder]: 226/643 cut-off events. [2022-07-12 10:05:26,860 INFO L130 PetriNetUnfolder]: For 3950/4064 co-relation queries the response was YES. [2022-07-12 10:05:26,862 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2643 conditions, 643 events. 226/643 cut-off events. For 3950/4064 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3220 event pairs, 65 based on Foata normal form. 16/632 useless extension candidates. Maximal degree in co-relation 2564. Up to 230 conditions per place. [2022-07-12 10:05:26,865 INFO L132 encePairwiseOnDemand]: 107/117 looper letters, 33 selfloop transitions, 8 changer transitions 25/144 dead transitions. [2022-07-12 10:05:26,866 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 144 transitions, 851 flow [2022-07-12 10:05:26,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 10:05:26,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-12 10:05:26,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1253 transitions. [2022-07-12 10:05:26,869 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8238001314924391 [2022-07-12 10:05:26,869 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1253 transitions. [2022-07-12 10:05:26,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1253 transitions. [2022-07-12 10:05:26,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:05:26,869 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1253 transitions. [2022-07-12 10:05:26,871 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 96.38461538461539) internal successors, (1253), 13 states have internal predecessors, (1253), 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-12 10:05:26,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:26,873 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:26,873 INFO L186 Difference]: Start difference. First operand has 134 places, 111 transitions, 408 flow. Second operand 13 states and 1253 transitions. [2022-07-12 10:05:26,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 144 transitions, 851 flow [2022-07-12 10:05:26,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 144 transitions, 798 flow, removed 20 selfloop flow, removed 6 redundant places. [2022-07-12 10:05:26,878 INFO L242 Difference]: Finished difference. Result has 141 places, 111 transitions, 409 flow [2022-07-12 10:05:26,879 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=409, PETRI_PLACES=141, PETRI_TRANSITIONS=111} [2022-07-12 10:05:26,879 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 19 predicate places. [2022-07-12 10:05:26,879 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 111 transitions, 409 flow [2022-07-12 10:05:26,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 93.45454545454545) internal successors, (1028), 11 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-12 10:05:26,880 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:05:26,880 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-12 10:05:26,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 10:05:26,880 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:05:26,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:05:26,881 INFO L85 PathProgramCache]: Analyzing trace with hash 8261190, now seen corresponding path program 1 times [2022-07-12 10:05:26,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:05:26,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061049870] [2022-07-12 10:05:26,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:05:26,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:05:26,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:05:26,955 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-12 10:05:26,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:05:26,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061049870] [2022-07-12 10:05:26,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061049870] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:05:26,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:05:26,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:05:26,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365245487] [2022-07-12 10:05:26,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:05:26,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:05:26,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:05:26,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:05:26,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:05:26,958 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 117 [2022-07-12 10:05:26,959 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 111 transitions, 409 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-12 10:05:26,959 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:05:26,959 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 117 [2022-07-12 10:05:26,959 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:05:27,335 INFO L129 PetriNetUnfolder]: 471/1170 cut-off events. [2022-07-12 10:05:27,336 INFO L130 PetriNetUnfolder]: For 7347/8053 co-relation queries the response was YES. [2022-07-12 10:05:27,340 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4831 conditions, 1170 events. 471/1170 cut-off events. For 7347/8053 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 7216 event pairs, 92 based on Foata normal form. 12/1132 useless extension candidates. Maximal degree in co-relation 4749. Up to 342 conditions per place. [2022-07-12 10:05:27,345 INFO L132 encePairwiseOnDemand]: 111/117 looper letters, 45 selfloop transitions, 2 changer transitions 17/148 dead transitions. [2022-07-12 10:05:27,345 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 148 transitions, 875 flow [2022-07-12 10:05:27,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 10:05:27,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-12 10:05:27,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 698 transitions. [2022-07-12 10:05:27,347 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8522588522588522 [2022-07-12 10:05:27,347 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 698 transitions. [2022-07-12 10:05:27,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 698 transitions. [2022-07-12 10:05:27,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:05:27,348 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 698 transitions. [2022-07-12 10:05:27,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 99.71428571428571) internal successors, (698), 7 states have internal predecessors, (698), 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-12 10:05:27,350 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 117.0) internal successors, (936), 8 states have internal predecessors, (936), 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-12 10:05:27,351 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 117.0) internal successors, (936), 8 states have internal predecessors, (936), 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-12 10:05:27,351 INFO L186 Difference]: Start difference. First operand has 141 places, 111 transitions, 409 flow. Second operand 7 states and 698 transitions. [2022-07-12 10:05:27,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 148 transitions, 875 flow [2022-07-12 10:05:27,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 148 transitions, 717 flow, removed 71 selfloop flow, removed 17 redundant places. [2022-07-12 10:05:27,360 INFO L242 Difference]: Finished difference. Result has 129 places, 111 transitions, 368 flow [2022-07-12 10:05:27,360 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=368, PETRI_PLACES=129, PETRI_TRANSITIONS=111} [2022-07-12 10:05:27,362 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 7 predicate places. [2022-07-12 10:05:27,363 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 111 transitions, 368 flow [2022-07-12 10:05:27,363 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-12 10:05:27,363 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:05:27,363 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-12 10:05:27,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 10:05:27,364 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:05:27,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:05:27,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1929120366, now seen corresponding path program 2 times [2022-07-12 10:05:27,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:05:27,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117561225] [2022-07-12 10:05:27,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:05:27,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:05:27,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:05:27,471 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-12 10:05:27,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:05:27,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117561225] [2022-07-12 10:05:27,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117561225] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:05:27,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:05:27,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 10:05:27,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568497984] [2022-07-12 10:05:27,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:05:27,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:05:27,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:05:27,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:05:27,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:05:27,477 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 117 [2022-07-12 10:05:27,478 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 111 transitions, 368 flow. Second operand has 6 states, 6 states have (on average 95.33333333333333) internal successors, (572), 6 states have internal predecessors, (572), 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-12 10:05:27,478 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:05:27,478 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 117 [2022-07-12 10:05:27,478 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:05:27,949 INFO L129 PetriNetUnfolder]: 1533/3273 cut-off events. [2022-07-12 10:05:27,949 INFO L130 PetriNetUnfolder]: For 8739/8944 co-relation queries the response was YES. [2022-07-12 10:05:27,959 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9444 conditions, 3273 events. 1533/3273 cut-off events. For 8739/8944 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 25013 event pairs, 88 based on Foata normal form. 11/3163 useless extension candidates. Maximal degree in co-relation 9374. Up to 947 conditions per place. [2022-07-12 10:05:27,967 INFO L132 encePairwiseOnDemand]: 107/117 looper letters, 53 selfloop transitions, 13 changer transitions 33/182 dead transitions. [2022-07-12 10:05:27,967 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 182 transitions, 914 flow [2022-07-12 10:05:27,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 10:05:27,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-12 10:05:27,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1012 transitions. [2022-07-12 10:05:27,970 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.864957264957265 [2022-07-12 10:05:27,970 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1012 transitions. [2022-07-12 10:05:27,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1012 transitions. [2022-07-12 10:05:27,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:05:27,970 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1012 transitions. [2022-07-12 10:05:27,972 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 101.2) internal successors, (1012), 10 states have internal predecessors, (1012), 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-12 10:05:27,974 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 117.0) internal successors, (1287), 11 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:27,974 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 117.0) internal successors, (1287), 11 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:27,974 INFO L186 Difference]: Start difference. First operand has 129 places, 111 transitions, 368 flow. Second operand 10 states and 1012 transitions. [2022-07-12 10:05:27,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 182 transitions, 914 flow [2022-07-12 10:05:27,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 182 transitions, 907 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-07-12 10:05:27,981 INFO L242 Difference]: Finished difference. Result has 137 places, 120 transitions, 447 flow [2022-07-12 10:05:27,981 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=447, PETRI_PLACES=137, PETRI_TRANSITIONS=120} [2022-07-12 10:05:27,981 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 15 predicate places. [2022-07-12 10:05:27,982 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 120 transitions, 447 flow [2022-07-12 10:05:27,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.33333333333333) internal successors, (572), 6 states have internal predecessors, (572), 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-12 10:05:27,983 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:05:27,983 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:05:27,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 10:05:27,983 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:05:27,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:05:27,984 INFO L85 PathProgramCache]: Analyzing trace with hash 554904087, now seen corresponding path program 1 times [2022-07-12 10:05:27,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:05:27,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640289879] [2022-07-12 10:05:27,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:05:27,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:05:28,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:05:28,075 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-12 10:05:28,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:05:28,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640289879] [2022-07-12 10:05:28,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640289879] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:05:28,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:05:28,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:05:28,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057857605] [2022-07-12 10:05:28,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:05:28,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:05:28,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:05:28,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:05:28,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:05:28,080 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 117 [2022-07-12 10:05:28,081 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 120 transitions, 447 flow. Second operand has 7 states, 7 states have (on average 95.14285714285714) internal successors, (666), 7 states have internal predecessors, (666), 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-12 10:05:28,081 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:05:28,081 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 117 [2022-07-12 10:05:28,081 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:05:28,590 INFO L129 PetriNetUnfolder]: 1247/2963 cut-off events. [2022-07-12 10:05:28,591 INFO L130 PetriNetUnfolder]: For 9697/9914 co-relation queries the response was YES. [2022-07-12 10:05:28,603 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10306 conditions, 2963 events. 1247/2963 cut-off events. For 9697/9914 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 24442 event pairs, 67 based on Foata normal form. 73/2978 useless extension candidates. Maximal degree in co-relation 10231. Up to 553 conditions per place. [2022-07-12 10:05:28,610 INFO L132 encePairwiseOnDemand]: 107/117 looper letters, 58 selfloop transitions, 24 changer transitions 42/207 dead transitions. [2022-07-12 10:05:28,610 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 207 transitions, 1285 flow [2022-07-12 10:05:28,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 10:05:28,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-12 10:05:28,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1314 transitions. [2022-07-12 10:05:28,613 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.863905325443787 [2022-07-12 10:05:28,613 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1314 transitions. [2022-07-12 10:05:28,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1314 transitions. [2022-07-12 10:05:28,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:05:28,614 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1314 transitions. [2022-07-12 10:05:28,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 101.07692307692308) internal successors, (1314), 13 states have internal predecessors, (1314), 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-12 10:05:28,617 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:28,618 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:28,618 INFO L186 Difference]: Start difference. First operand has 137 places, 120 transitions, 447 flow. Second operand 13 states and 1314 transitions. [2022-07-12 10:05:28,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 207 transitions, 1285 flow [2022-07-12 10:05:28,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 207 transitions, 1272 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-07-12 10:05:28,632 INFO L242 Difference]: Finished difference. Result has 153 places, 133 transitions, 627 flow [2022-07-12 10:05:28,632 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=423, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=627, PETRI_PLACES=153, PETRI_TRANSITIONS=133} [2022-07-12 10:05:28,633 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 31 predicate places. [2022-07-12 10:05:28,633 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 133 transitions, 627 flow [2022-07-12 10:05:28,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.14285714285714) internal successors, (666), 7 states have internal predecessors, (666), 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-12 10:05:28,633 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:05:28,634 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:05:28,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 10:05:28,634 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:05:28,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:05:28,634 INFO L85 PathProgramCache]: Analyzing trace with hash -916832281, now seen corresponding path program 1 times [2022-07-12 10:05:28,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:05:28,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833828106] [2022-07-12 10:05:28,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:05:28,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:05:28,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:05:28,728 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-12 10:05:28,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:05:28,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833828106] [2022-07-12 10:05:28,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833828106] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:05:28,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:05:28,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 10:05:28,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000182315] [2022-07-12 10:05:28,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:05:28,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 10:05:28,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:05:28,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 10:05:28,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-12 10:05:28,732 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 117 [2022-07-12 10:05:28,733 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 133 transitions, 627 flow. Second operand has 8 states, 8 states have (on average 95.125) internal successors, (761), 8 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:28,733 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:05:28,733 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 117 [2022-07-12 10:05:28,733 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:05:29,211 INFO L129 PetriNetUnfolder]: 1059/2740 cut-off events. [2022-07-12 10:05:29,212 INFO L130 PetriNetUnfolder]: For 11575/11814 co-relation queries the response was YES. [2022-07-12 10:05:29,223 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10610 conditions, 2740 events. 1059/2740 cut-off events. For 11575/11814 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 23749 event pairs, 83 based on Foata normal form. 36/2715 useless extension candidates. Maximal degree in co-relation 10528. Up to 483 conditions per place. [2022-07-12 10:05:29,227 INFO L132 encePairwiseOnDemand]: 107/117 looper letters, 38 selfloop transitions, 22 changer transitions 62/203 dead transitions. [2022-07-12 10:05:29,228 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 203 transitions, 1350 flow [2022-07-12 10:05:29,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 10:05:29,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-07-12 10:05:29,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1582 transitions. [2022-07-12 10:05:29,231 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8450854700854701 [2022-07-12 10:05:29,231 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1582 transitions. [2022-07-12 10:05:29,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1582 transitions. [2022-07-12 10:05:29,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:05:29,232 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1582 transitions. [2022-07-12 10:05:29,234 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 98.875) internal successors, (1582), 16 states have internal predecessors, (1582), 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-12 10:05:29,236 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 117.0) internal successors, (1989), 17 states have internal predecessors, (1989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:29,236 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 117.0) internal successors, (1989), 17 states have internal predecessors, (1989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:29,237 INFO L186 Difference]: Start difference. First operand has 153 places, 133 transitions, 627 flow. Second operand 16 states and 1582 transitions. [2022-07-12 10:05:29,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 203 transitions, 1350 flow [2022-07-12 10:05:29,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 203 transitions, 1255 flow, removed 35 selfloop flow, removed 6 redundant places. [2022-07-12 10:05:29,276 INFO L242 Difference]: Finished difference. Result has 169 places, 124 transitions, 561 flow [2022-07-12 10:05:29,277 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=561, PETRI_PLACES=169, PETRI_TRANSITIONS=124} [2022-07-12 10:05:29,277 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 47 predicate places. [2022-07-12 10:05:29,277 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 124 transitions, 561 flow [2022-07-12 10:05:29,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 95.125) internal successors, (761), 8 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:29,278 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:05:29,278 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:05:29,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 10:05:29,278 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:05:29,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:05:29,279 INFO L85 PathProgramCache]: Analyzing trace with hash -435128938, now seen corresponding path program 1 times [2022-07-12 10:05:29,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:05:29,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702534233] [2022-07-12 10:05:29,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:05:29,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:05:29,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:05:29,435 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-12 10:05:29,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:05:29,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702534233] [2022-07-12 10:05:29,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702534233] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:05:29,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:05:29,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-12 10:05:29,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778406713] [2022-07-12 10:05:29,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:05:29,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 10:05:29,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:05:29,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 10:05:29,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-07-12 10:05:29,443 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 117 [2022-07-12 10:05:29,444 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 124 transitions, 561 flow. Second operand has 13 states, 13 states have (on average 90.76923076923077) internal successors, (1180), 13 states have internal predecessors, (1180), 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-12 10:05:29,444 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:05:29,444 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 117 [2022-07-12 10:05:29,444 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:05:29,840 INFO L129 PetriNetUnfolder]: 298/1709 cut-off events. [2022-07-12 10:05:29,840 INFO L130 PetriNetUnfolder]: For 4659/4803 co-relation queries the response was YES. [2022-07-12 10:05:29,849 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5481 conditions, 1709 events. 298/1709 cut-off events. For 4659/4803 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 17544 event pairs, 3 based on Foata normal form. 1/1611 useless extension candidates. Maximal degree in co-relation 5389. Up to 227 conditions per place. [2022-07-12 10:05:29,851 INFO L132 encePairwiseOnDemand]: 103/117 looper letters, 26 selfloop transitions, 5 changer transitions 41/167 dead transitions. [2022-07-12 10:05:29,852 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 167 transitions, 952 flow [2022-07-12 10:05:29,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 10:05:29,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-07-12 10:05:29,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1488 transitions. [2022-07-12 10:05:29,855 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7948717948717948 [2022-07-12 10:05:29,855 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1488 transitions. [2022-07-12 10:05:29,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1488 transitions. [2022-07-12 10:05:29,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:05:29,855 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1488 transitions. [2022-07-12 10:05:29,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 93.0) internal successors, (1488), 16 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-12 10:05:29,860 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 117.0) internal successors, (1989), 17 states have internal predecessors, (1989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:29,860 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 117.0) internal successors, (1989), 17 states have internal predecessors, (1989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:29,860 INFO L186 Difference]: Start difference. First operand has 169 places, 124 transitions, 561 flow. Second operand 16 states and 1488 transitions. [2022-07-12 10:05:29,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 167 transitions, 952 flow [2022-07-12 10:05:29,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 167 transitions, 784 flow, removed 61 selfloop flow, removed 19 redundant places. [2022-07-12 10:05:29,891 INFO L242 Difference]: Finished difference. Result has 165 places, 121 transitions, 482 flow [2022-07-12 10:05:29,892 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=482, PETRI_PLACES=165, PETRI_TRANSITIONS=121} [2022-07-12 10:05:29,892 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 43 predicate places. [2022-07-12 10:05:29,892 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 121 transitions, 482 flow [2022-07-12 10:05:29,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 90.76923076923077) internal successors, (1180), 13 states have internal predecessors, (1180), 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-12 10:05:29,893 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:05:29,893 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:05:29,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 10:05:29,893 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:05:29,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:05:29,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1773163082, now seen corresponding path program 2 times [2022-07-12 10:05:29,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:05:29,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576335572] [2022-07-12 10:05:29,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:05:29,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:05:29,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:05:30,133 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-12 10:05:30,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:05:30,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576335572] [2022-07-12 10:05:30,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576335572] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:05:30,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:05:30,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-12 10:05:30,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546083559] [2022-07-12 10:05:30,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:05:30,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 10:05:30,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:05:30,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 10:05:30,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-07-12 10:05:30,136 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 117 [2022-07-12 10:05:30,137 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 121 transitions, 482 flow. Second operand has 14 states, 14 states have (on average 89.71428571428571) internal successors, (1256), 14 states have internal predecessors, (1256), 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-12 10:05:30,137 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:05:30,138 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 117 [2022-07-12 10:05:30,138 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:05:30,465 INFO L129 PetriNetUnfolder]: 101/761 cut-off events. [2022-07-12 10:05:30,466 INFO L130 PetriNetUnfolder]: For 783/811 co-relation queries the response was YES. [2022-07-12 10:05:30,469 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1918 conditions, 761 events. 101/761 cut-off events. For 783/811 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 6207 event pairs, 2 based on Foata normal form. 7/733 useless extension candidates. Maximal degree in co-relation 1888. Up to 88 conditions per place. [2022-07-12 10:05:30,471 INFO L132 encePairwiseOnDemand]: 106/117 looper letters, 26 selfloop transitions, 8 changer transitions 6/134 dead transitions. [2022-07-12 10:05:30,471 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 134 transitions, 630 flow [2022-07-12 10:05:30,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 10:05:30,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-07-12 10:05:30,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1006 transitions. [2022-07-12 10:05:30,482 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7816627816627817 [2022-07-12 10:05:30,482 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1006 transitions. [2022-07-12 10:05:30,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1006 transitions. [2022-07-12 10:05:30,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:05:30,482 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1006 transitions. [2022-07-12 10:05:30,483 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 91.45454545454545) internal successors, (1006), 11 states have internal predecessors, (1006), 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-12 10:05:30,485 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 117.0) internal successors, (1404), 12 states have internal predecessors, (1404), 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-12 10:05:30,485 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 117.0) internal successors, (1404), 12 states have internal predecessors, (1404), 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-12 10:05:30,485 INFO L186 Difference]: Start difference. First operand has 165 places, 121 transitions, 482 flow. Second operand 11 states and 1006 transitions. [2022-07-12 10:05:30,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 134 transitions, 630 flow [2022-07-12 10:05:30,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 134 transitions, 586 flow, removed 18 selfloop flow, removed 12 redundant places. [2022-07-12 10:05:30,506 INFO L242 Difference]: Finished difference. Result has 156 places, 123 transitions, 502 flow [2022-07-12 10:05:30,507 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=502, PETRI_PLACES=156, PETRI_TRANSITIONS=123} [2022-07-12 10:05:30,507 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 34 predicate places. [2022-07-12 10:05:30,507 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 123 transitions, 502 flow [2022-07-12 10:05:30,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 89.71428571428571) internal successors, (1256), 14 states have internal predecessors, (1256), 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-12 10:05:30,508 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:05:30,508 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:05:30,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 10:05:30,508 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:05:30,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:05:30,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1552525772, now seen corresponding path program 3 times [2022-07-12 10:05:30,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:05:30,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984427411] [2022-07-12 10:05:30,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:05:30,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:05:30,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:05:30,966 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-12 10:05:30,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:05:30,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984427411] [2022-07-12 10:05:30,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984427411] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:05:30,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:05:30,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-12 10:05:30,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122343517] [2022-07-12 10:05:30,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:05:30,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 10:05:30,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:05:30,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 10:05:30,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-07-12 10:05:30,969 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 117 [2022-07-12 10:05:30,970 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 123 transitions, 502 flow. Second operand has 15 states, 15 states have (on average 89.6) internal successors, (1344), 15 states have internal predecessors, (1344), 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-12 10:05:30,970 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:05:30,971 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 117 [2022-07-12 10:05:30,971 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:05:31,477 INFO L129 PetriNetUnfolder]: 125/897 cut-off events. [2022-07-12 10:05:31,477 INFO L130 PetriNetUnfolder]: For 992/1026 co-relation queries the response was YES. [2022-07-12 10:05:31,481 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2250 conditions, 897 events. 125/897 cut-off events. For 992/1026 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 7707 event pairs, 3 based on Foata normal form. 8/864 useless extension candidates. Maximal degree in co-relation 2222. Up to 112 conditions per place. [2022-07-12 10:05:31,482 INFO L132 encePairwiseOnDemand]: 106/117 looper letters, 21 selfloop transitions, 8 changer transitions 13/136 dead transitions. [2022-07-12 10:05:31,482 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 136 transitions, 647 flow [2022-07-12 10:05:31,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 10:05:31,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-12 10:05:31,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1185 transitions. [2022-07-12 10:05:31,484 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7790927021696252 [2022-07-12 10:05:31,485 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1185 transitions. [2022-07-12 10:05:31,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1185 transitions. [2022-07-12 10:05:31,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:05:31,487 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1185 transitions. [2022-07-12 10:05:31,488 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 91.15384615384616) internal successors, (1185), 13 states have internal predecessors, (1185), 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-12 10:05:31,499 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:31,500 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:31,501 INFO L186 Difference]: Start difference. First operand has 156 places, 123 transitions, 502 flow. Second operand 13 states and 1185 transitions. [2022-07-12 10:05:31,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 136 transitions, 647 flow [2022-07-12 10:05:31,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 136 transitions, 620 flow, removed 8 selfloop flow, removed 8 redundant places. [2022-07-12 10:05:31,510 INFO L242 Difference]: Finished difference. Result has 161 places, 120 transitions, 479 flow [2022-07-12 10:05:31,510 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=479, PETRI_PLACES=161, PETRI_TRANSITIONS=120} [2022-07-12 10:05:31,511 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 39 predicate places. [2022-07-12 10:05:31,512 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 120 transitions, 479 flow [2022-07-12 10:05:31,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 89.6) internal successors, (1344), 15 states have internal predecessors, (1344), 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-12 10:05:31,512 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:05:31,512 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:05:31,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 10:05:31,513 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:05:31,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:05:31,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1038619050, now seen corresponding path program 4 times [2022-07-12 10:05:31,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:05:31,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640116849] [2022-07-12 10:05:31,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:05:31,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:05:31,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 10:05:31,556 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 10:05:31,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 10:05:31,630 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 10:05:31,630 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 10:05:31,631 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-07-12 10:05:31,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-07-12 10:05:31,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-07-12 10:05:31,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-07-12 10:05:31,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-07-12 10:05:31,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-07-12 10:05:31,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 10:05:31,633 INFO L356 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:05:31,637 INFO L226 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-07-12 10:05:31,638 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 10:05:31,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 10:05:31 BasicIcfg [2022-07-12 10:05:31,744 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 10:05:31,745 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 10:05:31,745 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 10:05:31,745 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 10:05:31,745 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:05:23" (3/4) ... [2022-07-12 10:05:31,746 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-12 10:05:31,804 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 10:05:31,804 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 10:05:31,805 INFO L158 Benchmark]: Toolchain (without parser) took 9335.09ms. Allocated memory was 123.7MB in the beginning and 450.9MB in the end (delta: 327.2MB). Free memory was 97.5MB in the beginning and 236.5MB in the end (delta: -139.0MB). Peak memory consumption was 188.2MB. Max. memory is 16.1GB. [2022-07-12 10:05:31,805 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 123.7MB. Free memory is still 82.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 10:05:31,805 INFO L158 Benchmark]: CACSL2BoogieTranslator took 489.16ms. Allocated memory is still 123.7MB. Free memory was 97.2MB in the beginning and 86.4MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 10:05:31,806 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.43ms. Allocated memory is still 123.7MB. Free memory was 86.4MB in the beginning and 83.7MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-12 10:05:31,806 INFO L158 Benchmark]: Boogie Preprocessor took 51.94ms. Allocated memory is still 123.7MB. Free memory was 83.3MB in the beginning and 81.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 10:05:31,806 INFO L158 Benchmark]: RCFGBuilder took 860.52ms. Allocated memory was 123.7MB in the beginning and 169.9MB in the end (delta: 46.1MB). Free memory was 81.2MB in the beginning and 93.9MB in the end (delta: -12.8MB). Peak memory consumption was 40.4MB. Max. memory is 16.1GB. [2022-07-12 10:05:31,806 INFO L158 Benchmark]: TraceAbstraction took 7801.62ms. Allocated memory was 169.9MB in the beginning and 450.9MB in the end (delta: 281.0MB). Free memory was 93.2MB in the beginning and 263.8MB in the end (delta: -170.6MB). Peak memory consumption was 109.1MB. Max. memory is 16.1GB. [2022-07-12 10:05:31,807 INFO L158 Benchmark]: Witness Printer took 59.97ms. Allocated memory is still 450.9MB. Free memory was 263.8MB in the beginning and 236.5MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-07-12 10:05:31,808 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.18ms. Allocated memory is still 123.7MB. Free memory is still 82.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 489.16ms. Allocated memory is still 123.7MB. Free memory was 97.2MB in the beginning and 86.4MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.43ms. Allocated memory is still 123.7MB. Free memory was 86.4MB in the beginning and 83.7MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.94ms. Allocated memory is still 123.7MB. Free memory was 83.3MB in the beginning and 81.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 860.52ms. Allocated memory was 123.7MB in the beginning and 169.9MB in the end (delta: 46.1MB). Free memory was 81.2MB in the beginning and 93.9MB in the end (delta: -12.8MB). Peak memory consumption was 40.4MB. Max. memory is 16.1GB. * TraceAbstraction took 7801.62ms. Allocated memory was 169.9MB in the beginning and 450.9MB in the end (delta: 281.0MB). Free memory was 93.2MB in the beginning and 263.8MB in the end (delta: -170.6MB). Peak memory consumption was 109.1MB. Max. memory is 16.1GB. * Witness Printer took 59.97ms. Allocated memory is still 450.9MB. Free memory was 263.8MB in the beginning and 236.5MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. 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_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L713] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L715] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L716] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L717] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L719] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L720] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L721] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L722] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L723] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L724] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L725] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L726] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L727] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L728] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L729] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L730] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L731] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L732] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L733] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L734] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L735] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L737] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L739] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L740] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L741] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L825] 0 pthread_t t515; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t515={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L826] FCALL, FORK 0 pthread_create(&t515, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t515, ((void *)0), P0, ((void *)0))=-2, t515={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L827] 0 pthread_t t516; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t515={5:0}, t516={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L828] FCALL, FORK 0 pthread_create(&t516, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t516, ((void *)0), P1, ((void *)0))=-1, t515={5:0}, t516={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L765] 2 x$w_buff1 = x$w_buff0 [L766] 2 x$w_buff0 = 2 [L767] 2 x$w_buff1_used = x$w_buff0_used [L768] 2 x$w_buff0_used = (_Bool)1 [L769] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L769] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L770] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L771] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L772] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L773] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L774] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L829] 0 pthread_t t517; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t515={5:0}, t516={6:0}, t517={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L830] FCALL, FORK 0 pthread_create(&t517, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t517, ((void *)0), P2, ((void *)0))=0, t515={5:0}, t516={6:0}, t517={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L777] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L794] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L797] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L800] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L745] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L748] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L751] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L751] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L752] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L752] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L753] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L753] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L754] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L754] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L755] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L755] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L780] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L781] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L782] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L783] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L783] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L784] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L784] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L803] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L803] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L803] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L803] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L804] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L804] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L805] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L805] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L806] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L806] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L807] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L807] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t515={5:0}, t516={6:0}, t517={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L834] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L834] RET 0 assume_abort_if_not(main$tmp_guard0) [L836] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L836] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L836] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L836] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L837] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L837] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L838] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L838] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L839] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L839] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L840] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L840] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L843] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L844] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L845] 0 x$flush_delayed = weak$$choice2 [L846] 0 x$mem_tmp = x [L847] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L847] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L848] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L848] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L849] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L849] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L850] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L850] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L851] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L852] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L853] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L853] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L854] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L855] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L855] 0 x = x$flush_delayed ? x$mem_tmp : x [L856] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t515={5:0}, t516={6:0}, t517={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L858] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, 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: 826]: 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: 828]: 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: 830]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 145 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.6s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 658 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 658 mSDsluCounter, 580 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1007 mSDsCounter, 222 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1671 IncrementalHoareTripleChecker+Invalid, 1893 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 222 mSolverCounterUnsat, 104 mSDtfsCounter, 1671 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 183 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=627occurred in iteration=8, InterpolantAutomatonStates: 137, 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.5s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1064 NumberOfCodeBlocks, 1064 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 961 ConstructedInterpolants, 0 QuantifiedInterpolants, 5823 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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-12 10:05:31,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE