/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix056_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 11:56:43,869 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 11:56:43,871 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 11:56:43,931 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 11:56:43,931 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 11:56:43,936 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 11:56:43,938 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 11:56:43,942 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 11:56:43,946 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 11:56:43,951 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 11:56:43,952 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 11:56:43,954 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 11:56:43,954 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 11:56:43,956 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 11:56:43,957 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 11:56:43,960 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 11:56:43,961 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 11:56:43,961 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 11:56:43,964 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 11:56:43,969 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 11:56:43,970 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 11:56:43,971 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 11:56:43,972 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 11:56:43,973 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 11:56:43,980 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 11:56:43,980 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 11:56:43,981 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 11:56:43,982 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 11:56:43,983 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 11:56:43,984 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 11:56:43,984 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 11:56:43,986 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 11:56:43,987 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 11:56:43,988 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 11:56:43,988 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 11:56:43,989 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 11:56:43,989 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 11:56:43,989 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 11:56:43,990 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 11:56:43,990 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 11:56:43,991 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 11:56:43,992 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-13 11:56:44,023 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 11:56:44,024 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 11:56:44,026 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 11:56:44,026 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 11:56:44,026 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 11:56:44,027 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 11:56:44,027 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 11:56:44,027 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 11:56:44,027 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 11:56:44,028 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 11:56:44,028 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 11:56:44,028 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 11:56:44,029 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 11:56:44,029 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 11:56:44,029 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 11:56:44,029 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 11:56:44,029 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 11:56:44,029 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 11:56:44,029 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 11:56:44,030 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 11:56:44,030 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 11:56:44,030 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:56:44,030 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 11:56:44,030 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 11:56:44,030 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 11:56:44,030 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 11:56:44,031 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 11:56:44,031 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 11:56:44,031 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 11:56:44,335 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 11:56:44,355 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 11:56:44,357 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 11:56:44,358 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 11:56:44,358 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 11:56:44,359 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 11:56:45,426 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 11:56:45,663 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 11:56:45,664 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 11:56:45,675 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cce35157/207001e1b5794cd58c8eefdaceb704f6/FLAG0860ce7e7 [2022-12-13 11:56:45,690 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cce35157/207001e1b5794cd58c8eefdaceb704f6 [2022-12-13 11:56:45,693 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 11:56:45,694 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 11:56:45,695 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 11:56:45,695 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 11:56:45,697 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 11:56:45,698 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:56:45" (1/1) ... [2022-12-13 11:56:45,699 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e312bdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:56:45, skipping insertion in model container [2022-12-13 11:56:45,699 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:56:45" (1/1) ... [2022-12-13 11:56:45,704 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 11:56:45,751 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 11:56:45,881 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-13 11:56:46,047 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:46,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:46,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:46,052 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:46,052 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:46,058 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:46,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:46,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:46,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:46,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:46,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:46,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:46,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:46,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:46,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:46,068 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:46,072 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:46,072 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:46,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:46,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:46,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:46,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:46,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:46,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:46,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:46,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:46,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:46,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:46,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:46,120 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:46,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:56:46,131 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 11:56:46,145 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-13 11:56:46,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:46,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:46,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:46,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:46,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:46,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:46,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:46,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:46,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:46,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:46,181 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:46,181 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:46,181 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:46,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:46,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:46,187 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:46,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:46,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:46,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:46,201 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:46,201 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:46,204 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:46,204 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:46,205 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:46,209 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:46,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:46,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:46,220 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:46,220 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:46,220 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:46,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:56:46,260 INFO L208 MainTranslator]: Completed translation [2022-12-13 11:56:46,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:56:46 WrapperNode [2022-12-13 11:56:46,260 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 11:56:46,262 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 11:56:46,262 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 11:56:46,262 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 11:56:46,268 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:56:46" (1/1) ... [2022-12-13 11:56:46,300 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:56:46" (1/1) ... [2022-12-13 11:56:46,331 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2022-12-13 11:56:46,331 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 11:56:46,332 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 11:56:46,333 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 11:56:46,333 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 11:56:46,341 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:56:46" (1/1) ... [2022-12-13 11:56:46,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:56:46" (1/1) ... [2022-12-13 11:56:46,357 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:56:46" (1/1) ... [2022-12-13 11:56:46,358 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:56:46" (1/1) ... [2022-12-13 11:56:46,371 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:56:46" (1/1) ... [2022-12-13 11:56:46,373 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:56:46" (1/1) ... [2022-12-13 11:56:46,374 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:56:46" (1/1) ... [2022-12-13 11:56:46,375 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:56:46" (1/1) ... [2022-12-13 11:56:46,378 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 11:56:46,378 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 11:56:46,379 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 11:56:46,379 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 11:56:46,379 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:56:46" (1/1) ... [2022-12-13 11:56:46,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:56:46,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:56:46,437 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 11:56:46,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 11:56:46,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 11:56:46,488 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 11:56:46,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 11:56:46,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 11:56:46,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 11:56:46,489 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 11:56:46,490 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 11:56:46,490 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 11:56:46,490 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 11:56:46,490 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 11:56:46,490 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 11:56:46,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 11:56:46,491 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 11:56:46,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 11:56:46,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 11:56:46,492 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 11:56:46,639 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 11:56:46,640 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 11:56:46,881 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 11:56:47,081 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 11:56:47,085 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 11:56:47,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:56:47 BoogieIcfgContainer [2022-12-13 11:56:47,089 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 11:56:47,091 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 11:56:47,091 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 11:56:47,094 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 11:56:47,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 11:56:45" (1/3) ... [2022-12-13 11:56:47,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59e3431f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:56:47, skipping insertion in model container [2022-12-13 11:56:47,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:56:46" (2/3) ... [2022-12-13 11:56:47,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59e3431f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:56:47, skipping insertion in model container [2022-12-13 11:56:47,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:56:47" (3/3) ... [2022-12-13 11:56:47,098 INFO L112 eAbstractionObserver]: Analyzing ICFG mix056_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 11:56:47,111 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 11:56:47,112 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 11:56:47,112 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 11:56:47,163 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 11:56:47,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 229 flow [2022-12-13 11:56:47,238 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-12-13 11:56:47,238 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:56:47,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-13 11:56:47,243 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 107 transitions, 229 flow [2022-12-13 11:56:47,247 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 104 transitions, 217 flow [2022-12-13 11:56:47,248 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:56:47,264 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 104 transitions, 217 flow [2022-12-13 11:56:47,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 104 transitions, 217 flow [2022-12-13 11:56:47,294 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-12-13 11:56:47,294 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:56:47,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-13 11:56:47,298 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 104 transitions, 217 flow [2022-12-13 11:56:47,298 INFO L226 LiptonReduction]: Number of co-enabled transitions 1920 [2022-12-13 11:56:52,686 INFO L241 LiptonReduction]: Total number of compositions: 84 [2022-12-13 11:56:52,702 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 11:56:52,707 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=false, mAutomataTypeConcurrency=REPEATED_LIPTON_PN, 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;@319e5133, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 11:56:52,707 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 11:56:52,709 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-13 11:56:52,709 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:56:52,710 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:56:52,710 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 11:56:52,710 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:56:52,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:56:52,714 INFO L85 PathProgramCache]: Analyzing trace with hash 486866, now seen corresponding path program 1 times [2022-12-13 11:56:52,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:56:52,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158781198] [2022-12-13 11:56:52,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:56:52,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:56:52,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:56:53,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:56:53,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:56:53,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158781198] [2022-12-13 11:56:53,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158781198] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:56:53,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:56:53,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:56:53,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874128789] [2022-12-13 11:56:53,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:56:53,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:56:53,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:56:53,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:56:53,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:56:53,115 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 65 [2022-12-13 11:56:53,116 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 65 transitions, 139 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:56:53,117 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:56:53,117 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 65 [2022-12-13 11:56:53,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:56:54,574 INFO L130 PetriNetUnfolder]: 9240/14824 cut-off events. [2022-12-13 11:56:54,575 INFO L131 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2022-12-13 11:56:54,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28062 conditions, 14824 events. 9240/14824 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 903. Compared 112379 event pairs, 1220 based on Foata normal form. 0/9362 useless extension candidates. Maximal degree in co-relation 28051. Up to 11165 conditions per place. [2022-12-13 11:56:54,622 INFO L137 encePairwiseOnDemand]: 61/65 looper letters, 36 selfloop transitions, 2 changer transitions 59/108 dead transitions. [2022-12-13 11:56:54,622 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 108 transitions, 423 flow [2022-12-13 11:56:54,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:56:54,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:56:54,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2022-12-13 11:56:54,632 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6923076923076923 [2022-12-13 11:56:54,634 INFO L175 Difference]: Start difference. First operand has 75 places, 65 transitions, 139 flow. Second operand 3 states and 135 transitions. [2022-12-13 11:56:54,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 108 transitions, 423 flow [2022-12-13 11:56:54,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 108 transitions, 418 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 11:56:54,639 INFO L231 Difference]: Finished difference. Result has 72 places, 33 transitions, 76 flow [2022-12-13 11:56:54,641 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=72, PETRI_TRANSITIONS=33} [2022-12-13 11:56:54,643 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -3 predicate places. [2022-12-13 11:56:54,643 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:56:54,644 INFO L89 Accepts]: Start accepts. Operand has 72 places, 33 transitions, 76 flow [2022-12-13 11:56:54,646 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:56:54,646 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:56:54,647 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 33 transitions, 76 flow [2022-12-13 11:56:54,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 33 transitions, 76 flow [2022-12-13 11:56:54,652 INFO L130 PetriNetUnfolder]: 0/33 cut-off events. [2022-12-13 11:56:54,652 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:56:54,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 33 events. 0/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 90 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 11:56:54,654 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 33 transitions, 76 flow [2022-12-13 11:56:54,655 INFO L226 LiptonReduction]: Number of co-enabled transitions 616 [2022-12-13 11:56:54,766 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:56:54,768 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 11:56:54,768 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 76 flow [2022-12-13 11:56:54,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:56:54,768 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:56:54,769 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:56:54,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 11:56:54,769 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:56:54,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:56:54,770 INFO L85 PathProgramCache]: Analyzing trace with hash -389709415, now seen corresponding path program 1 times [2022-12-13 11:56:54,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:56:54,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220020615] [2022-12-13 11:56:54,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:56:54,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:56:54,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:56:55,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:56:55,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:56:55,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220020615] [2022-12-13 11:56:55,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220020615] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:56:55,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:56:55,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:56:55,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093180814] [2022-12-13 11:56:55,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:56:55,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:56:55,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:56:55,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:56:55,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:56:55,068 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2022-12-13 11:56:55,068 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:56:55,069 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:56:55,069 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2022-12-13 11:56:55,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:56:55,728 INFO L130 PetriNetUnfolder]: 4255/6560 cut-off events. [2022-12-13 11:56:55,728 INFO L131 PetriNetUnfolder]: For 292/292 co-relation queries the response was YES. [2022-12-13 11:56:55,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13193 conditions, 6560 events. 4255/6560 cut-off events. For 292/292 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 38630 event pairs, 1469 based on Foata normal form. 0/5342 useless extension candidates. Maximal degree in co-relation 13183. Up to 3195 conditions per place. [2022-12-13 11:56:55,761 INFO L137 encePairwiseOnDemand]: 26/33 looper letters, 37 selfloop transitions, 6 changer transitions 2/53 dead transitions. [2022-12-13 11:56:55,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 53 transitions, 210 flow [2022-12-13 11:56:55,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:56:55,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:56:55,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-12-13 11:56:55,762 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7070707070707071 [2022-12-13 11:56:55,763 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 76 flow. Second operand 3 states and 70 transitions. [2022-12-13 11:56:55,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 53 transitions, 210 flow [2022-12-13 11:56:55,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 53 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:56:55,764 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 116 flow [2022-12-13 11:56:55,765 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2022-12-13 11:56:55,765 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -31 predicate places. [2022-12-13 11:56:55,765 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:56:55,765 INFO L89 Accepts]: Start accepts. Operand has 44 places, 37 transitions, 116 flow [2022-12-13 11:56:55,766 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:56:55,766 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:56:55,766 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 37 transitions, 116 flow [2022-12-13 11:56:55,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 37 transitions, 116 flow [2022-12-13 11:56:55,785 INFO L130 PetriNetUnfolder]: 48/253 cut-off events. [2022-12-13 11:56:55,785 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-12-13 11:56:55,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 411 conditions, 253 events. 48/253 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1706 event pairs, 18 based on Foata normal form. 0/175 useless extension candidates. Maximal degree in co-relation 402. Up to 61 conditions per place. [2022-12-13 11:56:55,788 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 37 transitions, 116 flow [2022-12-13 11:56:55,788 INFO L226 LiptonReduction]: Number of co-enabled transitions 682 [2022-12-13 11:56:55,841 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:56:55,843 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-13 11:56:55,843 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 116 flow [2022-12-13 11:56:55,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:56:55,843 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:56:55,843 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:56:55,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 11:56:55,844 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:56:55,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:56:55,844 INFO L85 PathProgramCache]: Analyzing trace with hash 803907954, now seen corresponding path program 1 times [2022-12-13 11:56:55,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:56:55,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960679032] [2022-12-13 11:56:55,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:56:55,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:56:55,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:56:55,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:56:55,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:56:55,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960679032] [2022-12-13 11:56:55,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960679032] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:56:55,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:56:55,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:56:55,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75459856] [2022-12-13 11:56:55,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:56:55,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:56:55,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:56:55,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:56:55,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:56:55,995 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2022-12-13 11:56:55,996 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:56:55,996 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:56:55,996 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2022-12-13 11:56:55,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:56:56,478 INFO L130 PetriNetUnfolder]: 3254/5155 cut-off events. [2022-12-13 11:56:56,479 INFO L131 PetriNetUnfolder]: For 1708/1708 co-relation queries the response was YES. [2022-12-13 11:56:56,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11981 conditions, 5155 events. 3254/5155 cut-off events. For 1708/1708 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 30064 event pairs, 234 based on Foata normal form. 6/4342 useless extension candidates. Maximal degree in co-relation 11969. Up to 2405 conditions per place. [2022-12-13 11:56:56,509 INFO L137 encePairwiseOnDemand]: 25/32 looper letters, 45 selfloop transitions, 10 changer transitions 0/63 dead transitions. [2022-12-13 11:56:56,509 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 63 transitions, 300 flow [2022-12-13 11:56:56,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:56:56,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:56:56,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2022-12-13 11:56:56,513 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6640625 [2022-12-13 11:56:56,513 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 116 flow. Second operand 4 states and 85 transitions. [2022-12-13 11:56:56,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 63 transitions, 300 flow [2022-12-13 11:56:56,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 63 transitions, 280 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:56:56,523 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 172 flow [2022-12-13 11:56:56,523 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=172, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2022-12-13 11:56:56,524 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -28 predicate places. [2022-12-13 11:56:56,524 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:56:56,524 INFO L89 Accepts]: Start accepts. Operand has 47 places, 42 transitions, 172 flow [2022-12-13 11:56:56,525 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:56:56,525 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:56:56,526 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 42 transitions, 172 flow [2022-12-13 11:56:56,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 42 transitions, 172 flow [2022-12-13 11:56:56,543 INFO L130 PetriNetUnfolder]: 41/225 cut-off events. [2022-12-13 11:56:56,543 INFO L131 PetriNetUnfolder]: For 92/102 co-relation queries the response was YES. [2022-12-13 11:56:56,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 429 conditions, 225 events. 41/225 cut-off events. For 92/102 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1454 event pairs, 11 based on Foata normal form. 0/158 useless extension candidates. Maximal degree in co-relation 417. Up to 54 conditions per place. [2022-12-13 11:56:56,546 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 42 transitions, 172 flow [2022-12-13 11:56:56,546 INFO L226 LiptonReduction]: Number of co-enabled transitions 750 [2022-12-13 11:56:56,565 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:56:56,566 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 42 [2022-12-13 11:56:56,567 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 172 flow [2022-12-13 11:56:56,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:56:56,567 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:56:56,567 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:56:56,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 11:56:56,567 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:56:56,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:56:56,568 INFO L85 PathProgramCache]: Analyzing trace with hash 803909628, now seen corresponding path program 1 times [2022-12-13 11:56:56,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:56:56,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828687095] [2022-12-13 11:56:56,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:56:56,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:56:56,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:56:56,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:56:56,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:56:56,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828687095] [2022-12-13 11:56:56,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828687095] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:56:56,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:56:56,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:56:56,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112056883] [2022-12-13 11:56:56,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:56:56,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:56:56,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:56:56,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:56:56,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:56:56,697 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2022-12-13 11:56:56,698 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 172 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:56:56,698 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:56:56,698 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2022-12-13 11:56:56,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:56:57,180 INFO L130 PetriNetUnfolder]: 3195/5052 cut-off events. [2022-12-13 11:56:57,181 INFO L131 PetriNetUnfolder]: For 3322/3322 co-relation queries the response was YES. [2022-12-13 11:56:57,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12589 conditions, 5052 events. 3195/5052 cut-off events. For 3322/3322 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 29408 event pairs, 477 based on Foata normal form. 10/4254 useless extension candidates. Maximal degree in co-relation 12574. Up to 2357 conditions per place. [2022-12-13 11:56:57,210 INFO L137 encePairwiseOnDemand]: 25/32 looper letters, 50 selfloop transitions, 14 changer transitions 0/72 dead transitions. [2022-12-13 11:56:57,210 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 72 transitions, 388 flow [2022-12-13 11:56:57,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:56:57,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:56:57,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2022-12-13 11:56:57,212 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.703125 [2022-12-13 11:56:57,212 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 172 flow. Second operand 4 states and 90 transitions. [2022-12-13 11:56:57,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 72 transitions, 388 flow [2022-12-13 11:56:57,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 72 transitions, 388 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 11:56:57,220 INFO L231 Difference]: Finished difference. Result has 52 places, 47 transitions, 254 flow [2022-12-13 11:56:57,220 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=254, PETRI_PLACES=52, PETRI_TRANSITIONS=47} [2022-12-13 11:56:57,221 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -23 predicate places. [2022-12-13 11:56:57,221 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:56:57,221 INFO L89 Accepts]: Start accepts. Operand has 52 places, 47 transitions, 254 flow [2022-12-13 11:56:57,222 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:56:57,222 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:56:57,222 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 47 transitions, 254 flow [2022-12-13 11:56:57,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 47 transitions, 254 flow [2022-12-13 11:56:57,239 INFO L130 PetriNetUnfolder]: 35/207 cut-off events. [2022-12-13 11:56:57,239 INFO L131 PetriNetUnfolder]: For 230/254 co-relation queries the response was YES. [2022-12-13 11:56:57,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 472 conditions, 207 events. 35/207 cut-off events. For 230/254 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1299 event pairs, 5 based on Foata normal form. 0/146 useless extension candidates. Maximal degree in co-relation 456. Up to 46 conditions per place. [2022-12-13 11:56:57,242 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 47 transitions, 254 flow [2022-12-13 11:56:57,242 INFO L226 LiptonReduction]: Number of co-enabled transitions 814 [2022-12-13 11:56:57,245 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:56:57,246 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-13 11:56:57,246 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 47 transitions, 254 flow [2022-12-13 11:56:57,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:56:57,246 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:56:57,246 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:56:57,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 11:56:57,247 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:56:57,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:56:57,247 INFO L85 PathProgramCache]: Analyzing trace with hash -848657597, now seen corresponding path program 1 times [2022-12-13 11:56:57,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:56:57,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875490185] [2022-12-13 11:56:57,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:56:57,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:56:57,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:56:57,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:56:57,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:56:57,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875490185] [2022-12-13 11:56:57,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875490185] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:56:57,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:56:57,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:56:57,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409470633] [2022-12-13 11:56:57,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:56:57,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:56:57,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:56:57,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:56:57,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:56:57,348 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2022-12-13 11:56:57,348 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 47 transitions, 254 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:56:57,348 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:56:57,348 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2022-12-13 11:56:57,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:56:57,843 INFO L130 PetriNetUnfolder]: 3508/5598 cut-off events. [2022-12-13 11:56:57,844 INFO L131 PetriNetUnfolder]: For 5567/5633 co-relation queries the response was YES. [2022-12-13 11:56:57,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14455 conditions, 5598 events. 3508/5598 cut-off events. For 5567/5633 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 33654 event pairs, 941 based on Foata normal form. 132/4067 useless extension candidates. Maximal degree in co-relation 14436. Up to 5242 conditions per place. [2022-12-13 11:56:57,872 INFO L137 encePairwiseOnDemand]: 21/32 looper letters, 49 selfloop transitions, 10 changer transitions 0/73 dead transitions. [2022-12-13 11:56:57,872 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 73 transitions, 488 flow [2022-12-13 11:56:57,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:56:57,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:56:57,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-12-13 11:56:57,873 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6979166666666666 [2022-12-13 11:56:57,874 INFO L175 Difference]: Start difference. First operand has 52 places, 47 transitions, 254 flow. Second operand 3 states and 67 transitions. [2022-12-13 11:56:57,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 73 transitions, 488 flow [2022-12-13 11:56:57,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 73 transitions, 486 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-13 11:56:57,881 INFO L231 Difference]: Finished difference. Result has 55 places, 56 transitions, 320 flow [2022-12-13 11:56:57,881 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=320, PETRI_PLACES=55, PETRI_TRANSITIONS=56} [2022-12-13 11:56:57,881 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -20 predicate places. [2022-12-13 11:56:57,882 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:56:57,882 INFO L89 Accepts]: Start accepts. Operand has 55 places, 56 transitions, 320 flow [2022-12-13 11:56:57,883 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:56:57,883 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:56:57,883 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 56 transitions, 320 flow [2022-12-13 11:56:57,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 56 transitions, 320 flow [2022-12-13 11:56:58,009 INFO L130 PetriNetUnfolder]: 868/1863 cut-off events. [2022-12-13 11:56:58,010 INFO L131 PetriNetUnfolder]: For 867/911 co-relation queries the response was YES. [2022-12-13 11:56:58,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4025 conditions, 1863 events. 868/1863 cut-off events. For 867/911 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 15612 event pairs, 393 based on Foata normal form. 3/1055 useless extension candidates. Maximal degree in co-relation 4006. Up to 1297 conditions per place. [2022-12-13 11:56:58,023 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 56 transitions, 320 flow [2022-12-13 11:56:58,023 INFO L226 LiptonReduction]: Number of co-enabled transitions 972 [2022-12-13 11:56:58,044 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:56:58,047 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-13 11:56:58,048 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 56 transitions, 320 flow [2022-12-13 11:56:58,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:56:58,048 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:56:58,048 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:56:58,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 11:56:58,048 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:56:58,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:56:58,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1306727331, now seen corresponding path program 1 times [2022-12-13 11:56:58,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:56:58,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125902800] [2022-12-13 11:56:58,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:56:58,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:56:58,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:56:58,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:56:58,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:56:58,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125902800] [2022-12-13 11:56:58,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125902800] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:56:58,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:56:58,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:56:58,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636788053] [2022-12-13 11:56:58,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:56:58,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:56:58,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:56:58,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:56:58,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:56:58,216 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2022-12-13 11:56:58,217 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 56 transitions, 320 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:56:58,217 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:56:58,217 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2022-12-13 11:56:58,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:56:58,887 INFO L130 PetriNetUnfolder]: 5250/8531 cut-off events. [2022-12-13 11:56:58,887 INFO L131 PetriNetUnfolder]: For 11044/11246 co-relation queries the response was YES. [2022-12-13 11:56:58,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26173 conditions, 8531 events. 5250/8531 cut-off events. For 11044/11246 co-relation queries the response was YES. Maximal size of possible extension queue 574. Compared 58123 event pairs, 1522 based on Foata normal form. 223/7125 useless extension candidates. Maximal degree in co-relation 26151. Up to 4776 conditions per place. [2022-12-13 11:56:58,923 INFO L137 encePairwiseOnDemand]: 25/32 looper letters, 71 selfloop transitions, 15 changer transitions 4/101 dead transitions. [2022-12-13 11:56:58,923 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 101 transitions, 689 flow [2022-12-13 11:56:58,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:56:58,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:56:58,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-12-13 11:56:58,925 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.734375 [2022-12-13 11:56:58,925 INFO L175 Difference]: Start difference. First operand has 55 places, 56 transitions, 320 flow. Second operand 4 states and 94 transitions. [2022-12-13 11:56:58,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 101 transitions, 689 flow [2022-12-13 11:56:58,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 101 transitions, 667 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 11:56:58,936 INFO L231 Difference]: Finished difference. Result has 60 places, 57 transitions, 390 flow [2022-12-13 11:56:58,936 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=390, PETRI_PLACES=60, PETRI_TRANSITIONS=57} [2022-12-13 11:56:58,937 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -15 predicate places. [2022-12-13 11:56:58,937 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:56:58,937 INFO L89 Accepts]: Start accepts. Operand has 60 places, 57 transitions, 390 flow [2022-12-13 11:56:58,938 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:56:58,938 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:56:58,938 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 57 transitions, 390 flow [2022-12-13 11:56:58,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 57 transitions, 390 flow [2022-12-13 11:56:59,082 INFO L130 PetriNetUnfolder]: 1297/2591 cut-off events. [2022-12-13 11:56:59,083 INFO L131 PetriNetUnfolder]: For 1461/1505 co-relation queries the response was YES. [2022-12-13 11:56:59,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5612 conditions, 2591 events. 1297/2591 cut-off events. For 1461/1505 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 21853 event pairs, 633 based on Foata normal form. 3/1280 useless extension candidates. Maximal degree in co-relation 5589. Up to 2137 conditions per place. [2022-12-13 11:56:59,107 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 57 transitions, 390 flow [2022-12-13 11:56:59,108 INFO L226 LiptonReduction]: Number of co-enabled transitions 1016 [2022-12-13 11:56:59,137 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:56:59,138 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 201 [2022-12-13 11:56:59,138 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 57 transitions, 390 flow [2022-12-13 11:56:59,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:56:59,138 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:56:59,138 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:56:59,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 11:56:59,141 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:56:59,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:56:59,141 INFO L85 PathProgramCache]: Analyzing trace with hash -510553007, now seen corresponding path program 1 times [2022-12-13 11:56:59,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:56:59,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100418591] [2022-12-13 11:56:59,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:56:59,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:56:59,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:56:59,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:56:59,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:56:59,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100418591] [2022-12-13 11:56:59,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100418591] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:56:59,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:56:59,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:56:59,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909144639] [2022-12-13 11:56:59,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:56:59,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:56:59,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:56:59,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:56:59,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:56:59,304 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2022-12-13 11:56:59,304 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 57 transitions, 390 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:56:59,304 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:56:59,304 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2022-12-13 11:56:59,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:56:59,649 INFO L130 PetriNetUnfolder]: 2562/4685 cut-off events. [2022-12-13 11:56:59,649 INFO L131 PetriNetUnfolder]: For 6464/6510 co-relation queries the response was YES. [2022-12-13 11:56:59,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14767 conditions, 4685 events. 2562/4685 cut-off events. For 6464/6510 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 33051 event pairs, 352 based on Foata normal form. 339/3524 useless extension candidates. Maximal degree in co-relation 14741. Up to 3448 conditions per place. [2022-12-13 11:56:59,668 INFO L137 encePairwiseOnDemand]: 21/32 looper letters, 62 selfloop transitions, 19 changer transitions 1/96 dead transitions. [2022-12-13 11:56:59,669 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 96 transitions, 807 flow [2022-12-13 11:56:59,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:56:59,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:56:59,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2022-12-13 11:56:59,670 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.71875 [2022-12-13 11:56:59,670 INFO L175 Difference]: Start difference. First operand has 60 places, 57 transitions, 390 flow. Second operand 4 states and 92 transitions. [2022-12-13 11:56:59,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 96 transitions, 807 flow [2022-12-13 11:56:59,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 96 transitions, 797 flow, removed 5 selfloop flow, removed 0 redundant places. [2022-12-13 11:56:59,680 INFO L231 Difference]: Finished difference. Result has 64 places, 66 transitions, 496 flow [2022-12-13 11:56:59,680 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=496, PETRI_PLACES=64, PETRI_TRANSITIONS=66} [2022-12-13 11:56:59,680 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -11 predicate places. [2022-12-13 11:56:59,680 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:56:59,680 INFO L89 Accepts]: Start accepts. Operand has 64 places, 66 transitions, 496 flow [2022-12-13 11:56:59,681 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:56:59,682 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:56:59,682 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 66 transitions, 496 flow [2022-12-13 11:56:59,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 66 transitions, 496 flow [2022-12-13 11:56:59,862 INFO L130 PetriNetUnfolder]: 763/1916 cut-off events. [2022-12-13 11:56:59,862 INFO L131 PetriNetUnfolder]: For 1241/1659 co-relation queries the response was YES. [2022-12-13 11:56:59,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5783 conditions, 1916 events. 763/1916 cut-off events. For 1241/1659 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 17476 event pairs, 144 based on Foata normal form. 13/1113 useless extension candidates. Maximal degree in co-relation 5757. Up to 1420 conditions per place. [2022-12-13 11:56:59,882 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 66 transitions, 496 flow [2022-12-13 11:56:59,883 INFO L226 LiptonReduction]: Number of co-enabled transitions 1010 [2022-12-13 11:56:59,978 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:56:59,979 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 299 [2022-12-13 11:56:59,979 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 66 transitions, 496 flow [2022-12-13 11:56:59,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:56:59,979 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:56:59,980 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:56:59,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 11:56:59,980 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:56:59,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:56:59,980 INFO L85 PathProgramCache]: Analyzing trace with hash 845894646, now seen corresponding path program 1 times [2022-12-13 11:56:59,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:56:59,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597922433] [2022-12-13 11:56:59,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:56:59,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:57:00,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:57:00,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:57:00,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:57:00,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597922433] [2022-12-13 11:57:00,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597922433] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:57:00,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:57:00,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:57:00,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816051327] [2022-12-13 11:57:00,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:57:00,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:57:00,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:57:00,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:57:00,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:57:00,203 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2022-12-13 11:57:00,203 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 66 transitions, 496 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:00,204 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:57:00,204 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2022-12-13 11:57:00,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:57:00,491 INFO L130 PetriNetUnfolder]: 1428/2723 cut-off events. [2022-12-13 11:57:00,491 INFO L131 PetriNetUnfolder]: For 4158/4194 co-relation queries the response was YES. [2022-12-13 11:57:00,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10931 conditions, 2723 events. 1428/2723 cut-off events. For 4158/4194 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 18013 event pairs, 109 based on Foata normal form. 345/2090 useless extension candidates. Maximal degree in co-relation 10902. Up to 1543 conditions per place. [2022-12-13 11:57:00,503 INFO L137 encePairwiseOnDemand]: 21/32 looper letters, 44 selfloop transitions, 28 changer transitions 16/96 dead transitions. [2022-12-13 11:57:00,503 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 96 transitions, 873 flow [2022-12-13 11:57:00,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:57:00,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:57:00,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2022-12-13 11:57:00,516 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.61875 [2022-12-13 11:57:00,516 INFO L175 Difference]: Start difference. First operand has 64 places, 66 transitions, 496 flow. Second operand 5 states and 99 transitions. [2022-12-13 11:57:00,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 96 transitions, 873 flow [2022-12-13 11:57:00,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 96 transitions, 831 flow, removed 11 selfloop flow, removed 2 redundant places. [2022-12-13 11:57:00,526 INFO L231 Difference]: Finished difference. Result has 67 places, 57 transitions, 442 flow [2022-12-13 11:57:00,526 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=442, PETRI_PLACES=67, PETRI_TRANSITIONS=57} [2022-12-13 11:57:00,526 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -8 predicate places. [2022-12-13 11:57:00,527 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:57:00,527 INFO L89 Accepts]: Start accepts. Operand has 67 places, 57 transitions, 442 flow [2022-12-13 11:57:00,528 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:57:00,528 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:57:00,528 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 57 transitions, 442 flow [2022-12-13 11:57:00,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 57 transitions, 442 flow [2022-12-13 11:57:00,563 INFO L130 PetriNetUnfolder]: 194/530 cut-off events. [2022-12-13 11:57:00,563 INFO L131 PetriNetUnfolder]: For 422/620 co-relation queries the response was YES. [2022-12-13 11:57:00,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1931 conditions, 530 events. 194/530 cut-off events. For 422/620 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 3632 event pairs, 0 based on Foata normal form. 0/268 useless extension candidates. Maximal degree in co-relation 1904. Up to 379 conditions per place. [2022-12-13 11:57:00,568 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 57 transitions, 442 flow [2022-12-13 11:57:00,568 INFO L226 LiptonReduction]: Number of co-enabled transitions 606 [2022-12-13 11:57:01,107 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 11:57:01,108 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 581 [2022-12-13 11:57:01,108 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 438 flow [2022-12-13 11:57:01,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:01,109 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:57:01,109 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:57:01,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 11:57:01,109 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:57:01,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:57:01,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1072803595, now seen corresponding path program 1 times [2022-12-13 11:57:01,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:57:01,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105776206] [2022-12-13 11:57:01,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:01,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:57:01,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:57:01,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:57:01,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:57:01,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105776206] [2022-12-13 11:57:01,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105776206] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:57:01,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:57:01,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:57:01,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559460664] [2022-12-13 11:57:01,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:57:01,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:57:01,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:57:01,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:57:01,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:57:01,764 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2022-12-13 11:57:01,764 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 438 flow. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:01,764 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:57:01,764 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2022-12-13 11:57:01,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:57:02,061 INFO L130 PetriNetUnfolder]: 855/1558 cut-off events. [2022-12-13 11:57:02,061 INFO L131 PetriNetUnfolder]: For 3815/3909 co-relation queries the response was YES. [2022-12-13 11:57:02,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6786 conditions, 1558 events. 855/1558 cut-off events. For 3815/3909 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 9422 event pairs, 37 based on Foata normal form. 81/1259 useless extension candidates. Maximal degree in co-relation 6756. Up to 888 conditions per place. [2022-12-13 11:57:02,070 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 49 selfloop transitions, 4 changer transitions 39/107 dead transitions. [2022-12-13 11:57:02,071 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 107 transitions, 987 flow [2022-12-13 11:57:02,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:57:02,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:57:02,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2022-12-13 11:57:02,072 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6091954022988506 [2022-12-13 11:57:02,072 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 438 flow. Second operand 6 states and 106 transitions. [2022-12-13 11:57:02,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 107 transitions, 987 flow [2022-12-13 11:57:02,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 107 transitions, 764 flow, removed 30 selfloop flow, removed 11 redundant places. [2022-12-13 11:57:02,094 INFO L231 Difference]: Finished difference. Result has 59 places, 53 transitions, 319 flow [2022-12-13 11:57:02,094 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=319, PETRI_PLACES=59, PETRI_TRANSITIONS=53} [2022-12-13 11:57:02,095 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -16 predicate places. [2022-12-13 11:57:02,095 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:57:02,095 INFO L89 Accepts]: Start accepts. Operand has 59 places, 53 transitions, 319 flow [2022-12-13 11:57:02,096 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:57:02,096 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:57:02,096 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 53 transitions, 319 flow [2022-12-13 11:57:02,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 53 transitions, 319 flow [2022-12-13 11:57:02,125 INFO L130 PetriNetUnfolder]: 203/450 cut-off events. [2022-12-13 11:57:02,125 INFO L131 PetriNetUnfolder]: For 668/683 co-relation queries the response was YES. [2022-12-13 11:57:02,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1336 conditions, 450 events. 203/450 cut-off events. For 668/683 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 2658 event pairs, 0 based on Foata normal form. 4/188 useless extension candidates. Maximal degree in co-relation 1316. Up to 208 conditions per place. [2022-12-13 11:57:02,129 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 53 transitions, 319 flow [2022-12-13 11:57:02,129 INFO L226 LiptonReduction]: Number of co-enabled transitions 488 [2022-12-13 11:57:03,036 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [482] L754-->P0FINAL: Formula: (let ((.cse2 (not (= (mod v_~z$r_buff1_thd1~0_143 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd1~0_211 256) 0))) (.cse1 (not (= (mod v_~z$w_buff0_used~0_616 256) 0)))) (let ((.cse0 (and .cse5 .cse1)) (.cse4 (and (not (= (mod v_~z$w_buff0_used~0_617 256) 0)) .cse5)) (.cse3 (and .cse2 (not (= (mod v_~z$w_buff1_used~0_543 256) 0))))) (and (= v_~z$r_buff0_thd1~0_210 (ite .cse0 0 v_~z$r_buff0_thd1~0_211)) (= |v_P0Thread1of1ForFork2_#res#1.offset_51| 0) (= v_~__unbuffered_cnt~0_461 (+ v_~__unbuffered_cnt~0_462 1)) (= v_~z$r_buff1_thd1~0_142 (ite (or (and (not (= (mod v_~z$r_buff0_thd1~0_210 256) 0)) .cse1) (and .cse2 (not (= 0 (mod v_~z$w_buff1_used~0_542 256))))) 0 v_~z$r_buff1_thd1~0_143)) (= v_~z$w_buff1_used~0_542 (ite (or .cse0 .cse3) 0 v_~z$w_buff1_used~0_543)) (= |v_P0Thread1of1ForFork2_#res#1.base_51| 0) (= v_~z$w_buff0_used~0_616 (ite .cse4 0 v_~z$w_buff0_used~0_617)) (= v_~z~0_467 (ite .cse4 v_~z$w_buff0~0_383 (ite .cse3 v_~z$w_buff1~0_349 v_~z~0_468)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_617, ~z$w_buff0~0=v_~z$w_buff0~0_383, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_143, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_543, ~z$w_buff1~0=v_~z$w_buff1~0_349, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_462, ~z~0=v_~z~0_468, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_211} OutVars{P0Thread1of1ForFork2_#res#1.offset=|v_P0Thread1of1ForFork2_#res#1.offset_51|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_616, ~z$w_buff0~0=v_~z$w_buff0~0_383, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_142, P0Thread1of1ForFork2_#res#1.base=|v_P0Thread1of1ForFork2_#res#1.base_51|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_542, ~z$w_buff1~0=v_~z$w_buff1~0_349, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_461, ~z~0=v_~z~0_467, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_210} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res#1.offset, ~z$w_buff0_used~0, ~z$r_buff1_thd1~0, P0Thread1of1ForFork2_#res#1.base, ~z$w_buff1_used~0, ~__unbuffered_cnt~0, ~z~0, ~z$r_buff0_thd1~0] and [481] L836-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd0~0_163 256) 0))) (.cse2 (not (= (mod v_~z$w_buff0_used~0_558 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_159 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_559 256) 0)))) (.cse4 (and .cse5 .cse2)) (.cse1 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_492 256) 0))))) (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81| (mod v_~main$tmp_guard0~0_110 256)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_113| 0) (= v_~z~0_417 (ite .cse0 v_~z$w_buff0~0_345 (ite .cse1 v_~z$w_buff1~0_318 v_~z~0_418))) (= (ite (= (ite (= v_~__unbuffered_cnt~0_459 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_110) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_69| 0)) (= v_~z$r_buff1_thd0~0_162 (ite (or (and (not (= (mod v_~z$r_buff0_thd0~0_158 256) 0)) .cse2) (and .cse3 (not (= (mod v_~z$w_buff1_used~0_491 256) 0)))) 0 v_~z$r_buff1_thd0~0_163)) (= v_~z$w_buff0_used~0_558 (ite .cse0 0 v_~z$w_buff0_used~0_559)) (= v_~z$r_buff0_thd0~0_158 (ite .cse4 0 v_~z$r_buff0_thd0~0_159)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_109| (mod v_~main$tmp_guard1~0_140 256)) (= v_~z$w_buff1_used~0_491 (ite (or .cse4 .cse1) 0 v_~z$w_buff1_used~0_492)) (= (ite (= (ite (not (and (= v_~y~0_133 2) (= v_~__unbuffered_p2_EAX~0_167 0) (= 2 v_~x~0_135))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_140) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_109| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_113|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_69| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_159, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_559, ~z$w_buff0~0=v_~z$w_buff0~0_345, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_163, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_492, ~z$w_buff1~0=v_~z$w_buff1~0_318, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_167, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_459, ~z~0=v_~z~0_418, ~y~0=v_~y~0_133, ~x~0=v_~x~0_135} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_113|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_75|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_558, ~z$w_buff0~0=v_~z$w_buff0~0_345, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_97|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_491, ~z$w_buff1~0=v_~z$w_buff1~0_318, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_140, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_110, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_158, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_109|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_162, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_69|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_167, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_459, ~z~0=v_~z~0_417, ~y~0=v_~y~0_133, ~x~0=v_~x~0_135, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~pre9#1, ~z$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~z~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 11:57:03,503 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [489] L754-->L764: Formula: (let ((.cse4 (not (= (mod v_~z$r_buff1_thd1~0_171 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_644 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd1~0_239 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_645 256) 0)))) (.cse2 (and .cse5 .cse3)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_571 256) 0)) .cse4))) (and (= v_~z$w_buff0_used~0_644 (ite .cse0 0 v_~z$w_buff0_used~0_645)) (= v_~__unbuffered_cnt~0_489 (+ v_~__unbuffered_cnt~0_490 1)) (= v_~z~0_495 (ite .cse0 v_~z$w_buff0~0_397 (ite .cse1 v_~z$w_buff1~0_363 v_~z~0_496))) (= v_~z$r_buff0_thd1~0_238 (ite .cse2 0 v_~z$r_buff0_thd1~0_239)) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_571) v_~z$w_buff1_used~0_570) (= v_~z$r_buff1_thd1~0_170 (ite (or (and (not (= (mod v_~z$r_buff0_thd1~0_238 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$w_buff1_used~0_570 256) 0)))) 0 v_~z$r_buff1_thd1~0_171))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_645, ~z$w_buff0~0=v_~z$w_buff0~0_397, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_171, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_571, ~z$w_buff1~0=v_~z$w_buff1~0_363, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_490, ~z~0=v_~z~0_496, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_239} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_644, ~z$w_buff0~0=v_~z$w_buff0~0_397, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_170, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_570, ~z$w_buff1~0=v_~z$w_buff1~0_363, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_489, ~z~0=v_~z~0_495, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_238} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~__unbuffered_cnt~0, ~z~0, ~z$r_buff0_thd1~0] and [481] L836-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd0~0_163 256) 0))) (.cse2 (not (= (mod v_~z$w_buff0_used~0_558 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_159 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_559 256) 0)))) (.cse4 (and .cse5 .cse2)) (.cse1 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_492 256) 0))))) (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81| (mod v_~main$tmp_guard0~0_110 256)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_113| 0) (= v_~z~0_417 (ite .cse0 v_~z$w_buff0~0_345 (ite .cse1 v_~z$w_buff1~0_318 v_~z~0_418))) (= (ite (= (ite (= v_~__unbuffered_cnt~0_459 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_110) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_69| 0)) (= v_~z$r_buff1_thd0~0_162 (ite (or (and (not (= (mod v_~z$r_buff0_thd0~0_158 256) 0)) .cse2) (and .cse3 (not (= (mod v_~z$w_buff1_used~0_491 256) 0)))) 0 v_~z$r_buff1_thd0~0_163)) (= v_~z$w_buff0_used~0_558 (ite .cse0 0 v_~z$w_buff0_used~0_559)) (= v_~z$r_buff0_thd0~0_158 (ite .cse4 0 v_~z$r_buff0_thd0~0_159)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_109| (mod v_~main$tmp_guard1~0_140 256)) (= v_~z$w_buff1_used~0_491 (ite (or .cse4 .cse1) 0 v_~z$w_buff1_used~0_492)) (= (ite (= (ite (not (and (= v_~y~0_133 2) (= v_~__unbuffered_p2_EAX~0_167 0) (= 2 v_~x~0_135))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_140) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_109| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_113|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_69| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_159, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_559, ~z$w_buff0~0=v_~z$w_buff0~0_345, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_163, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_492, ~z$w_buff1~0=v_~z$w_buff1~0_318, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_167, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_459, ~z~0=v_~z~0_418, ~y~0=v_~y~0_133, ~x~0=v_~x~0_135} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_113|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_75|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_558, ~z$w_buff0~0=v_~z$w_buff0~0_345, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_97|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_491, ~z$w_buff1~0=v_~z$w_buff1~0_318, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_140, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_110, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_158, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_109|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_162, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_69|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_167, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_459, ~z~0=v_~z~0_417, ~y~0=v_~y~0_133, ~x~0=v_~x~0_135, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~pre9#1, ~z$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~z~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 11:57:03,848 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [490] L754-->P0EXIT: Formula: (let ((.cse0 (not (= (mod v_~z$r_buff1_thd1~0_175 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd1~0_243 256) 0))) (.cse1 (not (= (mod v_~z$w_buff0_used~0_648 256) 0)))) (let ((.cse3 (and .cse5 .cse1)) (.cse2 (and .cse0 (not (= (mod v_~z$w_buff1_used~0_575 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_649 256) 0))))) (and (= v_~__unbuffered_cnt~0_493 (+ v_~__unbuffered_cnt~0_494 1)) (= |v_P0Thread1of1ForFork2_#res#1.offset_61| 0) (= v_~z$r_buff1_thd1~0_174 (ite (or (and .cse0 (not (= (mod v_~z$w_buff1_used~0_574 256) 0))) (and .cse1 (not (= (mod v_~z$r_buff0_thd1~0_242 256) 0)))) 0 v_~z$r_buff1_thd1~0_175)) (= |v_P0Thread1of1ForFork2_#res#1.base_61| 0) (= v_~z$w_buff1_used~0_574 (ite (or .cse2 .cse3) 0 v_~z$w_buff1_used~0_575)) (= v_~z$r_buff0_thd1~0_242 (ite .cse3 0 v_~z$r_buff0_thd1~0_243)) (= v_~z~0_499 (ite .cse4 v_~z$w_buff0~0_399 (ite .cse2 v_~z$w_buff1~0_365 v_~z~0_500))) (= v_~z$w_buff0_used~0_648 (ite .cse4 0 v_~z$w_buff0_used~0_649))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_649, ~z$w_buff0~0=v_~z$w_buff0~0_399, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_175, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_575, ~z$w_buff1~0=v_~z$w_buff1~0_365, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_494, ~z~0=v_~z~0_500, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_243} OutVars{P0Thread1of1ForFork2_#res#1.offset=|v_P0Thread1of1ForFork2_#res#1.offset_61|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_648, ~z$w_buff0~0=v_~z$w_buff0~0_399, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_174, P0Thread1of1ForFork2_#res#1.base=|v_P0Thread1of1ForFork2_#res#1.base_61|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_574, ~z$w_buff1~0=v_~z$w_buff1~0_365, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_493, ~z~0=v_~z~0_499, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_242} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res#1.offset, ~z$w_buff0_used~0, ~z$r_buff1_thd1~0, P0Thread1of1ForFork2_#res#1.base, ~z$w_buff1_used~0, ~__unbuffered_cnt~0, ~z~0, ~z$r_buff0_thd1~0] and [481] L836-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd0~0_163 256) 0))) (.cse2 (not (= (mod v_~z$w_buff0_used~0_558 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_159 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_559 256) 0)))) (.cse4 (and .cse5 .cse2)) (.cse1 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_492 256) 0))))) (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81| (mod v_~main$tmp_guard0~0_110 256)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_113| 0) (= v_~z~0_417 (ite .cse0 v_~z$w_buff0~0_345 (ite .cse1 v_~z$w_buff1~0_318 v_~z~0_418))) (= (ite (= (ite (= v_~__unbuffered_cnt~0_459 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_110) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_69| 0)) (= v_~z$r_buff1_thd0~0_162 (ite (or (and (not (= (mod v_~z$r_buff0_thd0~0_158 256) 0)) .cse2) (and .cse3 (not (= (mod v_~z$w_buff1_used~0_491 256) 0)))) 0 v_~z$r_buff1_thd0~0_163)) (= v_~z$w_buff0_used~0_558 (ite .cse0 0 v_~z$w_buff0_used~0_559)) (= v_~z$r_buff0_thd0~0_158 (ite .cse4 0 v_~z$r_buff0_thd0~0_159)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_109| (mod v_~main$tmp_guard1~0_140 256)) (= v_~z$w_buff1_used~0_491 (ite (or .cse4 .cse1) 0 v_~z$w_buff1_used~0_492)) (= (ite (= (ite (not (and (= v_~y~0_133 2) (= v_~__unbuffered_p2_EAX~0_167 0) (= 2 v_~x~0_135))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_140) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_109| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_113|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_69| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_159, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_559, ~z$w_buff0~0=v_~z$w_buff0~0_345, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_163, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_492, ~z$w_buff1~0=v_~z$w_buff1~0_318, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_167, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_459, ~z~0=v_~z~0_418, ~y~0=v_~y~0_133, ~x~0=v_~x~0_135} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_113|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_75|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_558, ~z$w_buff0~0=v_~z$w_buff0~0_345, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_97|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_491, ~z$w_buff1~0=v_~z$w_buff1~0_318, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_140, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_110, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_158, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_109|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_162, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_69|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_167, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_459, ~z~0=v_~z~0_417, ~y~0=v_~y~0_133, ~x~0=v_~x~0_135, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~pre9#1, ~z$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~z~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 11:57:04,253 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 11:57:04,254 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2159 [2022-12-13 11:57:04,254 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 347 flow [2022-12-13 11:57:04,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:04,255 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:57:04,255 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:57:04,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 11:57:04,255 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:57:04,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:57:04,255 INFO L85 PathProgramCache]: Analyzing trace with hash 678351416, now seen corresponding path program 1 times [2022-12-13 11:57:04,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:57:04,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518887245] [2022-12-13 11:57:04,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:04,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:57:04,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:57:04,297 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 11:57:04,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:57:04,354 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 11:57:04,355 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 11:57:04,355 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 11:57:04,356 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 11:57:04,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 11:57:04,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 11:57:04,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 11:57:04,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 11:57:04,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 11:57:04,358 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:57:04,362 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 11:57:04,362 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 11:57:04,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 11:57:04 BasicIcfg [2022-12-13 11:57:04,428 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 11:57:04,428 INFO L158 Benchmark]: Toolchain (without parser) took 18734.40ms. Allocated memory was 212.9MB in the beginning and 817.9MB in the end (delta: 605.0MB). Free memory was 170.1MB in the beginning and 655.5MB in the end (delta: -485.4MB). Peak memory consumption was 120.6MB. Max. memory is 8.0GB. [2022-12-13 11:57:04,428 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 212.9MB. Free memory is still 189.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 11:57:04,428 INFO L158 Benchmark]: CACSL2BoogieTranslator took 565.97ms. Allocated memory is still 212.9MB. Free memory was 169.4MB in the beginning and 143.7MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-13 11:57:04,429 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.83ms. Allocated memory is still 212.9MB. Free memory was 143.2MB in the beginning and 141.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 11:57:04,429 INFO L158 Benchmark]: Boogie Preprocessor took 45.40ms. Allocated memory is still 212.9MB. Free memory was 141.1MB in the beginning and 139.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 11:57:04,429 INFO L158 Benchmark]: RCFGBuilder took 710.45ms. Allocated memory is still 212.9MB. Free memory was 139.0MB in the beginning and 104.4MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2022-12-13 11:57:04,429 INFO L158 Benchmark]: TraceAbstraction took 17336.48ms. Allocated memory was 212.9MB in the beginning and 817.9MB in the end (delta: 605.0MB). Free memory was 102.8MB in the beginning and 655.5MB in the end (delta: -552.6MB). Peak memory consumption was 53.4MB. Max. memory is 8.0GB. [2022-12-13 11:57:04,430 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.10ms. Allocated memory is still 212.9MB. Free memory is still 189.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 565.97ms. Allocated memory is still 212.9MB. Free memory was 169.4MB in the beginning and 143.7MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 69.83ms. Allocated memory is still 212.9MB. Free memory was 143.2MB in the beginning and 141.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.40ms. Allocated memory is still 212.9MB. Free memory was 141.1MB in the beginning and 139.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 710.45ms. Allocated memory is still 212.9MB. Free memory was 139.0MB in the beginning and 104.4MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 17336.48ms. Allocated memory was 212.9MB in the beginning and 817.9MB in the end (delta: 605.0MB). Free memory was 102.8MB in the beginning and 655.5MB in the end (delta: -552.6MB). Peak memory consumption was 53.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.4s, 112 PlacesBefore, 75 PlacesAfterwards, 104 TransitionsBefore, 65 TransitionsAfterwards, 1920 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 37 TrivialYvCompositions, 42 ConcurrentYvCompositions, 2 ChoiceCompositions, 84 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3523, independent: 3275, independent conditional: 3275, independent unconditional: 0, dependent: 248, dependent conditional: 248, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3523, independent: 3275, independent conditional: 0, independent unconditional: 3275, dependent: 248, dependent conditional: 0, dependent unconditional: 248, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3523, independent: 3275, independent conditional: 0, independent unconditional: 3275, dependent: 248, dependent conditional: 0, dependent unconditional: 248, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3523, independent: 3275, independent conditional: 0, independent unconditional: 3275, dependent: 248, dependent conditional: 0, dependent unconditional: 248, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1646, independent: 1592, independent conditional: 0, independent unconditional: 1592, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1646, independent: 1577, independent conditional: 0, independent unconditional: 1577, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 69, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 309, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 291, dependent conditional: 0, dependent unconditional: 291, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3523, independent: 1683, independent conditional: 0, independent unconditional: 1683, dependent: 194, dependent conditional: 0, dependent unconditional: 194, unknown: 1646, unknown conditional: 0, unknown unconditional: 1646] , Statistics on independence cache: Total cache size (in pairs): 3316, Positive cache size: 3262, Positive conditional cache size: 0, Positive unconditional cache size: 3262, Negative cache size: 54, Negative conditional cache size: 0, Negative unconditional cache size: 54, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 42 PlacesBefore, 42 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 616 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 285, independent: 249, independent conditional: 249, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 285, independent: 249, independent conditional: 25, independent unconditional: 224, dependent: 36, dependent conditional: 14, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 285, independent: 249, independent conditional: 25, independent unconditional: 224, dependent: 36, dependent conditional: 14, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 285, independent: 249, independent conditional: 25, independent unconditional: 224, dependent: 36, dependent conditional: 14, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 228, independent: 203, independent conditional: 23, independent unconditional: 180, dependent: 25, dependent conditional: 8, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 228, independent: 178, independent conditional: 0, independent unconditional: 178, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 50, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 25, dependent conditional: 8, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 108, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 86, dependent conditional: 44, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 285, independent: 46, independent conditional: 2, independent unconditional: 44, dependent: 11, dependent conditional: 6, dependent unconditional: 5, unknown: 228, unknown conditional: 31, unknown unconditional: 197] , Statistics on independence cache: Total cache size (in pairs): 228, Positive cache size: 203, Positive conditional cache size: 23, Positive unconditional cache size: 180, Negative cache size: 25, Negative conditional cache size: 8, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 43 PlacesBefore, 43 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 682 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 286, independent: 260, independent conditional: 260, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 286, independent: 260, independent conditional: 27, independent unconditional: 233, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 286, independent: 260, independent conditional: 0, independent unconditional: 260, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 286, independent: 260, independent conditional: 0, independent unconditional: 260, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 46, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 46, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 50, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 286, independent: 220, independent conditional: 0, independent unconditional: 220, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 46, unknown conditional: 0, unknown unconditional: 46] , Statistics on independence cache: Total cache size (in pairs): 274, Positive cache size: 243, Positive conditional cache size: 23, Positive unconditional cache size: 220, Negative cache size: 31, Negative conditional cache size: 8, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 27, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 750 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 298, independent: 269, independent conditional: 269, independent unconditional: 0, dependent: 29, dependent conditional: 29, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 298, independent: 269, independent conditional: 35, independent unconditional: 234, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 298, independent: 269, independent conditional: 0, independent unconditional: 269, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 298, independent: 269, independent conditional: 0, independent unconditional: 269, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 298, independent: 252, independent conditional: 0, independent unconditional: 252, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 19, unknown conditional: 0, unknown unconditional: 19] , Statistics on independence cache: Total cache size (in pairs): 293, Positive cache size: 260, Positive conditional cache size: 23, Positive unconditional cache size: 237, Negative cache size: 33, Negative conditional cache size: 8, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 35, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 814 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 373, independent: 339, independent conditional: 339, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 373, independent: 339, independent conditional: 68, independent unconditional: 271, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 373, independent: 339, independent conditional: 0, independent unconditional: 339, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 373, independent: 339, independent conditional: 0, independent unconditional: 339, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 373, independent: 337, independent conditional: 0, independent unconditional: 337, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 295, Positive cache size: 262, Positive conditional cache size: 23, Positive unconditional cache size: 239, Negative cache size: 33, Negative conditional cache size: 8, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 68, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 55 PlacesBefore, 55 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 972 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 213, independent: 181, independent conditional: 181, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 213, independent: 181, independent conditional: 37, independent unconditional: 144, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 213, independent: 181, independent conditional: 0, independent unconditional: 181, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 213, independent: 181, independent conditional: 0, independent unconditional: 181, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 213, independent: 181, independent conditional: 0, independent unconditional: 181, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 295, Positive cache size: 262, Positive conditional cache size: 23, Positive unconditional cache size: 239, Negative cache size: 33, Negative conditional cache size: 8, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 37, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 60 PlacesBefore, 60 PlacesAfterwards, 57 TransitionsBefore, 57 TransitionsAfterwards, 1016 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 197, independent: 164, independent conditional: 164, independent unconditional: 0, dependent: 33, dependent conditional: 33, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 197, independent: 164, independent conditional: 33, independent unconditional: 131, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 197, independent: 164, independent conditional: 0, independent unconditional: 164, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 197, independent: 164, independent conditional: 0, independent unconditional: 164, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 197, independent: 164, independent conditional: 0, independent unconditional: 164, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 295, Positive cache size: 262, Positive conditional cache size: 23, Positive unconditional cache size: 239, Negative cache size: 33, Negative conditional cache size: 8, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 33, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 64 PlacesBefore, 64 PlacesAfterwards, 66 TransitionsBefore, 66 TransitionsAfterwards, 1010 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 43, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 42, dependent conditional: 42, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 43, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 43, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 43, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 77, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 43, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 301, Positive cache size: 262, Positive conditional cache size: 23, Positive unconditional cache size: 239, Negative cache size: 39, Negative conditional cache size: 8, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 66 PlacesBefore, 64 PlacesAfterwards, 57 TransitionsBefore, 55 TransitionsAfterwards, 606 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 292, independent: 224, independent conditional: 224, independent unconditional: 0, dependent: 68, dependent conditional: 68, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 292, independent: 224, independent conditional: 60, independent unconditional: 164, dependent: 68, dependent conditional: 22, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 336, independent: 224, independent conditional: 12, independent unconditional: 212, dependent: 112, dependent conditional: 0, dependent unconditional: 112, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 336, independent: 224, independent conditional: 12, independent unconditional: 212, dependent: 112, dependent conditional: 0, dependent unconditional: 112, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 27, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 336, independent: 224, independent conditional: 12, independent unconditional: 212, dependent: 109, dependent conditional: 0, dependent unconditional: 109, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 305, Positive cache size: 263, Positive conditional cache size: 23, Positive unconditional cache size: 240, Negative cache size: 42, Negative conditional cache size: 8, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 114, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.1s, 56 PlacesBefore, 55 PlacesAfterwards, 53 TransitionsBefore, 49 TransitionsAfterwards, 488 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 468, independent: 414, independent conditional: 414, independent unconditional: 0, dependent: 54, dependent conditional: 54, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 468, independent: 414, independent conditional: 339, independent unconditional: 75, dependent: 54, dependent conditional: 32, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 468, independent: 414, independent conditional: 339, independent unconditional: 75, dependent: 54, dependent conditional: 32, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 468, independent: 414, independent conditional: 339, independent unconditional: 75, dependent: 54, dependent conditional: 32, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 44, independent: 42, independent conditional: 35, independent unconditional: 7, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 44, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 121, independent: 110, independent conditional: 110, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 468, independent: 372, independent conditional: 304, independent unconditional: 68, dependent: 52, dependent conditional: 30, dependent unconditional: 22, unknown: 44, unknown conditional: 37, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 520, Positive cache size: 476, Positive conditional cache size: 58, Positive unconditional cache size: 418, Negative cache size: 44, Negative conditional cache size: 10, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L719] 0 int z = 0; [L720] 0 _Bool z$flush_delayed; [L721] 0 int z$mem_tmp; [L722] 0 _Bool z$r_buff0_thd0; [L723] 0 _Bool z$r_buff0_thd1; [L724] 0 _Bool z$r_buff0_thd2; [L725] 0 _Bool z$r_buff0_thd3; [L726] 0 _Bool z$r_buff1_thd0; [L727] 0 _Bool z$r_buff1_thd1; [L728] 0 _Bool z$r_buff1_thd2; [L729] 0 _Bool z$r_buff1_thd3; [L730] 0 _Bool z$read_delayed; [L731] 0 int *z$read_delayed_var; [L732] 0 int z$w_buff0; [L733] 0 _Bool z$w_buff0_used; [L734] 0 int z$w_buff1; [L735] 0 _Bool z$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L831] 0 pthread_t t1489; [L832] FCALL, FORK 0 pthread_create(&t1489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1489, ((void *)0), P0, ((void *)0))=-1, t1489={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L833] 0 pthread_t t1490; [L834] FCALL, FORK 0 pthread_create(&t1490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1490, ((void *)0), P1, ((void *)0))=0, t1489={5:0}, t1490={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] 0 pthread_t t1491; [L836] FCALL, FORK 0 pthread_create(&t1491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1491, ((void *)0), P2, ((void *)0))=1, t1489={5:0}, t1490={6:0}, t1491={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 1 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 3 z$flush_delayed = weak$$choice2 [L796] 3 z$mem_tmp = z [L797] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L798] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L799] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L800] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L801] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L803] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 __unbuffered_p2_EAX = z [L805] 3 z = z$flush_delayed ? z$mem_tmp : z [L806] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L810] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L811] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L812] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L813] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L843] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L844] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L845] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L846] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L849] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 834]: 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: 836]: 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: 832]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 134 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 17.2s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 283 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 283 mSDsluCounter, 15 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 712 IncrementalHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 11 mSDtfsCounter, 712 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=496occurred in iteration=7, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 125 NumberOfCodeBlocks, 125 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 98 ConstructedInterpolants, 0 QuantifiedInterpolants, 598 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 11:57:04,468 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...