./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix043.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d 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 ../../../trunk/examples/svcomp/pthread-wmm/mix043.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 9bfd96daa3950021158d7079dc25a62741fa5d5a7f9e521049c1a78760db50f1 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 16:51:01,401 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 16:51:01,402 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 16:51:01,444 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 16:51:01,446 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 16:51:01,449 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 16:51:01,451 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 16:51:01,454 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 16:51:01,456 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 16:51:01,461 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 16:51:01,462 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 16:51:01,464 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 16:51:01,465 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 16:51:01,467 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 16:51:01,469 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 16:51:01,474 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 16:51:01,476 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 16:51:01,477 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 16:51:01,479 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 16:51:01,484 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 16:51:01,485 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 16:51:01,486 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 16:51:01,487 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 16:51:01,488 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 16:51:01,494 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 16:51:01,495 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 16:51:01,495 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 16:51:01,497 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 16:51:01,498 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 16:51:01,498 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 16:51:01,499 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 16:51:01,505 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 16:51:01,507 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 16:51:01,508 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 16:51:01,508 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 16:51:01,509 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 16:51:01,509 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 16:51:01,509 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 16:51:01,509 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 16:51:01,510 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 16:51:01,511 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 16:51:01,512 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 16:51:01,556 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 16:51:01,556 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 16:51:01,557 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 16:51:01,557 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 16:51:01,558 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 16:51:01,558 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 16:51:01,559 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 16:51:01,559 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 16:51:01,559 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 16:51:01,559 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 16:51:01,560 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 16:51:01,560 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 16:51:01,561 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 16:51:01,561 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 16:51:01,561 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 16:51:01,561 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 16:51:01,561 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 16:51:01,561 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 16:51:01,562 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 16:51:01,562 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 16:51:01,562 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 16:51:01,562 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 16:51:01,562 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 16:51:01,562 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 16:51:01,563 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:51:01,563 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 16:51:01,563 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 16:51:01,563 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 16:51:01,563 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 16:51:01,564 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 16:51:01,564 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 16:51:01,564 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 16:51:01,564 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 16:51:01,564 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 16:51:01,565 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 16:51:01,565 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 9bfd96daa3950021158d7079dc25a62741fa5d5a7f9e521049c1a78760db50f1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-30 16:51:01,851 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 16:51:01,869 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 16:51:01,872 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 16:51:01,873 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 16:51:01,873 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 16:51:01,875 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix043.oepc.i [2023-08-30 16:51:03,003 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 16:51:03,293 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 16:51:03,294 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix043.oepc.i [2023-08-30 16:51:03,305 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ab4580b0/628ff4fe64ac4feba2862711bd4b94a3/FLAGcd53c2e30 [2023-08-30 16:51:03,319 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ab4580b0/628ff4fe64ac4feba2862711bd4b94a3 [2023-08-30 16:51:03,324 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 16:51:03,325 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 16:51:03,328 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 16:51:03,328 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 16:51:03,331 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 16:51:03,331 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:51:03" (1/1) ... [2023-08-30 16:51:03,332 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@108553de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:51:03, skipping insertion in model container [2023-08-30 16:51:03,332 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:51:03" (1/1) ... [2023-08-30 16:51:03,339 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 16:51:03,387 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 16:51:03,528 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix043.oepc.i[945,958] [2023-08-30 16:51:03,771 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:51:03,781 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 16:51:03,793 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix043.oepc.i[945,958] [2023-08-30 16:51:03,867 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:51:03,906 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:51:03,906 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:51:03,912 INFO L208 MainTranslator]: Completed translation [2023-08-30 16:51:03,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:51:03 WrapperNode [2023-08-30 16:51:03,913 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 16:51:03,915 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 16:51:03,915 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 16:51:03,915 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 16:51:03,922 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:51:03" (1/1) ... [2023-08-30 16:51:03,954 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:51:03" (1/1) ... [2023-08-30 16:51:03,995 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2023-08-30 16:51:03,996 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 16:51:03,998 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 16:51:03,998 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 16:51:03,999 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 16:51:04,007 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:51:03" (1/1) ... [2023-08-30 16:51:04,007 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:51:03" (1/1) ... [2023-08-30 16:51:04,022 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:51:03" (1/1) ... [2023-08-30 16:51:04,023 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:51:03" (1/1) ... [2023-08-30 16:51:04,033 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:51:03" (1/1) ... [2023-08-30 16:51:04,041 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:51:03" (1/1) ... [2023-08-30 16:51:04,047 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:51:03" (1/1) ... [2023-08-30 16:51:04,053 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:51:03" (1/1) ... [2023-08-30 16:51:04,056 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 16:51:04,057 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 16:51:04,061 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 16:51:04,061 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 16:51:04,062 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:51:03" (1/1) ... [2023-08-30 16:51:04,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:51:04,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:51:04,095 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) [2023-08-30 16:51:04,113 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 [2023-08-30 16:51:04,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 16:51:04,139 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 16:51:04,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 16:51:04,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 16:51:04,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 16:51:04,141 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 16:51:04,141 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 16:51:04,141 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 16:51:04,142 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 16:51:04,142 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 16:51:04,142 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 16:51:04,142 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 16:51:04,142 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 16:51:04,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 16:51:04,142 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 16:51:04,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 16:51:04,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 16:51:04,144 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 16:51:04,334 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 16:51:04,336 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 16:51:04,634 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 16:51:04,807 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 16:51:04,808 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 16:51:04,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:51:04 BoogieIcfgContainer [2023-08-30 16:51:04,810 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 16:51:04,812 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 16:51:04,812 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 16:51:04,815 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 16:51:04,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 04:51:03" (1/3) ... [2023-08-30 16:51:04,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@349b0e79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:51:04, skipping insertion in model container [2023-08-30 16:51:04,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:51:03" (2/3) ... [2023-08-30 16:51:04,817 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@349b0e79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:51:04, skipping insertion in model container [2023-08-30 16:51:04,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:51:04" (3/3) ... [2023-08-30 16:51:04,818 INFO L112 eAbstractionObserver]: Analyzing ICFG mix043.oepc.i [2023-08-30 16:51:04,831 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 16:51:04,840 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 16:51:04,840 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 16:51:04,841 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 16:51:04,913 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 16:51:04,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 133 transitions, 286 flow [2023-08-30 16:51:05,026 INFO L130 PetriNetUnfolder]: 2/129 cut-off events. [2023-08-30 16:51:05,027 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:51:05,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-08-30 16:51:05,033 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 133 transitions, 286 flow [2023-08-30 16:51:05,040 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 129 transitions, 270 flow [2023-08-30 16:51:05,044 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 16:51:05,063 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 129 transitions, 270 flow [2023-08-30 16:51:05,067 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 129 transitions, 270 flow [2023-08-30 16:51:05,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 270 flow [2023-08-30 16:51:05,114 INFO L130 PetriNetUnfolder]: 2/129 cut-off events. [2023-08-30 16:51:05,115 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:51:05,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-08-30 16:51:05,120 INFO L119 LiptonReduction]: Number of co-enabled transitions 3270 [2023-08-30 16:51:09,049 INFO L134 LiptonReduction]: Checked pairs total: 8894 [2023-08-30 16:51:09,050 INFO L136 LiptonReduction]: Total number of compositions: 109 [2023-08-30 16:51:09,062 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 16:51:09,067 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6e80dfdf, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 16:51:09,068 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-30 16:51:09,070 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2023-08-30 16:51:09,070 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:51:09,071 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:09,071 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 16:51:09,072 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:09,076 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:09,076 INFO L85 PathProgramCache]: Analyzing trace with hash 553531, now seen corresponding path program 1 times [2023-08-30 16:51:09,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:09,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765573840] [2023-08-30 16:51:09,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:09,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:09,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:51:09,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:51:09,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:51:09,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765573840] [2023-08-30 16:51:09,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765573840] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:51:09,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:51:09,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:51:09,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567710931] [2023-08-30 16:51:09,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:51:09,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:51:09,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:51:09,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:51:09,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:51:09,481 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 242 [2023-08-30 16:51:09,486 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 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) [2023-08-30 16:51:09,486 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:51:09,486 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 242 [2023-08-30 16:51:09,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:51:10,501 INFO L130 PetriNetUnfolder]: 5879/8109 cut-off events. [2023-08-30 16:51:10,501 INFO L131 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES. [2023-08-30 16:51:10,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16253 conditions, 8109 events. 5879/8109 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 40514 event pairs, 2239 based on Foata normal form. 0/7719 useless extension candidates. Maximal degree in co-relation 16241. Up to 6367 conditions per place. [2023-08-30 16:51:10,548 INFO L137 encePairwiseOnDemand]: 238/242 looper letters, 43 selfloop transitions, 2 changer transitions 2/50 dead transitions. [2023-08-30 16:51:10,548 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 50 transitions, 215 flow [2023-08-30 16:51:10,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:51:10,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:51:10,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 401 transitions. [2023-08-30 16:51:10,565 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5523415977961432 [2023-08-30 16:51:10,566 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 401 transitions. [2023-08-30 16:51:10,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 401 transitions. [2023-08-30 16:51:10,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:51:10,571 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 401 transitions. [2023-08-30 16:51:10,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 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) [2023-08-30 16:51:10,581 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 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) [2023-08-30 16:51:10,582 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 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) [2023-08-30 16:51:10,583 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 74 flow. Second operand 3 states and 401 transitions. [2023-08-30 16:51:10,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 50 transitions, 215 flow [2023-08-30 16:51:10,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 208 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 16:51:10,588 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 68 flow [2023-08-30 16:51:10,590 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2023-08-30 16:51:10,593 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2023-08-30 16:51:10,593 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 68 flow [2023-08-30 16:51:10,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 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) [2023-08-30 16:51:10,594 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:10,594 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:51:10,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 16:51:10,595 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:10,595 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:10,595 INFO L85 PathProgramCache]: Analyzing trace with hash 276887586, now seen corresponding path program 1 times [2023-08-30 16:51:10,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:10,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612850714] [2023-08-30 16:51:10,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:10,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:10,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:51:10,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:51:10,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:51:10,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612850714] [2023-08-30 16:51:10,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612850714] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:51:10,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:51:10,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:51:10,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610604111] [2023-08-30 16:51:10,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:51:10,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:51:10,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:51:10,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:51:10,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:51:10,953 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 242 [2023-08-30 16:51:10,954 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 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) [2023-08-30 16:51:10,954 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:51:10,954 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 242 [2023-08-30 16:51:10,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:51:11,798 INFO L130 PetriNetUnfolder]: 5847/7940 cut-off events. [2023-08-30 16:51:11,799 INFO L131 PetriNetUnfolder]: For 521/521 co-relation queries the response was YES. [2023-08-30 16:51:11,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16604 conditions, 7940 events. 5847/7940 cut-off events. For 521/521 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 38042 event pairs, 1383 based on Foata normal form. 32/7967 useless extension candidates. Maximal degree in co-relation 16594. Up to 7393 conditions per place. [2023-08-30 16:51:11,844 INFO L137 encePairwiseOnDemand]: 238/242 looper letters, 36 selfloop transitions, 3 changer transitions 0/41 dead transitions. [2023-08-30 16:51:11,844 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 41 transitions, 176 flow [2023-08-30 16:51:11,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:51:11,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:51:11,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 385 transitions. [2023-08-30 16:51:11,846 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5303030303030303 [2023-08-30 16:51:11,847 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 385 transitions. [2023-08-30 16:51:11,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 385 transitions. [2023-08-30 16:51:11,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:51:11,847 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 385 transitions. [2023-08-30 16:51:11,848 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 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) [2023-08-30 16:51:11,851 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 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) [2023-08-30 16:51:11,852 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 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) [2023-08-30 16:51:11,852 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 68 flow. Second operand 3 states and 385 transitions. [2023-08-30 16:51:11,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 41 transitions, 176 flow [2023-08-30 16:51:11,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 41 transitions, 170 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:51:11,855 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 83 flow [2023-08-30 16:51:11,855 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=83, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2023-08-30 16:51:11,856 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2023-08-30 16:51:11,856 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 83 flow [2023-08-30 16:51:11,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 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) [2023-08-30 16:51:11,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:11,857 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:51:11,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 16:51:11,857 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:11,859 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:11,860 INFO L85 PathProgramCache]: Analyzing trace with hash -6421539, now seen corresponding path program 1 times [2023-08-30 16:51:11,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:11,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087951088] [2023-08-30 16:51:11,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:11,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:11,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:51:12,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:51:12,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:51:12,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087951088] [2023-08-30 16:51:12,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087951088] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:51:12,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:51:12,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:51:12,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017572902] [2023-08-30 16:51:12,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:51:12,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:51:12,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:51:12,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:51:12,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:51:12,155 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 242 [2023-08-30 16:51:12,156 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 83 flow. Second operand has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 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) [2023-08-30 16:51:12,156 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:51:12,156 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 242 [2023-08-30 16:51:12,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:51:13,694 INFO L130 PetriNetUnfolder]: 11809/16070 cut-off events. [2023-08-30 16:51:13,695 INFO L131 PetriNetUnfolder]: For 1485/1485 co-relation queries the response was YES. [2023-08-30 16:51:13,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34207 conditions, 16070 events. 11809/16070 cut-off events. For 1485/1485 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 78459 event pairs, 2914 based on Foata normal form. 500/16570 useless extension candidates. Maximal degree in co-relation 34196. Up to 8556 conditions per place. [2023-08-30 16:51:13,808 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 53 selfloop transitions, 6 changer transitions 0/59 dead transitions. [2023-08-30 16:51:13,808 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 59 transitions, 261 flow [2023-08-30 16:51:13,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:51:13,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:51:13,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 491 transitions. [2023-08-30 16:51:13,810 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5072314049586777 [2023-08-30 16:51:13,811 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 491 transitions. [2023-08-30 16:51:13,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 491 transitions. [2023-08-30 16:51:13,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:51:13,811 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 491 transitions. [2023-08-30 16:51:13,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 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) [2023-08-30 16:51:13,814 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 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) [2023-08-30 16:51:13,815 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 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) [2023-08-30 16:51:13,815 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 83 flow. Second operand 4 states and 491 transitions. [2023-08-30 16:51:13,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 59 transitions, 261 flow [2023-08-30 16:51:13,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 59 transitions, 258 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 16:51:13,817 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 126 flow [2023-08-30 16:51:13,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=126, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2023-08-30 16:51:13,818 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2023-08-30 16:51:13,818 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 126 flow [2023-08-30 16:51:13,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 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) [2023-08-30 16:51:13,819 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:13,819 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:51:13,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 16:51:13,820 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:13,820 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:13,820 INFO L85 PathProgramCache]: Analyzing trace with hash -269327850, now seen corresponding path program 1 times [2023-08-30 16:51:13,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:13,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566622550] [2023-08-30 16:51:13,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:13,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:13,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:51:14,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:51:14,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:51:14,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566622550] [2023-08-30 16:51:14,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566622550] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:51:14,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:51:14,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:51:14,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065735786] [2023-08-30 16:51:14,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:51:14,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:51:14,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:51:14,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:51:14,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:51:14,029 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 242 [2023-08-30 16:51:14,030 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 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) [2023-08-30 16:51:14,031 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:51:14,031 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 242 [2023-08-30 16:51:14,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:51:15,089 INFO L130 PetriNetUnfolder]: 7412/10761 cut-off events. [2023-08-30 16:51:15,089 INFO L131 PetriNetUnfolder]: For 3608/3715 co-relation queries the response was YES. [2023-08-30 16:51:15,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24832 conditions, 10761 events. 7412/10761 cut-off events. For 3608/3715 co-relation queries the response was YES. Maximal size of possible extension queue 572. Compared 63382 event pairs, 1363 based on Foata normal form. 821/11216 useless extension candidates. Maximal degree in co-relation 24817. Up to 6780 conditions per place. [2023-08-30 16:51:15,145 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 72 selfloop transitions, 10 changer transitions 0/89 dead transitions. [2023-08-30 16:51:15,145 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 89 transitions, 448 flow [2023-08-30 16:51:15,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:51:15,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:51:15,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 621 transitions. [2023-08-30 16:51:15,152 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5132231404958678 [2023-08-30 16:51:15,152 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 621 transitions. [2023-08-30 16:51:15,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 621 transitions. [2023-08-30 16:51:15,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:51:15,153 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 621 transitions. [2023-08-30 16:51:15,154 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 124.2) internal successors, (621), 5 states have internal predecessors, (621), 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) [2023-08-30 16:51:15,156 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 242.0) internal successors, (1452), 6 states have internal predecessors, (1452), 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) [2023-08-30 16:51:15,157 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 242.0) internal successors, (1452), 6 states have internal predecessors, (1452), 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) [2023-08-30 16:51:15,158 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 126 flow. Second operand 5 states and 621 transitions. [2023-08-30 16:51:15,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 89 transitions, 448 flow [2023-08-30 16:51:15,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 89 transitions, 443 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 16:51:15,168 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 199 flow [2023-08-30 16:51:15,168 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=199, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2023-08-30 16:51:15,170 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 8 predicate places. [2023-08-30 16:51:15,170 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 199 flow [2023-08-30 16:51:15,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 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) [2023-08-30 16:51:15,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:15,171 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:51:15,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 16:51:15,171 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:15,171 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:15,171 INFO L85 PathProgramCache]: Analyzing trace with hash -39621490, now seen corresponding path program 1 times [2023-08-30 16:51:15,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:15,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374257171] [2023-08-30 16:51:15,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:15,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:15,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:51:15,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:51:15,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:51:15,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374257171] [2023-08-30 16:51:15,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374257171] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:51:15,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:51:15,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:51:15,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261553274] [2023-08-30 16:51:15,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:51:15,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:51:15,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:51:15,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:51:15,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:51:15,558 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 242 [2023-08-30 16:51:15,559 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 199 flow. Second operand has 5 states, 5 states have (on average 112.2) internal successors, (561), 5 states have internal predecessors, (561), 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) [2023-08-30 16:51:15,559 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:51:15,559 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 242 [2023-08-30 16:51:15,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:51:16,555 INFO L130 PetriNetUnfolder]: 5864/8745 cut-off events. [2023-08-30 16:51:16,555 INFO L131 PetriNetUnfolder]: For 5144/5180 co-relation queries the response was YES. [2023-08-30 16:51:16,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25646 conditions, 8745 events. 5864/8745 cut-off events. For 5144/5180 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 52624 event pairs, 717 based on Foata normal form. 527/8997 useless extension candidates. Maximal degree in co-relation 25627. Up to 2675 conditions per place. [2023-08-30 16:51:16,612 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 100 selfloop transitions, 19 changer transitions 0/126 dead transitions. [2023-08-30 16:51:16,612 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 126 transitions, 728 flow [2023-08-30 16:51:16,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:51:16,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:51:16,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 872 transitions. [2023-08-30 16:51:16,615 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5147579693034239 [2023-08-30 16:51:16,616 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 872 transitions. [2023-08-30 16:51:16,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 872 transitions. [2023-08-30 16:51:16,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:51:16,617 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 872 transitions. [2023-08-30 16:51:16,619 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.57142857142857) internal successors, (872), 7 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:16,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 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) [2023-08-30 16:51:16,622 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 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) [2023-08-30 16:51:16,622 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 199 flow. Second operand 7 states and 872 transitions. [2023-08-30 16:51:16,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 126 transitions, 728 flow [2023-08-30 16:51:16,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 126 transitions, 723 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 16:51:16,664 INFO L231 Difference]: Finished difference. Result has 59 places, 52 transitions, 328 flow [2023-08-30 16:51:16,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=328, PETRI_PLACES=59, PETRI_TRANSITIONS=52} [2023-08-30 16:51:16,665 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 16 predicate places. [2023-08-30 16:51:16,666 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 52 transitions, 328 flow [2023-08-30 16:51:16,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.2) internal successors, (561), 5 states have internal predecessors, (561), 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) [2023-08-30 16:51:16,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:16,666 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:51:16,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 16:51:16,667 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:16,667 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:16,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1029788051, now seen corresponding path program 1 times [2023-08-30 16:51:16,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:16,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658358343] [2023-08-30 16:51:16,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:16,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:51:17,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:51:17,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:51:17,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658358343] [2023-08-30 16:51:17,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658358343] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:51:17,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:51:17,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:51:17,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909173655] [2023-08-30 16:51:17,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:51:17,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:51:17,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:51:17,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:51:17,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:51:17,066 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 242 [2023-08-30 16:51:17,067 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 52 transitions, 328 flow. Second operand has 6 states, 6 states have (on average 112.16666666666667) internal successors, (673), 6 states have internal predecessors, (673), 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) [2023-08-30 16:51:17,068 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:51:17,068 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 242 [2023-08-30 16:51:17,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:51:18,033 INFO L130 PetriNetUnfolder]: 5391/8033 cut-off events. [2023-08-30 16:51:18,033 INFO L131 PetriNetUnfolder]: For 10341/10363 co-relation queries the response was YES. [2023-08-30 16:51:18,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27497 conditions, 8033 events. 5391/8033 cut-off events. For 10341/10363 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 48095 event pairs, 604 based on Foata normal form. 191/7966 useless extension candidates. Maximal degree in co-relation 27474. Up to 2537 conditions per place. [2023-08-30 16:51:18,079 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 111 selfloop transitions, 28 changer transitions 13/159 dead transitions. [2023-08-30 16:51:18,079 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 159 transitions, 1045 flow [2023-08-30 16:51:18,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 16:51:18,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 16:51:18,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1121 transitions. [2023-08-30 16:51:18,083 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5146923783287419 [2023-08-30 16:51:18,083 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1121 transitions. [2023-08-30 16:51:18,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1121 transitions. [2023-08-30 16:51:18,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:51:18,084 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1121 transitions. [2023-08-30 16:51:18,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 124.55555555555556) internal successors, (1121), 9 states have internal predecessors, (1121), 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) [2023-08-30 16:51:18,089 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 242.0) internal successors, (2420), 10 states have internal predecessors, (2420), 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) [2023-08-30 16:51:18,090 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 242.0) internal successors, (2420), 10 states have internal predecessors, (2420), 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) [2023-08-30 16:51:18,090 INFO L175 Difference]: Start difference. First operand has 59 places, 52 transitions, 328 flow. Second operand 9 states and 1121 transitions. [2023-08-30 16:51:18,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 159 transitions, 1045 flow [2023-08-30 16:51:18,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 159 transitions, 995 flow, removed 17 selfloop flow, removed 3 redundant places. [2023-08-30 16:51:18,484 INFO L231 Difference]: Finished difference. Result has 67 places, 61 transitions, 456 flow [2023-08-30 16:51:18,485 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=456, PETRI_PLACES=67, PETRI_TRANSITIONS=61} [2023-08-30 16:51:18,486 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 24 predicate places. [2023-08-30 16:51:18,486 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 456 flow [2023-08-30 16:51:18,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.16666666666667) internal successors, (673), 6 states have internal predecessors, (673), 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) [2023-08-30 16:51:18,486 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:18,487 INFO L208 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] [2023-08-30 16:51:18,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 16:51:18,487 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:18,487 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:18,487 INFO L85 PathProgramCache]: Analyzing trace with hash -2143376969, now seen corresponding path program 1 times [2023-08-30 16:51:18,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:18,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056633600] [2023-08-30 16:51:18,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:18,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:18,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:51:18,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:51:18,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:51:18,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056633600] [2023-08-30 16:51:18,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056633600] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:51:18,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:51:18,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:51:18,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960934281] [2023-08-30 16:51:18,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:51:18,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:51:18,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:51:18,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:51:18,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:51:18,841 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 242 [2023-08-30 16:51:18,842 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 61 transitions, 456 flow. Second operand has 5 states, 5 states have (on average 110.8) internal successors, (554), 5 states have internal predecessors, (554), 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) [2023-08-30 16:51:18,843 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:51:18,843 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 242 [2023-08-30 16:51:18,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:51:20,342 INFO L130 PetriNetUnfolder]: 12166/17683 cut-off events. [2023-08-30 16:51:20,342 INFO L131 PetriNetUnfolder]: For 44182/44182 co-relation queries the response was YES. [2023-08-30 16:51:20,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63800 conditions, 17683 events. 12166/17683 cut-off events. For 44182/44182 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 105266 event pairs, 1571 based on Foata normal form. 13/17696 useless extension candidates. Maximal degree in co-relation 63774. Up to 6752 conditions per place. [2023-08-30 16:51:20,461 INFO L137 encePairwiseOnDemand]: 233/242 looper letters, 114 selfloop transitions, 22 changer transitions 109/245 dead transitions. [2023-08-30 16:51:20,462 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 245 transitions, 2342 flow [2023-08-30 16:51:20,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:51:20,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:51:20,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 749 transitions. [2023-08-30 16:51:20,464 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5158402203856749 [2023-08-30 16:51:20,465 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 749 transitions. [2023-08-30 16:51:20,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 749 transitions. [2023-08-30 16:51:20,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:51:20,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 749 transitions. [2023-08-30 16:51:20,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 124.83333333333333) internal successors, (749), 6 states have internal predecessors, (749), 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) [2023-08-30 16:51:20,469 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 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) [2023-08-30 16:51:20,470 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 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) [2023-08-30 16:51:20,470 INFO L175 Difference]: Start difference. First operand has 67 places, 61 transitions, 456 flow. Second operand 6 states and 749 transitions. [2023-08-30 16:51:20,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 245 transitions, 2342 flow [2023-08-30 16:51:21,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 245 transitions, 1905 flow, removed 154 selfloop flow, removed 4 redundant places. [2023-08-30 16:51:21,505 INFO L231 Difference]: Finished difference. Result has 73 places, 61 transitions, 431 flow [2023-08-30 16:51:21,505 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=431, PETRI_PLACES=73, PETRI_TRANSITIONS=61} [2023-08-30 16:51:21,506 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 30 predicate places. [2023-08-30 16:51:21,506 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 61 transitions, 431 flow [2023-08-30 16:51:21,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.8) internal successors, (554), 5 states have internal predecessors, (554), 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) [2023-08-30 16:51:21,506 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:21,506 INFO L208 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] [2023-08-30 16:51:21,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 16:51:21,507 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:21,507 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:21,507 INFO L85 PathProgramCache]: Analyzing trace with hash 178661929, now seen corresponding path program 2 times [2023-08-30 16:51:21,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:21,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783563330] [2023-08-30 16:51:21,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:21,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:21,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:51:22,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:51:22,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:51:22,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783563330] [2023-08-30 16:51:22,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783563330] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:51:22,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:51:22,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:51:22,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023834263] [2023-08-30 16:51:22,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:51:22,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:51:22,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:51:22,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:51:22,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:51:22,229 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 242 [2023-08-30 16:51:22,230 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 61 transitions, 431 flow. Second operand has 6 states, 6 states have (on average 115.66666666666667) internal successors, (694), 6 states have internal predecessors, (694), 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) [2023-08-30 16:51:22,231 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:51:22,231 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 242 [2023-08-30 16:51:22,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:51:23,136 INFO L130 PetriNetUnfolder]: 5150/8331 cut-off events. [2023-08-30 16:51:23,136 INFO L131 PetriNetUnfolder]: For 13750/13820 co-relation queries the response was YES. [2023-08-30 16:51:23,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28661 conditions, 8331 events. 5150/8331 cut-off events. For 13750/13820 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 54528 event pairs, 1273 based on Foata normal form. 33/8298 useless extension candidates. Maximal degree in co-relation 28629. Up to 4232 conditions per place. [2023-08-30 16:51:23,179 INFO L137 encePairwiseOnDemand]: 234/242 looper letters, 108 selfloop transitions, 9 changer transitions 55/186 dead transitions. [2023-08-30 16:51:23,179 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 186 transitions, 1572 flow [2023-08-30 16:51:23,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:51:23,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:51:23,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 873 transitions. [2023-08-30 16:51:23,183 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5153482880755608 [2023-08-30 16:51:23,183 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 873 transitions. [2023-08-30 16:51:23,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 873 transitions. [2023-08-30 16:51:23,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:51:23,184 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 873 transitions. [2023-08-30 16:51:23,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.71428571428571) internal successors, (873), 7 states have internal predecessors, (873), 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) [2023-08-30 16:51:23,188 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 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) [2023-08-30 16:51:23,189 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 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) [2023-08-30 16:51:23,189 INFO L175 Difference]: Start difference. First operand has 73 places, 61 transitions, 431 flow. Second operand 7 states and 873 transitions. [2023-08-30 16:51:23,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 186 transitions, 1572 flow [2023-08-30 16:51:23,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 186 transitions, 1490 flow, removed 41 selfloop flow, removed 5 redundant places. [2023-08-30 16:51:23,340 INFO L231 Difference]: Finished difference. Result has 71 places, 68 transitions, 474 flow [2023-08-30 16:51:23,341 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=474, PETRI_PLACES=71, PETRI_TRANSITIONS=68} [2023-08-30 16:51:23,343 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 28 predicate places. [2023-08-30 16:51:23,343 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 68 transitions, 474 flow [2023-08-30 16:51:23,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.66666666666667) internal successors, (694), 6 states have internal predecessors, (694), 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) [2023-08-30 16:51:23,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:23,344 INFO L208 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] [2023-08-30 16:51:23,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 16:51:23,344 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:23,345 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:23,345 INFO L85 PathProgramCache]: Analyzing trace with hash -852883781, now seen corresponding path program 3 times [2023-08-30 16:51:23,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:23,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105570800] [2023-08-30 16:51:23,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:23,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:23,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:51:24,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:51:24,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:51:24,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105570800] [2023-08-30 16:51:24,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105570800] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:51:24,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:51:24,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:51:24,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459503001] [2023-08-30 16:51:24,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:51:24,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:51:24,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:51:24,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:51:24,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:51:24,339 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 242 [2023-08-30 16:51:24,340 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 68 transitions, 474 flow. Second operand has 7 states, 7 states have (on average 107.42857142857143) internal successors, (752), 7 states have internal predecessors, (752), 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) [2023-08-30 16:51:24,340 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:51:24,340 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 242 [2023-08-30 16:51:24,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:51:25,804 INFO L130 PetriNetUnfolder]: 8353/12895 cut-off events. [2023-08-30 16:51:25,804 INFO L131 PetriNetUnfolder]: For 27417/27417 co-relation queries the response was YES. [2023-08-30 16:51:25,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50411 conditions, 12895 events. 8353/12895 cut-off events. For 27417/27417 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 80918 event pairs, 841 based on Foata normal form. 12/12907 useless extension candidates. Maximal degree in co-relation 50379. Up to 4301 conditions per place. [2023-08-30 16:51:25,921 INFO L137 encePairwiseOnDemand]: 228/242 looper letters, 217 selfloop transitions, 74 changer transitions 26/317 dead transitions. [2023-08-30 16:51:25,921 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 317 transitions, 2686 flow [2023-08-30 16:51:25,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 16:51:25,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 16:51:25,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1111 transitions. [2023-08-30 16:51:25,924 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.51010101010101 [2023-08-30 16:51:25,925 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1111 transitions. [2023-08-30 16:51:25,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1111 transitions. [2023-08-30 16:51:25,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:51:25,925 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1111 transitions. [2023-08-30 16:51:25,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 123.44444444444444) internal successors, (1111), 9 states have internal predecessors, (1111), 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) [2023-08-30 16:51:25,931 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 242.0) internal successors, (2420), 10 states have internal predecessors, (2420), 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) [2023-08-30 16:51:25,931 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 242.0) internal successors, (2420), 10 states have internal predecessors, (2420), 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) [2023-08-30 16:51:25,932 INFO L175 Difference]: Start difference. First operand has 71 places, 68 transitions, 474 flow. Second operand 9 states and 1111 transitions. [2023-08-30 16:51:25,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 317 transitions, 2686 flow [2023-08-30 16:51:26,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 317 transitions, 2669 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-08-30 16:51:26,247 INFO L231 Difference]: Finished difference. Result has 81 places, 124 transitions, 1254 flow [2023-08-30 16:51:26,247 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1254, PETRI_PLACES=81, PETRI_TRANSITIONS=124} [2023-08-30 16:51:26,248 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 38 predicate places. [2023-08-30 16:51:26,248 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 124 transitions, 1254 flow [2023-08-30 16:51:26,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 107.42857142857143) internal successors, (752), 7 states have internal predecessors, (752), 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) [2023-08-30 16:51:26,249 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:26,249 INFO L208 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] [2023-08-30 16:51:26,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 16:51:26,249 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:26,249 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:26,250 INFO L85 PathProgramCache]: Analyzing trace with hash -2115425159, now seen corresponding path program 4 times [2023-08-30 16:51:26,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:26,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288079173] [2023-08-30 16:51:26,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:26,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:26,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:51:26,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:51:26,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:51:26,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288079173] [2023-08-30 16:51:26,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288079173] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:51:26,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:51:26,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:51:26,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120955161] [2023-08-30 16:51:26,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:51:26,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:51:26,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:51:26,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:51:26,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:51:26,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 242 [2023-08-30 16:51:26,974 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 124 transitions, 1254 flow. Second operand has 7 states, 7 states have (on average 116.14285714285714) internal successors, (813), 7 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:26,974 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:51:26,974 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 242 [2023-08-30 16:51:26,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:51:28,398 INFO L130 PetriNetUnfolder]: 7578/12456 cut-off events. [2023-08-30 16:51:28,398 INFO L131 PetriNetUnfolder]: For 39050/39375 co-relation queries the response was YES. [2023-08-30 16:51:28,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53095 conditions, 12456 events. 7578/12456 cut-off events. For 39050/39375 co-relation queries the response was YES. Maximal size of possible extension queue 591. Compared 88071 event pairs, 580 based on Foata normal form. 228/12549 useless extension candidates. Maximal degree in co-relation 53057. Up to 4672 conditions per place. [2023-08-30 16:51:28,510 INFO L137 encePairwiseOnDemand]: 234/242 looper letters, 183 selfloop transitions, 24 changer transitions 49/294 dead transitions. [2023-08-30 16:51:28,510 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 294 transitions, 2896 flow [2023-08-30 16:51:28,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 16:51:28,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 16:51:28,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1030 transitions. [2023-08-30 16:51:28,520 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5320247933884298 [2023-08-30 16:51:28,520 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1030 transitions. [2023-08-30 16:51:28,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1030 transitions. [2023-08-30 16:51:28,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:51:28,521 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1030 transitions. [2023-08-30 16:51:28,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 128.75) internal successors, (1030), 8 states have internal predecessors, (1030), 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) [2023-08-30 16:51:28,526 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 242.0) internal successors, (2178), 9 states have internal predecessors, (2178), 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) [2023-08-30 16:51:28,527 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 242.0) internal successors, (2178), 9 states have internal predecessors, (2178), 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) [2023-08-30 16:51:28,527 INFO L175 Difference]: Start difference. First operand has 81 places, 124 transitions, 1254 flow. Second operand 8 states and 1030 transitions. [2023-08-30 16:51:28,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 294 transitions, 2896 flow [2023-08-30 16:51:28,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 294 transitions, 2868 flow, removed 14 selfloop flow, removed 0 redundant places. [2023-08-30 16:51:28,923 INFO L231 Difference]: Finished difference. Result has 92 places, 131 transitions, 1366 flow [2023-08-30 16:51:28,924 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=1236, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1366, PETRI_PLACES=92, PETRI_TRANSITIONS=131} [2023-08-30 16:51:28,924 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 49 predicate places. [2023-08-30 16:51:28,924 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 131 transitions, 1366 flow [2023-08-30 16:51:28,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.14285714285714) internal successors, (813), 7 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:28,925 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:28,925 INFO L208 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] [2023-08-30 16:51:28,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 16:51:28,926 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:28,926 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:28,926 INFO L85 PathProgramCache]: Analyzing trace with hash -602507445, now seen corresponding path program 5 times [2023-08-30 16:51:28,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:28,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626502419] [2023-08-30 16:51:28,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:28,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:28,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:51:29,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:51:29,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:51:29,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626502419] [2023-08-30 16:51:29,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626502419] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:51:29,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:51:29,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 16:51:29,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321931364] [2023-08-30 16:51:29,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:51:29,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:51:29,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:51:29,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:51:29,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:51:29,229 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 242 [2023-08-30 16:51:29,230 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 131 transitions, 1366 flow. Second operand has 7 states, 7 states have (on average 112.14285714285714) internal successors, (785), 7 states have internal predecessors, (785), 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) [2023-08-30 16:51:29,230 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:51:29,230 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 242 [2023-08-30 16:51:29,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:51:30,717 INFO L130 PetriNetUnfolder]: 6959/11289 cut-off events. [2023-08-30 16:51:30,717 INFO L131 PetriNetUnfolder]: For 53075/53283 co-relation queries the response was YES. [2023-08-30 16:51:30,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52901 conditions, 11289 events. 6959/11289 cut-off events. For 53075/53283 co-relation queries the response was YES. Maximal size of possible extension queue 572. Compared 79380 event pairs, 849 based on Foata normal form. 270/11419 useless extension candidates. Maximal degree in co-relation 52857. Up to 4445 conditions per place. [2023-08-30 16:51:30,804 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 183 selfloop transitions, 18 changer transitions 70/303 dead transitions. [2023-08-30 16:51:30,804 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 303 transitions, 3550 flow [2023-08-30 16:51:30,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 16:51:30,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 16:51:30,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 968 transitions. [2023-08-30 16:51:30,807 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-08-30 16:51:30,807 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 968 transitions. [2023-08-30 16:51:30,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 968 transitions. [2023-08-30 16:51:30,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:51:30,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 968 transitions. [2023-08-30 16:51:30,809 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 121.0) internal successors, (968), 8 states have internal predecessors, (968), 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) [2023-08-30 16:51:30,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 242.0) internal successors, (2178), 9 states have internal predecessors, (2178), 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) [2023-08-30 16:51:30,812 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 242.0) internal successors, (2178), 9 states have internal predecessors, (2178), 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) [2023-08-30 16:51:30,813 INFO L175 Difference]: Start difference. First operand has 92 places, 131 transitions, 1366 flow. Second operand 8 states and 968 transitions. [2023-08-30 16:51:30,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 303 transitions, 3550 flow [2023-08-30 16:51:31,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 303 transitions, 3372 flow, removed 33 selfloop flow, removed 6 redundant places. [2023-08-30 16:51:31,528 INFO L231 Difference]: Finished difference. Result has 94 places, 117 transitions, 1209 flow [2023-08-30 16:51:31,528 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=1274, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1209, PETRI_PLACES=94, PETRI_TRANSITIONS=117} [2023-08-30 16:51:31,529 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 51 predicate places. [2023-08-30 16:51:31,529 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 117 transitions, 1209 flow [2023-08-30 16:51:31,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.14285714285714) internal successors, (785), 7 states have internal predecessors, (785), 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) [2023-08-30 16:51:31,529 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:31,529 INFO L208 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] [2023-08-30 16:51:31,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 16:51:31,529 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:31,530 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:31,530 INFO L85 PathProgramCache]: Analyzing trace with hash 438623857, now seen corresponding path program 1 times [2023-08-30 16:51:31,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:31,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166444934] [2023-08-30 16:51:31,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:31,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:31,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:51:31,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:51:31,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:51:31,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166444934] [2023-08-30 16:51:31,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166444934] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:51:31,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:51:31,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:51:31,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127804654] [2023-08-30 16:51:31,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:51:31,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:51:31,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:51:31,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:51:31,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:51:32,014 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 242 [2023-08-30 16:51:32,015 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 117 transitions, 1209 flow. Second operand has 6 states, 6 states have (on average 108.66666666666667) internal successors, (652), 6 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:32,015 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:51:32,015 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 242 [2023-08-30 16:51:32,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:51:33,177 INFO L130 PetriNetUnfolder]: 6625/10405 cut-off events. [2023-08-30 16:51:33,177 INFO L131 PetriNetUnfolder]: For 53270/53270 co-relation queries the response was YES. [2023-08-30 16:51:33,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53168 conditions, 10405 events. 6625/10405 cut-off events. For 53270/53270 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 65350 event pairs, 556 based on Foata normal form. 2/10407 useless extension candidates. Maximal degree in co-relation 53134. Up to 4767 conditions per place. [2023-08-30 16:51:33,243 INFO L137 encePairwiseOnDemand]: 228/242 looper letters, 136 selfloop transitions, 85 changer transitions 111/332 dead transitions. [2023-08-30 16:51:33,243 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 332 transitions, 3694 flow [2023-08-30 16:51:33,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 16:51:33,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 16:51:33,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1312 transitions. [2023-08-30 16:51:33,247 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.492862509391435 [2023-08-30 16:51:33,248 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1312 transitions. [2023-08-30 16:51:33,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1312 transitions. [2023-08-30 16:51:33,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:51:33,249 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1312 transitions. [2023-08-30 16:51:33,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 119.27272727272727) internal successors, (1312), 11 states have internal predecessors, (1312), 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) [2023-08-30 16:51:33,255 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 242.0) internal successors, (2904), 12 states have internal predecessors, (2904), 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) [2023-08-30 16:51:33,256 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 242.0) internal successors, (2904), 12 states have internal predecessors, (2904), 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) [2023-08-30 16:51:33,256 INFO L175 Difference]: Start difference. First operand has 94 places, 117 transitions, 1209 flow. Second operand 11 states and 1312 transitions. [2023-08-30 16:51:33,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 332 transitions, 3694 flow [2023-08-30 16:51:33,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 332 transitions, 3433 flow, removed 62 selfloop flow, removed 8 redundant places. [2023-08-30 16:51:33,621 INFO L231 Difference]: Finished difference. Result has 101 places, 145 transitions, 1759 flow [2023-08-30 16:51:33,621 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=1122, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1759, PETRI_PLACES=101, PETRI_TRANSITIONS=145} [2023-08-30 16:51:33,621 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 58 predicate places. [2023-08-30 16:51:33,622 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 145 transitions, 1759 flow [2023-08-30 16:51:33,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.66666666666667) internal successors, (652), 6 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:33,622 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:33,622 INFO L208 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] [2023-08-30 16:51:33,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 16:51:33,623 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:33,623 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:33,623 INFO L85 PathProgramCache]: Analyzing trace with hash 351013515, now seen corresponding path program 2 times [2023-08-30 16:51:33,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:33,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048997821] [2023-08-30 16:51:33,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:33,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:33,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:51:33,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:51:33,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:51:33,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048997821] [2023-08-30 16:51:33,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048997821] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:51:33,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:51:33,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:51:33,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361713698] [2023-08-30 16:51:33,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:51:33,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:51:33,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:51:33,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:51:33,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:51:33,865 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 242 [2023-08-30 16:51:33,865 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 145 transitions, 1759 flow. Second operand has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 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) [2023-08-30 16:51:33,866 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:51:33,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 242 [2023-08-30 16:51:33,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:51:34,770 INFO L130 PetriNetUnfolder]: 5516/8942 cut-off events. [2023-08-30 16:51:34,771 INFO L131 PetriNetUnfolder]: For 52253/52253 co-relation queries the response was YES. [2023-08-30 16:51:34,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46376 conditions, 8942 events. 5516/8942 cut-off events. For 52253/52253 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 57868 event pairs, 1538 based on Foata normal form. 1/8943 useless extension candidates. Maximal degree in co-relation 46329. Up to 4999 conditions per place. [2023-08-30 16:51:34,815 INFO L137 encePairwiseOnDemand]: 236/242 looper letters, 118 selfloop transitions, 23 changer transitions 74/215 dead transitions. [2023-08-30 16:51:34,815 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 215 transitions, 2801 flow [2023-08-30 16:51:34,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:51:34,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:51:34,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 493 transitions. [2023-08-30 16:51:34,817 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5092975206611571 [2023-08-30 16:51:34,817 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 493 transitions. [2023-08-30 16:51:34,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 493 transitions. [2023-08-30 16:51:34,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:51:34,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 493 transitions. [2023-08-30 16:51:34,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 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) [2023-08-30 16:51:34,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 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) [2023-08-30 16:51:34,820 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 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) [2023-08-30 16:51:34,820 INFO L175 Difference]: Start difference. First operand has 101 places, 145 transitions, 1759 flow. Second operand 4 states and 493 transitions. [2023-08-30 16:51:34,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 215 transitions, 2801 flow [2023-08-30 16:51:35,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 215 transitions, 2739 flow, removed 28 selfloop flow, removed 3 redundant places. [2023-08-30 16:51:35,257 INFO L231 Difference]: Finished difference. Result has 100 places, 106 transitions, 1169 flow [2023-08-30 16:51:35,257 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=1718, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1169, PETRI_PLACES=100, PETRI_TRANSITIONS=106} [2023-08-30 16:51:35,258 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 57 predicate places. [2023-08-30 16:51:35,258 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 106 transitions, 1169 flow [2023-08-30 16:51:35,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 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) [2023-08-30 16:51:35,258 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:35,259 INFO L208 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] [2023-08-30 16:51:35,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 16:51:35,259 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:35,259 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:35,259 INFO L85 PathProgramCache]: Analyzing trace with hash -651950697, now seen corresponding path program 3 times [2023-08-30 16:51:35,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:35,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192526690] [2023-08-30 16:51:35,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:35,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:35,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:51:36,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:51:36,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:51:36,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192526690] [2023-08-30 16:51:36,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192526690] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:51:36,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:51:36,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 16:51:36,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170880698] [2023-08-30 16:51:36,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:51:36,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 16:51:36,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:51:36,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 16:51:36,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-30 16:51:36,323 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 242 [2023-08-30 16:51:36,324 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 106 transitions, 1169 flow. Second operand has 8 states, 8 states have (on average 107.5) internal successors, (860), 8 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) [2023-08-30 16:51:36,324 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:51:36,325 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 242 [2023-08-30 16:51:36,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:51:37,229 INFO L130 PetriNetUnfolder]: 2850/4624 cut-off events. [2023-08-30 16:51:37,230 INFO L131 PetriNetUnfolder]: For 24128/24128 co-relation queries the response was YES. [2023-08-30 16:51:37,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22944 conditions, 4624 events. 2850/4624 cut-off events. For 24128/24128 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 26387 event pairs, 254 based on Foata normal form. 1/4625 useless extension candidates. Maximal degree in co-relation 22896. Up to 1724 conditions per place. [2023-08-30 16:51:37,256 INFO L137 encePairwiseOnDemand]: 231/242 looper letters, 157 selfloop transitions, 40 changer transitions 43/240 dead transitions. [2023-08-30 16:51:37,256 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 240 transitions, 2582 flow [2023-08-30 16:51:37,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 16:51:37,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 16:51:37,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1057 transitions. [2023-08-30 16:51:37,259 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.485307621671258 [2023-08-30 16:51:37,259 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1057 transitions. [2023-08-30 16:51:37,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1057 transitions. [2023-08-30 16:51:37,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:51:37,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1057 transitions. [2023-08-30 16:51:37,262 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 117.44444444444444) internal successors, (1057), 9 states have internal predecessors, (1057), 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) [2023-08-30 16:51:37,265 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 242.0) internal successors, (2420), 10 states have internal predecessors, (2420), 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) [2023-08-30 16:51:37,265 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 242.0) internal successors, (2420), 10 states have internal predecessors, (2420), 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) [2023-08-30 16:51:37,266 INFO L175 Difference]: Start difference. First operand has 100 places, 106 transitions, 1169 flow. Second operand 9 states and 1057 transitions. [2023-08-30 16:51:37,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 240 transitions, 2582 flow [2023-08-30 16:51:37,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 240 transitions, 2373 flow, removed 53 selfloop flow, removed 8 redundant places. [2023-08-30 16:51:37,406 INFO L231 Difference]: Finished difference. Result has 102 places, 114 transitions, 1223 flow [2023-08-30 16:51:37,407 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=1031, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1223, PETRI_PLACES=102, PETRI_TRANSITIONS=114} [2023-08-30 16:51:37,408 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 59 predicate places. [2023-08-30 16:51:37,408 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 114 transitions, 1223 flow [2023-08-30 16:51:37,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 107.5) internal successors, (860), 8 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) [2023-08-30 16:51:37,409 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:37,409 INFO L208 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] [2023-08-30 16:51:37,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 16:51:37,410 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:37,410 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:37,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1473680957, now seen corresponding path program 4 times [2023-08-30 16:51:37,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:37,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128427933] [2023-08-30 16:51:37,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:37,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:37,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:51:37,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:51:37,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:51:37,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128427933] [2023-08-30 16:51:37,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128427933] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:51:37,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:51:37,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:51:37,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024813842] [2023-08-30 16:51:37,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:51:37,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:51:37,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:51:37,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:51:37,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:51:37,662 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 242 [2023-08-30 16:51:37,663 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 114 transitions, 1223 flow. Second operand has 4 states, 4 states have (on average 120.5) internal successors, (482), 4 states have internal predecessors, (482), 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) [2023-08-30 16:51:37,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:51:37,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 242 [2023-08-30 16:51:37,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:51:38,336 INFO L130 PetriNetUnfolder]: 3134/5152 cut-off events. [2023-08-30 16:51:38,337 INFO L131 PetriNetUnfolder]: For 24284/24328 co-relation queries the response was YES. [2023-08-30 16:51:38,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25107 conditions, 5152 events. 3134/5152 cut-off events. For 24284/24328 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 30624 event pairs, 810 based on Foata normal form. 20/5147 useless extension candidates. Maximal degree in co-relation 25062. Up to 3102 conditions per place. [2023-08-30 16:51:38,355 INFO L137 encePairwiseOnDemand]: 239/242 looper letters, 66 selfloop transitions, 2 changer transitions 105/177 dead transitions. [2023-08-30 16:51:38,355 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 177 transitions, 2092 flow [2023-08-30 16:51:38,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:51:38,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:51:38,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 508 transitions. [2023-08-30 16:51:38,357 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5247933884297521 [2023-08-30 16:51:38,357 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 508 transitions. [2023-08-30 16:51:38,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 508 transitions. [2023-08-30 16:51:38,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:51:38,357 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 508 transitions. [2023-08-30 16:51:38,358 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 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) [2023-08-30 16:51:38,360 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 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) [2023-08-30 16:51:38,360 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 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) [2023-08-30 16:51:38,360 INFO L175 Difference]: Start difference. First operand has 102 places, 114 transitions, 1223 flow. Second operand 4 states and 508 transitions. [2023-08-30 16:51:38,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 177 transitions, 2092 flow [2023-08-30 16:51:38,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 177 transitions, 2009 flow, removed 8 selfloop flow, removed 7 redundant places. [2023-08-30 16:51:38,471 INFO L231 Difference]: Finished difference. Result has 99 places, 65 transitions, 546 flow [2023-08-30 16:51:38,471 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=1162, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=546, PETRI_PLACES=99, PETRI_TRANSITIONS=65} [2023-08-30 16:51:38,471 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 56 predicate places. [2023-08-30 16:51:38,471 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 65 transitions, 546 flow [2023-08-30 16:51:38,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 120.5) internal successors, (482), 4 states have internal predecessors, (482), 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) [2023-08-30 16:51:38,472 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:38,472 INFO L208 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] [2023-08-30 16:51:38,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 16:51:38,472 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:38,472 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:38,472 INFO L85 PathProgramCache]: Analyzing trace with hash -491243477, now seen corresponding path program 5 times [2023-08-30 16:51:38,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:38,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726211018] [2023-08-30 16:51:38,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:38,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:38,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:51:38,512 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 16:51:38,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:51:38,585 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 16:51:38,585 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 16:51:38,586 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-30 16:51:38,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-30 16:51:38,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-08-30 16:51:38,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-30 16:51:38,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-30 16:51:38,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-30 16:51:38,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-30 16:51:38,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-30 16:51:38,589 INFO L445 BasicCegarLoop]: Path program histogram: [5, 5, 1, 1, 1, 1, 1, 1] [2023-08-30 16:51:38,594 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 16:51:38,595 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 16:51:38,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 04:51:38 BasicIcfg [2023-08-30 16:51:38,675 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 16:51:38,676 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 16:51:38,676 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 16:51:38,676 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 16:51:38,677 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:51:04" (3/4) ... [2023-08-30 16:51:38,678 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 16:51:38,775 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 16:51:38,775 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 16:51:38,776 INFO L158 Benchmark]: Toolchain (without parser) took 35450.54ms. Allocated memory was 62.9MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 39.4MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 253.5MB. Max. memory is 16.1GB. [2023-08-30 16:51:38,776 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 62.9MB. Free memory is still 40.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 16:51:38,776 INFO L158 Benchmark]: CACSL2BoogieTranslator took 585.84ms. Allocated memory was 62.9MB in the beginning and 79.7MB in the end (delta: 16.8MB). Free memory was 39.2MB in the beginning and 46.9MB in the end (delta: -7.7MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. [2023-08-30 16:51:38,777 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.67ms. Allocated memory is still 79.7MB. Free memory was 46.9MB in the beginning and 44.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 16:51:38,777 INFO L158 Benchmark]: Boogie Preprocessor took 58.75ms. Allocated memory is still 79.7MB. Free memory was 44.4MB in the beginning and 42.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 16:51:38,777 INFO L158 Benchmark]: RCFGBuilder took 753.45ms. Allocated memory is still 79.7MB. Free memory was 42.3MB in the beginning and 27.8MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-08-30 16:51:38,777 INFO L158 Benchmark]: TraceAbstraction took 33863.20ms. Allocated memory was 79.7MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 26.8MB in the beginning and 2.2GB in the end (delta: -2.2GB). Peak memory consumption was 205.6MB. Max. memory is 16.1GB. [2023-08-30 16:51:38,778 INFO L158 Benchmark]: Witness Printer took 99.27ms. Allocated memory is still 2.5GB. Free memory was 2.2GB in the beginning and 2.2GB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-08-30 16:51:38,780 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 62.9MB. Free memory is still 40.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 585.84ms. Allocated memory was 62.9MB in the beginning and 79.7MB in the end (delta: 16.8MB). Free memory was 39.2MB in the beginning and 46.9MB in the end (delta: -7.7MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.67ms. Allocated memory is still 79.7MB. Free memory was 46.9MB in the beginning and 44.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.75ms. Allocated memory is still 79.7MB. Free memory was 44.4MB in the beginning and 42.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 753.45ms. Allocated memory is still 79.7MB. Free memory was 42.3MB in the beginning and 27.8MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 33863.20ms. Allocated memory was 79.7MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 26.8MB in the beginning and 2.2GB in the end (delta: -2.2GB). Peak memory consumption was 205.6MB. Max. memory is 16.1GB. * Witness Printer took 99.27ms. Allocated memory is still 2.5GB. Free memory was 2.2GB in the beginning and 2.2GB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.0s, 140 PlacesBefore, 43 PlacesAfterwards, 129 TransitionsBefore, 31 TransitionsAfterwards, 3270 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 109 TotalNumberOfCompositions, 8894 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3188, independent: 2946, independent conditional: 0, independent unconditional: 2946, dependent: 242, dependent conditional: 0, dependent unconditional: 242, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1743, independent: 1690, independent conditional: 0, independent unconditional: 1690, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3188, independent: 1256, independent conditional: 0, independent unconditional: 1256, dependent: 189, dependent conditional: 0, dependent unconditional: 189, unknown: 1743, unknown conditional: 0, unknown unconditional: 1743] , Statistics on independence cache: Total cache size (in pairs): 176, Positive cache size: 152, Positive conditional cache size: 0, Positive unconditional cache size: 152, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool b$flush_delayed; [L724] 0 int b$mem_tmp; [L725] 0 _Bool b$r_buff0_thd0; [L726] 0 _Bool b$r_buff0_thd1; [L727] 0 _Bool b$r_buff0_thd2; [L728] 0 _Bool b$r_buff0_thd3; [L729] 0 _Bool b$r_buff0_thd4; [L730] 0 _Bool b$r_buff1_thd0; [L731] 0 _Bool b$r_buff1_thd1; [L732] 0 _Bool b$r_buff1_thd2; [L733] 0 _Bool b$r_buff1_thd3; [L734] 0 _Bool b$r_buff1_thd4; [L735] 0 _Bool b$read_delayed; [L736] 0 int *b$read_delayed_var; [L737] 0 int b$w_buff0; [L738] 0 _Bool b$w_buff0_used; [L739] 0 int b$w_buff1; [L740] 0 _Bool b$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t1129; [L872] FCALL, FORK 0 pthread_create(&t1129, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1129, ((void *)0), P0, ((void *)0))=-3, t1129={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 b$w_buff1 = b$w_buff0 [L755] 1 b$w_buff0 = 1 [L756] 1 b$w_buff1_used = b$w_buff0_used [L757] 1 b$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L759] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L760] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L761] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L762] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L763] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L764] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t1130; [L874] FCALL, FORK 0 pthread_create(&t1130, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1130, ((void *)0), P1, ((void *)0))=-2, t1129={5:0}, t1130={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t1131; [L767] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L784] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L876] FCALL, FORK 0 pthread_create(&t1131, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1131, ((void *)0), P2, ((void *)0))=-1, t1129={5:0}, t1130={6:0}, t1131={7:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L877] 0 pthread_t t1132; [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L878] FCALL, FORK 0 pthread_create(&t1132, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1132, ((void *)0), P3, ((void *)0))=0, t1129={5:0}, t1130={6:0}, t1131={7:0}, t1132={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L807] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L810] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L811] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L812] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L813] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L814] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L819] 3 return 0; [L824] 4 z = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L827] 4 a = 1 [L830] 4 __unbuffered_p3_EAX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 b$flush_delayed = weak$$choice2 [L836] 4 b$mem_tmp = b [L837] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L838] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L839] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L840] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L841] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L843] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = b [L845] 4 b = b$flush_delayed ? b$mem_tmp : b [L846] 4 b$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=2] [L770] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L771] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L772] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L773] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L774] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=2] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L849] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L850] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L851] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L852] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L853] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=2] [L790] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L791] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L792] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L793] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L794] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=2] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L885] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L886] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L887] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L888] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1129={5:0}, t1130={6:0}, t1131={7:0}, t1132={3:0}, weak$$choice2=0, x=1, y=1, z=2] [L891] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=2] - 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: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 872]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 878]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 171 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 33.6s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 22.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1258 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1086 mSDsluCounter, 612 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 488 mSDsCounter, 172 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3069 IncrementalHoareTripleChecker+Invalid, 3241 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 172 mSolverCounterUnsat, 124 mSDtfsCounter, 3069 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1759occurred in iteration=12, InterpolantAutomatonStates: 97, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 335 NumberOfCodeBlocks, 335 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 292 ConstructedInterpolants, 0 QuantifiedInterpolants, 2551 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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! [2023-08-30 16:51:38,814 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